/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_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:18:15,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:18:15,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:18:15,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:18:15,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:18:15,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:18:15,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:18:15,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:18:15,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:18:15,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:18:15,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:18:15,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:18:15,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:18:15,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:18:15,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:18:15,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:18:15,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:18:15,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:18:15,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:18:15,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:18:15,514 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:18:15,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:18:15,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:18:15,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:18:15,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:18:15,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:18:15,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:18:15,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:18:15,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:18:15,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:18:15,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:18:15,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:18:15,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:18:15,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:18:15,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:18:15,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:18:15,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:18:15,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:18:15,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:18:15,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:18:15,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:18:15,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:18:15,528 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:18:15,536 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:18:15,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:18:15,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:18:15,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:18:15,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:18:15,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:18:15,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:18:15,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:18:15,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:18:15,538 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:18:15,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:18:15,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:18:15,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:18:15,539 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:18:15,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:18:15,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:18:15,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:18:15,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:18:15,539 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:18:15,539 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:18:15,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:18:15,539 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:18:15,540 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:18:15,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:18:15,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:18:15,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:18:15,733 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:18:15,735 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:18:15,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound5.c [2022-04-28 11:18:15,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f3b81e7/0dbc6f8fe24644f8bba00fa265ff7b09/FLAG8d8d9038d [2022-04-28 11:18:16,160 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:18:16,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound5.c [2022-04-28 11:18:16,165 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f3b81e7/0dbc6f8fe24644f8bba00fa265ff7b09/FLAG8d8d9038d [2022-04-28 11:18:16,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f3b81e7/0dbc6f8fe24644f8bba00fa265ff7b09 [2022-04-28 11:18:16,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:18:16,177 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:18:16,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:18:16,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:18:16,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:18:16,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:18:16" (1/1) ... [2022-04-28 11:18:16,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16698f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:16, skipping insertion in model container [2022-04-28 11:18:16,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:18:16" (1/1) ... [2022-04-28 11:18:16,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:18:16,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:18:16,310 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_valuebound5.c[588,601] [2022-04-28 11:18:16,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:18:16,330 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:18:16,337 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_valuebound5.c[588,601] [2022-04-28 11:18:16,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:18:16,356 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:18:16,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:16 WrapperNode [2022-04-28 11:18:16,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:18:16,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:18:16,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:18:16,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:18:16,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:16" (1/1) ... [2022-04-28 11:18:16,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:16" (1/1) ... [2022-04-28 11:18:16,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:16" (1/1) ... [2022-04-28 11:18:16,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:16" (1/1) ... [2022-04-28 11:18:16,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:16" (1/1) ... [2022-04-28 11:18:16,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:16" (1/1) ... [2022-04-28 11:18:16,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:16" (1/1) ... [2022-04-28 11:18:16,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:18:16,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:18:16,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:18:16,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:18:16,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:16" (1/1) ... [2022-04-28 11:18:16,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:18:16,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:16,412 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:18:16,426 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:18:16,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:18:16,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:18:16,445 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:18:16,445 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:18:16,445 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:18:16,445 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:18:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:18:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:18:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:18:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:18:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-28 11:18:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:18:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:18:16,446 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:18:16,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:18:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:18:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:18:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:18:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:18:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:18:16,495 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:18:16,496 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:18:16,595 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:18:16,599 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:18:16,599 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 11:18:16,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:18:16 BoogieIcfgContainer [2022-04-28 11:18:16,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:18:16,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:18:16,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:18:16,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:18:16,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:18:16" (1/3) ... [2022-04-28 11:18:16,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a95f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:18:16, skipping insertion in model container [2022-04-28 11:18:16,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:16" (2/3) ... [2022-04-28 11:18:16,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a95f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:18:16, skipping insertion in model container [2022-04-28 11:18:16,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:18:16" (3/3) ... [2022-04-28 11:18:16,605 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound5.c [2022-04-28 11:18:16,614 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:18:16,614 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:18:16,640 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:18:16,644 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@28011d41, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68e7379 [2022-04-28 11:18:16,644 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:18:16,649 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:18:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:18:16,653 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:16,654 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:18:16,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:16,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:16,657 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 1 times [2022-04-28 11:18:16,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:16,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1701697713] [2022-04-28 11:18:16,671 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:18:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 2 times [2022-04-28 11:18:16,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:16,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64067964] [2022-04-28 11:18:16,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:16,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:16,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:18:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:16,854 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:18:16,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 11:18:16,855 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-28 11:18:16,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:18:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:16,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 11:18:16,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 11:18:16,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 11:18:16,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-28 11:18:16,870 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:18:16,870 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:18:16,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 11:18:16,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-28 11:18:16,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret5 := main(); {39#true} is VALID [2022-04-28 11:18:16,871 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:18:16,871 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {39#true} is VALID [2022-04-28 11:18:16,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 11:18:16,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 11:18:16,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 11:18:16,872 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-28 11:18:16,872 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:18:16,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-04-28 11:18:16,872 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:18:16,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-28 11:18:16,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-28 11:18:16,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-28 11:18:16,873 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:18:16,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:16,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64067964] [2022-04-28 11:18:16,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64067964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:16,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:16,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:18:16,876 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:16,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1701697713] [2022-04-28 11:18:16,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1701697713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:16,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:16,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:18:16,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083473004] [2022-04-28 11:18:16,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:16,880 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:18:16,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:16,883 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:18:16,907 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:18:16,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:18:16,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:16,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:18:16,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:18:16,926 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:18:17,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:17,093 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-04-28 11:18:17,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:18:17,093 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:18:17,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:17,094 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:18:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:18:17,101 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:18:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:18:17,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 11:18:17,217 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:18:17,229 INFO L225 Difference]: With dead ends: 63 [2022-04-28 11:18:17,229 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 11:18:17,232 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:18:17,236 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:18:17,238 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.0s Time] [2022-04-28 11:18:17,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 11:18:17,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 11:18:17,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:17,277 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:18:17,277 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:18:17,278 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:18:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:17,281 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-28 11:18:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:18:17,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:17,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:17,283 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:18:17,283 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:18:17,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:17,286 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-28 11:18:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:18:17,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:17,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:17,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:17,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:17,288 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:18:17,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-04-28 11:18:17,291 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 17 [2022-04-28 11:18:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:17,291 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-04-28 11:18:17,292 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:18:17,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 41 transitions. [2022-04-28 11:18:17,331 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:18:17,332 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:18:17,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:18:17,333 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:17,333 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:18:17,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:18:17,334 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 1 times [2022-04-28 11:18:17,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:17,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [594788589] [2022-04-28 11:18:17,340 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:18:17,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 2 times [2022-04-28 11:18:17,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:17,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756666990] [2022-04-28 11:18:17,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:17,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:17,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:18:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:17,484 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:18:17,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:18:17,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-28 11:18:17,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:18:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:17,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 11:18:17,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 11:18:17,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:18:17,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-28 11:18:17,492 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:18:17,493 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:18:17,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:18:17,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-28 11:18:17,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-28 11:18:17,493 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:18:17,493 INFO L272 TraceCheckUtils]: 6: Hoare triple {301#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {301#true} is VALID [2022-04-28 11:18:17,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 11:18:17,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 11:18:17,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:18:17,494 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-28 11:18:17,495 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:18:17,496 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:18:17,496 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:18:17,497 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:18:17,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {302#false} is VALID [2022-04-28 11:18:17,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-28 11:18:17,498 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:18:17,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:17,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756666990] [2022-04-28 11:18:17,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756666990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:17,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:17,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:18:17,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:17,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [594788589] [2022-04-28 11:18:17,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [594788589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:17,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:17,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:18:17,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552740506] [2022-04-28 11:18:17,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:17,501 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:18:17,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:17,502 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:18:17,514 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:18:17,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:18:17,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:17,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:18:17,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:18:17,516 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:18:17,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:17,865 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-28 11:18:17,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:18:17,865 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:18:17,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:17,866 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:18:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 11:18:17,868 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:18:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 11:18:17,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-28 11:18:17,914 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:17,918 INFO L225 Difference]: With dead ends: 37 [2022-04-28 11:18:17,918 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 11:18:17,919 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:18:17,919 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:18:17,920 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:18:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 11:18:17,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 11:18:17,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:17,933 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:18:17,934 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:18:17,934 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:18:17,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:17,939 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:18:17,939 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:18:17,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:17,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:17,940 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:18:17,940 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:18:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:17,942 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:18:17,942 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:18:17,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:17,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:17,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:17,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:17,943 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:18:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-28 11:18:17,945 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 17 [2022-04-28 11:18:17,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:17,945 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-28 11:18:17,945 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:18:17,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-28 11:18:17,983 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:18:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:18:17,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 11:18:17,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:17,984 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:18:17,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 11:18:17,985 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:17,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:17,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 1 times [2022-04-28 11:18:17,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:17,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [912814749] [2022-04-28 11:18:17,986 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:18:17,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 2 times [2022-04-28 11:18:17,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:17,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974428137] [2022-04-28 11:18:17,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:17,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:18,003 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:18,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2038609639] [2022-04-28 11:18:18,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:18:18,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:18,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:18,011 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:18:18,023 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:18:18,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:18:18,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:18,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:18:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:18,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:18,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-28 11:18:18,216 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:18:18,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:18:18,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #84#return; {538#true} is VALID [2022-04-28 11:18:18,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-28 11:18:18,217 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:18:18,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {538#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {538#true} is VALID [2022-04-28 11:18:18,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-28 11:18:18,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-28 11:18:18,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:18:18,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {538#true} {538#true} #60#return; {538#true} is VALID [2022-04-28 11:18:18,218 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:18:18,218 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:18:18,218 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:18:18,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-28 11:18:18,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-28 11:18:18,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:18:18,220 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:18:18,220 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:18:18,221 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:18:18,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-28 11:18:18,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-28 11:18:18,221 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:18:18,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:18:18,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:18,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974428137] [2022-04-28 11:18:18,222 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:18,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038609639] [2022-04-28 11:18:18,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038609639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:18,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:18,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:18:18,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:18,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [912814749] [2022-04-28 11:18:18,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [912814749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:18,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:18,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:18:18,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380294160] [2022-04-28 11:18:18,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:18,224 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:18:18,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:18,224 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:18:18,243 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:18:18,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:18:18,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:18,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:18:18,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:18:18,244 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:18:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:18,427 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 11:18:18,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:18:18,428 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:18:18,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:18,428 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:18:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:18:18,430 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:18:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:18:18,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:18:18,484 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:18:18,487 INFO L225 Difference]: With dead ends: 54 [2022-04-28 11:18:18,488 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 11:18:18,488 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:18:18,489 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:18:18,489 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:18:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 11:18:18,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-28 11:18:18,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:18,501 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:18:18,501 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:18:18,501 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:18:18,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:18,504 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:18:18,504 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:18:18,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:18,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:18,505 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:18:18,506 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:18:18,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:18,508 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:18:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:18:18,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:18,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:18,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:18,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:18,509 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:18:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-04-28 11:18:18,511 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2022-04-28 11:18:18,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:18,511 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-04-28 11:18:18,511 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:18:18,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 52 transitions. [2022-04-28 11:18:18,558 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:18:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-28 11:18:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 11:18:18,559 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:18,559 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:18:18,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 11:18:18,777 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:18:18,777 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:18,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:18,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 1 times [2022-04-28 11:18:18,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:18,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1309142054] [2022-04-28 11:18:18,778 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:18:18,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 2 times [2022-04-28 11:18:18,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:18,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166389673] [2022-04-28 11:18:18,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:18,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:18,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:18,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1338599400] [2022-04-28 11:18:18,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:18:18,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:18,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:18,791 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:18:18,792 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:18:18,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:18:18,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:18,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:18:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:18,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:18,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {906#true} is VALID [2022-04-28 11:18:18,915 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:18:18,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:18:18,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #84#return; {906#true} is VALID [2022-04-28 11:18:18,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret5 := main(); {906#true} is VALID [2022-04-28 11:18:18,918 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:18:18,918 INFO L272 TraceCheckUtils]: 6: Hoare triple {906#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {906#true} is VALID [2022-04-28 11:18:18,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:18:18,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:18:18,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:18:18,919 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {906#true} {906#true} #60#return; {906#true} is VALID [2022-04-28 11:18:18,920 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:18:18,921 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:18:18,921 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:18:18,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:18:18,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:18:18,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:18:18,923 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:18:18,924 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:18:18,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:18:18,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:18:18,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:18:18,925 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:18:18,925 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:18:18,926 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:18:18,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {985#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {907#false} is VALID [2022-04-28 11:18:18,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-28 11:18:18,926 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:18:18,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:18:18,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:18,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166389673] [2022-04-28 11:18:18,928 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:18,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338599400] [2022-04-28 11:18:18,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338599400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:18,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:18,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:18:18,928 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:18,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1309142054] [2022-04-28 11:18:18,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1309142054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:18,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:18,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:18:18,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878472647] [2022-04-28 11:18:18,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:18,929 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:18:18,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:18,930 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:18:18,945 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:18:18,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:18:18,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:18,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:18:18,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:18:18,946 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:18:19,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:19,151 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-28 11:18:19,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:18:19,151 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:18:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:19,151 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:18:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:18:19,153 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:18:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:18:19,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:18:19,209 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:18:19,210 INFO L225 Difference]: With dead ends: 58 [2022-04-28 11:18:19,211 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 11:18:19,211 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:18:19,211 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:18:19,212 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:18:19,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 11:18:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-28 11:18:19,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:19,225 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:18:19,225 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:18:19,226 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:18:19,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:19,228 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 11:18:19,228 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 11:18:19,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:19,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:19,229 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:18:19,229 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:18:19,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:19,231 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 11:18:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 11:18:19,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:19,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:19,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:19,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:19,232 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:18:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-04-28 11:18:19,234 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 27 [2022-04-28 11:18:19,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:19,234 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-04-28 11:18:19,234 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:18:19,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 67 transitions. [2022-04-28 11:18:19,294 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:18:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-04-28 11:18:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 11:18:19,295 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:19,295 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:18:19,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 11:18:19,511 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:18:19,511 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:19,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 1 times [2022-04-28 11:18:19,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:19,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1882707334] [2022-04-28 11:18:19,512 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:18:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 2 times [2022-04-28 11:18:19,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:19,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713557983] [2022-04-28 11:18:19,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:19,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:19,520 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:19,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [4908756] [2022-04-28 11:18:19,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:18:19,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:19,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:19,522 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:18:19,525 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:18:19,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:18:19,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:19,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:18:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:19,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:19,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2022-04-28 11:18:19,671 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:18:19,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:18:19,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #84#return; {1325#true} is VALID [2022-04-28 11:18:19,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret5 := main(); {1325#true} is VALID [2022-04-28 11:18:19,672 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:18:19,672 INFO L272 TraceCheckUtils]: 6: Hoare triple {1325#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {1325#true} is VALID [2022-04-28 11:18:19,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:18:19,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:18:19,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:18:19,672 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1325#true} {1325#true} #60#return; {1325#true} is VALID [2022-04-28 11:18:19,674 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:18:19,674 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:18:19,675 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:18:19,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:18:19,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:18:19,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:18:19,675 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:18:19,676 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:18:19,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:18:19,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:18:19,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:18:19,677 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:18:19,677 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:18:19,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:18:19,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:18:19,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:18:19,687 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:18:19,688 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:18:19,689 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:18:19,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {1419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1326#false} is VALID [2022-04-28 11:18:19,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2022-04-28 11:18:19,689 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:18:19,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:18:19,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:19,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713557983] [2022-04-28 11:18:19,690 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:19,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4908756] [2022-04-28 11:18:19,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4908756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:19,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:19,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:18:19,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:19,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1882707334] [2022-04-28 11:18:19,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1882707334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:19,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:19,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:18:19,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467445459] [2022-04-28 11:18:19,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:19,691 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:18:19,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:19,691 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:18:19,707 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:18:19,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:18:19,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:19,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:18:19,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:18:19,708 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:18:19,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:19,928 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-04-28 11:18:19,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:18:19,928 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:18:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:19,928 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:18:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:18:19,930 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:18:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:18:19,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:18:19,984 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:18:19,985 INFO L225 Difference]: With dead ends: 66 [2022-04-28 11:18:19,985 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 11:18:19,985 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:18:19,986 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:18:19,986 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:18:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 11:18:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 11:18:20,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:20,001 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:18:20,002 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:18:20,002 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:18:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:20,004 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 11:18:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:18:20,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:20,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:20,005 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:18:20,005 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:18:20,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:20,007 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 11:18:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:18:20,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:20,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:20,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:20,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:20,007 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:18:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-28 11:18:20,009 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-28 11:18:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:20,009 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-28 11:18:20,009 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:18:20,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 65 transitions. [2022-04-28 11:18:20,083 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:18:20,083 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:18:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 11:18:20,084 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:20,084 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:18:20,102 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:18:20,299 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:18:20,299 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:20,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 1 times [2022-04-28 11:18:20,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:20,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1686477462] [2022-04-28 11:18:20,607 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:20,607 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:20,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 2 times [2022-04-28 11:18:20,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:20,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724487245] [2022-04-28 11:18:20,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:20,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:20,631 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:20,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930581262] [2022-04-28 11:18:20,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:18:20,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:20,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:20,635 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:18:20,636 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:18:20,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:18:20,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:20,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:18:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:20,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:20,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-28 11:18:20,891 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:18:20,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:18:20,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-28 11:18:20,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-28 11:18:20,892 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:18:20,892 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:18:20,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:18:20,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:18:20,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:18:20,892 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-28 11:18:20,892 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:18:20,893 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:18:20,893 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:18:20,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:18:20,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:18:20,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:18:20,894 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:18:20,894 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:18:20,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:18:20,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:18:20,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:18:20,894 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:18:20,895 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:18:20,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:18:20,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:18:20,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:18:20,895 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:18:20,895 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:18:20,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:18:20,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:18:20,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:18:20,896 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:18:20,896 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:18:20,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:18:20,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:18:20,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:18:20,897 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:18:20,897 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:18:20,898 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:18:20,898 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:18:20,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:18:20,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:18:20,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:18:20,899 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:18:20,900 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:18:20,900 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:18:20,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {1921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 11:18:20,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 11:18:20,901 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:18:20,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:21,084 INFO L290 TraceCheckUtils]: 48: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 11:18:21,085 INFO L290 TraceCheckUtils]: 47: Hoare triple {1921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 11:18:21,085 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:18:21,086 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:18:21,088 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:18:21,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:18:21,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:18:21,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:18:21,088 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:18:21,089 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:18:21,095 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:18:21,095 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:18:21,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:18:21,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:18:21,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:18:21,096 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:18:21,096 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:18:21,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:18:21,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:18:21,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:18:21,097 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:18:21,097 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:18:21,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:18:21,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:18:21,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:18:21,098 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:18:21,098 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:18:21,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:18:21,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:18:21,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:18:21,099 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:18:21,099 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:18:21,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:18:21,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:18:21,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:18:21,100 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:18:21,100 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:18:21,100 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:18:21,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-28 11:18:21,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:18:21,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:18:21,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:18:21,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:18:21,101 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:18:21,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-28 11:18:21,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-28 11:18:21,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:18:21,101 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:18:21,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-28 11:18:21,102 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:18:21,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:21,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724487245] [2022-04-28 11:18:21,102 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:21,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930581262] [2022-04-28 11:18:21,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930581262] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:18:21,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:18:21,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:18:21,102 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:21,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1686477462] [2022-04-28 11:18:21,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1686477462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:21,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:21,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:18:21,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137348546] [2022-04-28 11:18:21,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:21,103 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:18:21,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:21,104 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:18:21,125 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:18:21,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:18:21,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:21,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:18:21,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:18:21,126 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:18:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:21,496 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 11:18:21,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:18:21,497 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:18:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:21,497 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:18:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:18:21,499 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:18:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:18:21,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:18:21,558 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:18:21,560 INFO L225 Difference]: With dead ends: 81 [2022-04-28 11:18:21,560 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 11:18:21,561 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:18:21,561 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:18:21,561 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:18:21,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 11:18:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-04-28 11:18:21,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:21,587 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:18:21,587 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:18:21,587 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:18:21,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:21,589 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-28 11:18:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 11:18:21,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:21,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:21,590 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:18:21,590 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:18:21,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:21,593 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-28 11:18:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 11:18:21,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:21,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:21,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:21,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:21,593 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:18:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-04-28 11:18:21,595 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 49 [2022-04-28 11:18:21,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:21,595 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-04-28 11:18:21,595 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:18:21,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 79 transitions. [2022-04-28 11:18:21,663 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:18:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-28 11:18:21,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 11:18:21,664 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:21,664 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:18:21,683 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:18:21,879 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:18:21,880 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:21,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 3 times [2022-04-28 11:18:21,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:21,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [215454212] [2022-04-28 11:18:22,143 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:22,143 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:22,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 4 times [2022-04-28 11:18:22,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:22,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017317439] [2022-04-28 11:18:22,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:22,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:22,169 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:22,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [390505291] [2022-04-28 11:18:22,169 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:18:22,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:22,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:22,184 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:18:22,185 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:18:22,218 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:18:22,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:22,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 11:18:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:22,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:22,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2022-04-28 11:18:22,413 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:18:22,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #84#return; {2536#true} is VALID [2022-04-28 11:18:22,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret5 := main(); {2536#true} is VALID [2022-04-28 11:18:22,413 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:18:22,413 INFO L272 TraceCheckUtils]: 6: Hoare triple {2536#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:18:22,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:18:22,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:18:22,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,414 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2536#true} {2536#true} #60#return; {2536#true} is VALID [2022-04-28 11:18:22,414 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:18:22,414 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:18:22,414 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:18:22,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:18:22,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:18:22,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,424 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:18:22,424 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:18:22,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:18:22,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:18:22,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,428 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:18:22,428 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:18:22,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:18:22,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:18:22,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,431 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:18:22,431 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:18:22,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:18:22,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:18:22,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,435 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:18:22,435 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:18:22,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:18:22,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:18:22,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,436 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:18:22,437 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:18:22,437 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:18:22,437 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:18:22,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:18:22,437 INFO L290 TraceCheckUtils]: 42: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:18:22,437 INFO L290 TraceCheckUtils]: 43: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,438 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:18:22,438 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:18:22,438 INFO L290 TraceCheckUtils]: 46: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:18:22,438 INFO L290 TraceCheckUtils]: 47: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:18:22,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,438 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:18:22,439 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:18:22,439 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:18:22,439 INFO L290 TraceCheckUtils]: 52: Hoare triple {2697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2537#false} is VALID [2022-04-28 11:18:22,442 INFO L290 TraceCheckUtils]: 53: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-04-28 11:18:22,442 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:18:22,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:22,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-04-28 11:18:22,599 INFO L290 TraceCheckUtils]: 52: Hoare triple {2697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2537#false} is VALID [2022-04-28 11:18:22,600 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:18:22,600 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:18:22,601 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:18:22,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:18:22,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:18:22,601 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:18:22,602 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:18:22,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:18:22,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:18:22,602 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:18:22,602 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:18:22,604 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:18:22,605 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:18:22,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:18:22,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:18:22,605 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:18:22,606 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:18:22,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:18:22,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:18:22,606 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:18:22,607 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:18:22,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:18:22,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:18:22,607 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:18:22,608 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:18:22,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:18:22,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:18:22,608 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:18:22,608 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:18:22,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:18:22,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:18:22,609 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:18:22,609 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:18:22,610 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:18:22,610 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2536#true} {2536#true} #60#return; {2536#true} is VALID [2022-04-28 11:18:22,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:18:22,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:18:22,610 INFO L272 TraceCheckUtils]: 6: Hoare triple {2536#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:18:22,610 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:18:22,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret5 := main(); {2536#true} is VALID [2022-04-28 11:18:22,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #84#return; {2536#true} is VALID [2022-04-28 11:18:22,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:18:22,611 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:18:22,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2022-04-28 11:18:22,611 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:18:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:22,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017317439] [2022-04-28 11:18:22,611 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:22,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390505291] [2022-04-28 11:18:22,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390505291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:18:22,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:18:22,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:18:22,612 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:22,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [215454212] [2022-04-28 11:18:22,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [215454212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:22,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:22,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:18:22,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136043417] [2022-04-28 11:18:22,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:22,612 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:18:22,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:22,613 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:18:22,641 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:18:22,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:18:22,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:22,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:18:22,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:18:22,642 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:18:22,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:22,972 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-28 11:18:22,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:18:22,973 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:18:22,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:22,973 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:18:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:18:22,975 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:18:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:18:22,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:18:23,037 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:18:23,039 INFO L225 Difference]: With dead ends: 85 [2022-04-28 11:18:23,039 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 11:18:23,039 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:18:23,040 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:18:23,040 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:18:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 11:18:23,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2022-04-28 11:18:23,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:23,067 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:18:23,067 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:18:23,068 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:18:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:23,070 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-04-28 11:18:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-04-28 11:18:23,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:23,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:23,071 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:18:23,071 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:18:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:23,074 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-04-28 11:18:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-04-28 11:18:23,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:23,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:23,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:23,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:23,074 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:18:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-04-28 11:18:23,077 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 54 [2022-04-28 11:18:23,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:23,077 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-04-28 11:18:23,077 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:18:23,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 84 transitions. [2022-04-28 11:18:23,159 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:18:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-04-28 11:18:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 11:18:23,160 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:23,160 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:18:23,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 11:18:23,363 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:18:23,363 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:23,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:23,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 5 times [2022-04-28 11:18:23,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:23,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1061912641] [2022-04-28 11:18:23,611 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:23,612 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:23,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 6 times [2022-04-28 11:18:23,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:23,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928249548] [2022-04-28 11:18:23,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:23,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:23,629 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:23,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [301158531] [2022-04-28 11:18:23,629 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:18:23,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:23,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:23,630 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:18:23,631 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:18:23,665 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 11:18:23,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:23,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 11:18:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:23,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:23,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 11:18:23,887 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:18:23,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:23,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #84#return; {3353#true} is VALID [2022-04-28 11:18:23,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret5 := main(); {3353#true} is VALID [2022-04-28 11:18:23,887 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:18:23,887 INFO L272 TraceCheckUtils]: 6: Hoare triple {3353#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:18:23,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:23,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:23,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:23,888 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3353#true} {3353#true} #60#return; {3353#true} is VALID [2022-04-28 11:18:23,888 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:18:23,888 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:18:23,888 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:18:23,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:23,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:23,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:23,889 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:18:23,889 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:18:23,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:23,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:23,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:23,890 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:18:23,890 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:18:23,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:23,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:23,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:23,891 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:18:23,891 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:18:23,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:23,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:23,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:23,892 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:18:23,892 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:18:23,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:23,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:23,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:23,894 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:18:23,896 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:18:23,897 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:18:23,897 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:18:23,897 INFO L290 TraceCheckUtils]: 41: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:23,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:23,897 INFO L290 TraceCheckUtils]: 43: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:23,898 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:18:23,898 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:18:23,898 INFO L290 TraceCheckUtils]: 46: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:23,898 INFO L290 TraceCheckUtils]: 47: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:23,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:23,900 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:18:23,900 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:18:23,900 INFO L290 TraceCheckUtils]: 51: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:23,900 INFO L290 TraceCheckUtils]: 52: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:23,901 INFO L290 TraceCheckUtils]: 53: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:23,901 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:18:23,902 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:18:23,902 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:18:23,902 INFO L290 TraceCheckUtils]: 57: Hoare triple {3529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 11:18:23,903 INFO L290 TraceCheckUtils]: 58: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 11:18:23,903 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:18:23,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:24,167 INFO L290 TraceCheckUtils]: 58: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 11:18:24,167 INFO L290 TraceCheckUtils]: 57: Hoare triple {3529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 11:18:24,168 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:18:24,168 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:18:24,169 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:18:24,169 INFO L290 TraceCheckUtils]: 53: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:24,169 INFO L290 TraceCheckUtils]: 52: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:24,169 INFO L290 TraceCheckUtils]: 51: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:24,169 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:18:24,170 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:18:24,170 INFO L290 TraceCheckUtils]: 48: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:24,170 INFO L290 TraceCheckUtils]: 47: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:24,170 INFO L290 TraceCheckUtils]: 46: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:24,171 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:18:24,171 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:18:24,171 INFO L290 TraceCheckUtils]: 43: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:24,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:24,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:24,171 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:18:24,172 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:18:24,174 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:18:24,175 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:18:24,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:24,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:24,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:24,175 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:18:24,176 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:18:24,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:24,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:24,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:24,176 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:18:24,176 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:18:24,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:24,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:24,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:24,177 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:18:24,177 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:18:24,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:24,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:24,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:24,177 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:18:24,178 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:18:24,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:24,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:24,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:24,178 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:18:24,178 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:18:24,179 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:18:24,179 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3353#true} {3353#true} #60#return; {3353#true} is VALID [2022-04-28 11:18:24,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:24,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:18:24,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:18:24,179 INFO L272 TraceCheckUtils]: 6: Hoare triple {3353#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:18:24,179 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:18:24,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret5 := main(); {3353#true} is VALID [2022-04-28 11:18:24,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #84#return; {3353#true} is VALID [2022-04-28 11:18:24,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:18:24,179 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:18:24,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 11:18:24,180 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:18:24,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:24,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928249548] [2022-04-28 11:18:24,180 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:24,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301158531] [2022-04-28 11:18:24,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301158531] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:18:24,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:18:24,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:18:24,180 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:24,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1061912641] [2022-04-28 11:18:24,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1061912641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:24,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:24,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:18:24,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603005108] [2022-04-28 11:18:24,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:24,181 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:18:24,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:24,181 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:18:24,209 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:18:24,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:18:24,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:24,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:18:24,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:18:24,210 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:18:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:24,613 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-04-28 11:18:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:18:24,613 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:18:24,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:24,613 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:18:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:18:24,615 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:18:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:18:24,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:18:24,679 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:18:24,680 INFO L225 Difference]: With dead ends: 89 [2022-04-28 11:18:24,680 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 11:18:24,681 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:18:24,681 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:18:24,681 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:18:24,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 11:18:24,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-28 11:18:24,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:24,709 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:18:24,709 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:18:24,709 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:18:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:24,711 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2022-04-28 11:18:24,711 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:18:24,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:24,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:24,712 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:18:24,712 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:18:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:24,714 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2022-04-28 11:18:24,714 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:18:24,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:24,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:24,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:24,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:24,714 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:18:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2022-04-28 11:18:24,716 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 59 [2022-04-28 11:18:24,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:24,716 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2022-04-28 11:18:24,716 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:18:24,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 98 transitions. [2022-04-28 11:18:24,805 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:18:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:18:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 11:18:24,806 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:24,806 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:18:24,825 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:18:25,019 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:18:25,019 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:25,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:25,020 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 1 times [2022-04-28 11:18:25,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:25,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [577920580] [2022-04-28 11:18:25,263 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:25,263 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:25,263 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 2 times [2022-04-28 11:18:25,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:25,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106676354] [2022-04-28 11:18:25,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:25,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:25,281 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:25,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611450089] [2022-04-28 11:18:25,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:18:25,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:25,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:25,287 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:18:25,288 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:18:25,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:18:25,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:25,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 11:18:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:25,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:25,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {4230#true} call ULTIMATE.init(); {4230#true} is VALID [2022-04-28 11:18:25,758 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:18:25,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:18:25,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4230#true} {4230#true} #84#return; {4230#true} is VALID [2022-04-28 11:18:25,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {4230#true} call #t~ret5 := main(); {4230#true} is VALID [2022-04-28 11:18:25,758 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:18:25,758 INFO L272 TraceCheckUtils]: 6: Hoare triple {4230#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:18:25,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:18:25,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:18:25,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:18:25,758 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4230#true} {4230#true} #60#return; {4230#true} is VALID [2022-04-28 11:18:25,759 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:18:25,759 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:18:25,759 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:18:25,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:18:25,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:18:25,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:18:25,760 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:18:25,760 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:18:25,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:18:25,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:18:25,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:18:25,761 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:18:25,761 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:18:25,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:18:25,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:18:25,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:18:25,761 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:18:25,761 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:18:25,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:18:25,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:18:25,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:18:25,762 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:18:25,762 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:18:25,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:18:25,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:18:25,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:18:25,763 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:18:25,763 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:18:25,764 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:18:25,764 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:18:25,764 INFO L290 TraceCheckUtils]: 41: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:18:25,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:18:25,764 INFO L290 TraceCheckUtils]: 43: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:18:25,764 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:18:25,764 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:18:25,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:18:25,765 INFO L290 TraceCheckUtils]: 47: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:18:25,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:18:25,765 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:18:25,765 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:18:25,765 INFO L290 TraceCheckUtils]: 51: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:18:25,765 INFO L290 TraceCheckUtils]: 52: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:18:25,765 INFO L290 TraceCheckUtils]: 53: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:18:25,766 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:18:25,766 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:18:25,766 INFO L290 TraceCheckUtils]: 56: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:18:25,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:18:25,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:18:25,767 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:18:25,767 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:18:25,767 INFO L290 TraceCheckUtils]: 61: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:18:25,767 INFO L290 TraceCheckUtils]: 62: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:18:25,767 INFO L290 TraceCheckUtils]: 63: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:18:25,771 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:18:25,772 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:18:25,772 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:18:25,772 INFO L290 TraceCheckUtils]: 67: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:18:25,772 INFO L290 TraceCheckUtils]: 68: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:18:25,772 INFO L290 TraceCheckUtils]: 69: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:18:25,773 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:18:25,773 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:18:25,774 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:18:25,774 INFO L290 TraceCheckUtils]: 73: Hoare triple {4455#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4231#false} is VALID [2022-04-28 11:18:25,774 INFO L290 TraceCheckUtils]: 74: Hoare triple {4231#false} assume !false; {4231#false} is VALID [2022-04-28 11:18:25,774 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:18:25,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:26,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:26,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106676354] [2022-04-28 11:18:26,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:26,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611450089] [2022-04-28 11:18:26,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611450089] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:18:26,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:18:26,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:18:26,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:26,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [577920580] [2022-04-28 11:18:26,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [577920580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:26,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:26,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:18:26,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145341773] [2022-04-28 11:18:26,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:26,121 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:18:26,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:26,123 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:18:26,166 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:18:26,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:18:26,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:26,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:18:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:18:26,167 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:18:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:26,663 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-04-28 11:18:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:18:26,664 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:18:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:26,664 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:18:26,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:18:26,666 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:18:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:18:26,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 11:18:26,725 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:18:26,727 INFO L225 Difference]: With dead ends: 94 [2022-04-28 11:18:26,727 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 11:18:26,727 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:18:26,727 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:18:26,728 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:18:26,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 11:18:26,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 11:18:26,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:26,786 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:18:26,787 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:18:26,788 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:18:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:26,790 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-28 11:18:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:18:26,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:26,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:26,790 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:18:26,791 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:18:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:26,793 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-28 11:18:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:18:26,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:26,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:26,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:26,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:26,793 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:18:26,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-04-28 11:18:26,795 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 75 [2022-04-28 11:18:26,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:26,796 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-04-28 11:18:26,796 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:18:26,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 104 transitions. [2022-04-28 11:18:26,893 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:18:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:18:26,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 11:18:26,893 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:26,893 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:18:26,909 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:18:27,103 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:18:27,103 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:27,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash -63758730, now seen corresponding path program 7 times [2022-04-28 11:18:27,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:27,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [322600208] [2022-04-28 11:18:27,418 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:27,418 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:27,419 INFO L85 PathProgramCache]: Analyzing trace with hash -63758730, now seen corresponding path program 8 times [2022-04-28 11:18:27,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:27,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742567264] [2022-04-28 11:18:27,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:27,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:27,433 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:27,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [382267146] [2022-04-28 11:18:27,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:18:27,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:27,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:27,435 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:18:27,436 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:18:27,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:18:27,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:27,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 11:18:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:27,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:27,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5138#true} is VALID [2022-04-28 11:18:27,789 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:18:27,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:27,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #84#return; {5138#true} is VALID [2022-04-28 11:18:27,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret5 := main(); {5138#true} is VALID [2022-04-28 11:18:27,790 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:18:27,790 INFO L272 TraceCheckUtils]: 6: Hoare triple {5138#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:18:27,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:27,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:27,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:27,790 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5138#true} {5138#true} #60#return; {5138#true} is VALID [2022-04-28 11:18:27,790 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_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:18:27,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} assume !false; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:18:27,791 INFO L272 TraceCheckUtils]: 13: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:18:27,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:27,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:27,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:27,791 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #62#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:18:27,792 INFO L272 TraceCheckUtils]: 18: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~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:18:27,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:27,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:27,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:27,792 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #64#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:18:27,792 INFO L272 TraceCheckUtils]: 23: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~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:18:27,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:27,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:27,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:27,793 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #66#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:18:27,793 INFO L272 TraceCheckUtils]: 28: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= 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)); {5138#true} is VALID [2022-04-28 11:18:27,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:27,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:27,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:27,794 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #68#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:18:27,794 INFO L272 TraceCheckUtils]: 33: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~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:18:27,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:27,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:27,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:27,794 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #70#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:18:27,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= 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; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:18:27,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} assume !false; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:18:27,795 INFO L272 TraceCheckUtils]: 40: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= 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:18:27,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:27,795 INFO L290 TraceCheckUtils]: 42: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:27,795 INFO L290 TraceCheckUtils]: 43: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:27,796 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #62#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:18:27,796 INFO L272 TraceCheckUtils]: 45: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:18:27,796 INFO L290 TraceCheckUtils]: 46: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:27,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:27,796 INFO L290 TraceCheckUtils]: 48: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:27,796 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #64#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:18:27,797 INFO L272 TraceCheckUtils]: 50: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= 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:18:27,797 INFO L290 TraceCheckUtils]: 51: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:27,797 INFO L290 TraceCheckUtils]: 52: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:27,797 INFO L290 TraceCheckUtils]: 53: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:27,797 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #66#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:18:27,797 INFO L272 TraceCheckUtils]: 55: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:18:27,797 INFO L290 TraceCheckUtils]: 56: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:27,797 INFO L290 TraceCheckUtils]: 57: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:27,797 INFO L290 TraceCheckUtils]: 58: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:27,798 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #68#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:18:27,798 INFO L272 TraceCheckUtils]: 60: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:18:27,798 INFO L290 TraceCheckUtils]: 61: Hoare triple {5138#true} ~cond := #in~cond; {5328#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:27,798 INFO L290 TraceCheckUtils]: 62: Hoare triple {5328#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:27,799 INFO L290 TraceCheckUtils]: 63: Hoare triple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:27,799 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #70#return; {5339#(and (= main_~z~0 12) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~n~0 1))} is VALID [2022-04-28 11:18:27,800 INFO L290 TraceCheckUtils]: 65: Hoare triple {5339#(and (= main_~z~0 12) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 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; {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} is VALID [2022-04-28 11:18:27,800 INFO L290 TraceCheckUtils]: 66: Hoare triple {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} assume !false; {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} is VALID [2022-04-28 11:18:27,800 INFO L272 TraceCheckUtils]: 67: Hoare triple {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:18:27,800 INFO L290 TraceCheckUtils]: 68: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:27,800 INFO L290 TraceCheckUtils]: 69: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:27,800 INFO L290 TraceCheckUtils]: 70: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:27,801 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5138#true} {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} #62#return; {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} is VALID [2022-04-28 11:18:27,801 INFO L272 TraceCheckUtils]: 72: Hoare triple {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:27,801 INFO L290 TraceCheckUtils]: 73: Hoare triple {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5369#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:27,802 INFO L290 TraceCheckUtils]: 74: Hoare triple {5369#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5139#false} is VALID [2022-04-28 11:18:27,802 INFO L290 TraceCheckUtils]: 75: Hoare triple {5139#false} assume !false; {5139#false} is VALID [2022-04-28 11:18:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 48 proven. 17 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-28 11:18:27,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:28,529 INFO L290 TraceCheckUtils]: 75: Hoare triple {5139#false} assume !false; {5139#false} is VALID [2022-04-28 11:18:28,530 INFO L290 TraceCheckUtils]: 74: Hoare triple {5369#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5139#false} is VALID [2022-04-28 11:18:28,530 INFO L290 TraceCheckUtils]: 73: Hoare triple {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5369#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:28,531 INFO L272 TraceCheckUtils]: 72: Hoare triple {5385#(= (+ (* 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)); {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:28,531 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5138#true} {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:18:28,531 INFO L290 TraceCheckUtils]: 70: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:28,531 INFO L290 TraceCheckUtils]: 69: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:28,531 INFO L290 TraceCheckUtils]: 68: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:28,531 INFO L272 TraceCheckUtils]: 67: Hoare triple {5385#(= (+ (* 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:18:28,532 INFO L290 TraceCheckUtils]: 66: Hoare triple {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:18:28,535 INFO L290 TraceCheckUtils]: 65: Hoare triple {5407#(= (+ (* 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; {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:18:28,535 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} {5411#(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; {5407#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:18:28,535 INFO L290 TraceCheckUtils]: 63: Hoare triple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:28,536 INFO L290 TraceCheckUtils]: 62: Hoare triple {5421#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:28,536 INFO L290 TraceCheckUtils]: 61: Hoare triple {5138#true} ~cond := #in~cond; {5421#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:18:28,536 INFO L272 TraceCheckUtils]: 60: Hoare triple {5411#(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)); {5138#true} is VALID [2022-04-28 11:18:28,537 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5138#true} {5411#(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; {5411#(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:18:28,537 INFO L290 TraceCheckUtils]: 58: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:28,537 INFO L290 TraceCheckUtils]: 57: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:28,537 INFO L290 TraceCheckUtils]: 56: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:28,537 INFO L272 TraceCheckUtils]: 55: Hoare triple {5411#(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)); {5138#true} is VALID [2022-04-28 11:18:28,537 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5138#true} {5411#(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; {5411#(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:18:28,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:28,538 INFO L290 TraceCheckUtils]: 52: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:28,538 INFO L290 TraceCheckUtils]: 51: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:28,538 INFO L272 TraceCheckUtils]: 50: Hoare triple {5411#(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)); {5138#true} is VALID [2022-04-28 11:18:28,538 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5138#true} {5411#(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; {5411#(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:18:28,538 INFO L290 TraceCheckUtils]: 48: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:28,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:28,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:28,538 INFO L272 TraceCheckUtils]: 45: Hoare triple {5411#(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)); {5138#true} is VALID [2022-04-28 11:18:28,541 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5138#true} {5411#(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; {5411#(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:18:28,541 INFO L290 TraceCheckUtils]: 43: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:28,541 INFO L290 TraceCheckUtils]: 42: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:28,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:28,541 INFO L272 TraceCheckUtils]: 40: Hoare triple {5411#(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)); {5138#true} is VALID [2022-04-28 11:18:28,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {5411#(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; {5411#(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:18:28,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {5491#(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; {5411#(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:18:28,554 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5138#true} {5491#(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; {5491#(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:18:28,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:28,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:28,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:28,554 INFO L272 TraceCheckUtils]: 33: Hoare triple {5491#(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)); {5138#true} is VALID [2022-04-28 11:18:28,554 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5138#true} {5491#(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; {5491#(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:18:28,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:28,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:28,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:28,555 INFO L272 TraceCheckUtils]: 28: Hoare triple {5491#(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)); {5138#true} is VALID [2022-04-28 11:18:28,555 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5138#true} {5491#(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; {5491#(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:18:28,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:28,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:28,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:28,555 INFO L272 TraceCheckUtils]: 23: Hoare triple {5491#(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)); {5138#true} is VALID [2022-04-28 11:18:28,556 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5138#true} {5491#(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; {5491#(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:18:28,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:28,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:28,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:28,556 INFO L272 TraceCheckUtils]: 18: Hoare triple {5491#(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)); {5138#true} is VALID [2022-04-28 11:18:28,556 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5138#true} {5491#(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; {5491#(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:18:28,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:28,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:28,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:28,557 INFO L272 TraceCheckUtils]: 13: Hoare triple {5491#(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)); {5138#true} is VALID [2022-04-28 11:18:28,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {5491#(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; {5491#(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:18:28,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {5138#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5491#(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:18:28,558 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5138#true} {5138#true} #60#return; {5138#true} is VALID [2022-04-28 11:18:28,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:28,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:18:28,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:18:28,558 INFO L272 TraceCheckUtils]: 6: Hoare triple {5138#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:18:28,558 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:18:28,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret5 := main(); {5138#true} is VALID [2022-04-28 11:18:28,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #84#return; {5138#true} is VALID [2022-04-28 11:18:28,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:18:28,558 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:18:28,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5138#true} is VALID [2022-04-28 11:18:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 48 proven. 17 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-28 11:18:28,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:28,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742567264] [2022-04-28 11:18:28,559 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:28,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382267146] [2022-04-28 11:18:28,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382267146] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:18:28,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:18:28,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-04-28 11:18:28,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:28,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [322600208] [2022-04-28 11:18:28,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [322600208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:28,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:28,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:18:28,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566298928] [2022-04-28 11:18:28,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:28,560 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:18:28,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:28,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:18:28,603 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:18:28,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:18:28,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:28,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:18:28,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:18:28,604 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:18:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:29,924 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2022-04-28 11:18:29,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:18:29,925 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:18:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:18:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-28 11:18:29,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:18:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-28 11:18:29,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 100 transitions. [2022-04-28 11:18:30,026 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:18:30,028 INFO L225 Difference]: With dead ends: 115 [2022-04-28 11:18:30,028 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 11:18:30,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:18:30,029 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:18:30,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 151 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 11:18:30,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 11:18:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2022-04-28 11:18:30,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:30,078 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:18:30,078 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:18:30,078 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:18:30,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:30,081 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-04-28 11:18:30,081 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-04-28 11:18:30,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:30,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:30,082 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:18:30,082 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:18:30,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:30,084 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-04-28 11:18:30,084 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-04-28 11:18:30,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:30,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:30,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:30,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:30,085 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:18:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-04-28 11:18:30,087 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 76 [2022-04-28 11:18:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:30,087 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-04-28 11:18:30,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:18:30,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 115 transitions. [2022-04-28 11:18:30,197 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:18:30,197 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-28 11:18:30,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 11:18:30,199 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:30,199 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:18:30,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 11:18:30,407 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:18:30,408 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:30,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:30,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 1 times [2022-04-28 11:18:30,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:30,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2059389386] [2022-04-28 11:18:30,660 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:30,660 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:30,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 2 times [2022-04-28 11:18:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:30,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682816268] [2022-04-28 11:18:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:30,667 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:30,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [715480645] [2022-04-28 11:18:30,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:18:30,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:30,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:30,668 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:18:30,669 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:18:30,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:18:30,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:30,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:18:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:30,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:31,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {6274#true} call ULTIMATE.init(); {6274#true} is VALID [2022-04-28 11:18:31,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {6274#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); {6274#true} is VALID [2022-04-28 11:18:31,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:18:31,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6274#true} {6274#true} #84#return; {6274#true} is VALID [2022-04-28 11:18:31,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {6274#true} call #t~ret5 := main(); {6274#true} is VALID [2022-04-28 11:18:31,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {6274#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; {6274#true} is VALID [2022-04-28 11:18:31,235 INFO L272 TraceCheckUtils]: 6: Hoare triple {6274#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:18:31,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:18:31,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:18:31,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:18:31,236 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6274#true} {6274#true} #60#return; {6274#true} is VALID [2022-04-28 11:18:31,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {6274#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:18:31,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !false; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:18:31,236 INFO L272 TraceCheckUtils]: 13: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:18:31,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:18:31,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:18:31,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:18:31,237 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #62#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:18:31,237 INFO L272 TraceCheckUtils]: 18: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6274#true} is VALID [2022-04-28 11:18:31,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:18:31,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:18:31,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:18:31,238 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #64#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:18:31,238 INFO L272 TraceCheckUtils]: 23: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:18:31,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:18:31,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:18:31,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:18:31,238 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #66#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:18:31,239 INFO L272 TraceCheckUtils]: 28: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:18:31,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:18:31,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:18:31,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:18:31,239 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #68#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:18:31,239 INFO L272 TraceCheckUtils]: 33: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6274#true} is VALID [2022-04-28 11:18:31,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:18:31,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:18:31,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:18:31,240 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #70#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:18:31,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:18:31,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !false; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:18:31,241 INFO L272 TraceCheckUtils]: 40: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:18:31,241 INFO L290 TraceCheckUtils]: 41: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:18:31,241 INFO L290 TraceCheckUtils]: 42: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:18:31,241 INFO L290 TraceCheckUtils]: 43: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:18:31,243 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #62#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:18:31,243 INFO L272 TraceCheckUtils]: 45: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6274#true} is VALID [2022-04-28 11:18:31,243 INFO L290 TraceCheckUtils]: 46: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:18:31,243 INFO L290 TraceCheckUtils]: 47: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:18:31,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:18:31,244 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #64#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:18:31,244 INFO L272 TraceCheckUtils]: 50: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:18:31,244 INFO L290 TraceCheckUtils]: 51: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:18:31,244 INFO L290 TraceCheckUtils]: 52: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:18:31,244 INFO L290 TraceCheckUtils]: 53: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:18:31,244 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #66#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:18:31,244 INFO L272 TraceCheckUtils]: 55: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:18:31,244 INFO L290 TraceCheckUtils]: 56: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:18:31,245 INFO L290 TraceCheckUtils]: 57: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:18:31,245 INFO L290 TraceCheckUtils]: 58: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:18:31,245 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #68#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:18:31,245 INFO L272 TraceCheckUtils]: 60: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6274#true} is VALID [2022-04-28 11:18:31,245 INFO L290 TraceCheckUtils]: 61: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:18:31,245 INFO L290 TraceCheckUtils]: 62: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:18:31,245 INFO L290 TraceCheckUtils]: 63: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:18:31,246 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #70#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:18:31,246 INFO L290 TraceCheckUtils]: 65: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:18:31,246 INFO L272 TraceCheckUtils]: 66: Hoare triple {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:18:31,246 INFO L290 TraceCheckUtils]: 67: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:18:31,247 INFO L290 TraceCheckUtils]: 68: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:18:31,247 INFO L290 TraceCheckUtils]: 69: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:18:31,247 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {6274#true} {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #72#return; {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:18:31,247 INFO L272 TraceCheckUtils]: 71: Hoare triple {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:18:31,247 INFO L290 TraceCheckUtils]: 72: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:18:31,247 INFO L290 TraceCheckUtils]: 73: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:18:31,247 INFO L290 TraceCheckUtils]: 74: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:18:31,263 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6274#true} {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #74#return; {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:18:31,265 INFO L272 TraceCheckUtils]: 76: Hoare triple {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:31,265 INFO L290 TraceCheckUtils]: 77: Hoare triple {6510#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:31,265 INFO L290 TraceCheckUtils]: 78: Hoare triple {6514#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6275#false} is VALID [2022-04-28 11:18:31,265 INFO L290 TraceCheckUtils]: 79: Hoare triple {6275#false} assume !false; {6275#false} is VALID [2022-04-28 11:18:31,266 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:18:31,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:40,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:40,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682816268] [2022-04-28 11:18:40,193 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:40,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715480645] [2022-04-28 11:18:40,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715480645] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:18:40,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:18:40,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:18:40,194 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:40,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2059389386] [2022-04-28 11:18:40,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2059389386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:40,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:40,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:18:40,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034002323] [2022-04-28 11:18:40,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:40,195 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:18:40,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:40,195 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:18:40,228 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:18:40,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:18:40,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:40,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:18:40,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:18:40,229 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:18:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:40,811 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-04-28 11:18:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:18:40,812 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:18:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:40,812 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:18:40,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:18:40,813 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:18:40,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:18:40,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 11:18:40,867 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:18:40,868 INFO L225 Difference]: With dead ends: 109 [2022-04-28 11:18:40,868 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 11:18:40,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:18:40,869 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:18:40,869 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:18:40,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 11:18:40,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-28 11:18:40,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:40,930 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:18:40,930 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:18:40,930 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:18:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:40,932 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-04-28 11:18:40,932 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:18:40,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:40,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:40,932 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:18:40,932 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:18:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:40,934 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-04-28 11:18:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:18:40,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:40,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:40,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:40,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:40,934 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:18:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2022-04-28 11:18:40,936 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 80 [2022-04-28 11:18:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:40,936 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2022-04-28 11:18:40,936 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:18:40,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 106 transitions. [2022-04-28 11:18:41,043 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:18:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:18:41,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 11:18:41,043 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:41,043 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:18:41,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 11:18:41,244 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:18:41,244 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:41,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 9 times [2022-04-28 11:18:41,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:41,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [468933872] [2022-04-28 11:18:41,499 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:41,499 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 10 times [2022-04-28 11:18:41,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:41,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582689765] [2022-04-28 11:18:41,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:41,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:41,506 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:41,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [997062055] [2022-04-28 11:18:41,506 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:18:41,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:41,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:41,509 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:18:41,523 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:18:41,558 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:18:41,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:41,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 11:18:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:41,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:41,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {7258#true} call ULTIMATE.init(); {7258#true} is VALID [2022-04-28 11:18:41,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {7258#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); {7258#true} is VALID [2022-04-28 11:18:41,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:41,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7258#true} {7258#true} #84#return; {7258#true} is VALID [2022-04-28 11:18:41,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {7258#true} call #t~ret5 := main(); {7258#true} is VALID [2022-04-28 11:18:41,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {7258#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; {7258#true} is VALID [2022-04-28 11:18:41,809 INFO L272 TraceCheckUtils]: 6: Hoare triple {7258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:18:41,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:41,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:41,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:41,809 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7258#true} {7258#true} #60#return; {7258#true} is VALID [2022-04-28 11:18:41,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {7258#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:41,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:41,810 INFO L272 TraceCheckUtils]: 13: Hoare triple {7296#(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)); {7258#true} is VALID [2022-04-28 11:18:41,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:41,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:41,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:41,811 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:41,811 INFO L272 TraceCheckUtils]: 18: Hoare triple {7296#(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)); {7258#true} is VALID [2022-04-28 11:18:41,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:41,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:41,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:41,812 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:41,812 INFO L272 TraceCheckUtils]: 23: Hoare triple {7296#(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)); {7258#true} is VALID [2022-04-28 11:18:41,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:41,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:41,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:41,812 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:41,812 INFO L272 TraceCheckUtils]: 28: Hoare triple {7296#(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)); {7258#true} is VALID [2022-04-28 11:18:41,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:41,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:41,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:41,813 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:41,813 INFO L272 TraceCheckUtils]: 33: Hoare triple {7296#(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)); {7258#true} is VALID [2022-04-28 11:18:41,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:41,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:41,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:41,814 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:41,814 INFO L290 TraceCheckUtils]: 38: Hoare triple {7296#(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; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:41,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !false; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:41,815 INFO L272 TraceCheckUtils]: 40: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:18:41,815 INFO L290 TraceCheckUtils]: 41: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:41,815 INFO L290 TraceCheckUtils]: 42: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:41,815 INFO L290 TraceCheckUtils]: 43: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:41,815 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #62#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:41,815 INFO L272 TraceCheckUtils]: 45: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:18:41,815 INFO L290 TraceCheckUtils]: 46: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:41,815 INFO L290 TraceCheckUtils]: 47: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:41,816 INFO L290 TraceCheckUtils]: 48: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:41,816 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #64#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:41,816 INFO L272 TraceCheckUtils]: 50: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:18:41,816 INFO L290 TraceCheckUtils]: 51: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:41,816 INFO L290 TraceCheckUtils]: 52: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:41,816 INFO L290 TraceCheckUtils]: 53: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:41,817 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #66#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:41,817 INFO L272 TraceCheckUtils]: 55: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:18:41,817 INFO L290 TraceCheckUtils]: 56: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:41,817 INFO L290 TraceCheckUtils]: 57: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:41,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:41,817 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #68#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:41,817 INFO L272 TraceCheckUtils]: 60: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:18:41,817 INFO L290 TraceCheckUtils]: 61: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:41,818 INFO L290 TraceCheckUtils]: 62: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:41,818 INFO L290 TraceCheckUtils]: 63: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:41,818 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #70#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:41,818 INFO L290 TraceCheckUtils]: 65: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:18:41,819 INFO L290 TraceCheckUtils]: 66: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} assume !false; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:18:41,819 INFO L272 TraceCheckUtils]: 67: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:18:41,819 INFO L290 TraceCheckUtils]: 68: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:41,819 INFO L290 TraceCheckUtils]: 69: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:41,819 INFO L290 TraceCheckUtils]: 70: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:41,819 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7258#true} {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} #62#return; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:18:41,820 INFO L272 TraceCheckUtils]: 72: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:18:41,820 INFO L290 TraceCheckUtils]: 73: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:41,820 INFO L290 TraceCheckUtils]: 74: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:41,820 INFO L290 TraceCheckUtils]: 75: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:41,831 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7258#true} {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} #64#return; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:18:41,832 INFO L272 TraceCheckUtils]: 77: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:41,832 INFO L290 TraceCheckUtils]: 78: Hoare triple {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7501#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:41,832 INFO L290 TraceCheckUtils]: 79: Hoare triple {7501#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7259#false} is VALID [2022-04-28 11:18:41,832 INFO L290 TraceCheckUtils]: 80: Hoare triple {7259#false} assume !false; {7259#false} is VALID [2022-04-28 11:18:41,833 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:18:41,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:42,104 INFO L290 TraceCheckUtils]: 80: Hoare triple {7259#false} assume !false; {7259#false} is VALID [2022-04-28 11:18:42,104 INFO L290 TraceCheckUtils]: 79: Hoare triple {7501#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7259#false} is VALID [2022-04-28 11:18:42,105 INFO L290 TraceCheckUtils]: 78: Hoare triple {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7501#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:42,105 INFO L272 TraceCheckUtils]: 77: Hoare triple {7517#(= (* 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)); {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:42,105 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7258#true} {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:18:42,105 INFO L290 TraceCheckUtils]: 75: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:42,106 INFO L290 TraceCheckUtils]: 74: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:42,106 INFO L290 TraceCheckUtils]: 73: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:42,106 INFO L272 TraceCheckUtils]: 72: Hoare triple {7517#(= (* 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)); {7258#true} is VALID [2022-04-28 11:18:42,106 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7258#true} {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:18:42,106 INFO L290 TraceCheckUtils]: 70: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:42,106 INFO L290 TraceCheckUtils]: 69: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:42,106 INFO L290 TraceCheckUtils]: 68: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:42,106 INFO L272 TraceCheckUtils]: 67: Hoare triple {7517#(= (* 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)); {7258#true} is VALID [2022-04-28 11:18:42,107 INFO L290 TraceCheckUtils]: 66: Hoare triple {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:18:42,109 INFO L290 TraceCheckUtils]: 65: Hoare triple {7554#(= (* (+ 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; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:18:42,109 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:42,109 INFO L290 TraceCheckUtils]: 63: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:42,109 INFO L290 TraceCheckUtils]: 62: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:42,109 INFO L290 TraceCheckUtils]: 61: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:42,109 INFO L272 TraceCheckUtils]: 60: Hoare triple {7554#(= (* (+ 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)); {7258#true} is VALID [2022-04-28 11:18:42,110 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:42,110 INFO L290 TraceCheckUtils]: 58: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:42,110 INFO L290 TraceCheckUtils]: 57: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:42,110 INFO L290 TraceCheckUtils]: 56: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:42,110 INFO L272 TraceCheckUtils]: 55: Hoare triple {7554#(= (* (+ 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)); {7258#true} is VALID [2022-04-28 11:18:42,110 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:42,111 INFO L290 TraceCheckUtils]: 53: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:42,111 INFO L290 TraceCheckUtils]: 52: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:42,111 INFO L290 TraceCheckUtils]: 51: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:42,111 INFO L272 TraceCheckUtils]: 50: Hoare triple {7554#(= (* (+ 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)); {7258#true} is VALID [2022-04-28 11:18:42,111 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:42,111 INFO L290 TraceCheckUtils]: 48: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:42,111 INFO L290 TraceCheckUtils]: 47: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:42,111 INFO L290 TraceCheckUtils]: 46: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:42,111 INFO L272 TraceCheckUtils]: 45: Hoare triple {7554#(= (* (+ 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)); {7258#true} is VALID [2022-04-28 11:18:42,112 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:42,112 INFO L290 TraceCheckUtils]: 43: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:42,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:42,112 INFO L290 TraceCheckUtils]: 41: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:42,112 INFO L272 TraceCheckUtils]: 40: Hoare triple {7554#(= (* (+ 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)); {7258#true} is VALID [2022-04-28 11:18:42,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:42,114 INFO L290 TraceCheckUtils]: 38: Hoare triple {7636#(= (+ 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; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:42,115 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {7636#(= (+ 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:18:42,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:42,115 INFO L290 TraceCheckUtils]: 35: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:42,115 INFO L290 TraceCheckUtils]: 34: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:42,115 INFO L272 TraceCheckUtils]: 33: Hoare triple {7636#(= (+ 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)); {7258#true} is VALID [2022-04-28 11:18:42,116 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {7636#(= (+ 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:18:42,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:42,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:42,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:42,116 INFO L272 TraceCheckUtils]: 28: Hoare triple {7636#(= (+ 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)); {7258#true} is VALID [2022-04-28 11:18:42,116 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {7636#(= (+ 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:18:42,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:42,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:42,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:42,117 INFO L272 TraceCheckUtils]: 23: Hoare triple {7636#(= (+ 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)); {7258#true} is VALID [2022-04-28 11:18:42,117 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {7636#(= (+ 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:18:42,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:42,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:42,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:42,117 INFO L272 TraceCheckUtils]: 18: Hoare triple {7636#(= (+ 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)); {7258#true} is VALID [2022-04-28 11:18:42,118 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {7636#(= (+ 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:18:42,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:42,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:42,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:42,118 INFO L272 TraceCheckUtils]: 13: Hoare triple {7636#(= (+ 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)); {7258#true} is VALID [2022-04-28 11:18:42,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {7636#(= (+ 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:18:42,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {7258#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7636#(= (+ 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:18:42,119 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7258#true} {7258#true} #60#return; {7258#true} is VALID [2022-04-28 11:18:42,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:42,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:18:42,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:18:42,119 INFO L272 TraceCheckUtils]: 6: Hoare triple {7258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:18:42,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {7258#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; {7258#true} is VALID [2022-04-28 11:18:42,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {7258#true} call #t~ret5 := main(); {7258#true} is VALID [2022-04-28 11:18:42,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7258#true} {7258#true} #84#return; {7258#true} is VALID [2022-04-28 11:18:42,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:18:42,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {7258#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); {7258#true} is VALID [2022-04-28 11:18:42,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {7258#true} call ULTIMATE.init(); {7258#true} is VALID [2022-04-28 11:18:42,120 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:18:42,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:42,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582689765] [2022-04-28 11:18:42,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:42,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997062055] [2022-04-28 11:18:42,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997062055] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:18:42,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:18:42,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 11:18:42,121 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:42,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [468933872] [2022-04-28 11:18:42,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [468933872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:42,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:42,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:18:42,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775495547] [2022-04-28 11:18:42,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:42,121 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:18:42,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:42,122 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:18:42,155 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:18:42,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:18:42,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:42,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:18:42,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:18:42,156 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:18:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:43,124 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2022-04-28 11:18:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:18:43,125 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:18:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:43,125 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:18:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-04-28 11:18:43,126 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:18:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-04-28 11:18:43,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 94 transitions. [2022-04-28 11:18:43,203 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:18:43,205 INFO L225 Difference]: With dead ends: 112 [2022-04-28 11:18:43,205 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 11:18:43,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:18:43,206 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:18:43,206 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:18:43,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 11:18:43,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2022-04-28 11:18:43,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:43,262 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:18:43,262 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:18:43,262 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:18:43,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:43,264 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 11:18:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-28 11:18:43,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:43,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:43,264 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:18:43,265 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:18:43,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:43,266 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 11:18:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-28 11:18:43,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:43,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:43,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:43,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:43,267 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:18:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-04-28 11:18:43,269 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 81 [2022-04-28 11:18:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:43,269 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-04-28 11:18:43,269 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:18:43,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 111 transitions. [2022-04-28 11:18:43,381 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:18:43,381 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 11:18:43,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 11:18:43,382 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:43,382 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:18:43,397 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:18:43,587 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:18:43,587 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:43,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:43,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1087104342, now seen corresponding path program 11 times [2022-04-28 11:18:43,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:43,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2119718819] [2022-04-28 11:18:43,903 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:43,904 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:43,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1087104342, now seen corresponding path program 12 times [2022-04-28 11:18:43,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:43,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974122356] [2022-04-28 11:18:43,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:43,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:43,918 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:43,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370881029] [2022-04-28 11:18:43,918 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:18:43,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:43,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:43,920 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:18:43,921 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:18:43,961 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:18:43,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:43,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 11:18:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:43,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:44,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {8401#true} call ULTIMATE.init(); {8401#true} is VALID [2022-04-28 11:18:44,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {8401#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); {8401#true} is VALID [2022-04-28 11:18:44,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8401#true} {8401#true} #84#return; {8401#true} is VALID [2022-04-28 11:18:44,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {8401#true} call #t~ret5 := main(); {8401#true} is VALID [2022-04-28 11:18:44,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {8401#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; {8401#true} is VALID [2022-04-28 11:18:44,361 INFO L272 TraceCheckUtils]: 6: Hoare triple {8401#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:18:44,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,361 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8401#true} {8401#true} #60#return; {8401#true} is VALID [2022-04-28 11:18:44,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {8401#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:44,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:44,362 INFO L272 TraceCheckUtils]: 13: Hoare triple {8439#(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)); {8401#true} is VALID [2022-04-28 11:18:44,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,362 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:44,363 INFO L272 TraceCheckUtils]: 18: Hoare triple {8439#(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)); {8401#true} is VALID [2022-04-28 11:18:44,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,363 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:44,363 INFO L272 TraceCheckUtils]: 23: Hoare triple {8439#(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)); {8401#true} is VALID [2022-04-28 11:18:44,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,364 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:44,364 INFO L272 TraceCheckUtils]: 28: Hoare triple {8439#(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)); {8401#true} is VALID [2022-04-28 11:18:44,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,365 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:44,365 INFO L272 TraceCheckUtils]: 33: Hoare triple {8439#(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)); {8401#true} is VALID [2022-04-28 11:18:44,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,365 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:44,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {8439#(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; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:44,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !false; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:44,366 INFO L272 TraceCheckUtils]: 40: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:18:44,366 INFO L290 TraceCheckUtils]: 41: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,366 INFO L290 TraceCheckUtils]: 42: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,366 INFO L290 TraceCheckUtils]: 43: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,367 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #62#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:44,367 INFO L272 TraceCheckUtils]: 45: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:18:44,367 INFO L290 TraceCheckUtils]: 46: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,367 INFO L290 TraceCheckUtils]: 47: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,367 INFO L290 TraceCheckUtils]: 48: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,367 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #64#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:44,368 INFO L272 TraceCheckUtils]: 50: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:18:44,368 INFO L290 TraceCheckUtils]: 51: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,368 INFO L290 TraceCheckUtils]: 53: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,368 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #66#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:44,368 INFO L272 TraceCheckUtils]: 55: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:18:44,368 INFO L290 TraceCheckUtils]: 56: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,368 INFO L290 TraceCheckUtils]: 57: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,369 INFO L290 TraceCheckUtils]: 58: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,378 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #68#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:44,378 INFO L272 TraceCheckUtils]: 60: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:18:44,378 INFO L290 TraceCheckUtils]: 61: Hoare triple {8401#true} ~cond := #in~cond; {8591#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:44,378 INFO L290 TraceCheckUtils]: 62: Hoare triple {8591#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:44,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:44,379 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #70#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:44,379 INFO L290 TraceCheckUtils]: 65: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:18:44,380 INFO L290 TraceCheckUtils]: 66: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} assume !false; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:18:44,380 INFO L272 TraceCheckUtils]: 67: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:18:44,380 INFO L290 TraceCheckUtils]: 68: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,380 INFO L290 TraceCheckUtils]: 69: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,380 INFO L290 TraceCheckUtils]: 70: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,381 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8401#true} {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} #62#return; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:18:44,381 INFO L272 TraceCheckUtils]: 72: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:18:44,381 INFO L290 TraceCheckUtils]: 73: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,381 INFO L290 TraceCheckUtils]: 74: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,381 INFO L290 TraceCheckUtils]: 75: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,381 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8401#true} {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} #64#return; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:18:44,381 INFO L272 TraceCheckUtils]: 77: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:18:44,382 INFO L290 TraceCheckUtils]: 78: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,382 INFO L290 TraceCheckUtils]: 79: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,382 INFO L290 TraceCheckUtils]: 80: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,382 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8401#true} {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} #66#return; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:18:44,383 INFO L272 TraceCheckUtils]: 82: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~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)); {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:44,383 INFO L290 TraceCheckUtils]: 83: Hoare triple {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8661#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:44,383 INFO L290 TraceCheckUtils]: 84: Hoare triple {8661#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8402#false} is VALID [2022-04-28 11:18:44,383 INFO L290 TraceCheckUtils]: 85: Hoare triple {8402#false} assume !false; {8402#false} is VALID [2022-04-28 11:18:44,384 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:18:44,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:44,976 INFO L290 TraceCheckUtils]: 85: Hoare triple {8402#false} assume !false; {8402#false} is VALID [2022-04-28 11:18:44,976 INFO L290 TraceCheckUtils]: 84: Hoare triple {8661#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8402#false} is VALID [2022-04-28 11:18:44,977 INFO L290 TraceCheckUtils]: 83: Hoare triple {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8661#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:44,977 INFO L272 TraceCheckUtils]: 82: Hoare triple {8677#(= (+ (* 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)); {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:44,978 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8401#true} {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {8677#(= (+ (* 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:18:44,978 INFO L290 TraceCheckUtils]: 80: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,978 INFO L290 TraceCheckUtils]: 79: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,978 INFO L290 TraceCheckUtils]: 78: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,978 INFO L272 TraceCheckUtils]: 77: Hoare triple {8677#(= (+ (* 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)); {8401#true} is VALID [2022-04-28 11:18:44,979 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8401#true} {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {8677#(= (+ (* 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:18:44,979 INFO L290 TraceCheckUtils]: 75: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,979 INFO L290 TraceCheckUtils]: 74: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,979 INFO L290 TraceCheckUtils]: 73: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,979 INFO L272 TraceCheckUtils]: 72: Hoare triple {8677#(= (+ (* 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)); {8401#true} is VALID [2022-04-28 11:18:44,979 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8401#true} {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #62#return; {8677#(= (+ (* 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:18:44,979 INFO L290 TraceCheckUtils]: 70: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,980 INFO L290 TraceCheckUtils]: 68: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,980 INFO L272 TraceCheckUtils]: 67: Hoare triple {8677#(= (+ (* 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)); {8401#true} is VALID [2022-04-28 11:18:44,980 INFO L290 TraceCheckUtils]: 66: Hoare triple {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !false; {8677#(= (+ (* 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:18:44,983 INFO L290 TraceCheckUtils]: 65: Hoare triple {8729#(= (+ (* 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; {8677#(= (+ (* 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:18:44,984 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} {8733#(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; {8729#(= (+ (* 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:18:44,985 INFO L290 TraceCheckUtils]: 63: Hoare triple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:44,985 INFO L290 TraceCheckUtils]: 62: Hoare triple {8743#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:44,985 INFO L290 TraceCheckUtils]: 61: Hoare triple {8401#true} ~cond := #in~cond; {8743#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:18:44,985 INFO L272 TraceCheckUtils]: 60: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:18:44,986 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8401#true} {8733#(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; {8733#(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:18:44,986 INFO L290 TraceCheckUtils]: 58: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,986 INFO L290 TraceCheckUtils]: 57: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,986 INFO L290 TraceCheckUtils]: 56: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,986 INFO L272 TraceCheckUtils]: 55: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:18:44,986 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8401#true} {8733#(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; {8733#(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:18:44,987 INFO L290 TraceCheckUtils]: 53: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,987 INFO L290 TraceCheckUtils]: 52: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,987 INFO L290 TraceCheckUtils]: 51: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,987 INFO L272 TraceCheckUtils]: 50: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:18:44,987 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8401#true} {8733#(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; {8733#(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:18:44,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,988 INFO L272 TraceCheckUtils]: 45: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:18:44,988 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8401#true} {8733#(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; {8733#(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:18:44,988 INFO L290 TraceCheckUtils]: 43: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:44,988 INFO L290 TraceCheckUtils]: 42: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:44,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:44,988 INFO L272 TraceCheckUtils]: 40: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:18:44,989 INFO L290 TraceCheckUtils]: 39: Hoare triple {8733#(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; {8733#(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:18:46,131 INFO L290 TraceCheckUtils]: 38: Hoare triple {8733#(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; {8733#(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:18:46,132 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8401#true} {8733#(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; {8733#(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:18:46,132 INFO L290 TraceCheckUtils]: 36: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:46,132 INFO L290 TraceCheckUtils]: 35: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:46,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:46,132 INFO L272 TraceCheckUtils]: 33: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:18:46,133 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8401#true} {8733#(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; {8733#(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:18:46,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:46,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:46,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:46,133 INFO L272 TraceCheckUtils]: 28: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:18:46,133 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8401#true} {8733#(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; {8733#(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:18:46,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:46,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:46,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:46,134 INFO L272 TraceCheckUtils]: 23: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:18:46,134 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8401#true} {8733#(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; {8733#(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:18:46,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:46,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:46,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:46,135 INFO L272 TraceCheckUtils]: 18: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:18:46,135 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8401#true} {8733#(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; {8733#(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:18:46,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:46,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:46,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:46,135 INFO L272 TraceCheckUtils]: 13: Hoare triple {8733#(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)); {8401#true} is VALID [2022-04-28 11:18:46,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {8733#(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; {8733#(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:18:46,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {8401#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8733#(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:18:46,136 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8401#true} {8401#true} #60#return; {8401#true} is VALID [2022-04-28 11:18:46,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:46,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:18:46,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:18:46,136 INFO L272 TraceCheckUtils]: 6: Hoare triple {8401#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:18:46,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {8401#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; {8401#true} is VALID [2022-04-28 11:18:46,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {8401#true} call #t~ret5 := main(); {8401#true} is VALID [2022-04-28 11:18:46,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8401#true} {8401#true} #84#return; {8401#true} is VALID [2022-04-28 11:18:46,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:18:46,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {8401#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); {8401#true} is VALID [2022-04-28 11:18:46,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {8401#true} call ULTIMATE.init(); {8401#true} is VALID [2022-04-28 11:18:46,137 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:18:46,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:46,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974122356] [2022-04-28 11:18:46,138 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:46,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370881029] [2022-04-28 11:18:46,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370881029] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:18:46,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:18:46,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-04-28 11:18:46,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:46,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2119718819] [2022-04-28 11:18:46,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2119718819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:46,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:46,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:18:46,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798334732] [2022-04-28 11:18:46,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:46,139 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:18:46,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:46,139 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:18:46,180 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:18:46,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:18:46,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:46,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:18:46,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:18:46,181 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:18:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:47,271 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2022-04-28 11:18:47,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:18:47,271 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:18:47,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:47,272 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:18:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-28 11:18:47,273 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:18:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-28 11:18:47,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-28 11:18:47,367 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:18:47,368 INFO L225 Difference]: With dead ends: 116 [2022-04-28 11:18:47,368 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 11:18:47,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:18:47,369 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:18:47,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 151 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 11:18:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 11:18:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-28 11:18:47,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:47,422 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:18:47,423 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:18:47,423 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:18:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:47,425 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-28 11:18:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:18:47,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:47,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:47,425 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:18:47,425 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:18:47,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:47,427 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-28 11:18:47,427 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:18:47,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:47,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:47,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:47,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:47,428 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:18:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-04-28 11:18:47,429 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 86 [2022-04-28 11:18:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:47,430 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-04-28 11:18:47,430 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:18:47,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 125 transitions. [2022-04-28 11:18:47,565 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:18:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:18:47,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 11:18:47,567 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:47,567 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:18:47,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 11:18:47,767 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:18:47,768 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:47,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:47,768 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 3 times [2022-04-28 11:18:47,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:47,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1941140899] [2022-04-28 11:18:47,994 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:47,994 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:47,994 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 4 times [2022-04-28 11:18:47,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:47,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79948543] [2022-04-28 11:18:47,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:47,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:48,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:48,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608181791] [2022-04-28 11:18:48,002 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:18:48,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:48,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:48,002 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:18:48,003 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:18:48,050 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:18:48,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:48,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 11:18:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:48,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:48,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {9609#true} call ULTIMATE.init(); {9609#true} is VALID [2022-04-28 11:18:48,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {9609#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); {9609#true} is VALID [2022-04-28 11:18:48,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9609#true} {9609#true} #84#return; {9609#true} is VALID [2022-04-28 11:18:48,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {9609#true} call #t~ret5 := main(); {9609#true} is VALID [2022-04-28 11:18:48,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {9609#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; {9609#true} is VALID [2022-04-28 11:18:48,621 INFO L272 TraceCheckUtils]: 6: Hoare triple {9609#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:18:48,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,621 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9609#true} {9609#true} #60#return; {9609#true} is VALID [2022-04-28 11:18:48,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {9609#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:48,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:48,622 INFO L272 TraceCheckUtils]: 13: Hoare triple {9647#(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)); {9609#true} is VALID [2022-04-28 11:18:48,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,623 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:48,623 INFO L272 TraceCheckUtils]: 18: Hoare triple {9647#(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)); {9609#true} is VALID [2022-04-28 11:18:48,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,624 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:48,624 INFO L272 TraceCheckUtils]: 23: Hoare triple {9647#(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)); {9609#true} is VALID [2022-04-28 11:18:48,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,624 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:48,625 INFO L272 TraceCheckUtils]: 28: Hoare triple {9647#(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)); {9609#true} is VALID [2022-04-28 11:18:48,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,625 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:48,626 INFO L272 TraceCheckUtils]: 33: Hoare triple {9647#(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)); {9609#true} is VALID [2022-04-28 11:18:48,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,626 INFO L290 TraceCheckUtils]: 36: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,626 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:48,627 INFO L290 TraceCheckUtils]: 38: Hoare triple {9647#(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; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:48,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !false; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:48,639 INFO L272 TraceCheckUtils]: 40: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:18:48,639 INFO L290 TraceCheckUtils]: 41: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,639 INFO L290 TraceCheckUtils]: 42: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,639 INFO L290 TraceCheckUtils]: 43: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,639 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #62#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:48,640 INFO L272 TraceCheckUtils]: 45: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:18:48,640 INFO L290 TraceCheckUtils]: 46: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,640 INFO L290 TraceCheckUtils]: 47: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,640 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #64#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:48,640 INFO L272 TraceCheckUtils]: 50: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:18:48,640 INFO L290 TraceCheckUtils]: 51: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,640 INFO L290 TraceCheckUtils]: 53: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,641 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #66#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:48,641 INFO L272 TraceCheckUtils]: 55: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:18:48,641 INFO L290 TraceCheckUtils]: 56: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,642 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #68#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:48,642 INFO L272 TraceCheckUtils]: 60: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:18:48,642 INFO L290 TraceCheckUtils]: 61: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,642 INFO L290 TraceCheckUtils]: 62: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,642 INFO L290 TraceCheckUtils]: 63: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,642 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #70#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:48,643 INFO L290 TraceCheckUtils]: 65: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:18:48,643 INFO L290 TraceCheckUtils]: 66: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} assume !false; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:18:48,643 INFO L272 TraceCheckUtils]: 67: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:18:48,643 INFO L290 TraceCheckUtils]: 68: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,644 INFO L290 TraceCheckUtils]: 69: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,644 INFO L290 TraceCheckUtils]: 70: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,644 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #62#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:18:48,644 INFO L272 TraceCheckUtils]: 72: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:18:48,644 INFO L290 TraceCheckUtils]: 73: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,644 INFO L290 TraceCheckUtils]: 74: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,644 INFO L290 TraceCheckUtils]: 75: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,645 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #64#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:18:48,645 INFO L272 TraceCheckUtils]: 77: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:18:48,645 INFO L290 TraceCheckUtils]: 78: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,645 INFO L290 TraceCheckUtils]: 79: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,645 INFO L290 TraceCheckUtils]: 80: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,646 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #66#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:18:48,646 INFO L272 TraceCheckUtils]: 82: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~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)); {9609#true} is VALID [2022-04-28 11:18:48,646 INFO L290 TraceCheckUtils]: 83: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,646 INFO L290 TraceCheckUtils]: 84: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,646 INFO L290 TraceCheckUtils]: 85: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,646 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #68#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:18:48,647 INFO L272 TraceCheckUtils]: 87: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~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)); {9609#true} is VALID [2022-04-28 11:18:48,647 INFO L290 TraceCheckUtils]: 88: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,647 INFO L290 TraceCheckUtils]: 89: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,647 INFO L290 TraceCheckUtils]: 90: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,647 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #70#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:18:48,648 INFO L290 TraceCheckUtils]: 92: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} assume !(~n~0 <= ~a~0); {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} is VALID [2022-04-28 11:18:48,648 INFO L272 TraceCheckUtils]: 93: Hoare triple {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:18:48,648 INFO L290 TraceCheckUtils]: 94: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:18:48,648 INFO L290 TraceCheckUtils]: 95: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:18:48,648 INFO L290 TraceCheckUtils]: 96: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:18:48,648 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {9609#true} {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} #72#return; {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} is VALID [2022-04-28 11:18:48,649 INFO L272 TraceCheckUtils]: 98: Hoare triple {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {9912#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:48,649 INFO L290 TraceCheckUtils]: 99: Hoare triple {9912#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9916#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:48,650 INFO L290 TraceCheckUtils]: 100: Hoare triple {9916#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9610#false} is VALID [2022-04-28 11:18:48,650 INFO L290 TraceCheckUtils]: 101: Hoare triple {9610#false} assume !false; {9610#false} is VALID [2022-04-28 11:18:48,650 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:18:48,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:48,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:48,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79948543] [2022-04-28 11:18:48,952 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:48,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608181791] [2022-04-28 11:18:48,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608181791] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:18:48,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:18:48,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 11:18:48,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:48,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1941140899] [2022-04-28 11:18:48,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1941140899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:48,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:48,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:18:48,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761722936] [2022-04-28 11:18:48,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:48,953 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:18:48,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:48,953 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:18:48,998 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:18:48,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:18:48,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:48,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:18:48,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:18:48,999 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:18:49,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:49,845 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2022-04-28 11:18:49,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:18:49,845 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:18:49,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:49,846 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:18:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:18:49,847 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:18:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:18:49,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2022-04-28 11:18:49,937 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:18:49,939 INFO L225 Difference]: With dead ends: 117 [2022-04-28 11:18:49,939 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 11:18:49,939 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:18:49,940 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:18:49,940 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:18:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 11:18:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-28 11:18:50,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:50,006 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:18:50,007 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:18:50,007 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:18:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:50,009 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-04-28 11:18:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:18:50,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:50,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:50,009 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:18:50,009 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:18:50,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:50,011 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-04-28 11:18:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:18:50,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:50,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:50,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:50,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:50,012 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:18:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2022-04-28 11:18:50,013 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 102 [2022-04-28 11:18:50,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:50,014 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2022-04-28 11:18:50,014 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:18:50,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 128 transitions. [2022-04-28 11:18:50,159 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:18:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:18:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 11:18:50,160 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:50,160 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:18:50,185 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:18:50,360 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:18:50,360 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:50,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash -360684101, now seen corresponding path program 13 times [2022-04-28 11:18:50,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:50,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [199208852] [2022-04-28 11:18:50,584 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:50,584 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:50,584 INFO L85 PathProgramCache]: Analyzing trace with hash -360684101, now seen corresponding path program 14 times [2022-04-28 11:18:50,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:50,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264945936] [2022-04-28 11:18:50,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:50,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:50,614 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:50,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [974555781] [2022-04-28 11:18:50,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:18:50,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:50,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:50,615 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:18:50,617 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:18:50,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:18:50,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:50,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 11:18:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:50,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:51,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {10737#true} call ULTIMATE.init(); {10737#true} is VALID [2022-04-28 11:18:51,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {10737#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); {10737#true} is VALID [2022-04-28 11:18:51,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10737#true} {10737#true} #84#return; {10737#true} is VALID [2022-04-28 11:18:51,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {10737#true} call #t~ret5 := main(); {10737#true} is VALID [2022-04-28 11:18:51,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {10737#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; {10737#true} is VALID [2022-04-28 11:18:51,190 INFO L272 TraceCheckUtils]: 6: Hoare triple {10737#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:18:51,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:51,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:51,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,190 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10737#true} {10737#true} #60#return; {10737#true} is VALID [2022-04-28 11:18:51,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {10737#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:18:51,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} assume !false; {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:18:51,191 INFO L272 TraceCheckUtils]: 13: Hoare triple {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:18:51,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:51,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:51,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,192 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #62#return; {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:18:51,192 INFO L272 TraceCheckUtils]: 18: Hoare triple {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:18:51,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:51,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:51,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,192 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #64#return; {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:18:51,192 INFO L272 TraceCheckUtils]: 23: Hoare triple {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:18:51,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:51,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:51,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,193 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #66#return; {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:18:51,193 INFO L272 TraceCheckUtils]: 28: Hoare triple {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= 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)); {10737#true} is VALID [2022-04-28 11:18:51,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:51,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:51,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,194 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #68#return; {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:18:51,194 INFO L272 TraceCheckUtils]: 33: Hoare triple {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:18:51,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:51,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:51,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,194 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #70#return; {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:18:51,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {10775#(and (= main_~n~0 0) (= main_~z~0 6) (<= 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; {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:51,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} assume !false; {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:51,195 INFO L272 TraceCheckUtils]: 40: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:18:51,195 INFO L290 TraceCheckUtils]: 41: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:51,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:51,196 INFO L290 TraceCheckUtils]: 43: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,196 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} #62#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:51,196 INFO L272 TraceCheckUtils]: 45: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:18:51,196 INFO L290 TraceCheckUtils]: 46: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:51,196 INFO L290 TraceCheckUtils]: 47: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:51,196 INFO L290 TraceCheckUtils]: 48: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,197 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} #64#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:51,197 INFO L272 TraceCheckUtils]: 50: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:18:51,197 INFO L290 TraceCheckUtils]: 51: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:51,197 INFO L290 TraceCheckUtils]: 52: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:51,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,197 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} #66#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:51,197 INFO L272 TraceCheckUtils]: 55: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:18:51,198 INFO L290 TraceCheckUtils]: 56: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:51,198 INFO L290 TraceCheckUtils]: 57: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:51,198 INFO L290 TraceCheckUtils]: 58: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,198 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} #68#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:51,198 INFO L272 TraceCheckUtils]: 60: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:18:51,198 INFO L290 TraceCheckUtils]: 61: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:51,198 INFO L290 TraceCheckUtils]: 62: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:51,198 INFO L290 TraceCheckUtils]: 63: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,215 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} #70#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:18:51,216 INFO L290 TraceCheckUtils]: 65: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:18:51,217 INFO L290 TraceCheckUtils]: 66: Hoare triple {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 2) main_~n~0) 0))} assume !false; {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:18:51,217 INFO L272 TraceCheckUtils]: 67: Hoare triple {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:18:51,217 INFO L290 TraceCheckUtils]: 68: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:51,217 INFO L290 TraceCheckUtils]: 69: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:51,217 INFO L290 TraceCheckUtils]: 70: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,217 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 2) main_~n~0) 0))} #62#return; {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:18:51,217 INFO L272 TraceCheckUtils]: 72: Hoare triple {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:18:51,217 INFO L290 TraceCheckUtils]: 73: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:51,217 INFO L290 TraceCheckUtils]: 74: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:51,218 INFO L290 TraceCheckUtils]: 75: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,218 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 2) main_~n~0) 0))} #64#return; {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:18:51,218 INFO L272 TraceCheckUtils]: 77: Hoare triple {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:18:51,218 INFO L290 TraceCheckUtils]: 78: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:51,218 INFO L290 TraceCheckUtils]: 79: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:51,218 INFO L290 TraceCheckUtils]: 80: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,219 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 2) main_~n~0) 0))} #66#return; {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:18:51,219 INFO L272 TraceCheckUtils]: 82: Hoare triple {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 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)); {10737#true} is VALID [2022-04-28 11:18:51,219 INFO L290 TraceCheckUtils]: 83: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:51,219 INFO L290 TraceCheckUtils]: 84: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:51,219 INFO L290 TraceCheckUtils]: 85: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,220 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 2) main_~n~0) 0))} #68#return; {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:18:51,220 INFO L272 TraceCheckUtils]: 87: Hoare triple {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 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)); {10737#true} is VALID [2022-04-28 11:18:51,220 INFO L290 TraceCheckUtils]: 88: Hoare triple {10737#true} ~cond := #in~cond; {11009#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:51,221 INFO L290 TraceCheckUtils]: 89: Hoare triple {11009#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11013#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:51,221 INFO L290 TraceCheckUtils]: 90: Hoare triple {11013#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11013#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:51,221 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {11013#(not (= |__VERIFIER_assert_#in~cond| 0))} {10939#(and (= main_~z~0 18) (<= main_~y~0 19) (= (+ (- 2) main_~n~0) 0))} #70#return; {11020#(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:18:51,222 INFO L290 TraceCheckUtils]: 92: Hoare triple {11020#(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; {11024#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} is VALID [2022-04-28 11:18:51,222 INFO L290 TraceCheckUtils]: 93: Hoare triple {11024#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} assume !false; {11024#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} is VALID [2022-04-28 11:18:51,222 INFO L272 TraceCheckUtils]: 94: Hoare triple {11024#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:18:51,222 INFO L290 TraceCheckUtils]: 95: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:51,222 INFO L290 TraceCheckUtils]: 96: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:51,222 INFO L290 TraceCheckUtils]: 97: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:51,223 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10737#true} {11024#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} #62#return; {11024#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} is VALID [2022-04-28 11:18:51,223 INFO L272 TraceCheckUtils]: 99: Hoare triple {11024#(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)); {11046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:51,224 INFO L290 TraceCheckUtils]: 100: Hoare triple {11046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:51,224 INFO L290 TraceCheckUtils]: 101: Hoare triple {11050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10738#false} is VALID [2022-04-28 11:18:51,224 INFO L290 TraceCheckUtils]: 102: Hoare triple {10738#false} assume !false; {10738#false} is VALID [2022-04-28 11:18:51,224 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:18:51,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:52,638 INFO L290 TraceCheckUtils]: 102: Hoare triple {10738#false} assume !false; {10738#false} is VALID [2022-04-28 11:18:52,638 INFO L290 TraceCheckUtils]: 101: Hoare triple {11050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10738#false} is VALID [2022-04-28 11:18:52,638 INFO L290 TraceCheckUtils]: 100: Hoare triple {11046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:52,639 INFO L272 TraceCheckUtils]: 99: Hoare triple {11066#(= (+ (* 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)); {11046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:52,639 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10737#true} {11066#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {11066#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:18:52,639 INFO L290 TraceCheckUtils]: 97: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,639 INFO L290 TraceCheckUtils]: 96: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:52,639 INFO L290 TraceCheckUtils]: 95: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:52,639 INFO L272 TraceCheckUtils]: 94: Hoare triple {11066#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:18:52,640 INFO L290 TraceCheckUtils]: 93: Hoare triple {11066#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {11066#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:18:52,642 INFO L290 TraceCheckUtils]: 92: Hoare triple {11088#(= (+ (* 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; {11066#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:18:52,643 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {11013#(not (= |__VERIFIER_assert_#in~cond| 0))} {11092#(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; {11088#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:18:52,643 INFO L290 TraceCheckUtils]: 90: Hoare triple {11013#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11013#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:52,643 INFO L290 TraceCheckUtils]: 89: Hoare triple {11102#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11013#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:52,644 INFO L290 TraceCheckUtils]: 88: Hoare triple {10737#true} ~cond := #in~cond; {11102#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:18:52,644 INFO L272 TraceCheckUtils]: 87: Hoare triple {11092#(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)); {10737#true} is VALID [2022-04-28 11:18:52,644 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10737#true} {11092#(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; {11092#(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:18:52,644 INFO L290 TraceCheckUtils]: 85: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,644 INFO L290 TraceCheckUtils]: 84: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:52,644 INFO L290 TraceCheckUtils]: 83: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:52,644 INFO L272 TraceCheckUtils]: 82: Hoare triple {11092#(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)); {10737#true} is VALID [2022-04-28 11:18:52,645 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10737#true} {11092#(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; {11092#(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:18:52,645 INFO L290 TraceCheckUtils]: 80: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,645 INFO L290 TraceCheckUtils]: 79: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:52,645 INFO L290 TraceCheckUtils]: 78: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:52,645 INFO L272 TraceCheckUtils]: 77: Hoare triple {11092#(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)); {10737#true} is VALID [2022-04-28 11:18:52,646 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10737#true} {11092#(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; {11092#(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:18:52,646 INFO L290 TraceCheckUtils]: 75: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,646 INFO L290 TraceCheckUtils]: 74: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:52,646 INFO L290 TraceCheckUtils]: 73: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:52,646 INFO L272 TraceCheckUtils]: 72: Hoare triple {11092#(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)); {10737#true} is VALID [2022-04-28 11:18:52,646 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10737#true} {11092#(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; {11092#(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:18:52,646 INFO L290 TraceCheckUtils]: 70: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,646 INFO L290 TraceCheckUtils]: 69: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:52,646 INFO L290 TraceCheckUtils]: 68: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:52,646 INFO L272 TraceCheckUtils]: 67: Hoare triple {11092#(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)); {10737#true} is VALID [2022-04-28 11:18:52,647 INFO L290 TraceCheckUtils]: 66: Hoare triple {11092#(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; {11092#(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:18:52,658 INFO L290 TraceCheckUtils]: 65: Hoare triple {11172#(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; {11092#(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:18:52,658 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10737#true} {11172#(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; {11172#(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:18:52,658 INFO L290 TraceCheckUtils]: 63: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,658 INFO L290 TraceCheckUtils]: 62: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:52,658 INFO L290 TraceCheckUtils]: 61: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:52,658 INFO L272 TraceCheckUtils]: 60: Hoare triple {11172#(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)); {10737#true} is VALID [2022-04-28 11:18:52,659 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10737#true} {11172#(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; {11172#(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:18:52,659 INFO L290 TraceCheckUtils]: 58: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,659 INFO L290 TraceCheckUtils]: 57: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:52,659 INFO L290 TraceCheckUtils]: 56: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:52,659 INFO L272 TraceCheckUtils]: 55: Hoare triple {11172#(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)); {10737#true} is VALID [2022-04-28 11:18:52,660 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10737#true} {11172#(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; {11172#(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:18:52,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,660 INFO L290 TraceCheckUtils]: 52: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:52,660 INFO L290 TraceCheckUtils]: 51: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:52,660 INFO L272 TraceCheckUtils]: 50: Hoare triple {11172#(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)); {10737#true} is VALID [2022-04-28 11:18:52,660 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10737#true} {11172#(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; {11172#(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:18:52,660 INFO L290 TraceCheckUtils]: 48: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,660 INFO L290 TraceCheckUtils]: 47: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:52,660 INFO L290 TraceCheckUtils]: 46: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:52,661 INFO L272 TraceCheckUtils]: 45: Hoare triple {11172#(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)); {10737#true} is VALID [2022-04-28 11:18:52,661 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10737#true} {11172#(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; {11172#(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:18:52,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:52,661 INFO L290 TraceCheckUtils]: 41: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:52,661 INFO L272 TraceCheckUtils]: 40: Hoare triple {11172#(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)); {10737#true} is VALID [2022-04-28 11:18:52,664 INFO L290 TraceCheckUtils]: 39: Hoare triple {11172#(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; {11172#(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:18:52,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {11254#(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; {11172#(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:18:52,675 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10737#true} {11254#(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; {11254#(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:18:52,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:52,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:52,676 INFO L272 TraceCheckUtils]: 33: Hoare triple {11254#(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)); {10737#true} is VALID [2022-04-28 11:18:52,676 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10737#true} {11254#(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; {11254#(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:18:52,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:52,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:52,676 INFO L272 TraceCheckUtils]: 28: Hoare triple {11254#(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)); {10737#true} is VALID [2022-04-28 11:18:52,677 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10737#true} {11254#(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; {11254#(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:18:52,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:52,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:52,677 INFO L272 TraceCheckUtils]: 23: Hoare triple {11254#(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)); {10737#true} is VALID [2022-04-28 11:18:52,678 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10737#true} {11254#(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; {11254#(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:18:52,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:52,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:52,678 INFO L272 TraceCheckUtils]: 18: Hoare triple {11254#(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)); {10737#true} is VALID [2022-04-28 11:18:52,678 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10737#true} {11254#(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; {11254#(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:18:52,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:52,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:52,679 INFO L272 TraceCheckUtils]: 13: Hoare triple {11254#(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)); {10737#true} is VALID [2022-04-28 11:18:52,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {11254#(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; {11254#(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:18:52,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {10737#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {11254#(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:18:52,680 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10737#true} {10737#true} #60#return; {10737#true} is VALID [2022-04-28 11:18:52,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:18:52,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:18:52,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {10737#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:18:52,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {10737#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; {10737#true} is VALID [2022-04-28 11:18:52,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {10737#true} call #t~ret5 := main(); {10737#true} is VALID [2022-04-28 11:18:52,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10737#true} {10737#true} #84#return; {10737#true} is VALID [2022-04-28 11:18:52,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:18:52,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {10737#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); {10737#true} is VALID [2022-04-28 11:18:52,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {10737#true} call ULTIMATE.init(); {10737#true} is VALID [2022-04-28 11:18:52,681 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:18:52,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:52,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264945936] [2022-04-28 11:18:52,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:52,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974555781] [2022-04-28 11:18:52,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974555781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:18:52,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:18:52,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-04-28 11:18:52,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:52,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [199208852] [2022-04-28 11:18:52,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [199208852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:52,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:52,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 11:18:52,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595491768] [2022-04-28 11:18:52,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:52,682 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:18:52,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:52,682 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:18:52,729 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:18:52,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 11:18:52,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:52,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 11:18:52,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:18:52,730 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:18:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:54,657 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2022-04-28 11:18:54,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:18:54,657 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:18:54,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:54,657 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:18:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-28 11:18:54,659 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:18:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-28 11:18:54,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2022-04-28 11:18:54,760 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:18:54,762 INFO L225 Difference]: With dead ends: 142 [2022-04-28 11:18:54,762 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 11:18:54,763 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:18:54,763 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 13 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:18:54,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 194 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 11:18:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 11:18:54,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-04-28 11:18:54,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:54,851 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:18:54,852 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:18:54,853 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:18:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:54,856 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2022-04-28 11:18:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2022-04-28 11:18:54,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:54,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:54,856 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:18:54,856 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:18:54,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:54,859 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2022-04-28 11:18:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2022-04-28 11:18:54,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:54,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:54,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:54,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:54,859 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:18:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2022-04-28 11:18:54,861 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 103 [2022-04-28 11:18:54,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:54,861 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2022-04-28 11:18:54,862 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:18:54,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 142 transitions. [2022-04-28 11:18:55,013 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:18:55,013 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-04-28 11:18:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 11:18:55,014 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:55,014 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:18:55,030 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:18:55,230 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:18:55,230 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:55,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:55,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 3 times [2022-04-28 11:18:55,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:55,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [821939539] [2022-04-28 11:18:55,443 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:55,443 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:55,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 4 times [2022-04-28 11:18:55,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:55,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380619171] [2022-04-28 11:18:55,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:55,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:55,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:55,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1541005927] [2022-04-28 11:18:55,450 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:18:55,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:55,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:55,451 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:18:55,452 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:18:55,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:18:55,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:55,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 11:18:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:55,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:56,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {12199#true} call ULTIMATE.init(); {12199#true} is VALID [2022-04-28 11:18:56,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {12199#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); {12199#true} is VALID [2022-04-28 11:18:56,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12199#true} {12199#true} #84#return; {12199#true} is VALID [2022-04-28 11:18:56,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {12199#true} call #t~ret5 := main(); {12199#true} is VALID [2022-04-28 11:18:56,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {12199#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; {12199#true} is VALID [2022-04-28 11:18:56,001 INFO L272 TraceCheckUtils]: 6: Hoare triple {12199#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {12199#true} is VALID [2022-04-28 11:18:56,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,001 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12199#true} {12199#true} #60#return; {12199#true} is VALID [2022-04-28 11:18:56,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {12199#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {12237#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:56,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {12237#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {12237#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:56,002 INFO L272 TraceCheckUtils]: 13: Hoare triple {12237#(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)); {12199#true} is VALID [2022-04-28 11:18:56,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,002 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12199#true} {12237#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {12237#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:56,003 INFO L272 TraceCheckUtils]: 18: Hoare triple {12237#(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)); {12199#true} is VALID [2022-04-28 11:18:56,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,003 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12199#true} {12237#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {12237#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:56,003 INFO L272 TraceCheckUtils]: 23: Hoare triple {12237#(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)); {12199#true} is VALID [2022-04-28 11:18:56,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,004 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12199#true} {12237#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {12237#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:56,004 INFO L272 TraceCheckUtils]: 28: Hoare triple {12237#(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)); {12199#true} is VALID [2022-04-28 11:18:56,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,004 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12199#true} {12237#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {12237#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:56,005 INFO L272 TraceCheckUtils]: 33: Hoare triple {12237#(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)); {12199#true} is VALID [2022-04-28 11:18:56,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,005 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12199#true} {12237#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {12237#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:56,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {12237#(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; {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:18:56,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !false; {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:18:56,006 INFO L272 TraceCheckUtils]: 40: Hoare triple {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12199#true} is VALID [2022-04-28 11:18:56,006 INFO L290 TraceCheckUtils]: 41: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,006 INFO L290 TraceCheckUtils]: 42: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,006 INFO L290 TraceCheckUtils]: 43: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,007 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {12199#true} {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #62#return; {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:18:56,007 INFO L272 TraceCheckUtils]: 45: Hoare triple {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12199#true} is VALID [2022-04-28 11:18:56,007 INFO L290 TraceCheckUtils]: 46: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,007 INFO L290 TraceCheckUtils]: 47: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,007 INFO L290 TraceCheckUtils]: 48: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,007 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {12199#true} {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #64#return; {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:18:56,007 INFO L272 TraceCheckUtils]: 50: Hoare triple {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12199#true} is VALID [2022-04-28 11:18:56,007 INFO L290 TraceCheckUtils]: 51: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,008 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12199#true} {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #66#return; {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:18:56,008 INFO L272 TraceCheckUtils]: 55: Hoare triple {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12199#true} is VALID [2022-04-28 11:18:56,008 INFO L290 TraceCheckUtils]: 56: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,008 INFO L290 TraceCheckUtils]: 57: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,008 INFO L290 TraceCheckUtils]: 58: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,009 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12199#true} {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #68#return; {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:18:56,009 INFO L272 TraceCheckUtils]: 60: Hoare triple {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12199#true} is VALID [2022-04-28 11:18:56,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,009 INFO L290 TraceCheckUtils]: 62: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,009 INFO L290 TraceCheckUtils]: 63: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,009 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12199#true} {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #70#return; {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:18:56,010 INFO L290 TraceCheckUtils]: 65: Hoare triple {12319#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 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; {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 11:18:56,010 INFO L290 TraceCheckUtils]: 66: Hoare triple {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} assume !false; {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 11:18:56,010 INFO L272 TraceCheckUtils]: 67: Hoare triple {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12199#true} is VALID [2022-04-28 11:18:56,010 INFO L290 TraceCheckUtils]: 68: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,010 INFO L290 TraceCheckUtils]: 69: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,010 INFO L290 TraceCheckUtils]: 70: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,011 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12199#true} {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} #62#return; {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 11:18:56,011 INFO L272 TraceCheckUtils]: 72: Hoare triple {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12199#true} is VALID [2022-04-28 11:18:56,011 INFO L290 TraceCheckUtils]: 73: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,011 INFO L290 TraceCheckUtils]: 74: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,011 INFO L290 TraceCheckUtils]: 75: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,011 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {12199#true} {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} #64#return; {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 11:18:56,012 INFO L272 TraceCheckUtils]: 77: Hoare triple {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12199#true} is VALID [2022-04-28 11:18:56,012 INFO L290 TraceCheckUtils]: 78: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,012 INFO L290 TraceCheckUtils]: 79: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,012 INFO L290 TraceCheckUtils]: 80: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,012 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {12199#true} {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} #66#return; {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 11:18:56,012 INFO L272 TraceCheckUtils]: 82: Hoare triple {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~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)); {12199#true} is VALID [2022-04-28 11:18:56,012 INFO L290 TraceCheckUtils]: 83: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,012 INFO L290 TraceCheckUtils]: 84: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,013 INFO L290 TraceCheckUtils]: 85: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,013 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {12199#true} {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} #68#return; {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 11:18:56,013 INFO L272 TraceCheckUtils]: 87: Hoare triple {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12199#true} is VALID [2022-04-28 11:18:56,013 INFO L290 TraceCheckUtils]: 88: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,013 INFO L290 TraceCheckUtils]: 89: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,013 INFO L290 TraceCheckUtils]: 90: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,014 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {12199#true} {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} #70#return; {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 11:18:56,015 INFO L290 TraceCheckUtils]: 92: Hoare triple {12401#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~n~0 <= ~a~0); {12483#(and (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 11:18:56,015 INFO L272 TraceCheckUtils]: 93: Hoare triple {12483#(and (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~y~0 (+ main_~z~0 1)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12199#true} is VALID [2022-04-28 11:18:56,015 INFO L290 TraceCheckUtils]: 94: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,015 INFO L290 TraceCheckUtils]: 95: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,015 INFO L290 TraceCheckUtils]: 96: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,015 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {12199#true} {12483#(and (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~y~0 (+ main_~z~0 1)))} #72#return; {12483#(and (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 11:18:56,015 INFO L272 TraceCheckUtils]: 98: Hoare triple {12483#(and (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~y~0 (+ main_~z~0 1)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {12199#true} is VALID [2022-04-28 11:18:56,016 INFO L290 TraceCheckUtils]: 99: Hoare triple {12199#true} ~cond := #in~cond; {12199#true} is VALID [2022-04-28 11:18:56,016 INFO L290 TraceCheckUtils]: 100: Hoare triple {12199#true} assume !(0 == ~cond); {12199#true} is VALID [2022-04-28 11:18:56,016 INFO L290 TraceCheckUtils]: 101: Hoare triple {12199#true} assume true; {12199#true} is VALID [2022-04-28 11:18:56,016 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {12199#true} {12483#(and (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~y~0 (+ main_~z~0 1)))} #74#return; {12483#(and (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 11:18:56,017 INFO L272 TraceCheckUtils]: 103: Hoare triple {12483#(and (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~y~0 (+ main_~z~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)); {12517#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:56,017 INFO L290 TraceCheckUtils]: 104: Hoare triple {12517#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12521#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:56,017 INFO L290 TraceCheckUtils]: 105: Hoare triple {12521#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12200#false} is VALID [2022-04-28 11:18:56,017 INFO L290 TraceCheckUtils]: 106: Hoare triple {12200#false} assume !false; {12200#false} is VALID [2022-04-28 11:18:56,018 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:18:56,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:00,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:00,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380619171] [2022-04-28 11:19:00,452 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:00,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541005927] [2022-04-28 11:19:00,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541005927] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:19:00,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:19:00,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 11:19:00,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:00,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [821939539] [2022-04-28 11:19:00,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [821939539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:00,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:00,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:19:00,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529039421] [2022-04-28 11:19:00,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:00,453 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:19:00,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:00,454 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:19:00,498 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:19:00,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:19:00,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:00,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:19:00,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:19:00,498 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:19:01,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:01,155 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-04-28 11:19:01,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:19:01,155 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:19:01,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:01,156 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:19:01,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:19:01,157 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:19:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:19:01,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2022-04-28 11:19:01,242 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:01,244 INFO L225 Difference]: With dead ends: 136 [2022-04-28 11:19:01,244 INFO L226 Difference]: Without dead ends: 123 [2022-04-28 11:19:01,244 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:19:01,244 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:19:01,245 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:19:01,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-28 11:19:01,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-04-28 11:19:01,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:01,321 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:19:01,321 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:19:01,321 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:19:01,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:01,323 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-04-28 11:19:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:19:01,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:01,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:01,324 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:19:01,324 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:19:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:01,326 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-04-28 11:19:01,326 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:19:01,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:01,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:01,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:01,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:01,326 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:19:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-04-28 11:19:01,328 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 107 [2022-04-28 11:19:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:01,328 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-04-28 11:19:01,328 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:19:01,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 133 transitions. [2022-04-28 11:19:01,474 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:19:01,474 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:19:01,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 11:19:01,475 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:01,475 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:19:01,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 11:19:01,675 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:19:01,675 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:01,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:01,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1388085622, now seen corresponding path program 15 times [2022-04-28 11:19:01,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:01,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1063083992] [2022-04-28 11:19:01,865 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:01,865 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:01,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1388085622, now seen corresponding path program 16 times [2022-04-28 11:19:01,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:01,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828762639] [2022-04-28 11:19:01,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:01,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:01,872 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:01,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [538027492] [2022-04-28 11:19:01,873 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:19:01,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:01,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:01,874 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:19:01,875 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:19:01,923 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:19:01,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:01,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 11:19:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:01,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:02,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {13427#true} call ULTIMATE.init(); {13427#true} is VALID [2022-04-28 11:19:02,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {13427#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); {13427#true} is VALID [2022-04-28 11:19:02,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13427#true} {13427#true} #84#return; {13427#true} is VALID [2022-04-28 11:19:02,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {13427#true} call #t~ret5 := main(); {13427#true} is VALID [2022-04-28 11:19:02,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {13427#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; {13427#true} is VALID [2022-04-28 11:19:02,501 INFO L272 TraceCheckUtils]: 6: Hoare triple {13427#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:02,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:02,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:02,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,501 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13427#true} {13427#true} #60#return; {13427#true} is VALID [2022-04-28 11:19:02,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {13427#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:19:02,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} assume !false; {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:19:02,502 INFO L272 TraceCheckUtils]: 13: Hoare triple {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:02,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:02,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:02,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,503 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13427#true} {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} #62#return; {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:19:02,503 INFO L272 TraceCheckUtils]: 18: Hoare triple {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:02,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:02,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:02,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,503 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13427#true} {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} #64#return; {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:19:02,503 INFO L272 TraceCheckUtils]: 23: Hoare triple {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:02,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:02,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:02,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,504 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13427#true} {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} #66#return; {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:19:02,504 INFO L272 TraceCheckUtils]: 28: Hoare triple {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:02,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:02,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:02,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,505 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13427#true} {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} #68#return; {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:19:02,505 INFO L272 TraceCheckUtils]: 33: Hoare triple {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:02,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:02,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:02,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,505 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13427#true} {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} #70#return; {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} is VALID [2022-04-28 11:19:02,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {13465#(and (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~x~0) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13547#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:19:02,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {13547#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} assume !false; {13547#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:19:02,506 INFO L272 TraceCheckUtils]: 40: Hoare triple {13547#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:02,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:02,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:02,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,507 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13427#true} {13547#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #62#return; {13547#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:19:02,507 INFO L272 TraceCheckUtils]: 45: Hoare triple {13547#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~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)); {13427#true} is VALID [2022-04-28 11:19:02,507 INFO L290 TraceCheckUtils]: 46: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:02,507 INFO L290 TraceCheckUtils]: 47: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:02,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,508 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13427#true} {13547#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #64#return; {13547#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:19:02,508 INFO L272 TraceCheckUtils]: 50: Hoare triple {13547#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~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)); {13427#true} is VALID [2022-04-28 11:19:02,508 INFO L290 TraceCheckUtils]: 51: Hoare triple {13427#true} ~cond := #in~cond; {13587#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:02,508 INFO L290 TraceCheckUtils]: 52: Hoare triple {13587#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13591#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:02,509 INFO L290 TraceCheckUtils]: 53: Hoare triple {13591#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13591#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:02,509 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13591#(not (= |__VERIFIER_assert_#in~cond| 0))} {13547#(and (= (+ 5 main_~y~0) main_~z~0) (<= 1 main_~x~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #66#return; {13598#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:19:02,509 INFO L272 TraceCheckUtils]: 55: Hoare triple {13598#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:02,509 INFO L290 TraceCheckUtils]: 56: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:02,510 INFO L290 TraceCheckUtils]: 57: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:02,510 INFO L290 TraceCheckUtils]: 58: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,510 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13427#true} {13598#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #68#return; {13598#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:19:02,510 INFO L272 TraceCheckUtils]: 60: Hoare triple {13598#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:02,510 INFO L290 TraceCheckUtils]: 61: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:02,510 INFO L290 TraceCheckUtils]: 62: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:02,510 INFO L290 TraceCheckUtils]: 63: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,511 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13427#true} {13598#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #70#return; {13598#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:19:02,511 INFO L290 TraceCheckUtils]: 65: Hoare triple {13598#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} is VALID [2022-04-28 11:19:02,512 INFO L290 TraceCheckUtils]: 66: Hoare triple {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} assume !false; {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} is VALID [2022-04-28 11:19:02,512 INFO L272 TraceCheckUtils]: 67: Hoare triple {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:02,512 INFO L290 TraceCheckUtils]: 68: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:02,512 INFO L290 TraceCheckUtils]: 69: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:02,512 INFO L290 TraceCheckUtils]: 70: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,512 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13427#true} {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} #62#return; {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} is VALID [2022-04-28 11:19:02,512 INFO L272 TraceCheckUtils]: 72: Hoare triple {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) 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)); {13427#true} is VALID [2022-04-28 11:19:02,513 INFO L290 TraceCheckUtils]: 73: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:02,513 INFO L290 TraceCheckUtils]: 74: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:02,513 INFO L290 TraceCheckUtils]: 75: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,513 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13427#true} {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} #64#return; {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} is VALID [2022-04-28 11:19:02,513 INFO L272 TraceCheckUtils]: 77: Hoare triple {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:02,513 INFO L290 TraceCheckUtils]: 78: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:02,513 INFO L290 TraceCheckUtils]: 79: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:02,513 INFO L290 TraceCheckUtils]: 80: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,514 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13427#true} {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} #66#return; {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} is VALID [2022-04-28 11:19:02,514 INFO L272 TraceCheckUtils]: 82: Hoare triple {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:02,514 INFO L290 TraceCheckUtils]: 83: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:02,514 INFO L290 TraceCheckUtils]: 84: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:02,514 INFO L290 TraceCheckUtils]: 85: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,515 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13427#true} {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} #68#return; {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} is VALID [2022-04-28 11:19:02,515 INFO L272 TraceCheckUtils]: 87: Hoare triple {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:02,515 INFO L290 TraceCheckUtils]: 88: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:02,515 INFO L290 TraceCheckUtils]: 89: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:02,515 INFO L290 TraceCheckUtils]: 90: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,515 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {13427#true} {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} #70#return; {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} is VALID [2022-04-28 11:19:02,516 INFO L290 TraceCheckUtils]: 92: Hoare triple {13632#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 7 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ (- 1) main_~n~0) 1) (= (+ main_~y~0 (* (- 1) main_~z~0) 6 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13714#(and (= main_~n~0 3) (= main_~y~0 37) (= (+ main_~x~0 (- 19)) 8))} is VALID [2022-04-28 11:19:02,516 INFO L290 TraceCheckUtils]: 93: Hoare triple {13714#(and (= main_~n~0 3) (= main_~y~0 37) (= (+ main_~x~0 (- 19)) 8))} assume !false; {13714#(and (= main_~n~0 3) (= main_~y~0 37) (= (+ main_~x~0 (- 19)) 8))} is VALID [2022-04-28 11:19:02,516 INFO L272 TraceCheckUtils]: 94: Hoare triple {13714#(and (= main_~n~0 3) (= main_~y~0 37) (= (+ main_~x~0 (- 19)) 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:02,516 INFO L290 TraceCheckUtils]: 95: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:02,517 INFO L290 TraceCheckUtils]: 96: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:02,517 INFO L290 TraceCheckUtils]: 97: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:02,517 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {13427#true} {13714#(and (= main_~n~0 3) (= main_~y~0 37) (= (+ main_~x~0 (- 19)) 8))} #62#return; {13714#(and (= main_~n~0 3) (= main_~y~0 37) (= (+ main_~x~0 (- 19)) 8))} is VALID [2022-04-28 11:19:02,517 INFO L272 TraceCheckUtils]: 99: Hoare triple {13714#(and (= main_~n~0 3) (= main_~y~0 37) (= (+ main_~x~0 (- 19)) 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:02,517 INFO L290 TraceCheckUtils]: 100: Hoare triple {13427#true} ~cond := #in~cond; {13587#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:02,518 INFO L290 TraceCheckUtils]: 101: Hoare triple {13587#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13591#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:02,518 INFO L290 TraceCheckUtils]: 102: Hoare triple {13591#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13591#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:02,518 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {13591#(not (= |__VERIFIER_assert_#in~cond| 0))} {13714#(and (= main_~n~0 3) (= main_~y~0 37) (= (+ main_~x~0 (- 19)) 8))} #64#return; {13748#(and (= main_~n~0 3) (= main_~x~0 27))} is VALID [2022-04-28 11:19:02,519 INFO L272 TraceCheckUtils]: 104: Hoare triple {13748#(and (= main_~n~0 3) (= main_~x~0 27))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13752#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:02,519 INFO L290 TraceCheckUtils]: 105: Hoare triple {13752#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13756#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:02,519 INFO L290 TraceCheckUtils]: 106: Hoare triple {13756#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13428#false} is VALID [2022-04-28 11:19:02,520 INFO L290 TraceCheckUtils]: 107: Hoare triple {13428#false} assume !false; {13428#false} is VALID [2022-04-28 11:19:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 98 proven. 59 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-04-28 11:19:02,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:03,347 INFO L290 TraceCheckUtils]: 107: Hoare triple {13428#false} assume !false; {13428#false} is VALID [2022-04-28 11:19:03,347 INFO L290 TraceCheckUtils]: 106: Hoare triple {13756#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13428#false} is VALID [2022-04-28 11:19:03,347 INFO L290 TraceCheckUtils]: 105: Hoare triple {13752#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13756#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:03,348 INFO L272 TraceCheckUtils]: 104: Hoare triple {13772#(= (* 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)); {13752#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:03,349 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {13591#(not (= |__VERIFIER_assert_#in~cond| 0))} {13776#(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; {13772#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:03,349 INFO L290 TraceCheckUtils]: 102: Hoare triple {13591#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13591#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:03,349 INFO L290 TraceCheckUtils]: 101: Hoare triple {13786#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13591#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:03,349 INFO L290 TraceCheckUtils]: 100: Hoare triple {13427#true} ~cond := #in~cond; {13786#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:19:03,350 INFO L272 TraceCheckUtils]: 99: Hoare triple {13776#(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)); {13427#true} is VALID [2022-04-28 11:19:03,350 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {13427#true} {13776#(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))} #62#return; {13776#(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:19:03,350 INFO L290 TraceCheckUtils]: 97: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:03,350 INFO L290 TraceCheckUtils]: 96: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:03,350 INFO L290 TraceCheckUtils]: 95: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:03,350 INFO L272 TraceCheckUtils]: 94: Hoare triple {13776#(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 ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:03,351 INFO L290 TraceCheckUtils]: 93: Hoare triple {13776#(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))} assume !false; {13776#(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:19:03,356 INFO L290 TraceCheckUtils]: 92: Hoare triple {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ 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; {13776#(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:19:03,357 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {13427#true} {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} #70#return; {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ 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:03,357 INFO L290 TraceCheckUtils]: 90: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:03,357 INFO L290 TraceCheckUtils]: 89: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:03,357 INFO L290 TraceCheckUtils]: 88: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:03,357 INFO L272 TraceCheckUtils]: 87: Hoare triple {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ 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)); {13427#true} is VALID [2022-04-28 11:19:03,357 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13427#true} {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} #68#return; {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ 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:03,358 INFO L290 TraceCheckUtils]: 85: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:03,358 INFO L290 TraceCheckUtils]: 84: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:03,358 INFO L290 TraceCheckUtils]: 83: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:03,358 INFO L272 TraceCheckUtils]: 82: Hoare triple {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ 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)); {13427#true} is VALID [2022-04-28 11:19:03,358 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13427#true} {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} #66#return; {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ 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:03,358 INFO L290 TraceCheckUtils]: 80: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:03,358 INFO L290 TraceCheckUtils]: 79: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:03,358 INFO L290 TraceCheckUtils]: 78: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:03,358 INFO L272 TraceCheckUtils]: 77: Hoare triple {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ 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)); {13427#true} is VALID [2022-04-28 11:19:03,359 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13427#true} {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} #64#return; {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ 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:03,359 INFO L290 TraceCheckUtils]: 75: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:03,359 INFO L290 TraceCheckUtils]: 74: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:03,359 INFO L290 TraceCheckUtils]: 73: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:03,359 INFO L272 TraceCheckUtils]: 72: Hoare triple {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ 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)); {13427#true} is VALID [2022-04-28 11:19:03,360 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13427#true} {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} #62#return; {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ 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:03,360 INFO L290 TraceCheckUtils]: 70: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:03,360 INFO L290 TraceCheckUtils]: 69: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:03,360 INFO L290 TraceCheckUtils]: 68: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:03,360 INFO L272 TraceCheckUtils]: 67: Hoare triple {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ 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)); {13427#true} is VALID [2022-04-28 11:19:03,360 INFO L290 TraceCheckUtils]: 66: Hoare triple {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0)))} assume !false; {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ 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:03,365 INFO L290 TraceCheckUtils]: 65: Hoare triple {13893#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (= (+ 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; {13811#(or (not (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))) (= (* (+ 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:03,366 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13427#true} {13893#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))))} #70#return; {13893#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (= (+ 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:03,366 INFO L290 TraceCheckUtils]: 63: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:03,366 INFO L290 TraceCheckUtils]: 62: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:03,366 INFO L290 TraceCheckUtils]: 61: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:03,366 INFO L272 TraceCheckUtils]: 60: Hoare triple {13893#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (= (+ 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)); {13427#true} is VALID [2022-04-28 11:19:03,366 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13427#true} {13893#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))))} #68#return; {13893#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (= (+ 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:03,367 INFO L290 TraceCheckUtils]: 58: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:03,367 INFO L290 TraceCheckUtils]: 57: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:03,367 INFO L290 TraceCheckUtils]: 56: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:03,367 INFO L272 TraceCheckUtils]: 55: Hoare triple {13893#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (= (+ 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)); {13427#true} is VALID [2022-04-28 11:19:03,367 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13591#(not (= |__VERIFIER_assert_#in~cond| 0))} {13927#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))))} #66#return; {13893#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (= (+ 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:03,368 INFO L290 TraceCheckUtils]: 53: Hoare triple {13591#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13591#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:03,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {13786#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13591#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:03,368 INFO L290 TraceCheckUtils]: 51: Hoare triple {13427#true} ~cond := #in~cond; {13786#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:19:03,368 INFO L272 TraceCheckUtils]: 50: Hoare triple {13927#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ 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)); {13427#true} is VALID [2022-04-28 11:19:03,369 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13427#true} {13927#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))))} #64#return; {13927#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ 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:03,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:03,369 INFO L290 TraceCheckUtils]: 47: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:03,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:03,369 INFO L272 TraceCheckUtils]: 45: Hoare triple {13927#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ 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)); {13427#true} is VALID [2022-04-28 11:19:03,370 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13427#true} {13927#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))))} #62#return; {13927#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ 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:03,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:03,370 INFO L290 TraceCheckUtils]: 42: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:03,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:03,370 INFO L272 TraceCheckUtils]: 40: Hoare triple {13927#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ 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)); {13427#true} is VALID [2022-04-28 11:19:03,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {13927#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))))} assume !false; {13927#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ 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:04,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13927#(or (not (= (+ (* main_~n~0 9) 16 (* (- 1) main_~z~0) (* 3 (+ main_~n~0 1) (+ main_~n~0 1)) (* (- 1) main_~y~0)) (+ main_~z~0 6))) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ 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:04,507 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13427#true} {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} #70#return; {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} is VALID [2022-04-28 11:19:04,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:04,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:04,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:04,507 INFO L272 TraceCheckUtils]: 33: Hoare triple {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:04,508 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13427#true} {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} #68#return; {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} is VALID [2022-04-28 11:19:04,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:04,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:04,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:04,508 INFO L272 TraceCheckUtils]: 28: Hoare triple {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:04,508 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13427#true} {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} #66#return; {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} is VALID [2022-04-28 11:19:04,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:04,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:04,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:04,509 INFO L272 TraceCheckUtils]: 23: Hoare triple {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:04,509 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13427#true} {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} #64#return; {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} is VALID [2022-04-28 11:19:04,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:04,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:04,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:04,509 INFO L272 TraceCheckUtils]: 18: Hoare triple {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:04,510 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13427#true} {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} #62#return; {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} is VALID [2022-04-28 11:19:04,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:04,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:04,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:04,510 INFO L272 TraceCheckUtils]: 13: Hoare triple {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:04,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} assume !false; {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} is VALID [2022-04-28 11:19:04,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {13427#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13976#(or (= (+ (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 6 (* main_~y~0 2) (* main_~z~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3))) (not (<= (+ main_~y~0 main_~x~0) (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1))) (not (= (+ (* 3 (+ main_~n~0 2) (+ main_~n~0 2)) 19 (* (- 2) main_~z~0) (* main_~n~0 9) (* (- 1) main_~y~0)) (+ main_~z~0 12))))} is VALID [2022-04-28 11:19:04,513 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13427#true} {13427#true} #60#return; {13427#true} is VALID [2022-04-28 11:19:04,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:04,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {13427#true} assume !(0 == ~cond); {13427#true} is VALID [2022-04-28 11:19:04,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {13427#true} ~cond := #in~cond; {13427#true} is VALID [2022-04-28 11:19:04,513 INFO L272 TraceCheckUtils]: 6: Hoare triple {13427#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {13427#true} is VALID [2022-04-28 11:19:04,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {13427#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; {13427#true} is VALID [2022-04-28 11:19:04,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {13427#true} call #t~ret5 := main(); {13427#true} is VALID [2022-04-28 11:19:04,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13427#true} {13427#true} #84#return; {13427#true} is VALID [2022-04-28 11:19:04,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-28 11:19:04,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {13427#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); {13427#true} is VALID [2022-04-28 11:19:04,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {13427#true} call ULTIMATE.init(); {13427#true} is VALID [2022-04-28 11:19:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 98 proven. 59 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-04-28 11:19:04,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:04,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828762639] [2022-04-28 11:19:04,514 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:04,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538027492] [2022-04-28 11:19:04,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538027492] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:19:04,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:19:04,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-28 11:19:04,515 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:04,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1063083992] [2022-04-28 11:19:04,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1063083992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:04,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:04,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 11:19:04,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064349440] [2022-04-28 11:19:04,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:04,516 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) Word has length 108 [2022-04-28 11:19:04,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:04,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-28 11:19:04,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:04,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 11:19:04,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:04,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 11:19:04,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-28 11:19:04,572 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-28 11:19:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:06,695 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2022-04-28 11:19:06,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:19:06,695 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) Word has length 108 [2022-04-28 11:19:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-28 11:19:06,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2022-04-28 11:19:06,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-28 11:19:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2022-04-28 11:19:06,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 106 transitions. [2022-04-28 11:19:06,813 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:19:06,815 INFO L225 Difference]: With dead ends: 139 [2022-04-28 11:19:06,815 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 11:19:06,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-04-28 11:19:06,815 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:06,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 174 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 11:19:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 11:19:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2022-04-28 11:19:06,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:06,906 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:19:06,906 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:19:06,906 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:19:06,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:06,923 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-04-28 11:19:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2022-04-28 11:19:06,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:06,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:06,926 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:19:06,926 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:19:06,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:06,928 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-04-28 11:19:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2022-04-28 11:19:06,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:06,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:06,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:06,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:06,929 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:19:06,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2022-04-28 11:19:06,931 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 108 [2022-04-28 11:19:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:06,931 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2022-04-28 11:19:06,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-28 11:19:06,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 138 transitions. [2022-04-28 11:19:07,094 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:19:07,094 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2022-04-28 11:19:07,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 11:19:07,095 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:07,095 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:19:07,113 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:19:07,295 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:19:07,296 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:07,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:07,296 INFO L85 PathProgramCache]: Analyzing trace with hash 34642523, now seen corresponding path program 17 times [2022-04-28 11:19:07,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:07,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [461523295] [2022-04-28 11:19:07,526 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:07,527 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:07,527 INFO L85 PathProgramCache]: Analyzing trace with hash 34642523, now seen corresponding path program 18 times [2022-04-28 11:19:07,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:07,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068758654] [2022-04-28 11:19:07,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:07,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:07,535 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:07,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [636305679] [2022-04-28 11:19:07,535 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:19:07,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:07,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:07,536 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:19:07,537 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:19:08,194 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:19:08,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:08,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 11:19:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:08,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:13,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {14905#true} call ULTIMATE.init(); {14905#true} is VALID [2022-04-28 11:19:13,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {14905#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); {14905#true} is VALID [2022-04-28 11:19:13,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14905#true} {14905#true} #84#return; {14905#true} is VALID [2022-04-28 11:19:13,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {14905#true} call #t~ret5 := main(); {14905#true} is VALID [2022-04-28 11:19:13,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {14905#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; {14905#true} is VALID [2022-04-28 11:19:13,066 INFO L272 TraceCheckUtils]: 6: Hoare triple {14905#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:13,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:13,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:13,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,066 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14905#true} {14905#true} #60#return; {14905#true} is VALID [2022-04-28 11:19:13,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {14905#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {14905#true} is VALID [2022-04-28 11:19:13,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {14905#true} assume !false; {14905#true} is VALID [2022-04-28 11:19:13,066 INFO L272 TraceCheckUtils]: 13: Hoare triple {14905#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:13,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:13,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:13,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,067 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14905#true} {14905#true} #62#return; {14905#true} is VALID [2022-04-28 11:19:13,067 INFO L272 TraceCheckUtils]: 18: Hoare triple {14905#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:13,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:13,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:13,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,067 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14905#true} {14905#true} #64#return; {14905#true} is VALID [2022-04-28 11:19:13,067 INFO L272 TraceCheckUtils]: 23: Hoare triple {14905#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:13,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:13,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:13,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,067 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14905#true} {14905#true} #66#return; {14905#true} is VALID [2022-04-28 11:19:13,067 INFO L272 TraceCheckUtils]: 28: Hoare triple {14905#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:13,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:13,067 INFO L290 TraceCheckUtils]: 30: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:13,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,068 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14905#true} {14905#true} #68#return; {14905#true} is VALID [2022-04-28 11:19:13,068 INFO L272 TraceCheckUtils]: 33: Hoare triple {14905#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:13,068 INFO L290 TraceCheckUtils]: 34: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:13,068 INFO L290 TraceCheckUtils]: 35: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:13,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,068 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14905#true} {14905#true} #70#return; {14905#true} is VALID [2022-04-28 11:19:13,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {14905#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; {14905#true} is VALID [2022-04-28 11:19:13,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {14905#true} assume !false; {14905#true} is VALID [2022-04-28 11:19:13,068 INFO L272 TraceCheckUtils]: 40: Hoare triple {14905#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:13,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:13,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:13,068 INFO L290 TraceCheckUtils]: 43: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,068 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14905#true} {14905#true} #62#return; {14905#true} is VALID [2022-04-28 11:19:13,068 INFO L272 TraceCheckUtils]: 45: Hoare triple {14905#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:13,069 INFO L290 TraceCheckUtils]: 46: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:13,069 INFO L290 TraceCheckUtils]: 47: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:13,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,069 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14905#true} {14905#true} #64#return; {14905#true} is VALID [2022-04-28 11:19:13,069 INFO L272 TraceCheckUtils]: 50: Hoare triple {14905#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:13,069 INFO L290 TraceCheckUtils]: 51: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:13,069 INFO L290 TraceCheckUtils]: 52: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:13,069 INFO L290 TraceCheckUtils]: 53: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,069 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14905#true} {14905#true} #66#return; {14905#true} is VALID [2022-04-28 11:19:13,069 INFO L272 TraceCheckUtils]: 55: Hoare triple {14905#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:13,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:13,069 INFO L290 TraceCheckUtils]: 57: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:13,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,069 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14905#true} {14905#true} #68#return; {14905#true} is VALID [2022-04-28 11:19:13,069 INFO L272 TraceCheckUtils]: 60: Hoare triple {14905#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:13,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:13,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:13,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,070 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14905#true} {14905#true} #70#return; {14905#true} is VALID [2022-04-28 11:19:13,070 INFO L290 TraceCheckUtils]: 65: Hoare triple {14905#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; {14905#true} is VALID [2022-04-28 11:19:13,070 INFO L290 TraceCheckUtils]: 66: Hoare triple {14905#true} assume !false; {14905#true} is VALID [2022-04-28 11:19:13,070 INFO L272 TraceCheckUtils]: 67: Hoare triple {14905#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:13,070 INFO L290 TraceCheckUtils]: 68: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:13,070 INFO L290 TraceCheckUtils]: 69: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:13,070 INFO L290 TraceCheckUtils]: 70: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,070 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {14905#true} {14905#true} #62#return; {14905#true} is VALID [2022-04-28 11:19:13,070 INFO L272 TraceCheckUtils]: 72: Hoare triple {14905#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:13,070 INFO L290 TraceCheckUtils]: 73: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:13,070 INFO L290 TraceCheckUtils]: 74: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:13,070 INFO L290 TraceCheckUtils]: 75: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,071 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14905#true} {14905#true} #64#return; {14905#true} is VALID [2022-04-28 11:19:13,071 INFO L272 TraceCheckUtils]: 77: Hoare triple {14905#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:13,071 INFO L290 TraceCheckUtils]: 78: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:13,071 INFO L290 TraceCheckUtils]: 79: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:13,071 INFO L290 TraceCheckUtils]: 80: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,071 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14905#true} {14905#true} #66#return; {14905#true} is VALID [2022-04-28 11:19:13,071 INFO L272 TraceCheckUtils]: 82: Hoare triple {14905#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:13,071 INFO L290 TraceCheckUtils]: 83: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:13,071 INFO L290 TraceCheckUtils]: 84: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:13,071 INFO L290 TraceCheckUtils]: 85: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,071 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {14905#true} {14905#true} #68#return; {14905#true} is VALID [2022-04-28 11:19:13,071 INFO L272 TraceCheckUtils]: 87: Hoare triple {14905#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:13,072 INFO L290 TraceCheckUtils]: 88: Hoare triple {14905#true} ~cond := #in~cond; {15174#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:13,072 INFO L290 TraceCheckUtils]: 89: Hoare triple {15174#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:13,072 INFO L290 TraceCheckUtils]: 90: Hoare triple {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:13,073 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} {14905#true} #70#return; {15185#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} is VALID [2022-04-28 11:19:13,075 INFO L290 TraceCheckUtils]: 92: Hoare triple {15185#(= (+ (* 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; {15185#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} is VALID [2022-04-28 11:19:13,075 INFO L290 TraceCheckUtils]: 93: Hoare triple {15185#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} assume !false; {15185#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} is VALID [2022-04-28 11:19:13,075 INFO L272 TraceCheckUtils]: 94: Hoare triple {15185#(= (+ (* 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)); {14905#true} is VALID [2022-04-28 11:19:13,075 INFO L290 TraceCheckUtils]: 95: Hoare triple {14905#true} ~cond := #in~cond; {15174#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:13,076 INFO L290 TraceCheckUtils]: 96: Hoare triple {15174#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:13,076 INFO L290 TraceCheckUtils]: 97: Hoare triple {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:13,076 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} {15185#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} #62#return; {15207#(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:19:13,076 INFO L272 TraceCheckUtils]: 99: Hoare triple {15207#(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)); {14905#true} is VALID [2022-04-28 11:19:13,076 INFO L290 TraceCheckUtils]: 100: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:13,077 INFO L290 TraceCheckUtils]: 101: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:13,077 INFO L290 TraceCheckUtils]: 102: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:13,077 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {14905#true} {15207#(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; {15207#(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:19:13,077 INFO L272 TraceCheckUtils]: 104: Hoare triple {15207#(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)); {14905#true} is VALID [2022-04-28 11:19:13,077 INFO L290 TraceCheckUtils]: 105: Hoare triple {14905#true} ~cond := #in~cond; {15174#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:13,078 INFO L290 TraceCheckUtils]: 106: Hoare triple {15174#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:13,078 INFO L290 TraceCheckUtils]: 107: Hoare triple {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:15,080 WARN L284 TraceCheckUtils]: 108: Hoare quadruple {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} {15207#(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; {15238#(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:19:17,082 WARN L272 TraceCheckUtils]: 109: Hoare triple {15238#(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)); {15242#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-28 11:19:17,083 INFO L290 TraceCheckUtils]: 110: Hoare triple {15242#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15246#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:17,083 INFO L290 TraceCheckUtils]: 111: Hoare triple {15246#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14906#false} is VALID [2022-04-28 11:19:17,083 INFO L290 TraceCheckUtils]: 112: Hoare triple {14906#false} assume !false; {14906#false} is VALID [2022-04-28 11:19:17,084 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:19:17,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:55,936 INFO L290 TraceCheckUtils]: 112: Hoare triple {14906#false} assume !false; {14906#false} is VALID [2022-04-28 11:19:55,936 INFO L290 TraceCheckUtils]: 111: Hoare triple {15246#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14906#false} is VALID [2022-04-28 11:19:55,936 INFO L290 TraceCheckUtils]: 110: Hoare triple {15242#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15246#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:55,937 INFO L272 TraceCheckUtils]: 109: Hoare triple {15262#(= (+ (* 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)); {15242#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:55,938 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} {15266#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {15262#(= (+ (* 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:19:55,938 INFO L290 TraceCheckUtils]: 107: Hoare triple {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:55,938 INFO L290 TraceCheckUtils]: 106: Hoare triple {15276#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:55,939 INFO L290 TraceCheckUtils]: 105: Hoare triple {14905#true} ~cond := #in~cond; {15276#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:19:55,939 INFO L272 TraceCheckUtils]: 104: Hoare triple {15266#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:55,939 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {14905#true} {15266#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {15266#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:19:55,939 INFO L290 TraceCheckUtils]: 102: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:55,939 INFO L290 TraceCheckUtils]: 101: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:55,939 INFO L290 TraceCheckUtils]: 100: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:55,940 INFO L272 TraceCheckUtils]: 99: Hoare triple {15266#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:55,940 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} {15298#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #62#return; {15266#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:19:55,940 INFO L290 TraceCheckUtils]: 97: Hoare triple {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:55,941 INFO L290 TraceCheckUtils]: 96: Hoare triple {15276#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:55,941 INFO L290 TraceCheckUtils]: 95: Hoare triple {14905#true} ~cond := #in~cond; {15276#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:19:55,941 INFO L272 TraceCheckUtils]: 94: Hoare triple {15298#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:55,941 INFO L290 TraceCheckUtils]: 93: Hoare triple {15298#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !false; {15298#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:19:57,944 WARN L290 TraceCheckUtils]: 92: Hoare triple {15317#(or (= (+ (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 18) (* main_~y~0 12) 6 (* main_~z~0 12)) (+ (* (+ main_~z~0 6) (+ main_~z~0 main_~y~0)) (* main_~z~0 2) 12)) (not (= (mod main_~z~0 6) 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; {15298#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is UNKNOWN [2022-04-28 11:19:59,946 WARN L284 TraceCheckUtils]: 91: Hoare quadruple {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} {14905#true} #70#return; {15317#(or (= (+ (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 18) (* main_~y~0 12) 6 (* main_~z~0 12)) (+ (* (+ main_~z~0 6) (+ main_~z~0 main_~y~0)) (* main_~z~0 2) 12)) (not (= (mod main_~z~0 6) 0)))} is UNKNOWN [2022-04-28 11:19:59,947 INFO L290 TraceCheckUtils]: 90: Hoare triple {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:59,947 INFO L290 TraceCheckUtils]: 89: Hoare triple {15276#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:59,947 INFO L290 TraceCheckUtils]: 88: Hoare triple {14905#true} ~cond := #in~cond; {15276#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:19:59,947 INFO L272 TraceCheckUtils]: 87: Hoare triple {14905#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:59,948 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {14905#true} {14905#true} #68#return; {14905#true} is VALID [2022-04-28 11:19:59,948 INFO L290 TraceCheckUtils]: 85: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:59,948 INFO L290 TraceCheckUtils]: 84: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:59,948 INFO L290 TraceCheckUtils]: 83: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:59,948 INFO L272 TraceCheckUtils]: 82: Hoare triple {14905#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:59,948 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14905#true} {14905#true} #66#return; {14905#true} is VALID [2022-04-28 11:19:59,948 INFO L290 TraceCheckUtils]: 80: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:59,948 INFO L290 TraceCheckUtils]: 79: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:59,948 INFO L290 TraceCheckUtils]: 78: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:59,948 INFO L272 TraceCheckUtils]: 77: Hoare triple {14905#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:59,948 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14905#true} {14905#true} #64#return; {14905#true} is VALID [2022-04-28 11:19:59,948 INFO L290 TraceCheckUtils]: 75: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:59,948 INFO L290 TraceCheckUtils]: 74: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:59,948 INFO L290 TraceCheckUtils]: 73: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:59,948 INFO L272 TraceCheckUtils]: 72: Hoare triple {14905#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:59,949 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {14905#true} {14905#true} #62#return; {14905#true} is VALID [2022-04-28 11:19:59,949 INFO L290 TraceCheckUtils]: 70: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:59,949 INFO L290 TraceCheckUtils]: 69: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:59,949 INFO L290 TraceCheckUtils]: 68: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:59,949 INFO L272 TraceCheckUtils]: 67: Hoare triple {14905#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:59,949 INFO L290 TraceCheckUtils]: 66: Hoare triple {14905#true} assume !false; {14905#true} is VALID [2022-04-28 11:19:59,949 INFO L290 TraceCheckUtils]: 65: Hoare triple {14905#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; {14905#true} is VALID [2022-04-28 11:19:59,949 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14905#true} {14905#true} #70#return; {14905#true} is VALID [2022-04-28 11:19:59,949 INFO L290 TraceCheckUtils]: 63: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:59,949 INFO L290 TraceCheckUtils]: 62: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:59,949 INFO L290 TraceCheckUtils]: 61: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:59,949 INFO L272 TraceCheckUtils]: 60: Hoare triple {14905#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:59,949 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14905#true} {14905#true} #68#return; {14905#true} is VALID [2022-04-28 11:19:59,949 INFO L290 TraceCheckUtils]: 58: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:59,949 INFO L290 TraceCheckUtils]: 57: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:59,950 INFO L290 TraceCheckUtils]: 56: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:59,950 INFO L272 TraceCheckUtils]: 55: Hoare triple {14905#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:59,950 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14905#true} {14905#true} #66#return; {14905#true} is VALID [2022-04-28 11:19:59,950 INFO L290 TraceCheckUtils]: 53: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:59,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:59,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:59,950 INFO L272 TraceCheckUtils]: 50: Hoare triple {14905#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:59,950 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14905#true} {14905#true} #64#return; {14905#true} is VALID [2022-04-28 11:19:59,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:59,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:59,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:59,950 INFO L272 TraceCheckUtils]: 45: Hoare triple {14905#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:59,950 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14905#true} {14905#true} #62#return; {14905#true} is VALID [2022-04-28 11:19:59,950 INFO L290 TraceCheckUtils]: 43: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:59,950 INFO L290 TraceCheckUtils]: 42: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:59,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:59,951 INFO L272 TraceCheckUtils]: 40: Hoare triple {14905#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:59,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {14905#true} assume !false; {14905#true} is VALID [2022-04-28 11:19:59,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {14905#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; {14905#true} is VALID [2022-04-28 11:19:59,951 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14905#true} {14905#true} #70#return; {14905#true} is VALID [2022-04-28 11:19:59,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:59,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:59,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:59,951 INFO L272 TraceCheckUtils]: 33: Hoare triple {14905#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:59,951 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14905#true} {14905#true} #68#return; {14905#true} is VALID [2022-04-28 11:19:59,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:59,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:59,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:59,951 INFO L272 TraceCheckUtils]: 28: Hoare triple {14905#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:59,951 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14905#true} {14905#true} #66#return; {14905#true} is VALID [2022-04-28 11:19:59,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:59,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:59,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:59,952 INFO L272 TraceCheckUtils]: 23: Hoare triple {14905#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:59,952 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14905#true} {14905#true} #64#return; {14905#true} is VALID [2022-04-28 11:19:59,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:59,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:59,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:59,952 INFO L272 TraceCheckUtils]: 18: Hoare triple {14905#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:59,952 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14905#true} {14905#true} #62#return; {14905#true} is VALID [2022-04-28 11:19:59,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:59,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:59,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:59,952 INFO L272 TraceCheckUtils]: 13: Hoare triple {14905#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:59,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {14905#true} assume !false; {14905#true} is VALID [2022-04-28 11:19:59,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {14905#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {14905#true} is VALID [2022-04-28 11:19:59,953 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14905#true} {14905#true} #60#return; {14905#true} is VALID [2022-04-28 11:19:59,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:59,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {14905#true} assume !(0 == ~cond); {14905#true} is VALID [2022-04-28 11:19:59,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {14905#true} ~cond := #in~cond; {14905#true} is VALID [2022-04-28 11:19:59,953 INFO L272 TraceCheckUtils]: 6: Hoare triple {14905#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {14905#true} is VALID [2022-04-28 11:19:59,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {14905#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; {14905#true} is VALID [2022-04-28 11:19:59,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {14905#true} call #t~ret5 := main(); {14905#true} is VALID [2022-04-28 11:19:59,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14905#true} {14905#true} #84#return; {14905#true} is VALID [2022-04-28 11:19:59,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {14905#true} assume true; {14905#true} is VALID [2022-04-28 11:19:59,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {14905#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); {14905#true} is VALID [2022-04-28 11:19:59,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {14905#true} call ULTIMATE.init(); {14905#true} is VALID [2022-04-28 11:19:59,954 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:19:59,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:59,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068758654] [2022-04-28 11:19:59,954 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:59,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636305679] [2022-04-28 11:19:59,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636305679] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:19:59,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:19:59,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2022-04-28 11:19:59,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:59,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [461523295] [2022-04-28 11:19:59,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [461523295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:59,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:59,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:19:59,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786550560] [2022-04-28 11:19:59,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:59,955 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:19:59,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:59,955 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:20:02,049 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:20:02,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:20:02,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:20:02,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:20:02,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=141, Unknown=2, NotChecked=0, Total=182 [2022-04-28 11:20:02,050 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:20:07,647 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:20:09,648 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:20:11,651 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:20:13,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:20:15,654 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:20:19,688 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:20:21,690 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:20:25,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:28,061 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:31,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:33,399 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:20:37,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:20:39,656 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:20:43,500 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:45,561 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:48,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:52,933 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:20:54,867 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:56,868 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:20:58,872 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:21:00,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:00,953 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2022-04-28 11:21:00,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:21:00,953 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:21:00,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:21:00,954 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:21:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-28 11:21:00,955 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:21:00,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-28 11:21:00,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-28 11:21:05,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 51 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:05,013 INFO L225 Difference]: With dead ends: 134 [2022-04-28 11:21:05,013 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 11:21:05,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=61, Invalid=209, Unknown=2, NotChecked=0, Total=272 [2022-04-28 11:21:05,013 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 39 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.9s IncrementalHoareTripleChecker+Time [2022-04-28 11:21:05,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 94 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 115 Invalid, 14 Unknown, 0 Unchecked, 37.9s Time] [2022-04-28 11:21:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 11:21:05,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-28 11:21:05,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:21:05,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 32 states have call successors, (32), 23 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:21:05,100 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 32 states have call successors, (32), 23 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:21:05,100 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 32 states have call successors, (32), 23 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:21:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:05,102 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2022-04-28 11:21:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2022-04-28 11:21:05,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:05,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:05,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 32 states have call successors, (32), 23 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 132 states. [2022-04-28 11:21:05,103 INFO L87 Difference]: Start difference. First operand has 132 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 32 states have call successors, (32), 23 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 132 states. [2022-04-28 11:21:05,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:05,104 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2022-04-28 11:21:05,104 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2022-04-28 11:21:05,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:05,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:05,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:21:05,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:21:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 32 states have call successors, (32), 23 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:21:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2022-04-28 11:21:05,106 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 113 [2022-04-28 11:21:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:21:05,107 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2022-04-28 11:21:05,107 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:21:05,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 141 transitions. [2022-04-28 11:21:09,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 139 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2022-04-28 11:21:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-28 11:21:09,278 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:21:09,278 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:21:09,285 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:21:09,483 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:21:09,483 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:21:09,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:21:09,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2063139367, now seen corresponding path program 5 times [2022-04-28 11:21:09,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:09,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [677426986] [2022-04-28 11:21:09,711 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:21:09,711 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:21:09,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2063139367, now seen corresponding path program 6 times [2022-04-28 11:21:09,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:21:09,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273293322] [2022-04-28 11:21:09,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:21:09,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:21:09,718 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:21:09,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1760440592] [2022-04-28 11:21:09,719 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:21:09,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:21:09,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:21:09,719 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:21:09,720 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:21:09,879 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:21:09,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:21:09,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 11:21:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:21:09,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:21:13,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {16399#true} call ULTIMATE.init(); {16399#true} is VALID [2022-04-28 11:21:13,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {16399#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); {16399#true} is VALID [2022-04-28 11:21:13,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16399#true} {16399#true} #84#return; {16399#true} is VALID [2022-04-28 11:21:13,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {16399#true} call #t~ret5 := main(); {16399#true} is VALID [2022-04-28 11:21:13,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {16399#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; {16399#true} is VALID [2022-04-28 11:21:13,968 INFO L272 TraceCheckUtils]: 6: Hoare triple {16399#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {16399#true} ~cond := #in~cond; {16425#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:21:13,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {16425#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {16429#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:21:13,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {16429#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {16429#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:21:13,969 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16429#(not (= |assume_abort_if_not_#in~cond| 0))} {16399#true} #60#return; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} assume !false; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,970 INFO L272 TraceCheckUtils]: 13: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,970 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16399#true} {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #62#return; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,971 INFO L272 TraceCheckUtils]: 18: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,971 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16399#true} {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #64#return; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,971 INFO L272 TraceCheckUtils]: 23: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,972 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16399#true} {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #66#return; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,972 INFO L272 TraceCheckUtils]: 28: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,972 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16399#true} {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #68#return; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,973 INFO L272 TraceCheckUtils]: 33: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,973 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16399#true} {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #70#return; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} assume !false; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,974 INFO L272 TraceCheckUtils]: 40: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,974 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16399#true} {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #62#return; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,974 INFO L272 TraceCheckUtils]: 45: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,975 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {16399#true} {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #64#return; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,975 INFO L272 TraceCheckUtils]: 50: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,975 INFO L290 TraceCheckUtils]: 51: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,975 INFO L290 TraceCheckUtils]: 52: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,975 INFO L290 TraceCheckUtils]: 53: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,976 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16399#true} {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #66#return; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,976 INFO L272 TraceCheckUtils]: 55: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,976 INFO L290 TraceCheckUtils]: 58: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,976 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16399#true} {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #68#return; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,976 INFO L272 TraceCheckUtils]: 60: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,977 INFO L290 TraceCheckUtils]: 61: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,977 INFO L290 TraceCheckUtils]: 62: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,977 INFO L290 TraceCheckUtils]: 63: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,977 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16399#true} {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #70#return; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,977 INFO L290 TraceCheckUtils]: 65: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,978 INFO L290 TraceCheckUtils]: 66: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} assume !false; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,978 INFO L272 TraceCheckUtils]: 67: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,978 INFO L290 TraceCheckUtils]: 68: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,978 INFO L290 TraceCheckUtils]: 69: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,978 INFO L290 TraceCheckUtils]: 70: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,978 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16399#true} {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #62#return; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,978 INFO L272 TraceCheckUtils]: 72: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,979 INFO L290 TraceCheckUtils]: 73: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,979 INFO L290 TraceCheckUtils]: 74: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,979 INFO L290 TraceCheckUtils]: 75: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,979 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16399#true} {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #64#return; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,979 INFO L272 TraceCheckUtils]: 77: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,979 INFO L290 TraceCheckUtils]: 78: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,979 INFO L290 TraceCheckUtils]: 79: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,979 INFO L290 TraceCheckUtils]: 80: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,980 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {16399#true} {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #66#return; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,980 INFO L272 TraceCheckUtils]: 82: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,980 INFO L290 TraceCheckUtils]: 83: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,980 INFO L290 TraceCheckUtils]: 84: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,980 INFO L290 TraceCheckUtils]: 85: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,980 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16399#true} {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #68#return; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,980 INFO L272 TraceCheckUtils]: 87: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,981 INFO L290 TraceCheckUtils]: 88: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,981 INFO L290 TraceCheckUtils]: 89: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,981 INFO L290 TraceCheckUtils]: 90: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,981 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {16399#true} {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #70#return; {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,990 INFO L290 TraceCheckUtils]: 92: Hoare triple {16436#(and (<= 0 main_~a~0) (<= main_~a~0 5))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {16683#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,992 INFO L290 TraceCheckUtils]: 93: Hoare triple {16683#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 5))} assume !false; {16683#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,992 INFO L272 TraceCheckUtils]: 94: Hoare triple {16683#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,992 INFO L290 TraceCheckUtils]: 95: Hoare triple {16399#true} ~cond := #in~cond; {16693#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:13,994 INFO L290 TraceCheckUtils]: 96: Hoare triple {16693#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16697#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:13,995 INFO L290 TraceCheckUtils]: 97: Hoare triple {16697#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16697#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:13,995 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16697#(not (= |__VERIFIER_assert_#in~cond| 0))} {16683#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 5))} #62#return; {16704#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,995 INFO L272 TraceCheckUtils]: 99: Hoare triple {16704#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,995 INFO L290 TraceCheckUtils]: 100: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,996 INFO L290 TraceCheckUtils]: 101: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,996 INFO L290 TraceCheckUtils]: 102: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,996 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {16399#true} {16704#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} #64#return; {16704#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,996 INFO L272 TraceCheckUtils]: 104: Hoare triple {16704#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,996 INFO L290 TraceCheckUtils]: 105: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,996 INFO L290 TraceCheckUtils]: 106: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,996 INFO L290 TraceCheckUtils]: 107: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,997 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16399#true} {16704#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} #66#return; {16704#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,997 INFO L272 TraceCheckUtils]: 109: Hoare triple {16704#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,997 INFO L290 TraceCheckUtils]: 110: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,997 INFO L290 TraceCheckUtils]: 111: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,997 INFO L290 TraceCheckUtils]: 112: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,997 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {16399#true} {16704#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} #68#return; {16704#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,998 INFO L272 TraceCheckUtils]: 114: Hoare triple {16704#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,998 INFO L290 TraceCheckUtils]: 115: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,998 INFO L290 TraceCheckUtils]: 116: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,998 INFO L290 TraceCheckUtils]: 117: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:13,998 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {16399#true} {16704#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} #70#return; {16704#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:13,999 INFO L290 TraceCheckUtils]: 119: Hoare triple {16704#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} assume !(~n~0 <= ~a~0); {16768#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= main_~a~0 5) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:21:13,999 INFO L272 TraceCheckUtils]: 120: Hoare triple {16768#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= main_~a~0 5) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16399#true} is VALID [2022-04-28 11:21:13,999 INFO L290 TraceCheckUtils]: 121: Hoare triple {16399#true} ~cond := #in~cond; {16399#true} is VALID [2022-04-28 11:21:13,999 INFO L290 TraceCheckUtils]: 122: Hoare triple {16399#true} assume !(0 == ~cond); {16399#true} is VALID [2022-04-28 11:21:13,999 INFO L290 TraceCheckUtils]: 123: Hoare triple {16399#true} assume true; {16399#true} is VALID [2022-04-28 11:21:14,000 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {16399#true} {16768#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= main_~a~0 5) (= (mod main_~z~0 6) 0))} #72#return; {16768#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= main_~a~0 5) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:21:14,005 INFO L272 TraceCheckUtils]: 125: Hoare triple {16768#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= main_~a~0 5) (= (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)); {16787#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:21:14,005 INFO L290 TraceCheckUtils]: 126: Hoare triple {16787#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16791#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:14,006 INFO L290 TraceCheckUtils]: 127: Hoare triple {16791#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16400#false} is VALID [2022-04-28 11:21:14,006 INFO L290 TraceCheckUtils]: 128: Hoare triple {16400#false} assume !false; {16400#false} is VALID [2022-04-28 11:21:14,006 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:21:14,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:21:14,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:21:14,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273293322] [2022-04-28 11:21:14,092 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:21:14,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760440592] [2022-04-28 11:21:14,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760440592] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:21:14,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:21:14,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 11:21:14,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:21:14,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [677426986] [2022-04-28 11:21:14,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [677426986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:21:14,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:21:14,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 11:21:14,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491199565] [2022-04-28 11:21:14,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:21:14,094 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:21:14,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:21:14,094 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:21:14,136 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:21:14,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 11:21:14,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:14,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 11:21:14,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:21:14,137 INFO L87 Difference]: Start difference. First operand 132 states and 141 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:21:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:14,854 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-04-28 11:21:14,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:21:14,854 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:21:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:21:14,854 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:21:14,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-28 11:21:14,855 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:21:14,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-28 11:21:14,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 46 transitions. [2022-04-28 11:21:14,902 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:21:14,904 INFO L225 Difference]: With dead ends: 138 [2022-04-28 11:21:14,904 INFO L226 Difference]: Without dead ends: 136 [2022-04-28 11:21:14,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:21:14,905 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:21:14,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 91 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:21:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-28 11:21:15,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-04-28 11:21:15,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:21:15,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 136 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 32 states have call successors, (32), 24 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:21:15,032 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 136 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 32 states have call successors, (32), 24 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:21:15,033 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 136 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 32 states have call successors, (32), 24 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:21:15,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:15,034 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2022-04-28 11:21:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2022-04-28 11:21:15,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:15,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:15,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 32 states have call successors, (32), 24 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 136 states. [2022-04-28 11:21:15,035 INFO L87 Difference]: Start difference. First operand has 136 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 32 states have call successors, (32), 24 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 136 states. [2022-04-28 11:21:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:15,037 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2022-04-28 11:21:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2022-04-28 11:21:15,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:15,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:15,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:21:15,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:21:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 32 states have call successors, (32), 24 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:21:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2022-04-28 11:21:15,039 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 129 [2022-04-28 11:21:15,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:21:15,039 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2022-04-28 11:21:15,039 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:21:15,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 144 transitions. [2022-04-28 11:21:18,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 143 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2022-04-28 11:21:18,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 11:21:18,063 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:21:18,063 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:21:18,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-28 11:21:18,267 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:21:18,267 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:21:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:21:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash -262683944, now seen corresponding path program 5 times [2022-04-28 11:21:18,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:18,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [251315104] [2022-04-28 11:21:18,486 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:21:18,486 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:21:18,487 INFO L85 PathProgramCache]: Analyzing trace with hash -262683944, now seen corresponding path program 6 times [2022-04-28 11:21:18,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:21:18,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306601931] [2022-04-28 11:21:18,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:21:18,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:21:18,494 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:21:18,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [213703472] [2022-04-28 11:21:18,494 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:21:18,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:21:18,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:21:18,495 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:21:18,496 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:21:18,695 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:21:18,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:21:18,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 11:21:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:21:18,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:21:23,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {17641#true} call ULTIMATE.init(); {17641#true} is VALID [2022-04-28 11:21:23,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {17641#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); {17641#true} is VALID [2022-04-28 11:21:23,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17641#true} {17641#true} #84#return; {17641#true} is VALID [2022-04-28 11:21:23,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {17641#true} call #t~ret5 := main(); {17641#true} is VALID [2022-04-28 11:21:23,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {17641#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; {17661#(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:21:23,189 INFO L272 TraceCheckUtils]: 6: Hoare triple {17661#(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 <= 5 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {17641#true} ~cond := #in~cond; {17668#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:21:23,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {17668#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {17672#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:21:23,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {17672#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {17672#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:21:23,191 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17672#(not (= |assume_abort_if_not_#in~cond| 0))} {17661#(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; {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} assume !false; {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,192 INFO L272 TraceCheckUtils]: 13: Hoare triple {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,192 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17641#true} {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #62#return; {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,192 INFO L272 TraceCheckUtils]: 18: Hoare triple {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,193 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17641#true} {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #64#return; {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,193 INFO L272 TraceCheckUtils]: 23: Hoare triple {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,194 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17641#true} {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #66#return; {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,194 INFO L272 TraceCheckUtils]: 28: Hoare triple {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,194 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17641#true} {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #68#return; {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,194 INFO L272 TraceCheckUtils]: 33: Hoare triple {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,195 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17641#true} {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #70#return; {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,196 INFO L290 TraceCheckUtils]: 39: Hoare triple {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} assume !false; {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,196 INFO L272 TraceCheckUtils]: 40: Hoare triple {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,196 INFO L290 TraceCheckUtils]: 41: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,196 INFO L290 TraceCheckUtils]: 43: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,196 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17641#true} {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #62#return; {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,196 INFO L272 TraceCheckUtils]: 45: Hoare triple {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,196 INFO L290 TraceCheckUtils]: 46: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,197 INFO L290 TraceCheckUtils]: 47: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,197 INFO L290 TraceCheckUtils]: 48: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,197 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17641#true} {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #64#return; {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,197 INFO L272 TraceCheckUtils]: 50: Hoare triple {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,197 INFO L290 TraceCheckUtils]: 51: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,197 INFO L290 TraceCheckUtils]: 52: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,198 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17641#true} {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #66#return; {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,198 INFO L272 TraceCheckUtils]: 55: Hoare triple {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,198 INFO L290 TraceCheckUtils]: 56: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,198 INFO L290 TraceCheckUtils]: 57: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,198 INFO L290 TraceCheckUtils]: 58: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,198 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17641#true} {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #68#return; {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,198 INFO L272 TraceCheckUtils]: 60: Hoare triple {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,199 INFO L290 TraceCheckUtils]: 61: Hoare triple {17641#true} ~cond := #in~cond; {17833#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:23,199 INFO L290 TraceCheckUtils]: 62: Hoare triple {17833#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:23,199 INFO L290 TraceCheckUtils]: 63: Hoare triple {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:23,200 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} {17679#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #70#return; {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,202 INFO L290 TraceCheckUtils]: 65: Hoare triple {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,202 INFO L290 TraceCheckUtils]: 66: Hoare triple {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} assume !false; {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,202 INFO L272 TraceCheckUtils]: 67: Hoare triple {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,202 INFO L290 TraceCheckUtils]: 68: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,203 INFO L290 TraceCheckUtils]: 69: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,203 INFO L290 TraceCheckUtils]: 70: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,203 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17641#true} {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} #62#return; {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,203 INFO L272 TraceCheckUtils]: 72: Hoare triple {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,203 INFO L290 TraceCheckUtils]: 73: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,203 INFO L290 TraceCheckUtils]: 74: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,203 INFO L290 TraceCheckUtils]: 75: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,204 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {17641#true} {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} #64#return; {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,204 INFO L272 TraceCheckUtils]: 77: Hoare triple {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,204 INFO L290 TraceCheckUtils]: 78: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,204 INFO L290 TraceCheckUtils]: 79: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,204 INFO L290 TraceCheckUtils]: 80: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,205 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17641#true} {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} #66#return; {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,205 INFO L272 TraceCheckUtils]: 82: Hoare triple {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,205 INFO L290 TraceCheckUtils]: 83: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,205 INFO L290 TraceCheckUtils]: 84: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,205 INFO L290 TraceCheckUtils]: 85: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,206 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17641#true} {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} #68#return; {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,206 INFO L272 TraceCheckUtils]: 87: Hoare triple {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,208 INFO L290 TraceCheckUtils]: 88: Hoare triple {17641#true} ~cond := #in~cond; {17833#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:23,209 INFO L290 TraceCheckUtils]: 89: Hoare triple {17833#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:23,210 INFO L290 TraceCheckUtils]: 90: Hoare triple {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:23,210 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} #70#return; {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,212 INFO L290 TraceCheckUtils]: 92: Hoare triple {17844#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 5))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17929#(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)) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,213 INFO L290 TraceCheckUtils]: 93: Hoare triple {17929#(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)) (<= 0 main_~a~0) (<= main_~a~0 5))} assume !false; {17929#(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)) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,213 INFO L272 TraceCheckUtils]: 94: Hoare triple {17929#(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)) (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,213 INFO L290 TraceCheckUtils]: 95: Hoare triple {17641#true} ~cond := #in~cond; {17833#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:23,213 INFO L290 TraceCheckUtils]: 96: Hoare triple {17833#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:23,213 INFO L290 TraceCheckUtils]: 97: Hoare triple {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:23,214 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} {17929#(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)) (<= 0 main_~a~0) (<= main_~a~0 5))} #62#return; {17948#(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_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,214 INFO L272 TraceCheckUtils]: 99: Hoare triple {17948#(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_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,214 INFO L290 TraceCheckUtils]: 100: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,214 INFO L290 TraceCheckUtils]: 101: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,214 INFO L290 TraceCheckUtils]: 102: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,215 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {17641#true} {17948#(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_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} #64#return; {17948#(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_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,215 INFO L272 TraceCheckUtils]: 104: Hoare triple {17948#(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_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,215 INFO L290 TraceCheckUtils]: 105: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,215 INFO L290 TraceCheckUtils]: 106: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,215 INFO L290 TraceCheckUtils]: 107: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,216 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17641#true} {17948#(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_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} #66#return; {17948#(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_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,216 INFO L272 TraceCheckUtils]: 109: Hoare triple {17948#(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_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,216 INFO L290 TraceCheckUtils]: 110: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,216 INFO L290 TraceCheckUtils]: 111: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,216 INFO L290 TraceCheckUtils]: 112: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,216 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17641#true} {17948#(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_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} #68#return; {17948#(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_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,217 INFO L272 TraceCheckUtils]: 114: Hoare triple {17948#(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_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,217 INFO L290 TraceCheckUtils]: 115: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,217 INFO L290 TraceCheckUtils]: 116: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,217 INFO L290 TraceCheckUtils]: 117: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,217 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {17641#true} {17948#(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_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} #70#return; {17948#(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_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,218 INFO L290 TraceCheckUtils]: 119: Hoare triple {17948#(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_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 5))} assume !(~n~0 <= ~a~0); {18012#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,218 INFO L272 TraceCheckUtils]: 120: Hoare triple {18012#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 5))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,218 INFO L290 TraceCheckUtils]: 121: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,218 INFO L290 TraceCheckUtils]: 122: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,218 INFO L290 TraceCheckUtils]: 123: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,219 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17641#true} {18012#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 5))} #72#return; {18012#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,219 INFO L272 TraceCheckUtils]: 125: Hoare triple {18012#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:23,219 INFO L290 TraceCheckUtils]: 126: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:23,219 INFO L290 TraceCheckUtils]: 127: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:23,219 INFO L290 TraceCheckUtils]: 128: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:23,219 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17641#true} {18012#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 5))} #74#return; {18012#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 5))} is VALID [2022-04-28 11:21:23,319 INFO L272 TraceCheckUtils]: 130: Hoare triple {18012#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 5))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {18046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:21:23,320 INFO L290 TraceCheckUtils]: 131: Hoare triple {18046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:23,320 INFO L290 TraceCheckUtils]: 132: Hoare triple {18050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17642#false} is VALID [2022-04-28 11:21:23,320 INFO L290 TraceCheckUtils]: 133: Hoare triple {17642#false} assume !false; {17642#false} is VALID [2022-04-28 11:21:23,321 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:21:23,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:21:34,811 INFO L290 TraceCheckUtils]: 133: Hoare triple {17642#false} assume !false; {17642#false} is VALID [2022-04-28 11:21:34,811 INFO L290 TraceCheckUtils]: 132: Hoare triple {18050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17642#false} is VALID [2022-04-28 11:21:34,811 INFO L290 TraceCheckUtils]: 131: Hoare triple {18046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:34,812 INFO L272 TraceCheckUtils]: 130: Hoare triple {18066#(= (+ (* 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)); {18046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:21:34,812 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17641#true} {18066#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #74#return; {18066#(= (+ (* 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:21:34,812 INFO L290 TraceCheckUtils]: 128: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,813 INFO L290 TraceCheckUtils]: 127: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,813 INFO L290 TraceCheckUtils]: 126: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,813 INFO L272 TraceCheckUtils]: 125: Hoare triple {18066#(= (+ (* 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)); {17641#true} is VALID [2022-04-28 11:21:34,813 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17641#true} {18066#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #72#return; {18066#(= (+ (* 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:21:34,813 INFO L290 TraceCheckUtils]: 123: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,813 INFO L290 TraceCheckUtils]: 122: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,813 INFO L290 TraceCheckUtils]: 121: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,813 INFO L272 TraceCheckUtils]: 120: Hoare triple {18066#(= (+ (* 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)); {17641#true} is VALID [2022-04-28 11:21:34,814 INFO L290 TraceCheckUtils]: 119: Hoare triple {18100#(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); {18066#(= (+ (* 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:21:34,814 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {17641#true} {18100#(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; {18100#(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:21:34,814 INFO L290 TraceCheckUtils]: 117: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,814 INFO L290 TraceCheckUtils]: 116: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,814 INFO L290 TraceCheckUtils]: 115: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,814 INFO L272 TraceCheckUtils]: 114: Hoare triple {18100#(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)); {17641#true} is VALID [2022-04-28 11:21:34,815 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17641#true} {18100#(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; {18100#(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:21:34,815 INFO L290 TraceCheckUtils]: 112: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,815 INFO L290 TraceCheckUtils]: 111: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,815 INFO L290 TraceCheckUtils]: 110: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,815 INFO L272 TraceCheckUtils]: 109: Hoare triple {18100#(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)); {17641#true} is VALID [2022-04-28 11:21:34,816 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17641#true} {18100#(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; {18100#(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:21:34,816 INFO L290 TraceCheckUtils]: 107: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,816 INFO L290 TraceCheckUtils]: 106: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,816 INFO L290 TraceCheckUtils]: 105: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,816 INFO L272 TraceCheckUtils]: 104: Hoare triple {18100#(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)); {17641#true} is VALID [2022-04-28 11:21:34,816 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {17641#true} {18100#(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; {18100#(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:21:34,816 INFO L290 TraceCheckUtils]: 102: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,817 INFO L290 TraceCheckUtils]: 101: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,817 INFO L290 TraceCheckUtils]: 100: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,817 INFO L272 TraceCheckUtils]: 99: Hoare triple {18100#(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)); {17641#true} is VALID [2022-04-28 11:21:34,817 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} {18164#(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; {18100#(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:21:34,817 INFO L290 TraceCheckUtils]: 97: Hoare triple {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:34,818 INFO L290 TraceCheckUtils]: 96: Hoare triple {18174#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:34,818 INFO L290 TraceCheckUtils]: 95: Hoare triple {17641#true} ~cond := #in~cond; {18174#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:21:34,818 INFO L272 TraceCheckUtils]: 94: Hoare triple {18164#(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)); {17641#true} is VALID [2022-04-28 11:21:34,819 INFO L290 TraceCheckUtils]: 93: Hoare triple {18164#(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; {18164#(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:21:34,822 INFO L290 TraceCheckUtils]: 92: Hoare triple {18184#(or (= (+ (* (div main_~z~0 6) 12) (* main_~a~0 (+ 6 (* 6 (div main_~z~0 6)))) 12) (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10)) (<= (div main_~z~0 6) main_~a~0) (not (= (mod main_~z~0 6) 0)) (< (+ main_~a~0 1) (div 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; {18164#(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:21:34,826 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} {17641#true} #70#return; {18184#(or (= (+ (* (div main_~z~0 6) 12) (* main_~a~0 (+ 6 (* 6 (div main_~z~0 6)))) 12) (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10)) (<= (div main_~z~0 6) main_~a~0) (not (= (mod main_~z~0 6) 0)) (< (+ main_~a~0 1) (div main_~z~0 6)))} is VALID [2022-04-28 11:21:34,827 INFO L290 TraceCheckUtils]: 90: Hoare triple {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:34,827 INFO L290 TraceCheckUtils]: 89: Hoare triple {18174#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17837#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:34,827 INFO L290 TraceCheckUtils]: 88: Hoare triple {17641#true} ~cond := #in~cond; {18174#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:21:34,827 INFO L272 TraceCheckUtils]: 87: Hoare triple {17641#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:34,827 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17641#true} {17641#true} #68#return; {17641#true} is VALID [2022-04-28 11:21:34,827 INFO L290 TraceCheckUtils]: 85: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,828 INFO L290 TraceCheckUtils]: 84: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,828 INFO L290 TraceCheckUtils]: 83: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,828 INFO L272 TraceCheckUtils]: 82: Hoare triple {17641#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:34,828 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17641#true} {17641#true} #66#return; {17641#true} is VALID [2022-04-28 11:21:34,828 INFO L290 TraceCheckUtils]: 80: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,828 INFO L290 TraceCheckUtils]: 79: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,828 INFO L290 TraceCheckUtils]: 78: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,828 INFO L272 TraceCheckUtils]: 77: Hoare triple {17641#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:34,828 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {17641#true} {17641#true} #64#return; {17641#true} is VALID [2022-04-28 11:21:34,828 INFO L290 TraceCheckUtils]: 75: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,828 INFO L290 TraceCheckUtils]: 74: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,828 INFO L290 TraceCheckUtils]: 73: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,828 INFO L272 TraceCheckUtils]: 72: Hoare triple {17641#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:34,828 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17641#true} {17641#true} #62#return; {17641#true} is VALID [2022-04-28 11:21:34,828 INFO L290 TraceCheckUtils]: 70: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,829 INFO L290 TraceCheckUtils]: 69: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,829 INFO L290 TraceCheckUtils]: 68: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,829 INFO L272 TraceCheckUtils]: 67: Hoare triple {17641#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:34,829 INFO L290 TraceCheckUtils]: 66: Hoare triple {17641#true} assume !false; {17641#true} is VALID [2022-04-28 11:21:34,829 INFO L290 TraceCheckUtils]: 65: Hoare triple {17641#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; {17641#true} is VALID [2022-04-28 11:21:34,829 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17641#true} {17641#true} #70#return; {17641#true} is VALID [2022-04-28 11:21:34,829 INFO L290 TraceCheckUtils]: 63: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,829 INFO L290 TraceCheckUtils]: 62: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,829 INFO L290 TraceCheckUtils]: 61: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,829 INFO L272 TraceCheckUtils]: 60: Hoare triple {17641#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:34,829 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17641#true} {17641#true} #68#return; {17641#true} is VALID [2022-04-28 11:21:34,829 INFO L290 TraceCheckUtils]: 58: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,829 INFO L290 TraceCheckUtils]: 57: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,829 INFO L290 TraceCheckUtils]: 56: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,829 INFO L272 TraceCheckUtils]: 55: Hoare triple {17641#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:34,830 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17641#true} {17641#true} #66#return; {17641#true} is VALID [2022-04-28 11:21:34,830 INFO L290 TraceCheckUtils]: 53: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,830 INFO L290 TraceCheckUtils]: 52: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,830 INFO L290 TraceCheckUtils]: 51: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,830 INFO L272 TraceCheckUtils]: 50: Hoare triple {17641#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:34,830 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17641#true} {17641#true} #64#return; {17641#true} is VALID [2022-04-28 11:21:34,830 INFO L290 TraceCheckUtils]: 48: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,830 INFO L290 TraceCheckUtils]: 47: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,830 INFO L290 TraceCheckUtils]: 46: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,830 INFO L272 TraceCheckUtils]: 45: Hoare triple {17641#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:34,830 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17641#true} {17641#true} #62#return; {17641#true} is VALID [2022-04-28 11:21:34,830 INFO L290 TraceCheckUtils]: 43: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,830 INFO L290 TraceCheckUtils]: 42: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,830 INFO L290 TraceCheckUtils]: 41: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,830 INFO L272 TraceCheckUtils]: 40: Hoare triple {17641#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:34,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {17641#true} assume !false; {17641#true} is VALID [2022-04-28 11:21:34,831 INFO L290 TraceCheckUtils]: 38: Hoare triple {17641#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; {17641#true} is VALID [2022-04-28 11:21:34,831 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17641#true} {17641#true} #70#return; {17641#true} is VALID [2022-04-28 11:21:34,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,831 INFO L290 TraceCheckUtils]: 34: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,831 INFO L272 TraceCheckUtils]: 33: Hoare triple {17641#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:34,831 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17641#true} {17641#true} #68#return; {17641#true} is VALID [2022-04-28 11:21:34,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,831 INFO L272 TraceCheckUtils]: 28: Hoare triple {17641#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:34,831 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17641#true} {17641#true} #66#return; {17641#true} is VALID [2022-04-28 11:21:34,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,832 INFO L272 TraceCheckUtils]: 23: Hoare triple {17641#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:34,832 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17641#true} {17641#true} #64#return; {17641#true} is VALID [2022-04-28 11:21:34,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,832 INFO L272 TraceCheckUtils]: 18: Hoare triple {17641#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:34,832 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17641#true} {17641#true} #62#return; {17641#true} is VALID [2022-04-28 11:21:34,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,832 INFO L272 TraceCheckUtils]: 13: Hoare triple {17641#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:34,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {17641#true} assume !false; {17641#true} is VALID [2022-04-28 11:21:34,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {17641#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17641#true} is VALID [2022-04-28 11:21:34,833 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17641#true} {17641#true} #60#return; {17641#true} is VALID [2022-04-28 11:21:34,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {17641#true} assume !(0 == ~cond); {17641#true} is VALID [2022-04-28 11:21:34,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {17641#true} ~cond := #in~cond; {17641#true} is VALID [2022-04-28 11:21:34,833 INFO L272 TraceCheckUtils]: 6: Hoare triple {17641#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {17641#true} is VALID [2022-04-28 11:21:34,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {17641#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; {17641#true} is VALID [2022-04-28 11:21:34,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {17641#true} call #t~ret5 := main(); {17641#true} is VALID [2022-04-28 11:21:34,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17641#true} {17641#true} #84#return; {17641#true} is VALID [2022-04-28 11:21:34,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {17641#true} assume true; {17641#true} is VALID [2022-04-28 11:21:34,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {17641#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); {17641#true} is VALID [2022-04-28 11:21:34,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {17641#true} call ULTIMATE.init(); {17641#true} is VALID [2022-04-28 11:21:34,834 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:21:34,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:21:34,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306601931] [2022-04-28 11:21:34,834 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:21:34,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213703472] [2022-04-28 11:21:34,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213703472] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:21:34,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:21:34,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2022-04-28 11:21:34,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:21:34,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [251315104] [2022-04-28 11:21:34,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [251315104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:21:34,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:21:34,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:21:34,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361934047] [2022-04-28 11:21:34,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:21:34,835 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:21:34,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:21:34,836 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:21:35,101 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:21:35,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:21:35,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:35,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:21:35,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-28 11:21:35,102 INFO L87 Difference]: Start difference. First operand 136 states and 144 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:21:36,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:36,726 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2022-04-28 11:21:36,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:21:36,727 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:21:36,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:21:36,727 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:21:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2022-04-28 11:21:36,728 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:21:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2022-04-28 11:21:36,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2022-04-28 11:21:36,792 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:21:36,794 INFO L225 Difference]: With dead ends: 146 [2022-04-28 11:21:36,794 INFO L226 Difference]: Without dead ends: 144 [2022-04-28 11:21:36,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 248 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2022-04-28 11:21:36,794 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 11:21:36,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 117 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 11:21:36,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-28 11:21:36,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-04-28 11:21:36,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:21:36,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 144 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:21:36,937 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 144 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:21:36,937 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 144 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:21:36,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:36,939 INFO L93 Difference]: Finished difference Result 144 states and 150 transitions. [2022-04-28 11:21:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 150 transitions. [2022-04-28 11:21:36,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:36,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:36,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 144 states. [2022-04-28 11:21:36,939 INFO L87 Difference]: Start difference. First operand has 144 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 144 states. [2022-04-28 11:21:36,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:36,941 INFO L93 Difference]: Finished difference Result 144 states and 150 transitions. [2022-04-28 11:21:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 150 transitions. [2022-04-28 11:21:36,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:36,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:36,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:21:36,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:21:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:21:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 150 transitions. [2022-04-28 11:21:36,943 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 150 transitions. Word has length 134 [2022-04-28 11:21:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:21:36,943 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 150 transitions. [2022-04-28 11:21:36,943 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:21:36,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 150 transitions. [2022-04-28 11:21:39,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 149 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 150 transitions. [2022-04-28 11:21:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 11:21:39,451 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:21:39,451 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:21:39,457 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:21:39,657 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:21:39,658 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:21:39,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:21:39,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1923910469, now seen corresponding path program 19 times [2022-04-28 11:21:39,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:39,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [604392401] [2022-04-28 11:21:39,884 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:21:39,884 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:21:39,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1923910469, now seen corresponding path program 20 times [2022-04-28 11:21:39,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:21:39,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697218527] [2022-04-28 11:21:39,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:21:39,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:21:39,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:21:39,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1717482292] [2022-04-28 11:21:39,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:21:39,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:21:39,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:21:39,893 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:21:39,897 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:21:39,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:21:39,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:21:39,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 11:21:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:21:39,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:21:40,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {19339#true} call ULTIMATE.init(); {19339#true} is VALID [2022-04-28 11:21:40,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {19339#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); {19339#true} is VALID [2022-04-28 11:21:40,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19339#true} {19339#true} #84#return; {19339#true} is VALID [2022-04-28 11:21:40,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {19339#true} call #t~ret5 := main(); {19339#true} is VALID [2022-04-28 11:21:40,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {19339#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; {19339#true} is VALID [2022-04-28 11:21:40,510 INFO L272 TraceCheckUtils]: 6: Hoare triple {19339#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {19339#true} is VALID [2022-04-28 11:21:40,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,511 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19339#true} {19339#true} #60#return; {19339#true} is VALID [2022-04-28 11:21:40,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {19339#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {19377#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:40,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {19377#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {19377#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:40,511 INFO L272 TraceCheckUtils]: 13: Hoare triple {19377#(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)); {19339#true} is VALID [2022-04-28 11:21:40,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,512 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19339#true} {19377#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {19377#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:40,512 INFO L272 TraceCheckUtils]: 18: Hoare triple {19377#(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)); {19339#true} is VALID [2022-04-28 11:21:40,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,513 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19339#true} {19377#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {19377#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:40,513 INFO L272 TraceCheckUtils]: 23: Hoare triple {19377#(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)); {19339#true} is VALID [2022-04-28 11:21:40,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,513 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19339#true} {19377#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {19377#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:40,513 INFO L272 TraceCheckUtils]: 28: Hoare triple {19377#(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)); {19339#true} is VALID [2022-04-28 11:21:40,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,514 INFO L290 TraceCheckUtils]: 30: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,514 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19339#true} {19377#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {19377#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:40,514 INFO L272 TraceCheckUtils]: 33: Hoare triple {19377#(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)); {19339#true} is VALID [2022-04-28 11:21:40,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,515 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {19339#true} {19377#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {19377#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:40,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {19377#(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; {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:21:40,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} assume !false; {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:21:40,516 INFO L272 TraceCheckUtils]: 40: Hoare triple {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19339#true} is VALID [2022-04-28 11:21:40,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,516 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19339#true} {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #62#return; {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:21:40,516 INFO L272 TraceCheckUtils]: 45: Hoare triple {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= 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)); {19339#true} is VALID [2022-04-28 11:21:40,516 INFO L290 TraceCheckUtils]: 46: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,516 INFO L290 TraceCheckUtils]: 47: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,517 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {19339#true} {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #64#return; {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:21:40,517 INFO L272 TraceCheckUtils]: 50: Hoare triple {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19339#true} is VALID [2022-04-28 11:21:40,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,518 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19339#true} {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #66#return; {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:21:40,518 INFO L272 TraceCheckUtils]: 55: Hoare triple {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= 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)); {19339#true} is VALID [2022-04-28 11:21:40,518 INFO L290 TraceCheckUtils]: 56: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,518 INFO L290 TraceCheckUtils]: 57: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,518 INFO L290 TraceCheckUtils]: 58: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,518 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19339#true} {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #68#return; {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:21:40,518 INFO L272 TraceCheckUtils]: 60: Hoare triple {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19339#true} is VALID [2022-04-28 11:21:40,518 INFO L290 TraceCheckUtils]: 61: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,519 INFO L290 TraceCheckUtils]: 62: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,519 INFO L290 TraceCheckUtils]: 63: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,519 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {19339#true} {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #70#return; {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:21:40,519 INFO L290 TraceCheckUtils]: 65: Hoare triple {19459#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~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; {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:21:40,520 INFO L290 TraceCheckUtils]: 66: Hoare triple {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} assume !false; {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:21:40,520 INFO L272 TraceCheckUtils]: 67: Hoare triple {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19339#true} is VALID [2022-04-28 11:21:40,520 INFO L290 TraceCheckUtils]: 68: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,520 INFO L290 TraceCheckUtils]: 69: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,520 INFO L290 TraceCheckUtils]: 70: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,520 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19339#true} {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #62#return; {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:21:40,521 INFO L272 TraceCheckUtils]: 72: Hoare triple {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19339#true} is VALID [2022-04-28 11:21:40,521 INFO L290 TraceCheckUtils]: 73: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,521 INFO L290 TraceCheckUtils]: 74: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,521 INFO L290 TraceCheckUtils]: 75: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,521 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19339#true} {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #64#return; {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:21:40,521 INFO L272 TraceCheckUtils]: 77: Hoare triple {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19339#true} is VALID [2022-04-28 11:21:40,521 INFO L290 TraceCheckUtils]: 78: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,521 INFO L290 TraceCheckUtils]: 79: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,521 INFO L290 TraceCheckUtils]: 80: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,522 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19339#true} {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #66#return; {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:21:40,522 INFO L272 TraceCheckUtils]: 82: Hoare triple {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= 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)); {19339#true} is VALID [2022-04-28 11:21:40,522 INFO L290 TraceCheckUtils]: 83: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,522 INFO L290 TraceCheckUtils]: 84: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,522 INFO L290 TraceCheckUtils]: 85: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,523 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19339#true} {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #68#return; {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:21:40,523 INFO L272 TraceCheckUtils]: 87: Hoare triple {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19339#true} is VALID [2022-04-28 11:21:40,523 INFO L290 TraceCheckUtils]: 88: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,523 INFO L290 TraceCheckUtils]: 89: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,523 INFO L290 TraceCheckUtils]: 90: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,523 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {19339#true} {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #70#return; {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:21:40,524 INFO L290 TraceCheckUtils]: 92: Hoare triple {19541#(and (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= 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; {19623#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:21:40,524 INFO L290 TraceCheckUtils]: 93: Hoare triple {19623#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} assume !false; {19623#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:21:40,524 INFO L272 TraceCheckUtils]: 94: Hoare triple {19623#(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)); {19339#true} is VALID [2022-04-28 11:21:40,524 INFO L290 TraceCheckUtils]: 95: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,524 INFO L290 TraceCheckUtils]: 96: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,524 INFO L290 TraceCheckUtils]: 97: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,525 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {19339#true} {19623#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #62#return; {19623#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:21:40,525 INFO L272 TraceCheckUtils]: 99: Hoare triple {19623#(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)); {19339#true} is VALID [2022-04-28 11:21:40,525 INFO L290 TraceCheckUtils]: 100: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,525 INFO L290 TraceCheckUtils]: 101: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,525 INFO L290 TraceCheckUtils]: 102: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,525 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {19339#true} {19623#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #64#return; {19623#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:21:40,525 INFO L272 TraceCheckUtils]: 104: Hoare triple {19623#(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)); {19339#true} is VALID [2022-04-28 11:21:40,526 INFO L290 TraceCheckUtils]: 105: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,526 INFO L290 TraceCheckUtils]: 106: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,526 INFO L290 TraceCheckUtils]: 107: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,526 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19339#true} {19623#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #66#return; {19623#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:21:40,526 INFO L272 TraceCheckUtils]: 109: Hoare triple {19623#(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)); {19339#true} is VALID [2022-04-28 11:21:40,526 INFO L290 TraceCheckUtils]: 110: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,526 INFO L290 TraceCheckUtils]: 111: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,526 INFO L290 TraceCheckUtils]: 112: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,527 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19339#true} {19623#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #68#return; {19623#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:21:40,527 INFO L272 TraceCheckUtils]: 114: Hoare triple {19623#(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)); {19339#true} is VALID [2022-04-28 11:21:40,527 INFO L290 TraceCheckUtils]: 115: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,527 INFO L290 TraceCheckUtils]: 116: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,527 INFO L290 TraceCheckUtils]: 117: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,527 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {19339#true} {19623#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #70#return; {19623#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:21:40,528 INFO L290 TraceCheckUtils]: 119: Hoare triple {19623#(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; {19705#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:21:40,528 INFO L290 TraceCheckUtils]: 120: Hoare triple {19705#(and (= main_~n~0 4) (= 64 main_~x~0))} assume !false; {19705#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:21:40,528 INFO L272 TraceCheckUtils]: 121: Hoare triple {19705#(and (= main_~n~0 4) (= 64 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19339#true} is VALID [2022-04-28 11:21:40,528 INFO L290 TraceCheckUtils]: 122: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,528 INFO L290 TraceCheckUtils]: 123: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,528 INFO L290 TraceCheckUtils]: 124: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,529 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {19339#true} {19705#(and (= main_~n~0 4) (= 64 main_~x~0))} #62#return; {19705#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:21:40,529 INFO L272 TraceCheckUtils]: 126: Hoare triple {19705#(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)); {19339#true} is VALID [2022-04-28 11:21:40,529 INFO L290 TraceCheckUtils]: 127: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:40,529 INFO L290 TraceCheckUtils]: 128: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:40,529 INFO L290 TraceCheckUtils]: 129: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:40,529 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {19339#true} {19705#(and (= main_~n~0 4) (= 64 main_~x~0))} #64#return; {19705#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:21:40,530 INFO L272 TraceCheckUtils]: 131: Hoare triple {19705#(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)); {19742#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:21:40,530 INFO L290 TraceCheckUtils]: 132: Hoare triple {19742#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19746#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:40,530 INFO L290 TraceCheckUtils]: 133: Hoare triple {19746#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19340#false} is VALID [2022-04-28 11:21:40,531 INFO L290 TraceCheckUtils]: 134: Hoare triple {19340#false} assume !false; {19340#false} is VALID [2022-04-28 11:21:40,531 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:21:40,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:21:41,013 INFO L290 TraceCheckUtils]: 134: Hoare triple {19340#false} assume !false; {19340#false} is VALID [2022-04-28 11:21:41,013 INFO L290 TraceCheckUtils]: 133: Hoare triple {19746#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19340#false} is VALID [2022-04-28 11:21:41,014 INFO L290 TraceCheckUtils]: 132: Hoare triple {19742#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19746#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:41,014 INFO L272 TraceCheckUtils]: 131: Hoare triple {19762#(= (* 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)); {19742#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:21:41,015 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {19339#true} {19762#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {19762#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:21:41,015 INFO L290 TraceCheckUtils]: 129: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,015 INFO L290 TraceCheckUtils]: 128: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,015 INFO L290 TraceCheckUtils]: 127: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,015 INFO L272 TraceCheckUtils]: 126: Hoare triple {19762#(= (* 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)); {19339#true} is VALID [2022-04-28 11:21:41,015 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {19339#true} {19762#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {19762#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:21:41,015 INFO L290 TraceCheckUtils]: 124: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,015 INFO L290 TraceCheckUtils]: 123: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,015 INFO L290 TraceCheckUtils]: 122: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,016 INFO L272 TraceCheckUtils]: 121: Hoare triple {19762#(= (* 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)); {19339#true} is VALID [2022-04-28 11:21:41,016 INFO L290 TraceCheckUtils]: 120: Hoare triple {19762#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {19762#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:21:41,018 INFO L290 TraceCheckUtils]: 119: Hoare triple {19799#(= (+ (* 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; {19762#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:21:41,019 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {19339#true} {19799#(= (+ (* 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; {19799#(= (+ (* 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:21:41,019 INFO L290 TraceCheckUtils]: 117: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,019 INFO L290 TraceCheckUtils]: 116: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,019 INFO L290 TraceCheckUtils]: 115: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,019 INFO L272 TraceCheckUtils]: 114: Hoare triple {19799#(= (+ (* 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)); {19339#true} is VALID [2022-04-28 11:21:41,019 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19339#true} {19799#(= (+ (* 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; {19799#(= (+ (* 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:21:41,019 INFO L290 TraceCheckUtils]: 112: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,019 INFO L290 TraceCheckUtils]: 111: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,019 INFO L290 TraceCheckUtils]: 110: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,020 INFO L272 TraceCheckUtils]: 109: Hoare triple {19799#(= (+ (* 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)); {19339#true} is VALID [2022-04-28 11:21:41,020 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19339#true} {19799#(= (+ (* 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; {19799#(= (+ (* 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:21:41,020 INFO L290 TraceCheckUtils]: 107: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,020 INFO L290 TraceCheckUtils]: 106: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,020 INFO L290 TraceCheckUtils]: 105: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,020 INFO L272 TraceCheckUtils]: 104: Hoare triple {19799#(= (+ (* 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)); {19339#true} is VALID [2022-04-28 11:21:41,021 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {19339#true} {19799#(= (+ (* 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; {19799#(= (+ (* 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:21:41,021 INFO L290 TraceCheckUtils]: 102: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,021 INFO L290 TraceCheckUtils]: 101: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,021 INFO L290 TraceCheckUtils]: 100: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,021 INFO L272 TraceCheckUtils]: 99: Hoare triple {19799#(= (+ (* 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)); {19339#true} is VALID [2022-04-28 11:21:41,021 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {19339#true} {19799#(= (+ (* 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; {19799#(= (+ (* 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:21:41,021 INFO L290 TraceCheckUtils]: 97: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,021 INFO L290 TraceCheckUtils]: 96: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,022 INFO L290 TraceCheckUtils]: 95: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,022 INFO L272 TraceCheckUtils]: 94: Hoare triple {19799#(= (+ (* 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)); {19339#true} is VALID [2022-04-28 11:21:41,022 INFO L290 TraceCheckUtils]: 93: Hoare triple {19799#(= (+ (* 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; {19799#(= (+ (* 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:21:41,024 INFO L290 TraceCheckUtils]: 92: Hoare triple {19881#(= (+ 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; {19799#(= (+ (* 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:21:41,024 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {19339#true} {19881#(= (+ 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; {19881#(= (+ 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:21:41,024 INFO L290 TraceCheckUtils]: 90: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,024 INFO L290 TraceCheckUtils]: 89: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,024 INFO L290 TraceCheckUtils]: 88: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,025 INFO L272 TraceCheckUtils]: 87: Hoare triple {19881#(= (+ 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)); {19339#true} is VALID [2022-04-28 11:21:41,025 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19339#true} {19881#(= (+ 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; {19881#(= (+ 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:21:41,025 INFO L290 TraceCheckUtils]: 85: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,025 INFO L290 TraceCheckUtils]: 84: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,025 INFO L290 TraceCheckUtils]: 83: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,025 INFO L272 TraceCheckUtils]: 82: Hoare triple {19881#(= (+ 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)); {19339#true} is VALID [2022-04-28 11:21:41,035 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19339#true} {19881#(= (+ 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; {19881#(= (+ 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:21:41,036 INFO L290 TraceCheckUtils]: 80: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,036 INFO L290 TraceCheckUtils]: 79: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,036 INFO L290 TraceCheckUtils]: 78: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,036 INFO L272 TraceCheckUtils]: 77: Hoare triple {19881#(= (+ 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)); {19339#true} is VALID [2022-04-28 11:21:41,036 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19339#true} {19881#(= (+ 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; {19881#(= (+ 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:21:41,036 INFO L290 TraceCheckUtils]: 75: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,036 INFO L290 TraceCheckUtils]: 74: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,036 INFO L290 TraceCheckUtils]: 73: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,036 INFO L272 TraceCheckUtils]: 72: Hoare triple {19881#(= (+ 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)); {19339#true} is VALID [2022-04-28 11:21:41,037 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19339#true} {19881#(= (+ 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; {19881#(= (+ 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:21:41,037 INFO L290 TraceCheckUtils]: 70: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,037 INFO L290 TraceCheckUtils]: 69: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,037 INFO L290 TraceCheckUtils]: 68: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,037 INFO L272 TraceCheckUtils]: 67: Hoare triple {19881#(= (+ 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)); {19339#true} is VALID [2022-04-28 11:21:41,038 INFO L290 TraceCheckUtils]: 66: Hoare triple {19881#(= (+ 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; {19881#(= (+ 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:21:41,040 INFO L290 TraceCheckUtils]: 65: Hoare triple {19963#(= (+ 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; {19881#(= (+ 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:21:41,041 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {19339#true} {19963#(= (+ 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; {19963#(= (+ 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:21:41,041 INFO L290 TraceCheckUtils]: 63: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,041 INFO L290 TraceCheckUtils]: 62: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,041 INFO L290 TraceCheckUtils]: 61: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,041 INFO L272 TraceCheckUtils]: 60: Hoare triple {19963#(= (+ 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)); {19339#true} is VALID [2022-04-28 11:21:41,042 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19339#true} {19963#(= (+ 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; {19963#(= (+ 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:21:41,042 INFO L290 TraceCheckUtils]: 58: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,042 INFO L290 TraceCheckUtils]: 57: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,042 INFO L290 TraceCheckUtils]: 56: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,042 INFO L272 TraceCheckUtils]: 55: Hoare triple {19963#(= (+ 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)); {19339#true} is VALID [2022-04-28 11:21:41,042 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19339#true} {19963#(= (+ 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; {19963#(= (+ 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:21:41,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,042 INFO L290 TraceCheckUtils]: 52: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,043 INFO L290 TraceCheckUtils]: 51: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,043 INFO L272 TraceCheckUtils]: 50: Hoare triple {19963#(= (+ 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)); {19339#true} is VALID [2022-04-28 11:21:41,043 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {19339#true} {19963#(= (+ 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; {19963#(= (+ 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:21:41,043 INFO L290 TraceCheckUtils]: 48: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,043 INFO L290 TraceCheckUtils]: 47: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,043 INFO L290 TraceCheckUtils]: 46: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,043 INFO L272 TraceCheckUtils]: 45: Hoare triple {19963#(= (+ 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)); {19339#true} is VALID [2022-04-28 11:21:41,044 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19339#true} {19963#(= (+ 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; {19963#(= (+ 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:21:41,044 INFO L290 TraceCheckUtils]: 43: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,044 INFO L290 TraceCheckUtils]: 42: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,044 INFO L290 TraceCheckUtils]: 41: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,044 INFO L272 TraceCheckUtils]: 40: Hoare triple {19963#(= (+ 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)); {19339#true} is VALID [2022-04-28 11:21:41,044 INFO L290 TraceCheckUtils]: 39: Hoare triple {19963#(= (+ 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; {19963#(= (+ 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:21:41,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {20045#(= (+ (* 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; {19963#(= (+ 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:21:41,047 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {19339#true} {20045#(= (+ (* 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; {20045#(= (+ (* 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:21:41,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,047 INFO L272 TraceCheckUtils]: 33: Hoare triple {20045#(= (+ (* 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)); {19339#true} is VALID [2022-04-28 11:21:41,048 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19339#true} {20045#(= (+ (* 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; {20045#(= (+ (* 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:21:41,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,048 INFO L272 TraceCheckUtils]: 28: Hoare triple {20045#(= (+ (* 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)); {19339#true} is VALID [2022-04-28 11:21:41,049 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19339#true} {20045#(= (+ (* 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; {20045#(= (+ (* 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:21:41,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,049 INFO L272 TraceCheckUtils]: 23: Hoare triple {20045#(= (+ (* 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)); {19339#true} is VALID [2022-04-28 11:21:41,049 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19339#true} {20045#(= (+ (* 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; {20045#(= (+ (* 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:21:41,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,050 INFO L272 TraceCheckUtils]: 18: Hoare triple {20045#(= (+ (* 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)); {19339#true} is VALID [2022-04-28 11:21:41,050 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19339#true} {20045#(= (+ (* 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; {20045#(= (+ (* 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:21:41,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,050 INFO L272 TraceCheckUtils]: 13: Hoare triple {20045#(= (+ (* 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)); {19339#true} is VALID [2022-04-28 11:21:41,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {20045#(= (+ (* 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; {20045#(= (+ (* 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:21:41,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {19339#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {20045#(= (+ (* 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:21:41,051 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19339#true} {19339#true} #60#return; {19339#true} is VALID [2022-04-28 11:21:41,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {19339#true} assume !(0 == ~cond); {19339#true} is VALID [2022-04-28 11:21:41,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {19339#true} ~cond := #in~cond; {19339#true} is VALID [2022-04-28 11:21:41,052 INFO L272 TraceCheckUtils]: 6: Hoare triple {19339#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {19339#true} is VALID [2022-04-28 11:21:41,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {19339#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; {19339#true} is VALID [2022-04-28 11:21:41,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {19339#true} call #t~ret5 := main(); {19339#true} is VALID [2022-04-28 11:21:41,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19339#true} {19339#true} #84#return; {19339#true} is VALID [2022-04-28 11:21:41,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {19339#true} assume true; {19339#true} is VALID [2022-04-28 11:21:41,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {19339#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); {19339#true} is VALID [2022-04-28 11:21:41,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {19339#true} call ULTIMATE.init(); {19339#true} is VALID [2022-04-28 11:21:41,052 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:21:41,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:21:41,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697218527] [2022-04-28 11:21:41,053 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:21:41,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717482292] [2022-04-28 11:21:41,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717482292] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:21:41,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:21:41,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 11:21:41,053 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:21:41,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [604392401] [2022-04-28 11:21:41,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [604392401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:21:41,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:21:41,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:21:41,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456954118] [2022-04-28 11:21:41,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:21:41,054 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:21:41,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:21:41,054 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:21:41,114 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:21:41,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:21:41,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:41,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:21:41,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:21:41,115 INFO L87 Difference]: Start difference. First operand 144 states and 150 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:21:43,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:43,181 INFO L93 Difference]: Finished difference Result 184 states and 205 transitions. [2022-04-28 11:21:43,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:21:43,182 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:21:43,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:21:43,182 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:21:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2022-04-28 11:21:43,183 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:21:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2022-04-28 11:21:43,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 130 transitions. [2022-04-28 11:21:43,333 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:21:43,336 INFO L225 Difference]: With dead ends: 184 [2022-04-28 11:21:43,336 INFO L226 Difference]: Without dead ends: 176 [2022-04-28 11:21:43,336 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:21:43,336 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:21:43,337 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.2s Time] [2022-04-28 11:21:43,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-28 11:21:43,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2022-04-28 11:21:43,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:21:43,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 167 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 37 states have call successors, (37), 30 states have call predecessors, (37), 29 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 11:21:43,498 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 167 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 37 states have call successors, (37), 30 states have call predecessors, (37), 29 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 11:21:43,498 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 167 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 37 states have call successors, (37), 30 states have call predecessors, (37), 29 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 11:21:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:43,501 INFO L93 Difference]: Finished difference Result 176 states and 191 transitions. [2022-04-28 11:21:43,501 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 191 transitions. [2022-04-28 11:21:43,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:43,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:43,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 37 states have call successors, (37), 30 states have call predecessors, (37), 29 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand 176 states. [2022-04-28 11:21:43,501 INFO L87 Difference]: Start difference. First operand has 167 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 37 states have call successors, (37), 30 states have call predecessors, (37), 29 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand 176 states. [2022-04-28 11:21:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:43,503 INFO L93 Difference]: Finished difference Result 176 states and 191 transitions. [2022-04-28 11:21:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 191 transitions. [2022-04-28 11:21:43,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:43,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:43,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:21:43,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:21:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 37 states have call successors, (37), 30 states have call predecessors, (37), 29 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 11:21:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 174 transitions. [2022-04-28 11:21:43,506 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 174 transitions. Word has length 135 [2022-04-28 11:21:43,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:21:43,506 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 174 transitions. [2022-04-28 11:21:43,506 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:21:43,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 174 transitions. [2022-04-28 11:21:45,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 173 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 174 transitions. [2022-04-28 11:21:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-28 11:21:45,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:21:45,978 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:21:45,996 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:21:46,179 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:21:46,179 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:21:46,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:21:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1219256746, now seen corresponding path program 21 times [2022-04-28 11:21:46,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:46,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [389415224] [2022-04-28 11:21:46,413 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:21:46,413 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:21:46,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1219256746, now seen corresponding path program 22 times [2022-04-28 11:21:46,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:21:46,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376047804] [2022-04-28 11:21:46,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:21:46,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:21:46,421 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:21:46,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [181066338] [2022-04-28 11:21:46,422 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:21:46,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:21:46,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:21:46,423 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:21:46,424 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:21:46,499 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:21:46,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:21:46,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 11:21:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:21:46,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:21:47,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {21218#true} call ULTIMATE.init(); {21218#true} is VALID [2022-04-28 11:21:47,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {21218#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); {21218#true} is VALID [2022-04-28 11:21:47,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21218#true} {21218#true} #84#return; {21218#true} is VALID [2022-04-28 11:21:47,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {21218#true} call #t~ret5 := main(); {21218#true} is VALID [2022-04-28 11:21:47,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {21218#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; {21218#true} is VALID [2022-04-28 11:21:47,605 INFO L272 TraceCheckUtils]: 6: Hoare triple {21218#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,605 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21218#true} {21218#true} #60#return; {21218#true} is VALID [2022-04-28 11:21:47,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {21218#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {21256#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:47,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {21256#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {21256#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:47,606 INFO L272 TraceCheckUtils]: 13: Hoare triple {21256#(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)); {21218#true} is VALID [2022-04-28 11:21:47,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,606 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21218#true} {21256#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {21256#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:47,606 INFO L272 TraceCheckUtils]: 18: Hoare triple {21256#(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)); {21218#true} is VALID [2022-04-28 11:21:47,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,607 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21218#true} {21256#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {21256#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:47,607 INFO L272 TraceCheckUtils]: 23: Hoare triple {21256#(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)); {21218#true} is VALID [2022-04-28 11:21:47,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,608 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {21218#true} {21256#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {21256#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:47,608 INFO L272 TraceCheckUtils]: 28: Hoare triple {21256#(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)); {21218#true} is VALID [2022-04-28 11:21:47,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,608 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21218#true} {21256#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {21256#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:47,609 INFO L272 TraceCheckUtils]: 33: Hoare triple {21256#(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)); {21218#true} is VALID [2022-04-28 11:21:47,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,609 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {21218#true} {21256#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {21256#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:47,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {21256#(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; {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:21:47,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} assume !false; {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:21:47,610 INFO L272 TraceCheckUtils]: 40: Hoare triple {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,610 INFO L290 TraceCheckUtils]: 42: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,610 INFO L290 TraceCheckUtils]: 43: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,611 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {21218#true} {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #62#return; {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:21:47,611 INFO L272 TraceCheckUtils]: 45: Hoare triple {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 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)); {21218#true} is VALID [2022-04-28 11:21:47,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,611 INFO L290 TraceCheckUtils]: 47: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,611 INFO L290 TraceCheckUtils]: 48: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,611 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {21218#true} {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #64#return; {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:21:47,612 INFO L272 TraceCheckUtils]: 50: Hoare triple {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 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)); {21218#true} is VALID [2022-04-28 11:21:47,612 INFO L290 TraceCheckUtils]: 51: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,612 INFO L290 TraceCheckUtils]: 52: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,612 INFO L290 TraceCheckUtils]: 53: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,612 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21218#true} {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #66#return; {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:21:47,612 INFO L272 TraceCheckUtils]: 55: Hoare triple {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 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)); {21218#true} is VALID [2022-04-28 11:21:47,612 INFO L290 TraceCheckUtils]: 56: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,612 INFO L290 TraceCheckUtils]: 57: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,612 INFO L290 TraceCheckUtils]: 58: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,618 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21218#true} {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #68#return; {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:21:47,618 INFO L272 TraceCheckUtils]: 60: Hoare triple {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 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)); {21218#true} is VALID [2022-04-28 11:21:47,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,619 INFO L290 TraceCheckUtils]: 62: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,619 INFO L290 TraceCheckUtils]: 63: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,619 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21218#true} {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #70#return; {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:21:47,620 INFO L290 TraceCheckUtils]: 65: Hoare triple {21338#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 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; {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} is VALID [2022-04-28 11:21:47,620 INFO L290 TraceCheckUtils]: 66: Hoare triple {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} assume !false; {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} is VALID [2022-04-28 11:21:47,621 INFO L272 TraceCheckUtils]: 67: Hoare triple {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,621 INFO L290 TraceCheckUtils]: 68: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,621 INFO L290 TraceCheckUtils]: 69: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,621 INFO L290 TraceCheckUtils]: 70: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,622 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21218#true} {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} #62#return; {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} is VALID [2022-04-28 11:21:47,622 INFO L272 TraceCheckUtils]: 72: Hoare triple {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,622 INFO L290 TraceCheckUtils]: 73: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,622 INFO L290 TraceCheckUtils]: 74: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,622 INFO L290 TraceCheckUtils]: 75: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,622 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {21218#true} {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} #64#return; {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} is VALID [2022-04-28 11:21:47,622 INFO L272 TraceCheckUtils]: 77: Hoare triple {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,623 INFO L290 TraceCheckUtils]: 78: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,623 INFO L290 TraceCheckUtils]: 79: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,623 INFO L290 TraceCheckUtils]: 80: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,623 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {21218#true} {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} #66#return; {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} is VALID [2022-04-28 11:21:47,623 INFO L272 TraceCheckUtils]: 82: Hoare triple {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) 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)); {21218#true} is VALID [2022-04-28 11:21:47,623 INFO L290 TraceCheckUtils]: 83: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,623 INFO L290 TraceCheckUtils]: 84: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,623 INFO L290 TraceCheckUtils]: 85: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,624 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21218#true} {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} #68#return; {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} is VALID [2022-04-28 11:21:47,624 INFO L272 TraceCheckUtils]: 87: Hoare triple {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,624 INFO L290 TraceCheckUtils]: 88: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,624 INFO L290 TraceCheckUtils]: 89: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,624 INFO L290 TraceCheckUtils]: 90: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,624 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21218#true} {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} #70#return; {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) main_~n~0) 1))} is VALID [2022-04-28 11:21:47,625 INFO L290 TraceCheckUtils]: 92: Hoare triple {21420#(and (= 6 (+ (- 2) main_~x~0)) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)) (= (+ (- 1) 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; {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} is VALID [2022-04-28 11:21:47,625 INFO L290 TraceCheckUtils]: 93: Hoare triple {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} assume !false; {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} is VALID [2022-04-28 11:21:47,626 INFO L272 TraceCheckUtils]: 94: Hoare triple {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,626 INFO L290 TraceCheckUtils]: 95: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,626 INFO L290 TraceCheckUtils]: 96: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,626 INFO L290 TraceCheckUtils]: 97: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,626 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {21218#true} {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} #62#return; {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} is VALID [2022-04-28 11:21:47,626 INFO L272 TraceCheckUtils]: 99: Hoare triple {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,626 INFO L290 TraceCheckUtils]: 100: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,626 INFO L290 TraceCheckUtils]: 101: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,626 INFO L290 TraceCheckUtils]: 102: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,627 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {21218#true} {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} #64#return; {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} is VALID [2022-04-28 11:21:47,627 INFO L272 TraceCheckUtils]: 104: Hoare triple {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,627 INFO L290 TraceCheckUtils]: 105: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,627 INFO L290 TraceCheckUtils]: 106: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,627 INFO L290 TraceCheckUtils]: 107: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,628 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {21218#true} {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} #66#return; {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} is VALID [2022-04-28 11:21:47,628 INFO L272 TraceCheckUtils]: 109: Hoare triple {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* 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)); {21218#true} is VALID [2022-04-28 11:21:47,628 INFO L290 TraceCheckUtils]: 110: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,628 INFO L290 TraceCheckUtils]: 111: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,628 INFO L290 TraceCheckUtils]: 112: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,628 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {21218#true} {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} #68#return; {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} is VALID [2022-04-28 11:21:47,628 INFO L272 TraceCheckUtils]: 114: Hoare triple {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,628 INFO L290 TraceCheckUtils]: 115: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,628 INFO L290 TraceCheckUtils]: 116: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,629 INFO L290 TraceCheckUtils]: 117: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,629 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21218#true} {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} #70#return; {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* main_~z~0 (- 3)))))} is VALID [2022-04-28 11:21:47,630 INFO L290 TraceCheckUtils]: 119: Hoare triple {21502#(and (= 6 (+ (* (- 2) main_~z~0) main_~y~0 17)) (= main_~n~0 3) (= (+ main_~z~0 (- 12)) (+ 23 (* (- 2) main_~z~0) main_~y~0)) (= main_~x~0 (+ (* main_~y~0 2) 25 (* 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; {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} is VALID [2022-04-28 11:21:47,631 INFO L290 TraceCheckUtils]: 120: Hoare triple {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} assume !false; {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} is VALID [2022-04-28 11:21:47,631 INFO L272 TraceCheckUtils]: 121: Hoare triple {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,631 INFO L290 TraceCheckUtils]: 122: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,631 INFO L290 TraceCheckUtils]: 123: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,631 INFO L290 TraceCheckUtils]: 124: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,632 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {21218#true} {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} #62#return; {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} is VALID [2022-04-28 11:21:47,632 INFO L272 TraceCheckUtils]: 126: Hoare triple {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,632 INFO L290 TraceCheckUtils]: 127: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,633 INFO L290 TraceCheckUtils]: 128: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,633 INFO L290 TraceCheckUtils]: 129: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,633 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {21218#true} {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} #64#return; {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} is VALID [2022-04-28 11:21:47,633 INFO L272 TraceCheckUtils]: 131: Hoare triple {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,633 INFO L290 TraceCheckUtils]: 132: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,633 INFO L290 TraceCheckUtils]: 133: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,633 INFO L290 TraceCheckUtils]: 134: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,634 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {21218#true} {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} #66#return; {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} is VALID [2022-04-28 11:21:47,634 INFO L272 TraceCheckUtils]: 136: Hoare triple {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,634 INFO L290 TraceCheckUtils]: 137: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,634 INFO L290 TraceCheckUtils]: 138: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,634 INFO L290 TraceCheckUtils]: 139: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,634 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {21218#true} {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} #68#return; {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} is VALID [2022-04-28 11:21:47,634 INFO L272 TraceCheckUtils]: 141: Hoare triple {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,634 INFO L290 TraceCheckUtils]: 142: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,635 INFO L290 TraceCheckUtils]: 143: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,635 INFO L290 TraceCheckUtils]: 144: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,635 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {21218#true} {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} #70#return; {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 0))} is VALID [2022-04-28 11:21:47,652 INFO L290 TraceCheckUtils]: 146: Hoare triple {21584#(and (= (+ (* (- 5) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* main_~y~0 (- 3)) 25) (+ main_~x~0 (div (+ (* main_~y~0 3) (- 35)) (- 4)))) (= 6 (+ 17 (* (- 3) (div (+ (* main_~y~0 3) (- 35)) (- 4))) (* (- 2) main_~y~0))) (= 3 (+ (- 1) main_~n~0)) (= (mod (+ (* main_~y~0 3) 1) 4) 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; {21666#(and (exists ((v_main_~y~0_230 Int)) (and (= (+ (* (- 2) v_main_~y~0_230) (* (- 3) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 17) 6) (= (mod (+ (* v_main_~y~0_230 3) 1) 4) 0) (= (+ (* v_main_~y~0_230 (- 3)) (* (- 5) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 25) (+ main_~x~0 (* (- 1) v_main_~y~0_230) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4)))))) (= 5 main_~n~0))} is VALID [2022-04-28 11:21:47,654 INFO L290 TraceCheckUtils]: 147: Hoare triple {21666#(and (exists ((v_main_~y~0_230 Int)) (and (= (+ (* (- 2) v_main_~y~0_230) (* (- 3) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 17) 6) (= (mod (+ (* v_main_~y~0_230 3) 1) 4) 0) (= (+ (* v_main_~y~0_230 (- 3)) (* (- 5) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 25) (+ main_~x~0 (* (- 1) v_main_~y~0_230) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4)))))) (= 5 main_~n~0))} assume !false; {21666#(and (exists ((v_main_~y~0_230 Int)) (and (= (+ (* (- 2) v_main_~y~0_230) (* (- 3) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 17) 6) (= (mod (+ (* v_main_~y~0_230 3) 1) 4) 0) (= (+ (* v_main_~y~0_230 (- 3)) (* (- 5) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 25) (+ main_~x~0 (* (- 1) v_main_~y~0_230) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4)))))) (= 5 main_~n~0))} is VALID [2022-04-28 11:21:47,654 INFO L272 TraceCheckUtils]: 148: Hoare triple {21666#(and (exists ((v_main_~y~0_230 Int)) (and (= (+ (* (- 2) v_main_~y~0_230) (* (- 3) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 17) 6) (= (mod (+ (* v_main_~y~0_230 3) 1) 4) 0) (= (+ (* v_main_~y~0_230 (- 3)) (* (- 5) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 25) (+ main_~x~0 (* (- 1) v_main_~y~0_230) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4)))))) (= 5 main_~n~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,654 INFO L290 TraceCheckUtils]: 149: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,654 INFO L290 TraceCheckUtils]: 150: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,654 INFO L290 TraceCheckUtils]: 151: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,654 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {21218#true} {21666#(and (exists ((v_main_~y~0_230 Int)) (and (= (+ (* (- 2) v_main_~y~0_230) (* (- 3) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 17) 6) (= (mod (+ (* v_main_~y~0_230 3) 1) 4) 0) (= (+ (* v_main_~y~0_230 (- 3)) (* (- 5) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 25) (+ main_~x~0 (* (- 1) v_main_~y~0_230) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4)))))) (= 5 main_~n~0))} #62#return; {21666#(and (exists ((v_main_~y~0_230 Int)) (and (= (+ (* (- 2) v_main_~y~0_230) (* (- 3) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 17) 6) (= (mod (+ (* v_main_~y~0_230 3) 1) 4) 0) (= (+ (* v_main_~y~0_230 (- 3)) (* (- 5) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 25) (+ main_~x~0 (* (- 1) v_main_~y~0_230) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4)))))) (= 5 main_~n~0))} is VALID [2022-04-28 11:21:47,654 INFO L272 TraceCheckUtils]: 153: Hoare triple {21666#(and (exists ((v_main_~y~0_230 Int)) (and (= (+ (* (- 2) v_main_~y~0_230) (* (- 3) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 17) 6) (= (mod (+ (* v_main_~y~0_230 3) 1) 4) 0) (= (+ (* v_main_~y~0_230 (- 3)) (* (- 5) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 25) (+ main_~x~0 (* (- 1) v_main_~y~0_230) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4)))))) (= 5 main_~n~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:47,655 INFO L290 TraceCheckUtils]: 154: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:47,655 INFO L290 TraceCheckUtils]: 155: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:47,655 INFO L290 TraceCheckUtils]: 156: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:47,655 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {21218#true} {21666#(and (exists ((v_main_~y~0_230 Int)) (and (= (+ (* (- 2) v_main_~y~0_230) (* (- 3) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 17) 6) (= (mod (+ (* v_main_~y~0_230 3) 1) 4) 0) (= (+ (* v_main_~y~0_230 (- 3)) (* (- 5) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 25) (+ main_~x~0 (* (- 1) v_main_~y~0_230) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4)))))) (= 5 main_~n~0))} #64#return; {21666#(and (exists ((v_main_~y~0_230 Int)) (and (= (+ (* (- 2) v_main_~y~0_230) (* (- 3) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 17) 6) (= (mod (+ (* v_main_~y~0_230 3) 1) 4) 0) (= (+ (* v_main_~y~0_230 (- 3)) (* (- 5) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 25) (+ main_~x~0 (* (- 1) v_main_~y~0_230) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4)))))) (= 5 main_~n~0))} is VALID [2022-04-28 11:21:47,656 INFO L272 TraceCheckUtils]: 158: Hoare triple {21666#(and (exists ((v_main_~y~0_230 Int)) (and (= (+ (* (- 2) v_main_~y~0_230) (* (- 3) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 17) 6) (= (mod (+ (* v_main_~y~0_230 3) 1) 4) 0) (= (+ (* v_main_~y~0_230 (- 3)) (* (- 5) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4))) 25) (+ main_~x~0 (* (- 1) v_main_~y~0_230) (div (+ (* v_main_~y~0_230 3) (- 35)) (- 4)))))) (= 5 main_~n~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21703#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:21:47,656 INFO L290 TraceCheckUtils]: 159: Hoare triple {21703#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21707#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:47,657 INFO L290 TraceCheckUtils]: 160: Hoare triple {21707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21219#false} is VALID [2022-04-28 11:21:47,657 INFO L290 TraceCheckUtils]: 161: Hoare triple {21219#false} assume !false; {21219#false} is VALID [2022-04-28 11:21:47,657 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:21:47,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:21:48,257 INFO L290 TraceCheckUtils]: 161: Hoare triple {21219#false} assume !false; {21219#false} is VALID [2022-04-28 11:21:48,258 INFO L290 TraceCheckUtils]: 160: Hoare triple {21707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21219#false} is VALID [2022-04-28 11:21:48,258 INFO L290 TraceCheckUtils]: 159: Hoare triple {21703#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21707#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:48,259 INFO L272 TraceCheckUtils]: 158: Hoare triple {21723#(= (* 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)); {21703#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:21:48,259 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {21218#true} {21723#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {21723#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:21:48,259 INFO L290 TraceCheckUtils]: 156: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,259 INFO L290 TraceCheckUtils]: 155: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,259 INFO L290 TraceCheckUtils]: 154: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,259 INFO L272 TraceCheckUtils]: 153: Hoare triple {21723#(= (* 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)); {21218#true} is VALID [2022-04-28 11:21:48,260 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {21218#true} {21723#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {21723#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:21:48,260 INFO L290 TraceCheckUtils]: 151: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,260 INFO L290 TraceCheckUtils]: 150: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,260 INFO L290 TraceCheckUtils]: 149: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,260 INFO L272 TraceCheckUtils]: 148: Hoare triple {21723#(= (* 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)); {21218#true} is VALID [2022-04-28 11:21:48,260 INFO L290 TraceCheckUtils]: 147: Hoare triple {21723#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {21723#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:21:48,262 INFO L290 TraceCheckUtils]: 146: Hoare triple {21760#(= (* (+ 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; {21723#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:21:48,262 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {21218#true} {21760#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {21760#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:21:48,262 INFO L290 TraceCheckUtils]: 144: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,262 INFO L290 TraceCheckUtils]: 143: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,262 INFO L290 TraceCheckUtils]: 142: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,263 INFO L272 TraceCheckUtils]: 141: Hoare triple {21760#(= (* (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,263 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {21218#true} {21760#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {21760#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:21:48,263 INFO L290 TraceCheckUtils]: 139: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,263 INFO L290 TraceCheckUtils]: 138: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,263 INFO L290 TraceCheckUtils]: 137: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,263 INFO L272 TraceCheckUtils]: 136: Hoare triple {21760#(= (* (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,264 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {21218#true} {21760#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {21760#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:21:48,264 INFO L290 TraceCheckUtils]: 134: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,264 INFO L290 TraceCheckUtils]: 133: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,264 INFO L290 TraceCheckUtils]: 132: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,264 INFO L272 TraceCheckUtils]: 131: Hoare triple {21760#(= (* (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,264 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {21218#true} {21760#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {21760#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:21:48,264 INFO L290 TraceCheckUtils]: 129: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,265 INFO L290 TraceCheckUtils]: 128: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,265 INFO L290 TraceCheckUtils]: 127: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,265 INFO L272 TraceCheckUtils]: 126: Hoare triple {21760#(= (* (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,265 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {21218#true} {21760#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {21760#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:21:48,265 INFO L290 TraceCheckUtils]: 124: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,265 INFO L290 TraceCheckUtils]: 123: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,265 INFO L290 TraceCheckUtils]: 122: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,265 INFO L272 TraceCheckUtils]: 121: Hoare triple {21760#(= (* (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,266 INFO L290 TraceCheckUtils]: 120: Hoare triple {21760#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {21760#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:21:48,269 INFO L290 TraceCheckUtils]: 119: Hoare triple {21842#(= (+ 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; {21760#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:21:48,269 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21218#true} {21842#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {21842#(= (+ 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:21:48,269 INFO L290 TraceCheckUtils]: 117: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,269 INFO L290 TraceCheckUtils]: 116: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,269 INFO L290 TraceCheckUtils]: 115: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,269 INFO L272 TraceCheckUtils]: 114: Hoare triple {21842#(= (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,270 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {21218#true} {21842#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {21842#(= (+ 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:21:48,270 INFO L290 TraceCheckUtils]: 112: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,270 INFO L290 TraceCheckUtils]: 111: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,270 INFO L290 TraceCheckUtils]: 110: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,270 INFO L272 TraceCheckUtils]: 109: Hoare triple {21842#(= (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,271 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {21218#true} {21842#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {21842#(= (+ 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:21:48,271 INFO L290 TraceCheckUtils]: 107: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,271 INFO L290 TraceCheckUtils]: 106: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,271 INFO L290 TraceCheckUtils]: 105: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,271 INFO L272 TraceCheckUtils]: 104: Hoare triple {21842#(= (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,271 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {21218#true} {21842#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {21842#(= (+ 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:21:48,271 INFO L290 TraceCheckUtils]: 102: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,271 INFO L290 TraceCheckUtils]: 101: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,271 INFO L290 TraceCheckUtils]: 100: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,272 INFO L272 TraceCheckUtils]: 99: Hoare triple {21842#(= (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,272 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {21218#true} {21842#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {21842#(= (+ 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:21:48,272 INFO L290 TraceCheckUtils]: 97: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,272 INFO L290 TraceCheckUtils]: 96: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,272 INFO L290 TraceCheckUtils]: 95: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,272 INFO L272 TraceCheckUtils]: 94: Hoare triple {21842#(= (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,273 INFO L290 TraceCheckUtils]: 93: Hoare triple {21842#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {21842#(= (+ 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:21:48,276 INFO L290 TraceCheckUtils]: 92: Hoare triple {21924#(= (+ 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; {21842#(= (+ 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:21:48,276 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21218#true} {21924#(= (+ 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; {21924#(= (+ 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:21:48,276 INFO L290 TraceCheckUtils]: 90: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,276 INFO L290 TraceCheckUtils]: 89: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,276 INFO L290 TraceCheckUtils]: 88: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,276 INFO L272 TraceCheckUtils]: 87: Hoare triple {21924#(= (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,277 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21218#true} {21924#(= (+ 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; {21924#(= (+ 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:21:48,277 INFO L290 TraceCheckUtils]: 85: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,277 INFO L290 TraceCheckUtils]: 84: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,277 INFO L290 TraceCheckUtils]: 83: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,277 INFO L272 TraceCheckUtils]: 82: Hoare triple {21924#(= (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,278 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {21218#true} {21924#(= (+ 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; {21924#(= (+ 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:21:48,278 INFO L290 TraceCheckUtils]: 80: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,278 INFO L290 TraceCheckUtils]: 79: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,278 INFO L290 TraceCheckUtils]: 78: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,278 INFO L272 TraceCheckUtils]: 77: Hoare triple {21924#(= (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,278 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {21218#true} {21924#(= (+ 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; {21924#(= (+ 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:21:48,278 INFO L290 TraceCheckUtils]: 75: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,278 INFO L290 TraceCheckUtils]: 74: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,279 INFO L290 TraceCheckUtils]: 73: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,279 INFO L272 TraceCheckUtils]: 72: Hoare triple {21924#(= (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,279 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21218#true} {21924#(= (+ 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; {21924#(= (+ 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:21:48,279 INFO L290 TraceCheckUtils]: 70: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,279 INFO L290 TraceCheckUtils]: 69: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,279 INFO L290 TraceCheckUtils]: 68: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,279 INFO L272 TraceCheckUtils]: 67: Hoare triple {21924#(= (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,280 INFO L290 TraceCheckUtils]: 66: Hoare triple {21924#(= (+ 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; {21924#(= (+ 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:21:48,282 INFO L290 TraceCheckUtils]: 65: Hoare triple {22006#(= (+ 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; {21924#(= (+ 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:21:48,282 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21218#true} {22006#(= (+ 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; {22006#(= (+ 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:21:48,282 INFO L290 TraceCheckUtils]: 63: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,282 INFO L272 TraceCheckUtils]: 60: Hoare triple {22006#(= (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,283 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21218#true} {22006#(= (+ 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; {22006#(= (+ 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:21:48,283 INFO L290 TraceCheckUtils]: 58: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,283 INFO L290 TraceCheckUtils]: 57: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,283 INFO L290 TraceCheckUtils]: 56: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,283 INFO L272 TraceCheckUtils]: 55: Hoare triple {22006#(= (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,284 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21218#true} {22006#(= (+ 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; {22006#(= (+ 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:21:48,284 INFO L290 TraceCheckUtils]: 53: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,284 INFO L272 TraceCheckUtils]: 50: Hoare triple {22006#(= (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,284 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {21218#true} {22006#(= (+ 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; {22006#(= (+ 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:21:48,284 INFO L290 TraceCheckUtils]: 48: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,284 INFO L290 TraceCheckUtils]: 47: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,284 INFO L290 TraceCheckUtils]: 46: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,284 INFO L272 TraceCheckUtils]: 45: Hoare triple {22006#(= (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,285 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {21218#true} {22006#(= (+ 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; {22006#(= (+ 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:21:48,285 INFO L290 TraceCheckUtils]: 43: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,285 INFO L272 TraceCheckUtils]: 40: Hoare triple {22006#(= (+ 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)); {21218#true} is VALID [2022-04-28 11:21:48,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {22006#(= (+ 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; {22006#(= (+ 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:21:48,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {22088#(= (+ (* 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; {22006#(= (+ 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:21:48,288 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {21218#true} {22088#(= (+ (* 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; {22088#(= (+ (* 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:21:48,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,288 INFO L272 TraceCheckUtils]: 33: Hoare triple {22088#(= (+ (* 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)); {21218#true} is VALID [2022-04-28 11:21:48,291 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21218#true} {22088#(= (+ (* 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; {22088#(= (+ (* 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:21:48,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,292 INFO L272 TraceCheckUtils]: 28: Hoare triple {22088#(= (+ (* 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)); {21218#true} is VALID [2022-04-28 11:21:48,292 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {21218#true} {22088#(= (+ (* 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; {22088#(= (+ (* 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:21:48,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,292 INFO L272 TraceCheckUtils]: 23: Hoare triple {22088#(= (+ (* 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)); {21218#true} is VALID [2022-04-28 11:21:48,293 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21218#true} {22088#(= (+ (* 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; {22088#(= (+ (* 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:21:48,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,293 INFO L272 TraceCheckUtils]: 18: Hoare triple {22088#(= (+ (* 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)); {21218#true} is VALID [2022-04-28 11:21:48,293 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21218#true} {22088#(= (+ (* 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; {22088#(= (+ (* 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:21:48,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,294 INFO L272 TraceCheckUtils]: 13: Hoare triple {22088#(= (+ (* 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)); {21218#true} is VALID [2022-04-28 11:21:48,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {22088#(= (+ (* 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; {22088#(= (+ (* 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:21:48,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {21218#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {22088#(= (+ (* 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:21:48,295 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21218#true} {21218#true} #60#return; {21218#true} is VALID [2022-04-28 11:21:48,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {21218#true} assume !(0 == ~cond); {21218#true} is VALID [2022-04-28 11:21:48,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {21218#true} ~cond := #in~cond; {21218#true} is VALID [2022-04-28 11:21:48,295 INFO L272 TraceCheckUtils]: 6: Hoare triple {21218#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {21218#true} is VALID [2022-04-28 11:21:48,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {21218#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; {21218#true} is VALID [2022-04-28 11:21:48,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {21218#true} call #t~ret5 := main(); {21218#true} is VALID [2022-04-28 11:21:48,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21218#true} {21218#true} #84#return; {21218#true} is VALID [2022-04-28 11:21:48,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-28 11:21:48,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {21218#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); {21218#true} is VALID [2022-04-28 11:21:48,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {21218#true} call ULTIMATE.init(); {21218#true} is VALID [2022-04-28 11:21:48,296 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:21:48,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:21:48,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376047804] [2022-04-28 11:21:48,296 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:21:48,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181066338] [2022-04-28 11:21:48,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181066338] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:21:48,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:21:48,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-28 11:21:48,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:21:48,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [389415224] [2022-04-28 11:21:48,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [389415224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:21:48,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:21:48,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:21:48,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466585809] [2022-04-28 11:21:48,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:21:48,297 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:21:48,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:21:48,298 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:21:48,384 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:21:48,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:21:48,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:48,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:21:48,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:21:48,385 INFO L87 Difference]: Start difference. First operand 167 states and 174 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:21:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:52,018 INFO L93 Difference]: Finished difference Result 190 states and 206 transitions. [2022-04-28 11:21:52,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:21:52,018 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:21:52,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:21:52,019 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:21:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2022-04-28 11:21:52,020 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:21:52,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2022-04-28 11:21:52,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 125 transitions. [2022-04-28 11:21:52,176 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:21:52,179 INFO L225 Difference]: With dead ends: 190 [2022-04-28 11:21:52,179 INFO L226 Difference]: Without dead ends: 188 [2022-04-28 11:21:52,179 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:21:52,179 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 6 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 11:21:52,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 325 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 452 Invalid, 0 Unknown, 104 Unchecked, 1.7s Time] [2022-04-28 11:21:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-04-28 11:21:52,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2022-04-28 11:21:52,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:21:52,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 182 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 42 states have call successors, (42), 32 states have call predecessors, (42), 31 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:21:52,373 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 182 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 42 states have call successors, (42), 32 states have call predecessors, (42), 31 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:21:52,373 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 182 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 42 states have call successors, (42), 32 states have call predecessors, (42), 31 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:21:52,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:52,380 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2022-04-28 11:21:52,380 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2022-04-28 11:21:52,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:52,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:52,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 42 states have call successors, (42), 32 states have call predecessors, (42), 31 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 188 states. [2022-04-28 11:21:52,388 INFO L87 Difference]: Start difference. First operand has 182 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 42 states have call successors, (42), 32 states have call predecessors, (42), 31 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 188 states. [2022-04-28 11:21:52,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:52,391 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2022-04-28 11:21:52,391 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2022-04-28 11:21:52,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:52,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:52,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:21:52,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:21:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 42 states have call successors, (42), 32 states have call predecessors, (42), 31 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:21:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2022-04-28 11:21:52,395 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 162 [2022-04-28 11:21:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:21:52,395 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2022-04-28 11:21:52,395 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:21:52,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 193 transitions. [2022-04-28 11:21:55,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 192 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2022-04-28 11:21:55,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-04-28 11:21:55,203 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:21:55,204 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:21:55,222 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:21:55,420 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:21:55,420 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:21:55,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:21:55,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1267842796, now seen corresponding path program 1 times [2022-04-28 11:21:55,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:55,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2038165745] [2022-04-28 11:21:55,619 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:21:55,619 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:21:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1267842796, now seen corresponding path program 2 times [2022-04-28 11:21:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:21:55,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690511492] [2022-04-28 11:21:55,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:21:55,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:21:55,634 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:21:55,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1734691096] [2022-04-28 11:21:55,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:21:55,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:21:55,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:21:55,636 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:21:55,636 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:21:55,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:21:55,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:21:55,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 11:21:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:21:55,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:21:57,630 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:21:57,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {23327#true} call ULTIMATE.init(); {23327#true} is VALID [2022-04-28 11:21:57,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {23327#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); {23327#true} is VALID [2022-04-28 11:21:57,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23327#true} {23327#true} #84#return; {23327#true} is VALID [2022-04-28 11:21:57,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {23327#true} call #t~ret5 := main(); {23327#true} is VALID [2022-04-28 11:21:57,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {23327#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; {23327#true} is VALID [2022-04-28 11:21:57,687 INFO L272 TraceCheckUtils]: 6: Hoare triple {23327#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {23327#true} is VALID [2022-04-28 11:21:57,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,688 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23327#true} {23327#true} #60#return; {23327#true} is VALID [2022-04-28 11:21:57,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {23327#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {23365#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:57,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {23365#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {23365#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:57,688 INFO L272 TraceCheckUtils]: 13: Hoare triple {23365#(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)); {23327#true} is VALID [2022-04-28 11:21:57,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,689 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {23327#true} {23365#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {23365#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:57,689 INFO L272 TraceCheckUtils]: 18: Hoare triple {23365#(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)); {23327#true} is VALID [2022-04-28 11:21:57,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,690 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {23327#true} {23365#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {23365#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:57,690 INFO L272 TraceCheckUtils]: 23: Hoare triple {23365#(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)); {23327#true} is VALID [2022-04-28 11:21:57,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,690 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {23327#true} {23365#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {23365#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:57,691 INFO L272 TraceCheckUtils]: 28: Hoare triple {23365#(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)); {23327#true} is VALID [2022-04-28 11:21:57,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,691 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23327#true} {23365#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {23365#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:57,691 INFO L272 TraceCheckUtils]: 33: Hoare triple {23365#(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)); {23327#true} is VALID [2022-04-28 11:21:57,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,691 INFO L290 TraceCheckUtils]: 35: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,692 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23327#true} {23365#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {23365#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:21:57,692 INFO L290 TraceCheckUtils]: 38: Hoare triple {23365#(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; {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 11:21:57,693 INFO L290 TraceCheckUtils]: 39: Hoare triple {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} assume !false; {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 11:21:57,693 INFO L272 TraceCheckUtils]: 40: Hoare triple {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ 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)); {23327#true} is VALID [2022-04-28 11:21:57,693 INFO L290 TraceCheckUtils]: 41: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,693 INFO L290 TraceCheckUtils]: 42: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,693 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {23327#true} {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #62#return; {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 11:21:57,693 INFO L272 TraceCheckUtils]: 45: Hoare triple {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ 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)); {23327#true} is VALID [2022-04-28 11:21:57,694 INFO L290 TraceCheckUtils]: 46: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,694 INFO L290 TraceCheckUtils]: 47: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,694 INFO L290 TraceCheckUtils]: 48: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,694 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {23327#true} {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #64#return; {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 11:21:57,694 INFO L272 TraceCheckUtils]: 50: Hoare triple {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ 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)); {23327#true} is VALID [2022-04-28 11:21:57,694 INFO L290 TraceCheckUtils]: 51: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,694 INFO L290 TraceCheckUtils]: 52: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,694 INFO L290 TraceCheckUtils]: 53: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,695 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {23327#true} {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #66#return; {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 11:21:57,695 INFO L272 TraceCheckUtils]: 55: Hoare triple {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ 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)); {23327#true} is VALID [2022-04-28 11:21:57,695 INFO L290 TraceCheckUtils]: 56: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,695 INFO L290 TraceCheckUtils]: 57: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,695 INFO L290 TraceCheckUtils]: 58: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,695 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23327#true} {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #68#return; {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 11:21:57,696 INFO L272 TraceCheckUtils]: 60: Hoare triple {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ 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)); {23327#true} is VALID [2022-04-28 11:21:57,696 INFO L290 TraceCheckUtils]: 61: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,696 INFO L290 TraceCheckUtils]: 62: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,696 INFO L290 TraceCheckUtils]: 63: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,696 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {23327#true} {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #70#return; {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 11:21:57,697 INFO L290 TraceCheckUtils]: 65: Hoare triple {23447#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 1 main_~n~0) (= (+ main_~z~0 (- 6)) 6) (= (+ 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; {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-28 11:21:57,698 INFO L290 TraceCheckUtils]: 66: Hoare triple {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} assume !false; {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-28 11:21:57,698 INFO L272 TraceCheckUtils]: 67: Hoare triple {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23327#true} is VALID [2022-04-28 11:21:57,698 INFO L290 TraceCheckUtils]: 68: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,698 INFO L290 TraceCheckUtils]: 69: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,698 INFO L290 TraceCheckUtils]: 70: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,698 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23327#true} {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #62#return; {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-28 11:21:57,698 INFO L272 TraceCheckUtils]: 72: Hoare triple {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23327#true} is VALID [2022-04-28 11:21:57,698 INFO L290 TraceCheckUtils]: 73: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,698 INFO L290 TraceCheckUtils]: 74: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,699 INFO L290 TraceCheckUtils]: 75: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,699 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {23327#true} {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #64#return; {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-28 11:21:57,699 INFO L272 TraceCheckUtils]: 77: Hoare triple {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23327#true} is VALID [2022-04-28 11:21:57,699 INFO L290 TraceCheckUtils]: 78: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,699 INFO L290 TraceCheckUtils]: 79: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,699 INFO L290 TraceCheckUtils]: 80: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,700 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {23327#true} {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #66#return; {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-28 11:21:57,700 INFO L272 TraceCheckUtils]: 82: Hoare triple {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {23327#true} is VALID [2022-04-28 11:21:57,700 INFO L290 TraceCheckUtils]: 83: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,700 INFO L290 TraceCheckUtils]: 84: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,700 INFO L290 TraceCheckUtils]: 85: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,700 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {23327#true} {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #68#return; {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-28 11:21:57,700 INFO L272 TraceCheckUtils]: 87: Hoare triple {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23327#true} is VALID [2022-04-28 11:21:57,700 INFO L290 TraceCheckUtils]: 88: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,701 INFO L290 TraceCheckUtils]: 89: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,701 INFO L290 TraceCheckUtils]: 90: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,701 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {23327#true} {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #70#return; {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-28 11:21:57,702 INFO L290 TraceCheckUtils]: 92: Hoare triple {23529#(and (= main_~z~0 18) (<= 2 main_~n~0) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:21:57,702 INFO L290 TraceCheckUtils]: 93: Hoare triple {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} assume !false; {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:21:57,702 INFO L272 TraceCheckUtils]: 94: Hoare triple {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23327#true} is VALID [2022-04-28 11:21:57,702 INFO L290 TraceCheckUtils]: 95: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,702 INFO L290 TraceCheckUtils]: 96: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,702 INFO L290 TraceCheckUtils]: 97: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,703 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23327#true} {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} #62#return; {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:21:57,703 INFO L272 TraceCheckUtils]: 99: Hoare triple {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23327#true} is VALID [2022-04-28 11:21:57,703 INFO L290 TraceCheckUtils]: 100: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,703 INFO L290 TraceCheckUtils]: 101: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,703 INFO L290 TraceCheckUtils]: 102: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,704 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {23327#true} {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} #64#return; {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:21:57,704 INFO L272 TraceCheckUtils]: 104: Hoare triple {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23327#true} is VALID [2022-04-28 11:21:57,704 INFO L290 TraceCheckUtils]: 105: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,704 INFO L290 TraceCheckUtils]: 106: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,704 INFO L290 TraceCheckUtils]: 107: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,704 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {23327#true} {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} #66#return; {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:21:57,704 INFO L272 TraceCheckUtils]: 109: Hoare triple {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {23327#true} is VALID [2022-04-28 11:21:57,704 INFO L290 TraceCheckUtils]: 110: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,705 INFO L290 TraceCheckUtils]: 111: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,705 INFO L290 TraceCheckUtils]: 112: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,705 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {23327#true} {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} #68#return; {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:21:57,705 INFO L272 TraceCheckUtils]: 114: Hoare triple {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23327#true} is VALID [2022-04-28 11:21:57,705 INFO L290 TraceCheckUtils]: 115: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,705 INFO L290 TraceCheckUtils]: 116: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,705 INFO L290 TraceCheckUtils]: 117: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,706 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {23327#true} {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} #70#return; {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:21:57,706 INFO L290 TraceCheckUtils]: 119: Hoare triple {23611#(and (= (+ (* (- 2) main_~z~0) (* main_~y~0 2) (- 18)) (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0))) (<= 3 main_~n~0) (= (+ main_~y~0 (* (- 1) main_~z~0) (- 12)) 1) (= (+ main_~z~0 (- 6)) 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; {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} is VALID [2022-04-28 11:21:57,707 INFO L290 TraceCheckUtils]: 120: Hoare triple {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} assume !false; {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} is VALID [2022-04-28 11:21:57,707 INFO L272 TraceCheckUtils]: 121: Hoare triple {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23327#true} is VALID [2022-04-28 11:21:57,707 INFO L290 TraceCheckUtils]: 122: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,707 INFO L290 TraceCheckUtils]: 123: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,707 INFO L290 TraceCheckUtils]: 124: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,707 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {23327#true} {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} #62#return; {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} is VALID [2022-04-28 11:21:57,707 INFO L272 TraceCheckUtils]: 126: Hoare triple {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23327#true} is VALID [2022-04-28 11:21:57,708 INFO L290 TraceCheckUtils]: 127: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,708 INFO L290 TraceCheckUtils]: 128: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,708 INFO L290 TraceCheckUtils]: 129: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,708 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {23327#true} {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} #64#return; {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} is VALID [2022-04-28 11:21:57,708 INFO L272 TraceCheckUtils]: 131: Hoare triple {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23327#true} is VALID [2022-04-28 11:21:57,708 INFO L290 TraceCheckUtils]: 132: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,708 INFO L290 TraceCheckUtils]: 133: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,708 INFO L290 TraceCheckUtils]: 134: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,709 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {23327#true} {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} #66#return; {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} is VALID [2022-04-28 11:21:57,709 INFO L272 TraceCheckUtils]: 136: Hoare triple {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 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)); {23327#true} is VALID [2022-04-28 11:21:57,709 INFO L290 TraceCheckUtils]: 137: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,709 INFO L290 TraceCheckUtils]: 138: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,709 INFO L290 TraceCheckUtils]: 139: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,710 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {23327#true} {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} #68#return; {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} is VALID [2022-04-28 11:21:57,710 INFO L272 TraceCheckUtils]: 141: Hoare triple {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23327#true} is VALID [2022-04-28 11:21:57,710 INFO L290 TraceCheckUtils]: 142: Hoare triple {23327#true} ~cond := #in~cond; {23763#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:57,710 INFO L290 TraceCheckUtils]: 143: Hoare triple {23763#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23767#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:57,710 INFO L290 TraceCheckUtils]: 144: Hoare triple {23767#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23767#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:57,711 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {23767#(not (= |__VERIFIER_assert_#in~cond| 0))} {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} #70#return; {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} is VALID [2022-04-28 11:21:57,711 INFO L290 TraceCheckUtils]: 146: Hoare triple {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} assume !(~n~0 <= ~a~0); {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} is VALID [2022-04-28 11:21:57,711 INFO L272 TraceCheckUtils]: 147: Hoare triple {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23327#true} is VALID [2022-04-28 11:21:57,711 INFO L290 TraceCheckUtils]: 148: Hoare triple {23327#true} ~cond := #in~cond; {23327#true} is VALID [2022-04-28 11:21:57,711 INFO L290 TraceCheckUtils]: 149: Hoare triple {23327#true} assume !(0 == ~cond); {23327#true} is VALID [2022-04-28 11:21:57,712 INFO L290 TraceCheckUtils]: 150: Hoare triple {23327#true} assume true; {23327#true} is VALID [2022-04-28 11:21:57,712 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {23327#true} {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} #72#return; {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} is VALID [2022-04-28 11:21:57,712 INFO L272 TraceCheckUtils]: 152: Hoare triple {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 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)); {23327#true} is VALID [2022-04-28 11:21:57,712 INFO L290 TraceCheckUtils]: 153: Hoare triple {23327#true} ~cond := #in~cond; {23763#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:57,713 INFO L290 TraceCheckUtils]: 154: Hoare triple {23763#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23767#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:57,713 INFO L290 TraceCheckUtils]: 155: Hoare triple {23767#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23767#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:57,713 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {23767#(not (= |__VERIFIER_assert_#in~cond| 0))} {23693#(and (<= 3 main_~a~0) (= (+ main_~x~0 (- 56)) 8) (= main_~y~0 61) (= 30 main_~z~0))} #74#return; {23807#(and (= main_~y~0 61) (= 64 main_~x~0) (= 30 main_~z~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-28 11:21:57,714 INFO L272 TraceCheckUtils]: 157: Hoare triple {23807#(and (= main_~y~0 61) (= 64 main_~x~0) (= 30 main_~z~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)); {23327#true} is VALID [2022-04-28 11:21:57,714 INFO L290 TraceCheckUtils]: 158: Hoare triple {23327#true} ~cond := #in~cond; {23763#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:57,714 INFO L290 TraceCheckUtils]: 159: Hoare triple {23763#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23767#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:57,714 INFO L290 TraceCheckUtils]: 160: Hoare triple {23767#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23767#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:57,715 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {23767#(not (= |__VERIFIER_assert_#in~cond| 0))} {23807#(and (= main_~y~0 61) (= 64 main_~x~0) (= 30 main_~z~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #76#return; {23823#(and (= main_~y~0 61) (= 64 main_~x~0) (= 30 main_~z~0))} is VALID [2022-04-28 11:21:57,715 INFO L272 TraceCheckUtils]: 162: Hoare triple {23823#(and (= main_~y~0 61) (= 64 main_~x~0) (= 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)); {23827#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:21:57,720 INFO L290 TraceCheckUtils]: 163: Hoare triple {23827#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23831#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:57,720 INFO L290 TraceCheckUtils]: 164: Hoare triple {23831#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23328#false} is VALID [2022-04-28 11:21:57,720 INFO L290 TraceCheckUtils]: 165: Hoare triple {23328#false} assume !false; {23328#false} is VALID [2022-04-28 11:21:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2022-04-28 11:21:57,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:22:24,364 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:23:08,690 WARN L232 SmtUtils]: Spent 34.02s on a formula simplification. DAG size of input: 65 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 11:23:16,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:23:16,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690511492] [2022-04-28 11:23:16,713 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:23:16,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734691096] [2022-04-28 11:23:16,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734691096] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:23:16,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:23:16,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 11:23:16,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:23:16,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2038165745] [2022-04-28 11:23:16,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2038165745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:16,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:16,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 11:23:16,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099229972] [2022-04-28 11:23:16,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:23:16,714 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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), 7 states have call successors, (30) Word has length 166 [2022-04-28 11:23:16,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:23:16,714 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), 10 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), 7 states have call successors, (30) [2022-04-28 11:23:16,799 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:23:16,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 11:23:16,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:16,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 11:23:16,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=258, Unknown=1, NotChecked=0, Total=342 [2022-04-28 11:23:16,800 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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), 7 states have call successors, (30) [2022-04-28 11:23:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:19,581 INFO L93 Difference]: Finished difference Result 206 states and 218 transitions. [2022-04-28 11:23:19,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:23:19,581 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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), 7 states have call successors, (30) Word has length 166 [2022-04-28 11:23:19,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:23:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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), 7 states have call successors, (30) [2022-04-28 11:23:19,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2022-04-28 11:23:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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), 7 states have call successors, (30) [2022-04-28 11:23:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2022-04-28 11:23:19,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 118 transitions. [2022-04-28 11:23:19,708 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:23:19,710 INFO L225 Difference]: With dead ends: 206 [2022-04-28 11:23:19,710 INFO L226 Difference]: Without dead ends: 190 [2022-04-28 11:23:19,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=96, Invalid=323, Unknown=1, NotChecked=0, Total=420 [2022-04-28 11:23:19,711 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:23:19,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 205 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 11:23:19,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-04-28 11:23:19,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-04-28 11:23:19,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:23:19,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand has 190 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 42 states have call successors, (42), 34 states have call predecessors, (42), 33 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:23:19,931 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand has 190 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 42 states have call successors, (42), 34 states have call predecessors, (42), 33 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:23:19,931 INFO L87 Difference]: Start difference. First operand 190 states. Second operand has 190 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 42 states have call successors, (42), 34 states have call predecessors, (42), 33 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:23:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:19,934 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2022-04-28 11:23:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 198 transitions. [2022-04-28 11:23:19,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:19,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:19,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 42 states have call successors, (42), 34 states have call predecessors, (42), 33 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 190 states. [2022-04-28 11:23:19,935 INFO L87 Difference]: Start difference. First operand has 190 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 42 states have call successors, (42), 34 states have call predecessors, (42), 33 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 190 states. [2022-04-28 11:23:19,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:19,937 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2022-04-28 11:23:19,937 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 198 transitions. [2022-04-28 11:23:19,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:19,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:19,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:23:19,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:23:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 42 states have call successors, (42), 34 states have call predecessors, (42), 33 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:23:19,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 198 transitions. [2022-04-28 11:23:19,940 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 198 transitions. Word has length 166 [2022-04-28 11:23:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:23:19,940 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 198 transitions. [2022-04-28 11:23:19,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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), 7 states have call successors, (30) [2022-04-28 11:23:19,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 198 transitions. [2022-04-28 11:23:24,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 196 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 198 transitions. [2022-04-28 11:23:24,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-04-28 11:23:24,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:23:24,908 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:23:24,926 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:23:25,119 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:23:25,119 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:23:25,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:23:25,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1777251365, now seen corresponding path program 23 times [2022-04-28 11:23:25,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:25,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1778183483] [2022-04-28 11:23:25,361 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:23:25,361 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:23:25,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1777251365, now seen corresponding path program 24 times [2022-04-28 11:23:25,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:23:25,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580836052] [2022-04-28 11:23:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:23:25,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:23:25,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:23:25,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401230074] [2022-04-28 11:23:25,380 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:23:25,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:23:25,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:23:25,381 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:23:25,382 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:23:25,478 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:23:25,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:23:25,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 11:23:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:25,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:23:26,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {25163#true} call ULTIMATE.init(); {25163#true} is VALID [2022-04-28 11:23:26,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {25163#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); {25163#true} is VALID [2022-04-28 11:23:26,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25163#true} {25163#true} #84#return; {25163#true} is VALID [2022-04-28 11:23:26,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {25163#true} call #t~ret5 := main(); {25163#true} is VALID [2022-04-28 11:23:26,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {25163#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; {25163#true} is VALID [2022-04-28 11:23:26,184 INFO L272 TraceCheckUtils]: 6: Hoare triple {25163#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,184 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25163#true} {25163#true} #60#return; {25163#true} is VALID [2022-04-28 11:23:26,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {25163#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {25163#true} is VALID [2022-04-28 11:23:26,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {25163#true} assume !false; {25163#true} is VALID [2022-04-28 11:23:26,185 INFO L272 TraceCheckUtils]: 13: Hoare triple {25163#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,185 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25163#true} {25163#true} #62#return; {25163#true} is VALID [2022-04-28 11:23:26,185 INFO L272 TraceCheckUtils]: 18: Hoare triple {25163#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,185 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {25163#true} {25163#true} #64#return; {25163#true} is VALID [2022-04-28 11:23:26,185 INFO L272 TraceCheckUtils]: 23: Hoare triple {25163#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,185 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25163#true} {25163#true} #66#return; {25163#true} is VALID [2022-04-28 11:23:26,186 INFO L272 TraceCheckUtils]: 28: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,186 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25163#true} {25163#true} #68#return; {25163#true} is VALID [2022-04-28 11:23:26,186 INFO L272 TraceCheckUtils]: 33: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,186 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25163#true} {25163#true} #70#return; {25163#true} is VALID [2022-04-28 11:23:26,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {25163#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; {25163#true} is VALID [2022-04-28 11:23:26,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {25163#true} assume !false; {25163#true} is VALID [2022-04-28 11:23:26,186 INFO L272 TraceCheckUtils]: 40: Hoare triple {25163#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,187 INFO L290 TraceCheckUtils]: 43: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,187 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {25163#true} {25163#true} #62#return; {25163#true} is VALID [2022-04-28 11:23:26,187 INFO L272 TraceCheckUtils]: 45: Hoare triple {25163#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,187 INFO L290 TraceCheckUtils]: 46: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,187 INFO L290 TraceCheckUtils]: 47: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,187 INFO L290 TraceCheckUtils]: 48: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,187 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {25163#true} {25163#true} #64#return; {25163#true} is VALID [2022-04-28 11:23:26,187 INFO L272 TraceCheckUtils]: 50: Hoare triple {25163#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,187 INFO L290 TraceCheckUtils]: 51: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,187 INFO L290 TraceCheckUtils]: 52: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,187 INFO L290 TraceCheckUtils]: 53: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,187 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {25163#true} {25163#true} #66#return; {25163#true} is VALID [2022-04-28 11:23:26,187 INFO L272 TraceCheckUtils]: 55: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,187 INFO L290 TraceCheckUtils]: 56: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,188 INFO L290 TraceCheckUtils]: 57: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,188 INFO L290 TraceCheckUtils]: 58: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,188 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25163#true} {25163#true} #68#return; {25163#true} is VALID [2022-04-28 11:23:26,188 INFO L272 TraceCheckUtils]: 60: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,188 INFO L290 TraceCheckUtils]: 61: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,188 INFO L290 TraceCheckUtils]: 62: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,188 INFO L290 TraceCheckUtils]: 63: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,188 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25163#true} {25163#true} #70#return; {25163#true} is VALID [2022-04-28 11:23:26,188 INFO L290 TraceCheckUtils]: 65: Hoare triple {25163#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; {25163#true} is VALID [2022-04-28 11:23:26,188 INFO L290 TraceCheckUtils]: 66: Hoare triple {25163#true} assume !false; {25163#true} is VALID [2022-04-28 11:23:26,188 INFO L272 TraceCheckUtils]: 67: Hoare triple {25163#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,188 INFO L290 TraceCheckUtils]: 68: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,188 INFO L290 TraceCheckUtils]: 69: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,188 INFO L290 TraceCheckUtils]: 70: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,189 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25163#true} {25163#true} #62#return; {25163#true} is VALID [2022-04-28 11:23:26,189 INFO L272 TraceCheckUtils]: 72: Hoare triple {25163#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,189 INFO L290 TraceCheckUtils]: 73: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,189 INFO L290 TraceCheckUtils]: 74: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,189 INFO L290 TraceCheckUtils]: 75: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,189 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {25163#true} {25163#true} #64#return; {25163#true} is VALID [2022-04-28 11:23:26,189 INFO L272 TraceCheckUtils]: 77: Hoare triple {25163#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,189 INFO L290 TraceCheckUtils]: 78: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,189 INFO L290 TraceCheckUtils]: 79: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,189 INFO L290 TraceCheckUtils]: 80: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,189 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25163#true} {25163#true} #66#return; {25163#true} is VALID [2022-04-28 11:23:26,189 INFO L272 TraceCheckUtils]: 82: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,189 INFO L290 TraceCheckUtils]: 83: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,189 INFO L290 TraceCheckUtils]: 84: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,189 INFO L290 TraceCheckUtils]: 85: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,189 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {25163#true} {25163#true} #68#return; {25163#true} is VALID [2022-04-28 11:23:26,190 INFO L272 TraceCheckUtils]: 87: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,190 INFO L290 TraceCheckUtils]: 88: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,190 INFO L290 TraceCheckUtils]: 89: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,190 INFO L290 TraceCheckUtils]: 90: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,190 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {25163#true} {25163#true} #70#return; {25163#true} is VALID [2022-04-28 11:23:26,190 INFO L290 TraceCheckUtils]: 92: Hoare triple {25163#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; {25163#true} is VALID [2022-04-28 11:23:26,190 INFO L290 TraceCheckUtils]: 93: Hoare triple {25163#true} assume !false; {25163#true} is VALID [2022-04-28 11:23:26,190 INFO L272 TraceCheckUtils]: 94: Hoare triple {25163#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,190 INFO L290 TraceCheckUtils]: 95: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,190 INFO L290 TraceCheckUtils]: 96: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,190 INFO L290 TraceCheckUtils]: 97: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,190 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25163#true} {25163#true} #62#return; {25163#true} is VALID [2022-04-28 11:23:26,190 INFO L272 TraceCheckUtils]: 99: Hoare triple {25163#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,190 INFO L290 TraceCheckUtils]: 100: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,191 INFO L290 TraceCheckUtils]: 101: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,191 INFO L290 TraceCheckUtils]: 102: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,191 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25163#true} {25163#true} #64#return; {25163#true} is VALID [2022-04-28 11:23:26,191 INFO L272 TraceCheckUtils]: 104: Hoare triple {25163#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,191 INFO L290 TraceCheckUtils]: 105: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,191 INFO L290 TraceCheckUtils]: 106: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,191 INFO L290 TraceCheckUtils]: 107: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,191 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {25163#true} {25163#true} #66#return; {25163#true} is VALID [2022-04-28 11:23:26,191 INFO L272 TraceCheckUtils]: 109: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,191 INFO L290 TraceCheckUtils]: 110: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,191 INFO L290 TraceCheckUtils]: 111: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,191 INFO L290 TraceCheckUtils]: 112: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,191 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {25163#true} {25163#true} #68#return; {25163#true} is VALID [2022-04-28 11:23:26,191 INFO L272 TraceCheckUtils]: 114: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,191 INFO L290 TraceCheckUtils]: 115: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,192 INFO L290 TraceCheckUtils]: 116: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,192 INFO L290 TraceCheckUtils]: 117: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,192 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {25163#true} {25163#true} #70#return; {25163#true} is VALID [2022-04-28 11:23:26,192 INFO L290 TraceCheckUtils]: 119: Hoare triple {25163#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; {25163#true} is VALID [2022-04-28 11:23:26,192 INFO L290 TraceCheckUtils]: 120: Hoare triple {25163#true} assume !false; {25163#true} is VALID [2022-04-28 11:23:26,192 INFO L272 TraceCheckUtils]: 121: Hoare triple {25163#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,192 INFO L290 TraceCheckUtils]: 122: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,192 INFO L290 TraceCheckUtils]: 123: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,192 INFO L290 TraceCheckUtils]: 124: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,192 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {25163#true} {25163#true} #62#return; {25163#true} is VALID [2022-04-28 11:23:26,192 INFO L272 TraceCheckUtils]: 126: Hoare triple {25163#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,192 INFO L290 TraceCheckUtils]: 127: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,192 INFO L290 TraceCheckUtils]: 128: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,192 INFO L290 TraceCheckUtils]: 129: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,192 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25163#true} {25163#true} #64#return; {25163#true} is VALID [2022-04-28 11:23:26,193 INFO L272 TraceCheckUtils]: 131: Hoare triple {25163#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,193 INFO L290 TraceCheckUtils]: 132: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,193 INFO L290 TraceCheckUtils]: 133: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,193 INFO L290 TraceCheckUtils]: 134: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,193 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25163#true} {25163#true} #66#return; {25163#true} is VALID [2022-04-28 11:23:26,193 INFO L272 TraceCheckUtils]: 136: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,193 INFO L290 TraceCheckUtils]: 137: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,193 INFO L290 TraceCheckUtils]: 138: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,193 INFO L290 TraceCheckUtils]: 139: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,193 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25163#true} {25163#true} #68#return; {25163#true} is VALID [2022-04-28 11:23:26,193 INFO L272 TraceCheckUtils]: 141: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,193 INFO L290 TraceCheckUtils]: 142: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,193 INFO L290 TraceCheckUtils]: 143: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,193 INFO L290 TraceCheckUtils]: 144: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,193 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25163#true} {25163#true} #70#return; {25163#true} is VALID [2022-04-28 11:23:26,194 INFO L290 TraceCheckUtils]: 146: Hoare triple {25163#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; {25163#true} is VALID [2022-04-28 11:23:26,194 INFO L290 TraceCheckUtils]: 147: Hoare triple {25163#true} assume !false; {25163#true} is VALID [2022-04-28 11:23:26,194 INFO L272 TraceCheckUtils]: 148: Hoare triple {25163#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,194 INFO L290 TraceCheckUtils]: 149: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,194 INFO L290 TraceCheckUtils]: 150: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,194 INFO L290 TraceCheckUtils]: 151: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,194 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {25163#true} {25163#true} #62#return; {25163#true} is VALID [2022-04-28 11:23:26,194 INFO L272 TraceCheckUtils]: 153: Hoare triple {25163#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,194 INFO L290 TraceCheckUtils]: 154: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,194 INFO L290 TraceCheckUtils]: 155: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,194 INFO L290 TraceCheckUtils]: 156: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,194 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25163#true} {25163#true} #64#return; {25163#true} is VALID [2022-04-28 11:23:26,194 INFO L272 TraceCheckUtils]: 158: Hoare triple {25163#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,194 INFO L290 TraceCheckUtils]: 159: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:23:26,194 INFO L290 TraceCheckUtils]: 160: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:23:26,195 INFO L290 TraceCheckUtils]: 161: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:23:26,195 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {25163#true} {25163#true} #66#return; {25163#true} is VALID [2022-04-28 11:23:26,195 INFO L272 TraceCheckUtils]: 163: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,195 INFO L290 TraceCheckUtils]: 164: Hoare triple {25163#true} ~cond := #in~cond; {25660#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:26,195 INFO L290 TraceCheckUtils]: 165: Hoare triple {25660#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:26,196 INFO L290 TraceCheckUtils]: 166: Hoare triple {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:26,196 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} {25163#true} #68#return; {25671#(= (+ (* 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:23:26,196 INFO L272 TraceCheckUtils]: 168: Hoare triple {25671#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,196 INFO L290 TraceCheckUtils]: 169: Hoare triple {25163#true} ~cond := #in~cond; {25660#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:26,197 INFO L290 TraceCheckUtils]: 170: Hoare triple {25660#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:26,197 INFO L290 TraceCheckUtils]: 171: Hoare triple {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:26,198 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} {25671#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #70#return; {25687#(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))))} is VALID [2022-04-28 11:23:26,203 INFO L290 TraceCheckUtils]: 173: Hoare triple {25687#(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))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25687#(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))))} is VALID [2022-04-28 11:23:26,203 INFO L290 TraceCheckUtils]: 174: Hoare triple {25687#(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))))} assume !false; {25687#(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))))} is VALID [2022-04-28 11:23:26,203 INFO L272 TraceCheckUtils]: 175: Hoare triple {25687#(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))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,203 INFO L290 TraceCheckUtils]: 176: Hoare triple {25163#true} ~cond := #in~cond; {25660#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:26,204 INFO L290 TraceCheckUtils]: 177: Hoare triple {25660#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:26,204 INFO L290 TraceCheckUtils]: 178: Hoare triple {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:26,208 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} {25687#(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))))} #62#return; {25709#(and (= (+ (* (+ (* main_~n~0 6) 6) (+ (* main_~n~0 6) 6)) 12) (+ (* main_~y~0 12) 36 (* main_~n~0 36))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~n~0 12) (* (+ (* main_~n~0 6) 6) main_~y~0) 12)))} is VALID [2022-04-28 11:23:26,208 INFO L272 TraceCheckUtils]: 180: Hoare triple {25709#(and (= (+ (* (+ (* main_~n~0 6) 6) (+ (* main_~n~0 6) 6)) 12) (+ (* main_~y~0 12) 36 (* main_~n~0 36))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~n~0 12) (* (+ (* main_~n~0 6) 6) main_~y~0) 12)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:23:26,208 INFO L290 TraceCheckUtils]: 181: Hoare triple {25163#true} ~cond := #in~cond; {25660#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:26,208 INFO L290 TraceCheckUtils]: 182: Hoare triple {25660#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:26,209 INFO L290 TraceCheckUtils]: 183: Hoare triple {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:26,210 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} {25709#(and (= (+ (* (+ (* main_~n~0 6) 6) (+ (* main_~n~0 6) 6)) 12) (+ (* main_~y~0 12) 36 (* main_~n~0 36))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~n~0 12) (* (+ (* main_~n~0 6) 6) main_~y~0) 12)))} #64#return; {25725#(= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18))} is VALID [2022-04-28 11:23:26,211 INFO L272 TraceCheckUtils]: 185: Hoare triple {25725#(= (* 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)); {25729#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:23:26,211 INFO L290 TraceCheckUtils]: 186: Hoare triple {25729#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25733#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:26,211 INFO L290 TraceCheckUtils]: 187: Hoare triple {25733#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25164#false} is VALID [2022-04-28 11:23:26,212 INFO L290 TraceCheckUtils]: 188: Hoare triple {25164#false} assume !false; {25164#false} is VALID [2022-04-28 11:23:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 430 proven. 4 refuted. 0 times theorem prover too weak. 1743 trivial. 0 not checked. [2022-04-28 11:23:26,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:27:24,512 INFO L290 TraceCheckUtils]: 188: Hoare triple {25164#false} assume !false; {25164#false} is VALID [2022-04-28 11:27:24,512 INFO L290 TraceCheckUtils]: 187: Hoare triple {25733#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25164#false} is VALID [2022-04-28 11:27:24,513 INFO L290 TraceCheckUtils]: 186: Hoare triple {25729#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25733#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:27:24,513 INFO L272 TraceCheckUtils]: 185: Hoare triple {25725#(= (* 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)); {25729#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:27:24,514 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} {25752#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18)))} #64#return; {25725#(= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18))} is VALID [2022-04-28 11:27:24,514 INFO L290 TraceCheckUtils]: 183: Hoare triple {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:24,514 INFO L290 TraceCheckUtils]: 182: Hoare triple {25762#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:24,515 INFO L290 TraceCheckUtils]: 181: Hoare triple {25163#true} ~cond := #in~cond; {25762#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:27:24,515 INFO L272 TraceCheckUtils]: 180: Hoare triple {25752#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:25,288 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} {25769#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} #62#return; {25752#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18)))} is VALID [2022-04-28 11:27:25,288 INFO L290 TraceCheckUtils]: 178: Hoare triple {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:25,289 INFO L290 TraceCheckUtils]: 177: Hoare triple {25762#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:25,289 INFO L290 TraceCheckUtils]: 176: Hoare triple {25163#true} ~cond := #in~cond; {25762#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:27:25,289 INFO L272 TraceCheckUtils]: 175: Hoare triple {25769#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:25,290 INFO L290 TraceCheckUtils]: 174: Hoare triple {25769#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} assume !false; {25769#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} is VALID [2022-04-28 11:27:25,939 INFO L290 TraceCheckUtils]: 173: Hoare triple {25769#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 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; {25769#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} is VALID [2022-04-28 11:27:25,940 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25163#true} {25769#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} #70#return; {25769#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} is VALID [2022-04-28 11:27:25,940 INFO L290 TraceCheckUtils]: 171: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:25,940 INFO L290 TraceCheckUtils]: 170: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:25,940 INFO L290 TraceCheckUtils]: 169: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:25,940 INFO L272 TraceCheckUtils]: 168: Hoare triple {25769#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,307 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} {25163#true} #68#return; {25769#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} is VALID [2022-04-28 11:27:26,307 INFO L290 TraceCheckUtils]: 166: Hoare triple {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:26,307 INFO L290 TraceCheckUtils]: 165: Hoare triple {25762#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:26,308 INFO L290 TraceCheckUtils]: 164: Hoare triple {25163#true} ~cond := #in~cond; {25762#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:27:26,308 INFO L272 TraceCheckUtils]: 163: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,308 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {25163#true} {25163#true} #66#return; {25163#true} is VALID [2022-04-28 11:27:26,308 INFO L290 TraceCheckUtils]: 161: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,308 INFO L290 TraceCheckUtils]: 160: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,308 INFO L290 TraceCheckUtils]: 159: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,308 INFO L272 TraceCheckUtils]: 158: Hoare triple {25163#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,308 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25163#true} {25163#true} #64#return; {25163#true} is VALID [2022-04-28 11:27:26,308 INFO L290 TraceCheckUtils]: 156: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,308 INFO L290 TraceCheckUtils]: 155: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,308 INFO L290 TraceCheckUtils]: 154: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,308 INFO L272 TraceCheckUtils]: 153: Hoare triple {25163#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,309 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {25163#true} {25163#true} #62#return; {25163#true} is VALID [2022-04-28 11:27:26,309 INFO L290 TraceCheckUtils]: 151: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,309 INFO L290 TraceCheckUtils]: 150: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,309 INFO L290 TraceCheckUtils]: 149: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,309 INFO L272 TraceCheckUtils]: 148: Hoare triple {25163#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,309 INFO L290 TraceCheckUtils]: 147: Hoare triple {25163#true} assume !false; {25163#true} is VALID [2022-04-28 11:27:26,309 INFO L290 TraceCheckUtils]: 146: Hoare triple {25163#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; {25163#true} is VALID [2022-04-28 11:27:26,309 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25163#true} {25163#true} #70#return; {25163#true} is VALID [2022-04-28 11:27:26,309 INFO L290 TraceCheckUtils]: 144: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,309 INFO L290 TraceCheckUtils]: 143: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,309 INFO L290 TraceCheckUtils]: 142: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,309 INFO L272 TraceCheckUtils]: 141: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,309 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25163#true} {25163#true} #68#return; {25163#true} is VALID [2022-04-28 11:27:26,309 INFO L290 TraceCheckUtils]: 139: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,309 INFO L290 TraceCheckUtils]: 138: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,310 INFO L290 TraceCheckUtils]: 137: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,310 INFO L272 TraceCheckUtils]: 136: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,310 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25163#true} {25163#true} #66#return; {25163#true} is VALID [2022-04-28 11:27:26,310 INFO L290 TraceCheckUtils]: 134: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,310 INFO L290 TraceCheckUtils]: 133: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,310 INFO L290 TraceCheckUtils]: 132: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,310 INFO L272 TraceCheckUtils]: 131: Hoare triple {25163#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,310 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25163#true} {25163#true} #64#return; {25163#true} is VALID [2022-04-28 11:27:26,310 INFO L290 TraceCheckUtils]: 129: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,310 INFO L290 TraceCheckUtils]: 128: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,310 INFO L290 TraceCheckUtils]: 127: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,310 INFO L272 TraceCheckUtils]: 126: Hoare triple {25163#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,310 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {25163#true} {25163#true} #62#return; {25163#true} is VALID [2022-04-28 11:27:26,310 INFO L290 TraceCheckUtils]: 124: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,311 INFO L290 TraceCheckUtils]: 123: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,311 INFO L290 TraceCheckUtils]: 122: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,311 INFO L272 TraceCheckUtils]: 121: Hoare triple {25163#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,311 INFO L290 TraceCheckUtils]: 120: Hoare triple {25163#true} assume !false; {25163#true} is VALID [2022-04-28 11:27:26,311 INFO L290 TraceCheckUtils]: 119: Hoare triple {25163#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; {25163#true} is VALID [2022-04-28 11:27:26,311 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {25163#true} {25163#true} #70#return; {25163#true} is VALID [2022-04-28 11:27:26,311 INFO L290 TraceCheckUtils]: 117: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,311 INFO L290 TraceCheckUtils]: 116: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,311 INFO L290 TraceCheckUtils]: 115: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,311 INFO L272 TraceCheckUtils]: 114: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,311 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {25163#true} {25163#true} #68#return; {25163#true} is VALID [2022-04-28 11:27:26,311 INFO L290 TraceCheckUtils]: 112: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,311 INFO L290 TraceCheckUtils]: 111: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,311 INFO L290 TraceCheckUtils]: 110: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,312 INFO L272 TraceCheckUtils]: 109: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,312 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {25163#true} {25163#true} #66#return; {25163#true} is VALID [2022-04-28 11:27:26,312 INFO L290 TraceCheckUtils]: 107: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,312 INFO L290 TraceCheckUtils]: 106: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,312 INFO L290 TraceCheckUtils]: 105: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,312 INFO L272 TraceCheckUtils]: 104: Hoare triple {25163#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,312 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25163#true} {25163#true} #64#return; {25163#true} is VALID [2022-04-28 11:27:26,312 INFO L290 TraceCheckUtils]: 102: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,312 INFO L290 TraceCheckUtils]: 101: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,312 INFO L290 TraceCheckUtils]: 100: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,312 INFO L272 TraceCheckUtils]: 99: Hoare triple {25163#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,312 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25163#true} {25163#true} #62#return; {25163#true} is VALID [2022-04-28 11:27:26,312 INFO L290 TraceCheckUtils]: 97: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,312 INFO L290 TraceCheckUtils]: 96: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,312 INFO L290 TraceCheckUtils]: 95: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,313 INFO L272 TraceCheckUtils]: 94: Hoare triple {25163#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,313 INFO L290 TraceCheckUtils]: 93: Hoare triple {25163#true} assume !false; {25163#true} is VALID [2022-04-28 11:27:26,313 INFO L290 TraceCheckUtils]: 92: Hoare triple {25163#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; {25163#true} is VALID [2022-04-28 11:27:26,313 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {25163#true} {25163#true} #70#return; {25163#true} is VALID [2022-04-28 11:27:26,313 INFO L290 TraceCheckUtils]: 90: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,313 INFO L290 TraceCheckUtils]: 89: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,313 INFO L290 TraceCheckUtils]: 88: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,313 INFO L272 TraceCheckUtils]: 87: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,313 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {25163#true} {25163#true} #68#return; {25163#true} is VALID [2022-04-28 11:27:26,313 INFO L290 TraceCheckUtils]: 85: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,313 INFO L290 TraceCheckUtils]: 84: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,313 INFO L290 TraceCheckUtils]: 83: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,313 INFO L272 TraceCheckUtils]: 82: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,313 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25163#true} {25163#true} #66#return; {25163#true} is VALID [2022-04-28 11:27:26,313 INFO L290 TraceCheckUtils]: 80: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,314 INFO L290 TraceCheckUtils]: 79: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,314 INFO L290 TraceCheckUtils]: 78: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,314 INFO L272 TraceCheckUtils]: 77: Hoare triple {25163#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,314 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {25163#true} {25163#true} #64#return; {25163#true} is VALID [2022-04-28 11:27:26,314 INFO L290 TraceCheckUtils]: 75: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,314 INFO L290 TraceCheckUtils]: 74: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,314 INFO L290 TraceCheckUtils]: 73: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,314 INFO L272 TraceCheckUtils]: 72: Hoare triple {25163#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,314 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25163#true} {25163#true} #62#return; {25163#true} is VALID [2022-04-28 11:27:26,314 INFO L290 TraceCheckUtils]: 70: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,314 INFO L290 TraceCheckUtils]: 69: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,314 INFO L290 TraceCheckUtils]: 68: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,314 INFO L272 TraceCheckUtils]: 67: Hoare triple {25163#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {25163#true} assume !false; {25163#true} is VALID [2022-04-28 11:27:26,315 INFO L290 TraceCheckUtils]: 65: Hoare triple {25163#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; {25163#true} is VALID [2022-04-28 11:27:26,315 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25163#true} {25163#true} #70#return; {25163#true} is VALID [2022-04-28 11:27:26,315 INFO L290 TraceCheckUtils]: 63: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,315 INFO L290 TraceCheckUtils]: 62: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,315 INFO L290 TraceCheckUtils]: 61: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,315 INFO L272 TraceCheckUtils]: 60: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,315 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25163#true} {25163#true} #68#return; {25163#true} is VALID [2022-04-28 11:27:26,315 INFO L290 TraceCheckUtils]: 58: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,315 INFO L290 TraceCheckUtils]: 57: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,315 INFO L290 TraceCheckUtils]: 56: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,315 INFO L272 TraceCheckUtils]: 55: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,315 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {25163#true} {25163#true} #66#return; {25163#true} is VALID [2022-04-28 11:27:26,315 INFO L290 TraceCheckUtils]: 53: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,315 INFO L290 TraceCheckUtils]: 52: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,315 INFO L290 TraceCheckUtils]: 51: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,316 INFO L272 TraceCheckUtils]: 50: Hoare triple {25163#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,316 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {25163#true} {25163#true} #64#return; {25163#true} is VALID [2022-04-28 11:27:26,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,316 INFO L272 TraceCheckUtils]: 45: Hoare triple {25163#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,316 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {25163#true} {25163#true} #62#return; {25163#true} is VALID [2022-04-28 11:27:26,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,316 INFO L272 TraceCheckUtils]: 40: Hoare triple {25163#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {25163#true} assume !false; {25163#true} is VALID [2022-04-28 11:27:26,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {25163#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; {25163#true} is VALID [2022-04-28 11:27:26,316 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25163#true} {25163#true} #70#return; {25163#true} is VALID [2022-04-28 11:27:26,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,317 INFO L290 TraceCheckUtils]: 34: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,317 INFO L272 TraceCheckUtils]: 33: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,317 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25163#true} {25163#true} #68#return; {25163#true} is VALID [2022-04-28 11:27:26,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,317 INFO L290 TraceCheckUtils]: 29: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,317 INFO L272 TraceCheckUtils]: 28: Hoare triple {25163#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,317 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25163#true} {25163#true} #66#return; {25163#true} is VALID [2022-04-28 11:27:26,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,317 INFO L272 TraceCheckUtils]: 23: Hoare triple {25163#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,317 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {25163#true} {25163#true} #64#return; {25163#true} is VALID [2022-04-28 11:27:26,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,318 INFO L272 TraceCheckUtils]: 18: Hoare triple {25163#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,318 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25163#true} {25163#true} #62#return; {25163#true} is VALID [2022-04-28 11:27:26,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,318 INFO L272 TraceCheckUtils]: 13: Hoare triple {25163#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {25163#true} assume !false; {25163#true} is VALID [2022-04-28 11:27:26,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {25163#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {25163#true} is VALID [2022-04-28 11:27:26,318 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25163#true} {25163#true} #60#return; {25163#true} is VALID [2022-04-28 11:27:26,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {25163#true} assume !(0 == ~cond); {25163#true} is VALID [2022-04-28 11:27:26,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {25163#true} ~cond := #in~cond; {25163#true} is VALID [2022-04-28 11:27:26,319 INFO L272 TraceCheckUtils]: 6: Hoare triple {25163#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {25163#true} is VALID [2022-04-28 11:27:26,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {25163#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; {25163#true} is VALID [2022-04-28 11:27:26,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {25163#true} call #t~ret5 := main(); {25163#true} is VALID [2022-04-28 11:27:26,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25163#true} {25163#true} #84#return; {25163#true} is VALID [2022-04-28 11:27:26,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {25163#true} assume true; {25163#true} is VALID [2022-04-28 11:27:26,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {25163#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); {25163#true} is VALID [2022-04-28 11:27:26,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {25163#true} call ULTIMATE.init(); {25163#true} is VALID [2022-04-28 11:27:26,320 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:27:26,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:27:26,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580836052] [2022-04-28 11:27:26,320 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:27:26,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401230074] [2022-04-28 11:27:26,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401230074] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:27:26,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:27:26,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-28 11:27:26,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:27:26,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1778183483] [2022-04-28 11:27:26,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1778183483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:27:26,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:27:26,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:27:26,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078380512] [2022-04-28 11:27:26,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:27:26,321 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 189 [2022-04-28 11:27:26,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:27:26,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:27:26,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:26,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:27:26,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:26,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:27:26,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:27:26,366 INFO L87 Difference]: Start difference. First operand 190 states and 198 transitions. Second operand has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:27:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:29,872 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2022-04-28 11:27:29,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:27:29,872 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 189 [2022-04-28 11:27:29,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:27:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:27:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 11:27:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:27:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 11:27:29,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-28 11:27:30,151 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:27:30,152 INFO L225 Difference]: With dead ends: 190 [2022-04-28 11:27:30,152 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 11:27:30,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 362 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:27:30,153 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 11:27:30,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 11:27:30,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 11:27:30,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 11:27:30,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:27:30,153 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:27:30,153 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:27:30,153 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:27:30,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:30,153 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:27:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:27:30,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:30,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:30,154 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:27:30,154 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:27:30,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:30,154 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:27:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:27:30,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:30,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:30,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:27:30,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:27:30,154 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:27:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 11:27:30,154 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 189 [2022-04-28 11:27:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:27:30,154 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 11:27:30,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:27:30,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 11:27:30,155 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:27:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:27:30,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:30,157 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:27:30,173 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:27:30,360 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:27:30,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 11:27:45,350 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 11:27:45,351 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 11:27:45,351 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 11:27:45,351 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-28 11:27:45,351 INFO L895 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 11:27:45,351 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 11:27:45,351 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 11:27:45,351 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (<= main_~a~0 5) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:27:45,351 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 (= 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)) (< main_~a~0 .cse1) (<= main_~a~0 5))))) [2022-04-28 11:27:45,351 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 56) the Hoare annotation is: true [2022-04-28 11:27:45,351 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse1 (+ main_~z~0 main_~x~0)) (.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) .cse1) (= main_~y~0 (+ main_~x~0 6))) (and (= (+ main_~x~0 10) main_~z~0) .cse0 (= (+ 7 main_~y~0) .cse1) (= main_~x~0 8)) (let ((.cse2 (div (+ main_~z~0 (- 6)) 6))) (and (= main_~x~0 (* .cse2 .cse2 .cse2)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse2 (+ main_~a~0 1)) (< main_~a~0 .cse2) (<= main_~a~0 5))))) [2022-04-28 11:27:45,351 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse1 (+ main_~z~0 main_~x~0)) (.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) .cse1) (= main_~y~0 (+ main_~x~0 6))) (and (= (+ main_~x~0 10) main_~z~0) .cse0 (= (+ 7 main_~y~0) .cse1) (= main_~x~0 8)) (let ((.cse2 (div (+ main_~z~0 (- 6)) 6))) (and (= main_~x~0 (* .cse2 .cse2 .cse2)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse2 (+ main_~a~0 1)) (< main_~a~0 .cse2) (<= main_~a~0 5))))) [2022-04-28 11:27:45,351 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 (= 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)) (< main_~a~0 .cse1) (<= main_~a~0 5))))) [2022-04-28 11:27:45,351 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 56) the Hoare annotation is: true [2022-04-28 11:27:45,352 INFO L895 garLoopResultBuilder]: At program point L38(lines 33 46) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (<= main_~a~0 5) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:27:45,352 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (<= main_~a~0 5) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:27:45,352 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (<= main_~a~0 5) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:27:45,352 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (<= main_~a~0 5) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:27:45,352 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 56) the Hoare annotation is: true [2022-04-28 11:27:45,352 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (* (- 1) main_~a~0))) (or (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:27:45,352 INFO L895 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 0 main_~a~0) (<= main_~a~0 5)) [2022-04-28 11:27:45,352 INFO L902 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: true [2022-04-28 11:27:45,352 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (let ((.cse1 (+ main_~z~0 main_~x~0)) (.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) .cse1) (= main_~y~0 (+ main_~x~0 6))) (and (= (+ main_~x~0 10) main_~z~0) .cse0 (= (+ 7 main_~y~0) .cse1) (= main_~x~0 8)) (let ((.cse2 (div (+ main_~z~0 (- 6)) 6))) (and (= main_~x~0 (* .cse2 .cse2 .cse2)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse2 (+ main_~a~0 1)) (< main_~a~0 .cse2) (<= main_~a~0 5))))) [2022-04-28 11:27:45,352 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 (= 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)) (< main_~a~0 .cse1) (<= main_~a~0 5))))) [2022-04-28 11:27:45,352 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (<= main_~a~0 5) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:27:45,352 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (<= main_~a~0 5) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:27:45,352 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:27:45,352 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:27:45,352 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:27:45,353 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:27:45,353 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 11:27:45,353 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 11:27:45,353 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:27:45,353 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 11:27:45,353 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:27:45,353 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 11:27:45,353 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:27:45,353 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:27:45,353 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:27:45,355 INFO L356 BasicCegarLoop]: Path program histogram: [24, 6, 6, 2, 2, 2, 2, 2, 2] [2022-04-28 11:27:45,356 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:27:45,358 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:27:45,369 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 11:27:47,396 INFO L163 areAnnotationChecker]: CFG has 50 edges. 49 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 11:27:47,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:27:47 BoogieIcfgContainer [2022-04-28 11:27:47,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:27:47,404 INFO L158 Benchmark]: Toolchain (without parser) took 571227.68ms. Allocated memory was 200.3MB in the beginning and 295.7MB in the end (delta: 95.4MB). Free memory was 151.1MB in the beginning and 143.6MB in the end (delta: 7.4MB). Peak memory consumption was 156.6MB. Max. memory is 8.0GB. [2022-04-28 11:27:47,404 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory was 167.4MB in the beginning and 167.2MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:27:47,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.77ms. Allocated memory is still 200.3MB. Free memory was 150.9MB in the beginning and 174.8MB in the end (delta: -23.9MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-04-28 11:27:47,405 INFO L158 Benchmark]: Boogie Preprocessor took 20.73ms. Allocated memory is still 200.3MB. Free memory was 174.8MB in the beginning and 173.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 11:27:47,405 INFO L158 Benchmark]: RCFGBuilder took 222.69ms. Allocated memory is still 200.3MB. Free memory was 173.2MB in the beginning and 161.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 11:27:47,405 INFO L158 Benchmark]: TraceAbstraction took 570802.02ms. Allocated memory was 200.3MB in the beginning and 295.7MB in the end (delta: 95.4MB). Free memory was 161.2MB in the beginning and 143.6MB in the end (delta: 17.5MB). Peak memory consumption was 165.6MB. Max. memory is 8.0GB. [2022-04-28 11:27:47,406 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory was 167.4MB in the beginning and 167.2MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 177.77ms. Allocated memory is still 200.3MB. Free memory was 150.9MB in the beginning and 174.8MB in the end (delta: -23.9MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.73ms. Allocated memory is still 200.3MB. Free memory was 174.8MB in the beginning and 173.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 222.69ms. Allocated memory is still 200.3MB. Free memory was 173.2MB in the beginning and 161.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 570802.02ms. Allocated memory was 200.3MB in the beginning and 295.7MB in the end (delta: 95.4MB). Free memory was 161.2MB in the beginning and 143.6MB in the end (delta: 17.5MB). Peak memory consumption was 165.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 568.7s, OverallIterations: 24, TraceHistogramMax: 33, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 91.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 380 SdHoareTripleChecker+Valid, 50.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 4064 SdHoareTripleChecker+Invalid, 50.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 104 IncrementalHoareTripleChecker+Unchecked, 2948 mSDsCounter, 372 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6031 IncrementalHoareTripleChecker+Invalid, 6521 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 372 mSolverCounterUnsat, 1116 mSDtfsCounter, 6031 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3694 GetRequests, 3398 SyntacticMatches, 27 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 52.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=23, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 86 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 510 PreInvPairs, 776 NumberOfFragments, 1114 HoareAnnotationTreeSize, 510 FomulaSimplifications, 7304 FormulaSimplificationTreeSizeReduction, 6.7s HoareSimplificationTime, 36 FomulaSimplificationsInter, 215340 FormulaSimplificationTreeSizeReductionInter, 8.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((n <= a + 1 && n * 6 + 6 == z) && 0 <= a) && n * 12 + n * y * 6 + 6 == x * 18 + y * 6) && a <= 5) && y * 12 == 36 * (n * n) + 12 + n * 36 - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (\old(cond) == cond || !(1 <= \old(cond))) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-04-28 11:27:47,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...