/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/ps4-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:55:29,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:55:29,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:55:29,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:55:29,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:55:29,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:55:29,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:55:29,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:55:29,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:55:29,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:55:29,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:55:29,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:55:29,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:55:29,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:55:29,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:55:29,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:55:29,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:55:29,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:55:29,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:55:29,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:55:29,564 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:55:29,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:55:29,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:55:29,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:55:29,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:55:29,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:55:29,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:55:29,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:55:29,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:55:29,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:55:29,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:55:29,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:55:29,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:55:29,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:55:29,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:55:29,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:55:29,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:55:29,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:55:29,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:55:29,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:55:29,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:55:29,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:55:29,575 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:55:29,580 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:55:29,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:55:29,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:55:29,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:55:29,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:55:29,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:55:29,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:55:29,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:55:29,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:55:29,582 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:55:29,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:55:29,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:55:29,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:55:29,583 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:55:29,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:55:29,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:55:29,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:55:29,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:55:29,583 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:55:29,583 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:55:29,583 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:55:29,584 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:55:29,584 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-08 10:55:29,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:55:29,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:55:29,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:55:29,724 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:55:29,725 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:55:29,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/ps4-ll.c [2022-04-08 10:55:29,761 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ccf32e2b/e928af7ee12141dbae3e8014baa86199/FLAG4ba531266 [2022-04-08 10:55:30,174 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:55:30,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps4-ll.c [2022-04-08 10:55:30,179 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ccf32e2b/e928af7ee12141dbae3e8014baa86199/FLAG4ba531266 [2022-04-08 10:55:30,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ccf32e2b/e928af7ee12141dbae3e8014baa86199 [2022-04-08 10:55:30,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:55:30,198 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:55:30,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:55:30,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:55:30,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:55:30,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:55:30" (1/1) ... [2022-04-08 10:55:30,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35184a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:55:30, skipping insertion in model container [2022-04-08 10:55:30,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:55:30" (1/1) ... [2022-04-08 10:55:30,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:55:30,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:55:30,381 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/ps4-ll.c[458,471] [2022-04-08 10:55:30,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:55:30,414 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:55:30,426 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/ps4-ll.c[458,471] [2022-04-08 10:55:30,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:55:30,448 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:55:30,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:55:30 WrapperNode [2022-04-08 10:55:30,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:55:30,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:55:30,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:55:30,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:55:30,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:55:30" (1/1) ... [2022-04-08 10:55:30,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:55:30" (1/1) ... [2022-04-08 10:55:30,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:55:30" (1/1) ... [2022-04-08 10:55:30,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:55:30" (1/1) ... [2022-04-08 10:55:30,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:55:30" (1/1) ... [2022-04-08 10:55:30,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:55:30" (1/1) ... [2022-04-08 10:55:30,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:55:30" (1/1) ... [2022-04-08 10:55:30,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:55:30,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:55:30,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:55:30,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:55:30,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:55:30" (1/1) ... [2022-04-08 10:55:30,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:55:30,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:55:30,510 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-08 10:55:30,516 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-08 10:55:30,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:55:30,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:55:30,538 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:55:30,538 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:55:30,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:55:30,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:55:30,538 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:55:30,538 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:55:30,539 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:55:30,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:55:30,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 10:55:30,539 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:55:30,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:55:30,539 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:55:30,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:55:30,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:55:30,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:55:30,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:55:30,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:55:30,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:55:30,587 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:55:30,589 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:55:30,692 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:55:30,697 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:55:30,697 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 10:55:30,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:55:30 BoogieIcfgContainer [2022-04-08 10:55:30,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:55:30,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:55:30,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:55:30,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:55:30,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:55:30" (1/3) ... [2022-04-08 10:55:30,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bffbe87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:55:30, skipping insertion in model container [2022-04-08 10:55:30,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:55:30" (2/3) ... [2022-04-08 10:55:30,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bffbe87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:55:30, skipping insertion in model container [2022-04-08 10:55:30,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:55:30" (3/3) ... [2022-04-08 10:55:30,720 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll.c [2022-04-08 10:55:30,723 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:55:30,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:55:30,777 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:55:30,784 INFO L340 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 [2022-04-08 10:55:30,784 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:55:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:55:30,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 10:55:30,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:55:30,802 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:55:30,802 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:55:30,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:55:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash -973133132, now seen corresponding path program 1 times [2022-04-08 10:55:30,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:30,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2036184450] [2022-04-08 10:55:30,816 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:55:30,817 INFO L85 PathProgramCache]: Analyzing trace with hash -973133132, now seen corresponding path program 2 times [2022-04-08 10:55:30,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:55:30,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974053103] [2022-04-08 10:55:30,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:55:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:55:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:55:30,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:55:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:55:30,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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(9, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-08 10:55:30,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 10:55:30,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #56#return; {25#true} is VALID [2022-04-08 10:55:30,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:55:30,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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(9, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-08 10:55:30,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 10:55:30,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #56#return; {25#true} is VALID [2022-04-08 10:55:30,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2022-04-08 10:55:30,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {25#true} is VALID [2022-04-08 10:55:30,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume false; {26#false} is VALID [2022-04-08 10:55:30,968 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-08 10:55:30,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-08 10:55:30,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-08 10:55:30,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-08 10:55:30,969 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-08 10:55:30,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:55:30,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974053103] [2022-04-08 10:55:30,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974053103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:55:30,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:55:30,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:55:30,973 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:55:30,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2036184450] [2022-04-08 10:55:30,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2036184450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:55:30,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:55:30,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:55:30,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288028735] [2022-04-08 10:55:30,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:55:30,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 10:55:30,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:55:30,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:55:30,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:30,997 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:55:30,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:31,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:55:31,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:55:31,028 INFO L87 Difference]: Start difference. First operand has 22 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:55:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:31,133 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-04-08 10:55:31,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:55:31,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 10:55:31,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:55:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:55:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-08 10:55:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:55:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-08 10:55:31,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-04-08 10:55:31,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:31,219 INFO L225 Difference]: With dead ends: 38 [2022-04-08 10:55:31,219 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 10:55:31,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:55:31,225 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:55:31,227 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:55:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 10:55:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 10:55:31,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:55:31,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:55:31,250 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:55:31,250 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:55:31,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:31,252 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 10:55:31,252 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 10:55:31,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:31,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:31,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 17 states. [2022-04-08 10:55:31,253 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 17 states. [2022-04-08 10:55:31,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:31,255 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 10:55:31,255 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 10:55:31,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:31,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:31,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:55:31,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:55:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:55:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-08 10:55:31,258 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-08 10:55:31,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:55:31,258 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-08 10:55:31,258 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:55:31,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-08 10:55:31,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:31,285 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 10:55:31,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 10:55:31,288 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:55:31,288 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:55:31,292 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:55:31,292 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:55:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:55:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash -971345672, now seen corresponding path program 1 times [2022-04-08 10:55:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:31,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1946253207] [2022-04-08 10:55:31,293 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:55:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash -971345672, now seen corresponding path program 2 times [2022-04-08 10:55:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:55:31,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196115331] [2022-04-08 10:55:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:55:31,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:55:31,320 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:55:31,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1310139919] [2022-04-08 10:55:31,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:55:31,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:55:31,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:55:31,344 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-08 10:55:31,352 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-08 10:55:31,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 10:55:31,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:55:31,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 10:55:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:55:31,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:55:31,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {177#true} call ULTIMATE.init(); {177#true} is VALID [2022-04-08 10:55:31,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#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(9, 2);call #Ultimate.allocInit(12, 3); {177#true} is VALID [2022-04-08 10:55:31,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#true} assume true; {177#true} is VALID [2022-04-08 10:55:31,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177#true} {177#true} #56#return; {177#true} is VALID [2022-04-08 10:55:31,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {177#true} call #t~ret5 := main(); {177#true} is VALID [2022-04-08 10:55:31,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {197#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:31,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {197#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {197#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:31,480 INFO L272 TraceCheckUtils]: 7: Hoare triple {197#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {204#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:55:31,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {208#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:55:31,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {208#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {178#false} is VALID [2022-04-08 10:55:31,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {178#false} assume !false; {178#false} is VALID [2022-04-08 10:55:31,482 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-08 10:55:31,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:55:31,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:55:31,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196115331] [2022-04-08 10:55:31,482 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:55:31,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310139919] [2022-04-08 10:55:31,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310139919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:55:31,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:55:31,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:55:31,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:55:31,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1946253207] [2022-04-08 10:55:31,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1946253207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:55:31,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:55:31,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:55:31,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184669667] [2022-04-08 10:55:31,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:55:31,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 10:55:31,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:55:31,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:55:31,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:31,495 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:55:31,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:31,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:55:31,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:55:31,496 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:55:49,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:49,195 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-08 10:55:49,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:55:49,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 10:55:49,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:55:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:55:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 10:55:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:55:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 10:55:49,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 10:55:49,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:49,228 INFO L225 Difference]: With dead ends: 28 [2022-04-08 10:55:49,228 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 10:55:49,228 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-08 10:55:49,229 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:55:49,230 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 54 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:55:49,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 10:55:49,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 10:55:49,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:55:49,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:55:49,245 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:55:49,245 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:55:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:49,252 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-08 10:55:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-08 10:55:49,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:49,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:49,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-08 10:55:49,254 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-08 10:55:49,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:49,258 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-08 10:55:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-08 10:55:49,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:49,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:49,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:55:49,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:55:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:55:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-08 10:55:49,261 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 11 [2022-04-08 10:55:49,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:55:49,261 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-08 10:55:49,261 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:55:49,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-08 10:55:49,287 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-08 10:55:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-08 10:55:49,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 10:55:49,290 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:55:49,290 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:55:49,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 10:55:49,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:55:49,504 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:55:49,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:55:49,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1679137237, now seen corresponding path program 1 times [2022-04-08 10:55:49,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:49,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1380263384] [2022-04-08 10:55:49,658 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:55:49,659 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:55:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1679137237, now seen corresponding path program 2 times [2022-04-08 10:55:49,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:55:49,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190571667] [2022-04-08 10:55:49,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:55:49,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:55:49,667 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:55:49,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [245676073] [2022-04-08 10:55:49,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:55:49,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:55:49,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:55:49,669 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-08 10:55:49,670 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-08 10:55:49,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:55:49,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:55:49,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 10:55:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:55:49,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:55:49,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {368#true} call ULTIMATE.init(); {368#true} is VALID [2022-04-08 10:55:49,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#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(9, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-04-08 10:55:49,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-08 10:55:49,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {368#true} {368#true} #56#return; {368#true} is VALID [2022-04-08 10:55:49,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {368#true} call #t~ret5 := main(); {368#true} is VALID [2022-04-08 10:55:49,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {388#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:49,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {388#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {388#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:49,804 INFO L272 TraceCheckUtils]: 7: Hoare triple {388#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {368#true} is VALID [2022-04-08 10:55:49,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {368#true} ~cond := #in~cond; {368#true} is VALID [2022-04-08 10:55:49,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#true} assume !(0 == ~cond); {368#true} is VALID [2022-04-08 10:55:49,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-08 10:55:49,805 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {368#true} {388#(and (= main_~x~0 0) (= main_~y~0 0))} #50#return; {388#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:49,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {388#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {410#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 10:55:49,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {410#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {410#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 10:55:49,807 INFO L272 TraceCheckUtils]: 14: Hoare triple {410#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {417#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:55:49,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {417#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {421#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:55:49,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {421#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {369#false} is VALID [2022-04-08 10:55:49,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {369#false} assume !false; {369#false} is VALID [2022-04-08 10:55:49,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:55:49,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:55:50,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {369#false} assume !false; {369#false} is VALID [2022-04-08 10:55:50,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {421#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {369#false} is VALID [2022-04-08 10:55:50,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {417#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {421#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:55:50,172 INFO L272 TraceCheckUtils]: 14: Hoare triple {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {417#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:55:50,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 10:55:50,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 10:55:50,423 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {368#true} {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #50#return; {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 10:55:50,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-08 10:55:50,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#true} assume !(0 == ~cond); {368#true} is VALID [2022-04-08 10:55:50,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {368#true} ~cond := #in~cond; {368#true} is VALID [2022-04-08 10:55:50,424 INFO L272 TraceCheckUtils]: 7: Hoare triple {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {368#true} is VALID [2022-04-08 10:55:50,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 10:55:50,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 10:55:50,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {368#true} call #t~ret5 := main(); {368#true} is VALID [2022-04-08 10:55:50,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {368#true} {368#true} #56#return; {368#true} is VALID [2022-04-08 10:55:50,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-08 10:55:50,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#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(9, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-04-08 10:55:50,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {368#true} call ULTIMATE.init(); {368#true} is VALID [2022-04-08 10:55:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:55:50,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:55:50,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190571667] [2022-04-08 10:55:50,426 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:55:50,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245676073] [2022-04-08 10:55:50,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245676073] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:55:50,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:55:50,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 10:55:50,427 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:55:50,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1380263384] [2022-04-08 10:55:50,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1380263384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:55:50,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:55:50,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:55:50,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443632230] [2022-04-08 10:55:50,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:55:50,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-08 10:55:50,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:55:50,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 10:55:50,887 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-08 10:55:50,888 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:55:50,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:50,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:55:50,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:55:50,889 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 10:55:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:50,969 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-08 10:55:50,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:55:50,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-08 10:55:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:55:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 10:55:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-08 10:55:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 10:55:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-08 10:55:50,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-08 10:55:51,440 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-08 10:55:51,441 INFO L225 Difference]: With dead ends: 30 [2022-04-08 10:55:51,441 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 10:55:51,441 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 10:55:51,442 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:55:51,442 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 47 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:55:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 10:55:51,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 10:55:51,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:55:51,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:55:51,453 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:55:51,453 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:55:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:51,454 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 10:55:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 10:55:51,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:51,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:51,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-08 10:55:51,455 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-08 10:55:51,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:51,456 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 10:55:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 10:55:51,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:51,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:51,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:55:51,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:55:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:55:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-08 10:55:51,457 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 18 [2022-04-08 10:55:51,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:55:51,458 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-08 10:55:51,458 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 10:55:51,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-08 10:55:51,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 10:55:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:55:51,932 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:55:51,932 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:55:51,953 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-08 10:55:52,132 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 10:55:52,132 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:55:52,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:55:52,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1991962395, now seen corresponding path program 1 times [2022-04-08 10:55:52,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:52,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2086693208] [2022-04-08 10:55:52,226 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:55:52,226 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:55:52,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1991962395, now seen corresponding path program 2 times [2022-04-08 10:55:52,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:55:52,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998285119] [2022-04-08 10:55:52,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:55:52,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:55:52,233 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:55:52,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1827148121] [2022-04-08 10:55:52,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:55:52,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:55:52,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:55:52,235 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-08 10:55:52,236 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-08 10:55:52,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:55:52,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:55:52,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 10:55:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:55:52,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:55:52,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {644#true} is VALID [2022-04-08 10:55:52,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {644#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(9, 2);call #Ultimate.allocInit(12, 3); {644#true} is VALID [2022-04-08 10:55:52,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2022-04-08 10:55:52,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #56#return; {644#true} is VALID [2022-04-08 10:55:52,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret5 := main(); {644#true} is VALID [2022-04-08 10:55:52,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {644#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {664#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:52,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {664#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {664#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:52,497 INFO L272 TraceCheckUtils]: 7: Hoare triple {664#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {644#true} is VALID [2022-04-08 10:55:52,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {644#true} ~cond := #in~cond; {644#true} is VALID [2022-04-08 10:55:52,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {644#true} assume !(0 == ~cond); {644#true} is VALID [2022-04-08 10:55:52,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {644#true} assume true; {644#true} is VALID [2022-04-08 10:55:52,498 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {644#true} {664#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {664#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:52,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {664#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {686#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 10:55:52,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {686#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {686#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 10:55:52,499 INFO L272 TraceCheckUtils]: 14: Hoare triple {686#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {644#true} is VALID [2022-04-08 10:55:52,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {644#true} ~cond := #in~cond; {644#true} is VALID [2022-04-08 10:55:52,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {644#true} assume !(0 == ~cond); {644#true} is VALID [2022-04-08 10:55:52,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {644#true} assume true; {644#true} is VALID [2022-04-08 10:55:52,500 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {644#true} {686#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} #50#return; {686#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 10:55:52,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {686#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {708#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 10:55:52,501 INFO L272 TraceCheckUtils]: 20: Hoare triple {708#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {712#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:55:52,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {712#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {716#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:55:52,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {716#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {645#false} is VALID [2022-04-08 10:55:52,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {645#false} assume !false; {645#false} is VALID [2022-04-08 10:55:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:55:52,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:55:52,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:55:52,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998285119] [2022-04-08 10:55:52,755 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:55:52,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827148121] [2022-04-08 10:55:52,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827148121] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:55:52,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:55:52,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 10:55:52,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:55:52,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2086693208] [2022-04-08 10:55:52,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2086693208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:55:52,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:55:52,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:55:52,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602757388] [2022-04-08 10:55:52,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:55:52,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2022-04-08 10:55:52,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:55:52,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:55:52,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:52,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:55:52,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:52,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:55:52,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:55:52,775 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:55:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:52,929 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-04-08 10:55:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:55:52,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2022-04-08 10:55:52,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:55:52,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:55:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-08 10:55:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:55:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-08 10:55:52,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2022-04-08 10:55:52,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:52,954 INFO L225 Difference]: With dead ends: 33 [2022-04-08 10:55:52,954 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 10:55:52,954 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 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-08 10:55:52,955 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:55:52,955 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:55:52,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 10:55:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 10:55:52,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:55:52,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:55:52,970 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:55:52,970 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:55:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:52,972 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-04-08 10:55:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-08 10:55:52,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:52,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:52,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-08 10:55:52,973 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-08 10:55:52,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:52,974 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-04-08 10:55:52,974 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-08 10:55:52,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:52,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:52,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:55:52,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:55:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:55:52,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-04-08 10:55:52,975 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2022-04-08 10:55:52,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:55:52,976 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-04-08 10:55:52,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:55:52,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2022-04-08 10:55:53,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:53,454 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-08 10:55:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:55:53,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:55:53,455 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:55:53,472 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-08 10:55:53,655 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:55:53,655 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:55:53,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:55:53,656 INFO L85 PathProgramCache]: Analyzing trace with hash 486172306, now seen corresponding path program 3 times [2022-04-08 10:55:53,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:53,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2726927] [2022-04-08 10:55:53,779 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:55:53,779 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:55:53,780 INFO L85 PathProgramCache]: Analyzing trace with hash 486172306, now seen corresponding path program 4 times [2022-04-08 10:55:53,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:55:53,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660094549] [2022-04-08 10:55:53,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:55:53,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:55:53,790 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:55:53,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [367559984] [2022-04-08 10:55:53,790 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:55:53,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:55:53,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:55:53,799 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-08 10:55:53,801 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-08 10:55:53,858 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:55:53,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:55:53,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 10:55:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:55:53,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:55:54,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {946#true} call ULTIMATE.init(); {946#true} is VALID [2022-04-08 10:55:54,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {946#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(9, 2);call #Ultimate.allocInit(12, 3); {946#true} is VALID [2022-04-08 10:55:54,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {946#true} assume true; {946#true} is VALID [2022-04-08 10:55:54,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {946#true} {946#true} #56#return; {946#true} is VALID [2022-04-08 10:55:54,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {946#true} call #t~ret5 := main(); {946#true} is VALID [2022-04-08 10:55:54,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {946#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {966#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:54,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {966#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {966#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:54,125 INFO L272 TraceCheckUtils]: 7: Hoare triple {966#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {946#true} is VALID [2022-04-08 10:55:54,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {946#true} ~cond := #in~cond; {946#true} is VALID [2022-04-08 10:55:54,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {946#true} assume !(0 == ~cond); {946#true} is VALID [2022-04-08 10:55:54,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {946#true} assume true; {946#true} is VALID [2022-04-08 10:55:54,125 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {946#true} {966#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {966#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:54,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {966#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {988#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:55:54,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {988#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {988#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:55:54,127 INFO L272 TraceCheckUtils]: 14: Hoare triple {988#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {946#true} is VALID [2022-04-08 10:55:54,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {946#true} ~cond := #in~cond; {946#true} is VALID [2022-04-08 10:55:54,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {946#true} assume !(0 == ~cond); {946#true} is VALID [2022-04-08 10:55:54,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {946#true} assume true; {946#true} is VALID [2022-04-08 10:55:54,130 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {946#true} {988#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {988#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:55:54,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {988#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1010#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 10:55:54,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {1010#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !false; {1010#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 10:55:54,131 INFO L272 TraceCheckUtils]: 21: Hoare triple {1010#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {946#true} is VALID [2022-04-08 10:55:54,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#true} ~cond := #in~cond; {946#true} is VALID [2022-04-08 10:55:54,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {946#true} assume !(0 == ~cond); {946#true} is VALID [2022-04-08 10:55:54,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {946#true} assume true; {946#true} is VALID [2022-04-08 10:55:54,132 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {946#true} {1010#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #50#return; {1010#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 10:55:54,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {1010#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1032#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 10:55:54,133 INFO L272 TraceCheckUtils]: 27: Hoare triple {1032#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:55:54,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {1036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:55:54,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {1040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {947#false} is VALID [2022-04-08 10:55:54,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {947#false} assume !false; {947#false} is VALID [2022-04-08 10:55:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 10:55:54,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:55:54,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:55:54,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660094549] [2022-04-08 10:55:54,422 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:55:54,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367559984] [2022-04-08 10:55:54,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367559984] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:55:54,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:55:54,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 10:55:54,422 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:55:54,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2726927] [2022-04-08 10:55:54,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2726927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:55:54,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:55:54,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:55:54,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305355831] [2022-04-08 10:55:54,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:55:54,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2022-04-08 10:55:54,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:55:54,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:55:54,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:54,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:55:54,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:54,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:55:54,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:55:54,447 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:55:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:54,651 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 10:55:54,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:55:54,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2022-04-08 10:55:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:55:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:55:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-04-08 10:55:54,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:55:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-04-08 10:55:54,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 34 transitions. [2022-04-08 10:55:54,677 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-08 10:55:54,678 INFO L225 Difference]: With dead ends: 36 [2022-04-08 10:55:54,678 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 10:55:54,678 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 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-08 10:55:54,679 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:55:54,679 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 107 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:55:54,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 10:55:54,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 10:55:54,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:55:54,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:55:54,697 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:55:54,697 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:55:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:54,698 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-08 10:55:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 10:55:54,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:54,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:54,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 31 states. [2022-04-08 10:55:54,699 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 31 states. [2022-04-08 10:55:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:54,700 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-08 10:55:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 10:55:54,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:54,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:54,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:55:54,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:55:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:55:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-08 10:55:54,701 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 31 [2022-04-08 10:55:54,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:55:54,702 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-08 10:55:54,702 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:55:54,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-08 10:55:55,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 10:55:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:55:55,182 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:55:55,182 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:55:55,207 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-08 10:55:55,382 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:55:55,383 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:55:55,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:55:55,383 INFO L85 PathProgramCache]: Analyzing trace with hash -625556411, now seen corresponding path program 5 times [2022-04-08 10:55:55,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:55,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1777737098] [2022-04-08 10:55:55,467 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:55:55,467 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:55:55,467 INFO L85 PathProgramCache]: Analyzing trace with hash -625556411, now seen corresponding path program 6 times [2022-04-08 10:55:55,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:55:55,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138279768] [2022-04-08 10:55:55,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:55:55,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:55:55,475 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:55:55,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1184802112] [2022-04-08 10:55:55,475 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:55:55,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:55:55,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:55:55,496 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-08 10:55:55,497 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-08 10:55:55,604 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:55:55,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:55:55,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 10:55:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:55:55,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:55:55,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {1288#true} call ULTIMATE.init(); {1288#true} is VALID [2022-04-08 10:55:55,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {1288#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(9, 2);call #Ultimate.allocInit(12, 3); {1288#true} is VALID [2022-04-08 10:55:55,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {1288#true} assume true; {1288#true} is VALID [2022-04-08 10:55:55,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1288#true} {1288#true} #56#return; {1288#true} is VALID [2022-04-08 10:55:55,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {1288#true} call #t~ret5 := main(); {1288#true} is VALID [2022-04-08 10:55:55,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {1288#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1308#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:55,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {1308#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1308#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:55,898 INFO L272 TraceCheckUtils]: 7: Hoare triple {1308#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1288#true} is VALID [2022-04-08 10:55:55,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {1288#true} ~cond := #in~cond; {1288#true} is VALID [2022-04-08 10:55:55,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {1288#true} assume !(0 == ~cond); {1288#true} is VALID [2022-04-08 10:55:55,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {1288#true} assume true; {1288#true} is VALID [2022-04-08 10:55:55,900 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1288#true} {1308#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {1308#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:55,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {1308#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1330#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:55:55,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {1330#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {1330#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:55:55,900 INFO L272 TraceCheckUtils]: 14: Hoare triple {1330#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1288#true} is VALID [2022-04-08 10:55:55,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {1288#true} ~cond := #in~cond; {1288#true} is VALID [2022-04-08 10:55:55,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {1288#true} assume !(0 == ~cond); {1288#true} is VALID [2022-04-08 10:55:55,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {1288#true} assume true; {1288#true} is VALID [2022-04-08 10:55:55,901 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1288#true} {1330#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {1330#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:55:55,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {1330#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1352#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 10:55:55,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {1352#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {1352#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 10:55:55,902 INFO L272 TraceCheckUtils]: 21: Hoare triple {1352#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1288#true} is VALID [2022-04-08 10:55:55,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {1288#true} ~cond := #in~cond; {1288#true} is VALID [2022-04-08 10:55:55,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {1288#true} assume !(0 == ~cond); {1288#true} is VALID [2022-04-08 10:55:55,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {1288#true} assume true; {1288#true} is VALID [2022-04-08 10:55:55,903 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1288#true} {1352#(and (= main_~y~0 2) (= main_~c~0 2))} #50#return; {1352#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 10:55:55,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {1352#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1374#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 10:55:55,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {1374#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1374#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 10:55:55,904 INFO L272 TraceCheckUtils]: 28: Hoare triple {1374#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1288#true} is VALID [2022-04-08 10:55:55,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {1288#true} ~cond := #in~cond; {1288#true} is VALID [2022-04-08 10:55:55,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {1288#true} assume !(0 == ~cond); {1288#true} is VALID [2022-04-08 10:55:55,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {1288#true} assume true; {1288#true} is VALID [2022-04-08 10:55:55,905 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1288#true} {1374#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #50#return; {1374#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 10:55:55,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {1374#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1396#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 10:55:55,906 INFO L272 TraceCheckUtils]: 34: Hoare triple {1396#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1400#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:55:55,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {1400#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1404#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:55:55,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {1404#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1289#false} is VALID [2022-04-08 10:55:55,907 INFO L290 TraceCheckUtils]: 37: Hoare triple {1289#false} assume !false; {1289#false} is VALID [2022-04-08 10:55:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 10:55:55,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:55:56,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:55:56,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138279768] [2022-04-08 10:55:56,149 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:55:56,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184802112] [2022-04-08 10:55:56,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184802112] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:55:56,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:55:56,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 10:55:56,150 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:55:56,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1777737098] [2022-04-08 10:55:56,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1777737098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:55:56,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:55:56,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:55:56,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7374143] [2022-04-08 10:55:56,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:55:56,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 38 [2022-04-08 10:55:56,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:55:56,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:55:56,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:56,170 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:55:56,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:56,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:55:56,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:55:56,170 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:55:56,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:56,478 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-08 10:55:56,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:55:56,478 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 38 [2022-04-08 10:55:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:55:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:55:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-08 10:55:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:55:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-08 10:55:56,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2022-04-08 10:55:56,507 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-08 10:55:56,508 INFO L225 Difference]: With dead ends: 39 [2022-04-08 10:55:56,508 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 10:55:56,509 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:55:56,509 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:55:56,509 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:55:56,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 10:55:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 10:55:56,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:55:56,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:55:56,529 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:55:56,529 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:55:56,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:56,530 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 10:55:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 10:55:56,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:56,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:56,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-08 10:55:56,531 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-08 10:55:56,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:56,532 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 10:55:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 10:55:56,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:56,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:56,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:55:56,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:55:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:55:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-08 10:55:56,534 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 38 [2022-04-08 10:55:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:55:56,534 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-08 10:55:56,534 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:55:56,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-08 10:55:57,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 10:55:57,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 10:55:57,023 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:55:57,023 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:55:57,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 10:55:57,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:55:57,224 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:55:57,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:55:57,224 INFO L85 PathProgramCache]: Analyzing trace with hash -516282574, now seen corresponding path program 7 times [2022-04-08 10:55:57,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:57,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2073053576] [2022-04-08 10:55:57,310 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:55:57,310 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:55:57,310 INFO L85 PathProgramCache]: Analyzing trace with hash -516282574, now seen corresponding path program 8 times [2022-04-08 10:55:57,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:55:57,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931539437] [2022-04-08 10:55:57,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:55:57,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:55:57,318 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:55:57,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75810762] [2022-04-08 10:55:57,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:55:57,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:55:57,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:55:57,319 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-08 10:55:57,320 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-08 10:55:57,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:55:57,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:55:57,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:55:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:55:57,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:55:57,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {1670#true} call ULTIMATE.init(); {1670#true} is VALID [2022-04-08 10:55:57,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {1670#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(9, 2);call #Ultimate.allocInit(12, 3); {1670#true} is VALID [2022-04-08 10:55:57,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {1670#true} assume true; {1670#true} is VALID [2022-04-08 10:55:57,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1670#true} {1670#true} #56#return; {1670#true} is VALID [2022-04-08 10:55:57,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {1670#true} call #t~ret5 := main(); {1670#true} is VALID [2022-04-08 10:55:57,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {1670#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1690#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:57,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {1690#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1690#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:57,759 INFO L272 TraceCheckUtils]: 7: Hoare triple {1690#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1670#true} is VALID [2022-04-08 10:55:57,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {1670#true} ~cond := #in~cond; {1670#true} is VALID [2022-04-08 10:55:57,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {1670#true} assume !(0 == ~cond); {1670#true} is VALID [2022-04-08 10:55:57,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {1670#true} assume true; {1670#true} is VALID [2022-04-08 10:55:57,760 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1670#true} {1690#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {1690#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:57,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {1690#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1712#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:55:57,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {1712#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1712#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:55:57,761 INFO L272 TraceCheckUtils]: 14: Hoare triple {1712#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1670#true} is VALID [2022-04-08 10:55:57,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {1670#true} ~cond := #in~cond; {1670#true} is VALID [2022-04-08 10:55:57,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {1670#true} assume !(0 == ~cond); {1670#true} is VALID [2022-04-08 10:55:57,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {1670#true} assume true; {1670#true} is VALID [2022-04-08 10:55:57,762 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1670#true} {1712#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {1712#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:55:57,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {1712#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1734#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:55:57,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {1734#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {1734#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:55:57,763 INFO L272 TraceCheckUtils]: 21: Hoare triple {1734#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1670#true} is VALID [2022-04-08 10:55:57,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {1670#true} ~cond := #in~cond; {1670#true} is VALID [2022-04-08 10:55:57,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {1670#true} assume !(0 == ~cond); {1670#true} is VALID [2022-04-08 10:55:57,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {1670#true} assume true; {1670#true} is VALID [2022-04-08 10:55:57,764 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1670#true} {1734#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {1734#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:55:57,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {1734#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1756#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 10:55:57,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {1756#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !false; {1756#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 10:55:57,765 INFO L272 TraceCheckUtils]: 28: Hoare triple {1756#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1670#true} is VALID [2022-04-08 10:55:57,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {1670#true} ~cond := #in~cond; {1670#true} is VALID [2022-04-08 10:55:57,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {1670#true} assume !(0 == ~cond); {1670#true} is VALID [2022-04-08 10:55:57,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {1670#true} assume true; {1670#true} is VALID [2022-04-08 10:55:57,765 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1670#true} {1756#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #50#return; {1756#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 10:55:57,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {1756#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1778#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-08 10:55:57,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {1778#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !false; {1778#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-08 10:55:57,766 INFO L272 TraceCheckUtils]: 35: Hoare triple {1778#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1670#true} is VALID [2022-04-08 10:55:57,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {1670#true} ~cond := #in~cond; {1670#true} is VALID [2022-04-08 10:55:57,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {1670#true} assume !(0 == ~cond); {1670#true} is VALID [2022-04-08 10:55:57,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {1670#true} assume true; {1670#true} is VALID [2022-04-08 10:55:57,767 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1670#true} {1778#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} #50#return; {1778#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-08 10:55:57,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {1778#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {1800#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:55:57,768 INFO L272 TraceCheckUtils]: 41: Hoare triple {1800#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1804#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:55:57,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {1804#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1808#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:55:57,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {1808#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1671#false} is VALID [2022-04-08 10:55:57,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {1671#false} assume !false; {1671#false} is VALID [2022-04-08 10:55:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 10:55:57,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:55:58,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:55:58,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931539437] [2022-04-08 10:55:58,050 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:55:58,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75810762] [2022-04-08 10:55:58,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75810762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:55:58,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:55:58,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 10:55:58,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:55:58,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2073053576] [2022-04-08 10:55:58,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2073053576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:55:58,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:55:58,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:55:58,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749021240] [2022-04-08 10:55:58,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:55:58,051 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2022-04-08 10:55:58,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:55:58,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:55:58,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:58,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:55:58,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:58,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:55:58,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:55:58,079 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:55:58,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:58,547 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 10:55:58,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:55:58,547 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2022-04-08 10:55:58,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:55:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:55:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-08 10:55:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:55:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-08 10:55:58,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-04-08 10:55:58,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:58,589 INFO L225 Difference]: With dead ends: 42 [2022-04-08 10:55:58,589 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 10:55:58,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:55:58,589 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:55:58,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 159 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:55:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 10:55:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 10:55:58,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:55:58,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 10:55:58,617 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 10:55:58,618 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 10:55:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:58,620 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-08 10:55:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-08 10:55:58,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:58,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:58,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-08 10:55:58,620 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-08 10:55:58,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:58,621 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-08 10:55:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-08 10:55:58,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:58,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:58,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:55:58,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:55:58,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 10:55:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-04-08 10:55:58,623 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 45 [2022-04-08 10:55:58,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:55:58,623 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-04-08 10:55:58,623 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:55:58,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 41 transitions. [2022-04-08 10:55:59,134 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-08 10:55:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-08 10:55:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 10:55:59,135 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:55:59,135 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:55:59,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-08 10:55:59,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:55:59,346 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:55:59,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:55:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1878724517, now seen corresponding path program 9 times [2022-04-08 10:55:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:59,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [862318623] [2022-04-08 10:55:59,442 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:55:59,442 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:55:59,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1878724517, now seen corresponding path program 10 times [2022-04-08 10:55:59,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:55:59,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258319349] [2022-04-08 10:55:59,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:55:59,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:55:59,457 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:55:59,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46946319] [2022-04-08 10:55:59,457 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:55:59,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:55:59,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:55:59,469 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-08 10:55:59,469 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-08 10:55:59,551 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:55:59,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:55:59,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 10:55:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:55:59,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:55:59,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {2092#true} call ULTIMATE.init(); {2092#true} is VALID [2022-04-08 10:55:59,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {2092#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(9, 2);call #Ultimate.allocInit(12, 3); {2092#true} is VALID [2022-04-08 10:55:59,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {2092#true} assume true; {2092#true} is VALID [2022-04-08 10:55:59,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2092#true} {2092#true} #56#return; {2092#true} is VALID [2022-04-08 10:55:59,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {2092#true} call #t~ret5 := main(); {2092#true} is VALID [2022-04-08 10:55:59,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {2092#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2112#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:59,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {2112#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2112#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:59,905 INFO L272 TraceCheckUtils]: 7: Hoare triple {2112#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2092#true} is VALID [2022-04-08 10:55:59,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {2092#true} ~cond := #in~cond; {2092#true} is VALID [2022-04-08 10:55:59,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {2092#true} assume !(0 == ~cond); {2092#true} is VALID [2022-04-08 10:55:59,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {2092#true} assume true; {2092#true} is VALID [2022-04-08 10:55:59,906 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2092#true} {2112#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {2112#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:55:59,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {2112#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2134#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:55:59,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {2134#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2134#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:55:59,907 INFO L272 TraceCheckUtils]: 14: Hoare triple {2134#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2092#true} is VALID [2022-04-08 10:55:59,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {2092#true} ~cond := #in~cond; {2092#true} is VALID [2022-04-08 10:55:59,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {2092#true} assume !(0 == ~cond); {2092#true} is VALID [2022-04-08 10:55:59,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {2092#true} assume true; {2092#true} is VALID [2022-04-08 10:55:59,908 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2092#true} {2134#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {2134#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:55:59,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {2134#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2156#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:55:59,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {2156#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2156#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:55:59,909 INFO L272 TraceCheckUtils]: 21: Hoare triple {2156#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2092#true} is VALID [2022-04-08 10:55:59,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {2092#true} ~cond := #in~cond; {2092#true} is VALID [2022-04-08 10:55:59,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {2092#true} assume !(0 == ~cond); {2092#true} is VALID [2022-04-08 10:55:59,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {2092#true} assume true; {2092#true} is VALID [2022-04-08 10:55:59,909 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2092#true} {2156#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #50#return; {2156#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:55:59,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {2156#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2178#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 10:55:59,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {2178#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {2178#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 10:55:59,910 INFO L272 TraceCheckUtils]: 28: Hoare triple {2178#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2092#true} is VALID [2022-04-08 10:55:59,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {2092#true} ~cond := #in~cond; {2092#true} is VALID [2022-04-08 10:55:59,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {2092#true} assume !(0 == ~cond); {2092#true} is VALID [2022-04-08 10:55:59,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {2092#true} assume true; {2092#true} is VALID [2022-04-08 10:55:59,911 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2092#true} {2178#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #50#return; {2178#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 10:55:59,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {2178#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2200#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 10:55:59,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {2200#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {2200#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 10:55:59,912 INFO L272 TraceCheckUtils]: 35: Hoare triple {2200#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2092#true} is VALID [2022-04-08 10:55:59,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {2092#true} ~cond := #in~cond; {2092#true} is VALID [2022-04-08 10:55:59,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {2092#true} assume !(0 == ~cond); {2092#true} is VALID [2022-04-08 10:55:59,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {2092#true} assume true; {2092#true} is VALID [2022-04-08 10:55:59,912 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2092#true} {2200#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {2200#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 10:55:59,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {2200#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2222#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 10:55:59,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {2222#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2222#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 10:55:59,913 INFO L272 TraceCheckUtils]: 42: Hoare triple {2222#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2092#true} is VALID [2022-04-08 10:55:59,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {2092#true} ~cond := #in~cond; {2092#true} is VALID [2022-04-08 10:55:59,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {2092#true} assume !(0 == ~cond); {2092#true} is VALID [2022-04-08 10:55:59,913 INFO L290 TraceCheckUtils]: 45: Hoare triple {2092#true} assume true; {2092#true} is VALID [2022-04-08 10:55:59,918 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2092#true} {2222#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #50#return; {2222#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 10:55:59,919 INFO L290 TraceCheckUtils]: 47: Hoare triple {2222#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2244#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 10:55:59,921 INFO L272 TraceCheckUtils]: 48: Hoare triple {2244#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2248#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:55:59,922 INFO L290 TraceCheckUtils]: 49: Hoare triple {2248#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2252#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:55:59,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {2252#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2093#false} is VALID [2022-04-08 10:55:59,923 INFO L290 TraceCheckUtils]: 51: Hoare triple {2093#false} assume !false; {2093#false} is VALID [2022-04-08 10:55:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 10:55:59,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:00,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:00,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258319349] [2022-04-08 10:56:00,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:00,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46946319] [2022-04-08 10:56:00,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46946319] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:56:00,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:56:00,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 10:56:00,123 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:00,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [862318623] [2022-04-08 10:56:00,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [862318623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:00,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:00,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:56:00,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036668954] [2022-04-08 10:56:00,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:00,124 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 52 [2022-04-08 10:56:00,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:00,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 10:56:00,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:00,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:56:00,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:00,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:56:00,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:56:00,148 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 10:56:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:00,599 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-08 10:56:00,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:56:00,599 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 52 [2022-04-08 10:56:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 10:56:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-08 10:56:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 10:56:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-08 10:56:00,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 46 transitions. [2022-04-08 10:56:00,660 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-08 10:56:00,661 INFO L225 Difference]: With dead ends: 45 [2022-04-08 10:56:00,661 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 10:56:00,662 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:56:00,662 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:00,662 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 188 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:56:00,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 10:56:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-08 10:56:00,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:00,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 10:56:00,687 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 10:56:00,687 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 10:56:00,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:00,688 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-08 10:56:00,688 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-04-08 10:56:00,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:00,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:00,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 40 states. [2022-04-08 10:56:00,689 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 40 states. [2022-04-08 10:56:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:00,690 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-08 10:56:00,690 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-04-08 10:56:00,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:00,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:00,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:00,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:00,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 10:56:00,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-04-08 10:56:00,692 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 52 [2022-04-08 10:56:00,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:00,692 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-04-08 10:56:00,692 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 10:56:00,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 45 transitions. [2022-04-08 10:56:01,206 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-08 10:56:01,206 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-04-08 10:56:01,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 10:56:01,206 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:01,206 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:56:01,224 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-08 10:56:01,407 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:01,407 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:01,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:01,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2079567918, now seen corresponding path program 11 times [2022-04-08 10:56:01,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:01,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [98770618] [2022-04-08 10:56:01,491 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:56:01,492 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:56:01,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2079567918, now seen corresponding path program 12 times [2022-04-08 10:56:01,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:01,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854627056] [2022-04-08 10:56:01,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:01,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:01,511 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:01,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1550261532] [2022-04-08 10:56:01,511 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:56:01,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:01,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:01,514 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-08 10:56:01,515 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-08 10:56:01,690 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:56:01,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:01,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:56:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:01,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:56:02,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {2554#true} call ULTIMATE.init(); {2554#true} is VALID [2022-04-08 10:56:02,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {2554#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(9, 2);call #Ultimate.allocInit(12, 3); {2554#true} is VALID [2022-04-08 10:56:02,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {2554#true} assume true; {2554#true} is VALID [2022-04-08 10:56:02,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2554#true} {2554#true} #56#return; {2554#true} is VALID [2022-04-08 10:56:02,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {2554#true} call #t~ret5 := main(); {2554#true} is VALID [2022-04-08 10:56:02,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {2554#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2574#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:02,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {2574#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2574#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:02,175 INFO L272 TraceCheckUtils]: 7: Hoare triple {2574#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2554#true} is VALID [2022-04-08 10:56:02,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {2554#true} ~cond := #in~cond; {2554#true} is VALID [2022-04-08 10:56:02,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {2554#true} assume !(0 == ~cond); {2554#true} is VALID [2022-04-08 10:56:02,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {2554#true} assume true; {2554#true} is VALID [2022-04-08 10:56:02,176 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2554#true} {2574#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {2574#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:02,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {2574#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2596#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:56:02,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {2596#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {2596#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:56:02,177 INFO L272 TraceCheckUtils]: 14: Hoare triple {2596#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2554#true} is VALID [2022-04-08 10:56:02,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {2554#true} ~cond := #in~cond; {2554#true} is VALID [2022-04-08 10:56:02,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {2554#true} assume !(0 == ~cond); {2554#true} is VALID [2022-04-08 10:56:02,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {2554#true} assume true; {2554#true} is VALID [2022-04-08 10:56:02,177 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2554#true} {2596#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {2596#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:56:02,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {2596#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2618#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 10:56:02,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {2618#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {2618#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 10:56:02,178 INFO L272 TraceCheckUtils]: 21: Hoare triple {2618#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2554#true} is VALID [2022-04-08 10:56:02,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {2554#true} ~cond := #in~cond; {2554#true} is VALID [2022-04-08 10:56:02,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {2554#true} assume !(0 == ~cond); {2554#true} is VALID [2022-04-08 10:56:02,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {2554#true} assume true; {2554#true} is VALID [2022-04-08 10:56:02,179 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2554#true} {2618#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 1)))} #50#return; {2618#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 10:56:02,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {2618#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2640#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 10:56:02,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {2640#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {2640#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 10:56:02,180 INFO L272 TraceCheckUtils]: 28: Hoare triple {2640#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2554#true} is VALID [2022-04-08 10:56:02,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {2554#true} ~cond := #in~cond; {2554#true} is VALID [2022-04-08 10:56:02,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {2554#true} assume !(0 == ~cond); {2554#true} is VALID [2022-04-08 10:56:02,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {2554#true} assume true; {2554#true} is VALID [2022-04-08 10:56:02,181 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2554#true} {2640#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #50#return; {2640#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 10:56:02,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {2640#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2662#(and (= (+ main_~y~0 (- 3)) 1) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-08 10:56:02,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {2662#(and (= (+ main_~y~0 (- 3)) 1) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 3))} assume !false; {2662#(and (= (+ main_~y~0 (- 3)) 1) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-08 10:56:02,182 INFO L272 TraceCheckUtils]: 35: Hoare triple {2662#(and (= (+ main_~y~0 (- 3)) 1) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2554#true} is VALID [2022-04-08 10:56:02,182 INFO L290 TraceCheckUtils]: 36: Hoare triple {2554#true} ~cond := #in~cond; {2554#true} is VALID [2022-04-08 10:56:02,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {2554#true} assume !(0 == ~cond); {2554#true} is VALID [2022-04-08 10:56:02,182 INFO L290 TraceCheckUtils]: 38: Hoare triple {2554#true} assume true; {2554#true} is VALID [2022-04-08 10:56:02,183 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2554#true} {2662#(and (= (+ main_~y~0 (- 3)) 1) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 3))} #50#return; {2662#(and (= (+ main_~y~0 (- 3)) 1) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-08 10:56:02,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {2662#(and (= (+ main_~y~0 (- 3)) 1) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2684#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:02,184 INFO L290 TraceCheckUtils]: 41: Hoare triple {2684#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {2684#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:02,184 INFO L272 TraceCheckUtils]: 42: Hoare triple {2684#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2554#true} is VALID [2022-04-08 10:56:02,184 INFO L290 TraceCheckUtils]: 43: Hoare triple {2554#true} ~cond := #in~cond; {2554#true} is VALID [2022-04-08 10:56:02,184 INFO L290 TraceCheckUtils]: 44: Hoare triple {2554#true} assume !(0 == ~cond); {2554#true} is VALID [2022-04-08 10:56:02,184 INFO L290 TraceCheckUtils]: 45: Hoare triple {2554#true} assume true; {2554#true} is VALID [2022-04-08 10:56:02,185 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2554#true} {2684#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {2684#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:02,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {2684#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2706#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 10:56:02,186 INFO L290 TraceCheckUtils]: 48: Hoare triple {2706#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {2706#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 10:56:02,186 INFO L272 TraceCheckUtils]: 49: Hoare triple {2706#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2554#true} is VALID [2022-04-08 10:56:02,186 INFO L290 TraceCheckUtils]: 50: Hoare triple {2554#true} ~cond := #in~cond; {2554#true} is VALID [2022-04-08 10:56:02,186 INFO L290 TraceCheckUtils]: 51: Hoare triple {2554#true} assume !(0 == ~cond); {2554#true} is VALID [2022-04-08 10:56:02,186 INFO L290 TraceCheckUtils]: 52: Hoare triple {2554#true} assume true; {2554#true} is VALID [2022-04-08 10:56:02,187 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2554#true} {2706#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #50#return; {2706#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 10:56:02,187 INFO L290 TraceCheckUtils]: 54: Hoare triple {2706#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {2728#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 10:56:02,188 INFO L272 TraceCheckUtils]: 55: Hoare triple {2728#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2732#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:56:02,188 INFO L290 TraceCheckUtils]: 56: Hoare triple {2732#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2736#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:02,189 INFO L290 TraceCheckUtils]: 57: Hoare triple {2736#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2555#false} is VALID [2022-04-08 10:56:02,189 INFO L290 TraceCheckUtils]: 58: Hoare triple {2555#false} assume !false; {2555#false} is VALID [2022-04-08 10:56:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 14 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 10:56:02,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:02,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:02,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854627056] [2022-04-08 10:56:02,806 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:02,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550261532] [2022-04-08 10:56:02,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550261532] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:56:02,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:56:02,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 10:56:02,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:02,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [98770618] [2022-04-08 10:56:02,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [98770618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:02,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:02,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:56:02,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675787822] [2022-04-08 10:56:02,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:02,808 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 59 [2022-04-08 10:56:02,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:02,809 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), 11 states have internal predecessors, (23), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 10:56:02,837 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-08 10:56:02,837 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:56:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:02,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:56:02,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:56:02,838 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 10:56:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:03,392 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-08 10:56:03,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:56:03,393 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 59 [2022-04-08 10:56:03,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 10:56:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2022-04-08 10:56:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 10:56:03,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2022-04-08 10:56:03,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 50 transitions. [2022-04-08 10:56:03,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:03,453 INFO L225 Difference]: With dead ends: 48 [2022-04-08 10:56:03,453 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 10:56:03,453 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:56:03,455 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:03,455 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 219 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:56:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 10:56:03,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-08 10:56:03,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:03,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:56:03,501 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:56:03,502 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:56:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:03,508 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-08 10:56:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-08 10:56:03,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:03,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:03,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-08 10:56:03,508 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-08 10:56:03,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:03,510 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-08 10:56:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-08 10:56:03,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:03,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:03,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:03,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:56:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-04-08 10:56:03,511 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 59 [2022-04-08 10:56:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:03,512 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-04-08 10:56:03,512 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 10:56:03,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 49 transitions. [2022-04-08 10:56:04,009 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-08 10:56:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-08 10:56:04,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 10:56:04,010 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:04,010 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:56:04,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 10:56:04,210 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 10:56:04,210 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:04,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:04,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2024272645, now seen corresponding path program 13 times [2022-04-08 10:56:04,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:04,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [840945052] [2022-04-08 10:56:04,304 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:56:04,304 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:56:04,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2024272645, now seen corresponding path program 14 times [2022-04-08 10:56:04,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:04,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165288505] [2022-04-08 10:56:04,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:04,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:04,315 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:04,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658621879] [2022-04-08 10:56:04,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:56:04,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:04,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:04,331 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-08 10:56:04,350 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-08 10:56:04,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:56:04,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:04,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 10:56:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:04,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:56:05,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {3144#true} call ULTIMATE.init(); {3144#true} is VALID [2022-04-08 10:56:05,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {3144#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(9, 2);call #Ultimate.allocInit(12, 3); {3144#true} is VALID [2022-04-08 10:56:05,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 10:56:05,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3144#true} {3144#true} #56#return; {3144#true} is VALID [2022-04-08 10:56:05,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {3144#true} call #t~ret5 := main(); {3144#true} is VALID [2022-04-08 10:56:05,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {3144#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3164#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:05,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {3164#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3164#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:05,061 INFO L272 TraceCheckUtils]: 7: Hoare triple {3164#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3144#true} is VALID [2022-04-08 10:56:05,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-08 10:56:05,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-08 10:56:05,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 10:56:05,061 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3144#true} {3164#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {3164#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:05,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {3164#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3186#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:56:05,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {3186#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {3186#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:56:05,062 INFO L272 TraceCheckUtils]: 14: Hoare triple {3186#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3144#true} is VALID [2022-04-08 10:56:05,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-08 10:56:05,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-08 10:56:05,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 10:56:05,062 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3144#true} {3186#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {3186#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:56:05,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {3186#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3208#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 10:56:05,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {3208#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {3208#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 10:56:05,063 INFO L272 TraceCheckUtils]: 21: Hoare triple {3208#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3144#true} is VALID [2022-04-08 10:56:05,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-08 10:56:05,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-08 10:56:05,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 10:56:05,064 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3144#true} {3208#(and (= main_~y~0 2) (= main_~c~0 2))} #50#return; {3208#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 10:56:05,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {3208#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3230#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 10:56:05,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {3230#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {3230#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 10:56:05,064 INFO L272 TraceCheckUtils]: 28: Hoare triple {3230#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3144#true} is VALID [2022-04-08 10:56:05,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-08 10:56:05,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-08 10:56:05,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 10:56:05,065 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3144#true} {3230#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #50#return; {3230#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 10:56:05,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {3230#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3252#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:56:05,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {3252#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {3252#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:56:05,065 INFO L272 TraceCheckUtils]: 35: Hoare triple {3252#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3144#true} is VALID [2022-04-08 10:56:05,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-08 10:56:05,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-08 10:56:05,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 10:56:05,066 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3144#true} {3252#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #50#return; {3252#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:56:05,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {3252#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3274#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:05,067 INFO L290 TraceCheckUtils]: 41: Hoare triple {3274#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3274#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:05,067 INFO L272 TraceCheckUtils]: 42: Hoare triple {3274#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3144#true} is VALID [2022-04-08 10:56:05,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-08 10:56:05,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-08 10:56:05,067 INFO L290 TraceCheckUtils]: 45: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 10:56:05,067 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3144#true} {3274#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {3274#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:05,068 INFO L290 TraceCheckUtils]: 47: Hoare triple {3274#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 10:56:05,068 INFO L290 TraceCheckUtils]: 48: Hoare triple {3296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {3296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 10:56:05,068 INFO L272 TraceCheckUtils]: 49: Hoare triple {3296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3144#true} is VALID [2022-04-08 10:56:05,068 INFO L290 TraceCheckUtils]: 50: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-08 10:56:05,068 INFO L290 TraceCheckUtils]: 51: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-08 10:56:05,068 INFO L290 TraceCheckUtils]: 52: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 10:56:05,068 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3144#true} {3296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #50#return; {3296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 10:56:05,069 INFO L290 TraceCheckUtils]: 54: Hoare triple {3296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3318#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 10:56:05,069 INFO L290 TraceCheckUtils]: 55: Hoare triple {3318#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {3318#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 10:56:05,069 INFO L272 TraceCheckUtils]: 56: Hoare triple {3318#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3144#true} is VALID [2022-04-08 10:56:05,069 INFO L290 TraceCheckUtils]: 57: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-08 10:56:05,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-08 10:56:05,069 INFO L290 TraceCheckUtils]: 59: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 10:56:05,070 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3144#true} {3318#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #50#return; {3318#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 10:56:05,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {3318#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3340#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 10:56:05,071 INFO L272 TraceCheckUtils]: 62: Hoare triple {3340#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3344#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:56:05,072 INFO L290 TraceCheckUtils]: 63: Hoare triple {3344#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3348#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:05,072 INFO L290 TraceCheckUtils]: 64: Hoare triple {3348#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3145#false} is VALID [2022-04-08 10:56:05,072 INFO L290 TraceCheckUtils]: 65: Hoare triple {3145#false} assume !false; {3145#false} is VALID [2022-04-08 10:56:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 10:56:05,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:05,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:05,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165288505] [2022-04-08 10:56:05,235 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:05,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658621879] [2022-04-08 10:56:05,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658621879] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:56:05,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:56:05,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 10:56:05,236 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:05,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [840945052] [2022-04-08 10:56:05,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [840945052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:05,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:05,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:56:05,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768874784] [2022-04-08 10:56:05,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:05,237 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 66 [2022-04-08 10:56:05,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:05,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:56:05,268 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-08 10:56:05,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:56:05,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:05,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:56:05,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:56:05,269 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:56:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:05,975 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-08 10:56:05,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:56:05,975 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 66 [2022-04-08 10:56:05,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:56:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2022-04-08 10:56:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:56:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2022-04-08 10:56:05,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 54 transitions. [2022-04-08 10:56:06,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:06,016 INFO L225 Difference]: With dead ends: 51 [2022-04-08 10:56:06,016 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 10:56:06,016 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:56:06,017 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:06,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 252 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:56:06,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 10:56:06,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 10:56:06,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:06,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 10:56:06,050 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 10:56:06,050 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 10:56:06,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:06,051 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-08 10:56:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-04-08 10:56:06,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:06,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:06,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 46 states. [2022-04-08 10:56:06,051 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 46 states. [2022-04-08 10:56:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:06,053 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-08 10:56:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-04-08 10:56:06,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:06,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:06,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:06,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 10:56:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-04-08 10:56:06,054 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 66 [2022-04-08 10:56:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:06,054 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-04-08 10:56:06,054 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:56:06,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 53 transitions. [2022-04-08 10:56:06,564 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-08 10:56:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-04-08 10:56:06,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 10:56:06,564 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:06,565 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:56:06,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 10:56:06,765 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 10:56:06,765 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:06,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:06,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1092280434, now seen corresponding path program 15 times [2022-04-08 10:56:06,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:06,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [329728480] [2022-04-08 10:56:06,866 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:56:06,866 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:56:06,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1092280434, now seen corresponding path program 16 times [2022-04-08 10:56:06,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:06,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818537516] [2022-04-08 10:56:06,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:06,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:06,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:06,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2086604655] [2022-04-08 10:56:06,881 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:56:06,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:06,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:06,884 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-08 10:56:06,890 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-08 10:56:07,610 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:56:07,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:07,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 10:56:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:07,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:56:08,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {3686#true} call ULTIMATE.init(); {3686#true} is VALID [2022-04-08 10:56:08,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {3686#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(9, 2);call #Ultimate.allocInit(12, 3); {3686#true} is VALID [2022-04-08 10:56:08,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 10:56:08,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3686#true} {3686#true} #56#return; {3686#true} is VALID [2022-04-08 10:56:08,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {3686#true} call #t~ret5 := main(); {3686#true} is VALID [2022-04-08 10:56:08,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {3686#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3706#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:08,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {3706#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3706#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:08,099 INFO L272 TraceCheckUtils]: 7: Hoare triple {3706#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3686#true} is VALID [2022-04-08 10:56:08,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 10:56:08,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 10:56:08,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 10:56:08,099 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3686#true} {3706#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {3706#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:08,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {3706#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3728#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:56:08,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {3728#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {3728#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:56:08,100 INFO L272 TraceCheckUtils]: 14: Hoare triple {3728#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3686#true} is VALID [2022-04-08 10:56:08,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 10:56:08,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 10:56:08,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 10:56:08,101 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3686#true} {3728#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {3728#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:56:08,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {3728#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3750#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:08,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {3750#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {3750#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:08,102 INFO L272 TraceCheckUtils]: 21: Hoare triple {3750#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3686#true} is VALID [2022-04-08 10:56:08,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 10:56:08,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 10:56:08,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 10:56:08,102 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3686#true} {3750#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #50#return; {3750#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:08,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {3750#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3772#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 10:56:08,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {3772#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {3772#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 10:56:08,103 INFO L272 TraceCheckUtils]: 28: Hoare triple {3772#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3686#true} is VALID [2022-04-08 10:56:08,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 10:56:08,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 10:56:08,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 10:56:08,104 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3686#true} {3772#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #50#return; {3772#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 10:56:08,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {3772#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3794#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 10:56:08,105 INFO L290 TraceCheckUtils]: 34: Hoare triple {3794#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} assume !false; {3794#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 10:56:08,105 INFO L272 TraceCheckUtils]: 35: Hoare triple {3794#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3686#true} is VALID [2022-04-08 10:56:08,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 10:56:08,105 INFO L290 TraceCheckUtils]: 37: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 10:56:08,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 10:56:08,105 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3686#true} {3794#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} #50#return; {3794#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 10:56:08,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {3794#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3816#(and (= (+ main_~c~0 (- 5)) 0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:08,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {3816#(and (= (+ main_~c~0 (- 5)) 0) (= 5 main_~y~0))} assume !false; {3816#(and (= (+ main_~c~0 (- 5)) 0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:08,106 INFO L272 TraceCheckUtils]: 42: Hoare triple {3816#(and (= (+ main_~c~0 (- 5)) 0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3686#true} is VALID [2022-04-08 10:56:08,106 INFO L290 TraceCheckUtils]: 43: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 10:56:08,106 INFO L290 TraceCheckUtils]: 44: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 10:56:08,106 INFO L290 TraceCheckUtils]: 45: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 10:56:08,107 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3686#true} {3816#(and (= (+ main_~c~0 (- 5)) 0) (= 5 main_~y~0))} #50#return; {3816#(and (= (+ main_~c~0 (- 5)) 0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:08,107 INFO L290 TraceCheckUtils]: 47: Hoare triple {3816#(and (= (+ main_~c~0 (- 5)) 0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3838#(and (= (+ main_~c~0 (- 6)) 0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:08,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {3838#(and (= (+ main_~c~0 (- 6)) 0) (= 5 (+ (- 1) main_~y~0)))} assume !false; {3838#(and (= (+ main_~c~0 (- 6)) 0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:08,108 INFO L272 TraceCheckUtils]: 49: Hoare triple {3838#(and (= (+ main_~c~0 (- 6)) 0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3686#true} is VALID [2022-04-08 10:56:08,108 INFO L290 TraceCheckUtils]: 50: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 10:56:08,108 INFO L290 TraceCheckUtils]: 51: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 10:56:08,108 INFO L290 TraceCheckUtils]: 52: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 10:56:08,108 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3686#true} {3838#(and (= (+ main_~c~0 (- 6)) 0) (= 5 (+ (- 1) main_~y~0)))} #50#return; {3838#(and (= (+ main_~c~0 (- 6)) 0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:08,109 INFO L290 TraceCheckUtils]: 54: Hoare triple {3838#(and (= (+ main_~c~0 (- 6)) 0) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3860#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} is VALID [2022-04-08 10:56:08,109 INFO L290 TraceCheckUtils]: 55: Hoare triple {3860#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} assume !false; {3860#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} is VALID [2022-04-08 10:56:08,109 INFO L272 TraceCheckUtils]: 56: Hoare triple {3860#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3686#true} is VALID [2022-04-08 10:56:08,109 INFO L290 TraceCheckUtils]: 57: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 10:56:08,109 INFO L290 TraceCheckUtils]: 58: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 10:56:08,109 INFO L290 TraceCheckUtils]: 59: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 10:56:08,110 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3686#true} {3860#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} #50#return; {3860#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} is VALID [2022-04-08 10:56:08,110 INFO L290 TraceCheckUtils]: 61: Hoare triple {3860#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3882#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 10:56:08,111 INFO L290 TraceCheckUtils]: 62: Hoare triple {3882#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !false; {3882#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 10:56:08,111 INFO L272 TraceCheckUtils]: 63: Hoare triple {3882#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3686#true} is VALID [2022-04-08 10:56:08,111 INFO L290 TraceCheckUtils]: 64: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 10:56:08,111 INFO L290 TraceCheckUtils]: 65: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 10:56:08,111 INFO L290 TraceCheckUtils]: 66: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 10:56:08,111 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {3686#true} {3882#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #50#return; {3882#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 10:56:08,112 INFO L290 TraceCheckUtils]: 68: Hoare triple {3882#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {3904#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-08 10:56:08,112 INFO L272 TraceCheckUtils]: 69: Hoare triple {3904#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:56:08,113 INFO L290 TraceCheckUtils]: 70: Hoare triple {3908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:08,113 INFO L290 TraceCheckUtils]: 71: Hoare triple {3912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3687#false} is VALID [2022-04-08 10:56:08,113 INFO L290 TraceCheckUtils]: 72: Hoare triple {3687#false} assume !false; {3687#false} is VALID [2022-04-08 10:56:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 10:56:08,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:08,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:08,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818537516] [2022-04-08 10:56:08,428 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:08,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086604655] [2022-04-08 10:56:08,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086604655] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:56:08,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:56:08,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 10:56:08,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:08,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [329728480] [2022-04-08 10:56:08,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [329728480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:08,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:08,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:56:08,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232622985] [2022-04-08 10:56:08,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:08,429 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 73 [2022-04-08 10:56:08,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:08,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 10:56:08,476 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-08 10:56:08,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:56:08,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:08,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:56:08,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:56:08,477 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 10:56:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:09,237 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 10:56:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:56:09,237 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 73 [2022-04-08 10:56:09,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 10:56:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2022-04-08 10:56:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 10:56:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2022-04-08 10:56:09,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 58 transitions. [2022-04-08 10:56:09,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:09,279 INFO L225 Difference]: With dead ends: 54 [2022-04-08 10:56:09,279 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 10:56:09,280 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:56:09,284 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:09,284 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 287 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:56:09,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 10:56:09,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-08 10:56:09,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:09,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 10:56:09,336 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 10:56:09,336 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 10:56:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:09,337 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-08 10:56:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-08 10:56:09,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:09,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:09,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 49 states. [2022-04-08 10:56:09,338 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 49 states. [2022-04-08 10:56:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:09,339 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-08 10:56:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-08 10:56:09,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:09,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:09,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:09,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 10:56:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-04-08 10:56:09,341 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 73 [2022-04-08 10:56:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:09,341 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-04-08 10:56:09,341 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 10:56:09,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 57 transitions. [2022-04-08 10:56:09,858 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-08 10:56:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-08 10:56:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 10:56:09,858 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:09,859 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:56:09,864 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-08 10:56:10,059 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 10:56:10,059 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:10,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:10,060 INFO L85 PathProgramCache]: Analyzing trace with hash 634613349, now seen corresponding path program 17 times [2022-04-08 10:56:10,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:10,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1318914629] [2022-04-08 10:56:10,138 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:56:10,138 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:56:10,138 INFO L85 PathProgramCache]: Analyzing trace with hash 634613349, now seen corresponding path program 18 times [2022-04-08 10:56:10,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:10,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933666725] [2022-04-08 10:56:10,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:10,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:10,147 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:10,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878437330] [2022-04-08 10:56:10,147 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:56:10,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:10,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:10,148 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-08 10:56:10,149 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-08 10:56:10,596 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 10:56:10,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:10,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 10:56:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:10,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:56:11,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {4268#true} call ULTIMATE.init(); {4268#true} is VALID [2022-04-08 10:56:11,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {4268#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(9, 2);call #Ultimate.allocInit(12, 3); {4268#true} is VALID [2022-04-08 10:56:11,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 10:56:11,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4268#true} {4268#true} #56#return; {4268#true} is VALID [2022-04-08 10:56:11,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {4268#true} call #t~ret5 := main(); {4268#true} is VALID [2022-04-08 10:56:11,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {4268#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {4288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:11,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {4288#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:11,070 INFO L272 TraceCheckUtils]: 7: Hoare triple {4288#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4268#true} is VALID [2022-04-08 10:56:11,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 10:56:11,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 10:56:11,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 10:56:11,070 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4268#true} {4288#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {4288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:11,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {4288#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4310#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:56:11,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {4310#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {4310#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:56:11,071 INFO L272 TraceCheckUtils]: 14: Hoare triple {4310#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4268#true} is VALID [2022-04-08 10:56:11,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 10:56:11,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 10:56:11,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 10:56:11,072 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4268#true} {4310#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {4310#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:56:11,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {4310#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4332#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:11,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {4332#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {4332#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:11,073 INFO L272 TraceCheckUtils]: 21: Hoare triple {4332#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4268#true} is VALID [2022-04-08 10:56:11,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 10:56:11,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 10:56:11,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 10:56:11,073 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4268#true} {4332#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #50#return; {4332#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:11,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {4332#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4354#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 10:56:11,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {4354#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {4354#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 10:56:11,074 INFO L272 TraceCheckUtils]: 28: Hoare triple {4354#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4268#true} is VALID [2022-04-08 10:56:11,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 10:56:11,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 10:56:11,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 10:56:11,079 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4268#true} {4354#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #50#return; {4354#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 10:56:11,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {4354#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4376#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 10:56:11,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {4376#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {4376#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 10:56:11,079 INFO L272 TraceCheckUtils]: 35: Hoare triple {4376#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4268#true} is VALID [2022-04-08 10:56:11,079 INFO L290 TraceCheckUtils]: 36: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 10:56:11,080 INFO L290 TraceCheckUtils]: 37: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 10:56:11,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 10:56:11,080 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4268#true} {4376#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #50#return; {4376#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 10:56:11,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {4376#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4398#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:11,081 INFO L290 TraceCheckUtils]: 41: Hoare triple {4398#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {4398#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:11,081 INFO L272 TraceCheckUtils]: 42: Hoare triple {4398#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4268#true} is VALID [2022-04-08 10:56:11,081 INFO L290 TraceCheckUtils]: 43: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 10:56:11,081 INFO L290 TraceCheckUtils]: 44: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 10:56:11,081 INFO L290 TraceCheckUtils]: 45: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 10:56:11,081 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4268#true} {4398#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {4398#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:11,082 INFO L290 TraceCheckUtils]: 47: Hoare triple {4398#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4420#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:11,082 INFO L290 TraceCheckUtils]: 48: Hoare triple {4420#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {4420#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:11,082 INFO L272 TraceCheckUtils]: 49: Hoare triple {4420#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4268#true} is VALID [2022-04-08 10:56:11,082 INFO L290 TraceCheckUtils]: 50: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 10:56:11,082 INFO L290 TraceCheckUtils]: 51: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 10:56:11,082 INFO L290 TraceCheckUtils]: 52: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 10:56:11,083 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4268#true} {4420#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #50#return; {4420#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:11,083 INFO L290 TraceCheckUtils]: 54: Hoare triple {4420#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4442#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 10:56:11,084 INFO L290 TraceCheckUtils]: 55: Hoare triple {4442#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !false; {4442#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 10:56:11,084 INFO L272 TraceCheckUtils]: 56: Hoare triple {4442#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4268#true} is VALID [2022-04-08 10:56:11,084 INFO L290 TraceCheckUtils]: 57: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 10:56:11,084 INFO L290 TraceCheckUtils]: 58: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 10:56:11,084 INFO L290 TraceCheckUtils]: 59: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 10:56:11,084 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4268#true} {4442#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #50#return; {4442#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 10:56:11,085 INFO L290 TraceCheckUtils]: 61: Hoare triple {4442#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4464#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:11,085 INFO L290 TraceCheckUtils]: 62: Hoare triple {4464#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} assume !false; {4464#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:11,085 INFO L272 TraceCheckUtils]: 63: Hoare triple {4464#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4268#true} is VALID [2022-04-08 10:56:11,085 INFO L290 TraceCheckUtils]: 64: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 10:56:11,085 INFO L290 TraceCheckUtils]: 65: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 10:56:11,085 INFO L290 TraceCheckUtils]: 66: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 10:56:11,086 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {4268#true} {4464#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} #50#return; {4464#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:11,086 INFO L290 TraceCheckUtils]: 68: Hoare triple {4464#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4486#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 10:56:11,086 INFO L290 TraceCheckUtils]: 69: Hoare triple {4486#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {4486#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 10:56:11,086 INFO L272 TraceCheckUtils]: 70: Hoare triple {4486#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4268#true} is VALID [2022-04-08 10:56:11,086 INFO L290 TraceCheckUtils]: 71: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 10:56:11,087 INFO L290 TraceCheckUtils]: 72: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 10:56:11,087 INFO L290 TraceCheckUtils]: 73: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 10:56:11,087 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {4268#true} {4486#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #50#return; {4486#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 10:56:11,088 INFO L290 TraceCheckUtils]: 75: Hoare triple {4486#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {4508#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 10:56:11,088 INFO L272 TraceCheckUtils]: 76: Hoare triple {4508#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4512#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:56:11,088 INFO L290 TraceCheckUtils]: 77: Hoare triple {4512#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4516#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:11,089 INFO L290 TraceCheckUtils]: 78: Hoare triple {4516#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4269#false} is VALID [2022-04-08 10:56:11,089 INFO L290 TraceCheckUtils]: 79: Hoare triple {4269#false} assume !false; {4269#false} is VALID [2022-04-08 10:56:11,091 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 10:56:11,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:11,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:11,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933666725] [2022-04-08 10:56:11,349 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:11,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878437330] [2022-04-08 10:56:11,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878437330] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:56:11,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:56:11,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 10:56:11,349 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:11,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1318914629] [2022-04-08 10:56:11,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1318914629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:11,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:11,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:56:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891146718] [2022-04-08 10:56:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:11,350 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 80 [2022-04-08 10:56:11,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:11,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 10:56:11,389 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-08 10:56:11,389 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:56:11,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:11,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:56:11,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:56:11,390 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 10:56:12,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:12,334 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-08 10:56:12,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:56:12,334 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 80 [2022-04-08 10:56:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 10:56:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-08 10:56:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 10:56:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-08 10:56:12,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 62 transitions. [2022-04-08 10:56:12,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:12,387 INFO L225 Difference]: With dead ends: 57 [2022-04-08 10:56:12,387 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 10:56:12,387 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:56:12,387 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:12,388 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 324 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:56:12,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 10:56:12,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 10:56:12,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:12,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 14 states have call successors, (14), 5 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-08 10:56:12,427 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 14 states have call successors, (14), 5 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-08 10:56:12,427 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 14 states have call successors, (14), 5 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-08 10:56:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:12,428 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-08 10:56:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-08 10:56:12,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:12,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:12,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 14 states have call successors, (14), 5 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 52 states. [2022-04-08 10:56:12,429 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 14 states have call successors, (14), 5 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 52 states. [2022-04-08 10:56:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:12,430 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-08 10:56:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-08 10:56:12,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:12,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:12,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:12,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 14 states have call successors, (14), 5 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-08 10:56:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-04-08 10:56:12,432 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 80 [2022-04-08 10:56:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:12,432 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-04-08 10:56:12,432 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 10:56:12,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 61 transitions. [2022-04-08 10:56:12,961 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-08 10:56:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-08 10:56:12,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 10:56:12,962 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:12,962 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:56:12,967 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-08 10:56:13,162 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 10:56:13,163 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:13,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:13,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1567631086, now seen corresponding path program 19 times [2022-04-08 10:56:13,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:13,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [536367046] [2022-04-08 10:56:13,244 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:56:13,244 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:56:13,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1567631086, now seen corresponding path program 20 times [2022-04-08 10:56:13,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:13,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662708332] [2022-04-08 10:56:13,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:13,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:13,253 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:13,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558075288] [2022-04-08 10:56:13,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:56:13,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:13,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:13,255 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-08 10:56:13,256 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-08 10:56:13,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:56:13,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:13,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 10:56:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:13,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:56:14,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {4890#true} call ULTIMATE.init(); {4890#true} is VALID [2022-04-08 10:56:14,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {4890#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(9, 2);call #Ultimate.allocInit(12, 3); {4890#true} is VALID [2022-04-08 10:56:14,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 10:56:14,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4890#true} {4890#true} #56#return; {4890#true} is VALID [2022-04-08 10:56:14,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {4890#true} call #t~ret5 := main(); {4890#true} is VALID [2022-04-08 10:56:14,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {4890#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {4910#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:14,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {4910#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4910#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:14,435 INFO L272 TraceCheckUtils]: 7: Hoare triple {4910#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4890#true} is VALID [2022-04-08 10:56:14,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 10:56:14,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 10:56:14,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 10:56:14,436 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4890#true} {4910#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {4910#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:14,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {4910#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4932#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:56:14,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {4932#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {4932#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:56:14,436 INFO L272 TraceCheckUtils]: 14: Hoare triple {4932#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4890#true} is VALID [2022-04-08 10:56:14,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 10:56:14,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 10:56:14,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 10:56:14,437 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4890#true} {4932#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {4932#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:56:14,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {4932#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4954#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:56:14,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {4954#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {4954#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:56:14,437 INFO L272 TraceCheckUtils]: 21: Hoare triple {4954#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4890#true} is VALID [2022-04-08 10:56:14,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 10:56:14,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 10:56:14,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 10:56:14,438 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4890#true} {4954#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {4954#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:56:14,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {4954#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4976#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 10:56:14,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {4976#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4976#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 10:56:14,438 INFO L272 TraceCheckUtils]: 28: Hoare triple {4976#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4890#true} is VALID [2022-04-08 10:56:14,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 10:56:14,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 10:56:14,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 10:56:14,439 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4890#true} {4976#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {4976#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 10:56:14,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {4976#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 10:56:14,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {4998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {4998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 10:56:14,440 INFO L272 TraceCheckUtils]: 35: Hoare triple {4998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4890#true} is VALID [2022-04-08 10:56:14,440 INFO L290 TraceCheckUtils]: 36: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 10:56:14,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 10:56:14,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 10:56:14,441 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4890#true} {4998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #50#return; {4998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 10:56:14,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {4998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5020#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 10:56:14,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {5020#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {5020#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 10:56:14,441 INFO L272 TraceCheckUtils]: 42: Hoare triple {5020#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4890#true} is VALID [2022-04-08 10:56:14,441 INFO L290 TraceCheckUtils]: 43: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 10:56:14,441 INFO L290 TraceCheckUtils]: 44: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 10:56:14,441 INFO L290 TraceCheckUtils]: 45: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 10:56:14,461 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4890#true} {5020#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #50#return; {5020#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 10:56:14,462 INFO L290 TraceCheckUtils]: 47: Hoare triple {5020#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5042#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:56:14,463 INFO L290 TraceCheckUtils]: 48: Hoare triple {5042#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {5042#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:56:14,463 INFO L272 TraceCheckUtils]: 49: Hoare triple {5042#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4890#true} is VALID [2022-04-08 10:56:14,463 INFO L290 TraceCheckUtils]: 50: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 10:56:14,463 INFO L290 TraceCheckUtils]: 51: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 10:56:14,463 INFO L290 TraceCheckUtils]: 52: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 10:56:14,464 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4890#true} {5042#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {5042#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:56:14,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {5042#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5064#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 10:56:14,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {5064#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {5064#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 10:56:14,464 INFO L272 TraceCheckUtils]: 56: Hoare triple {5064#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4890#true} is VALID [2022-04-08 10:56:14,465 INFO L290 TraceCheckUtils]: 57: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 10:56:14,465 INFO L290 TraceCheckUtils]: 58: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 10:56:14,465 INFO L290 TraceCheckUtils]: 59: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 10:56:14,465 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4890#true} {5064#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {5064#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 10:56:14,466 INFO L290 TraceCheckUtils]: 61: Hoare triple {5064#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5086#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 10:56:14,466 INFO L290 TraceCheckUtils]: 62: Hoare triple {5086#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {5086#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 10:56:14,466 INFO L272 TraceCheckUtils]: 63: Hoare triple {5086#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4890#true} is VALID [2022-04-08 10:56:14,466 INFO L290 TraceCheckUtils]: 64: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 10:56:14,466 INFO L290 TraceCheckUtils]: 65: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 10:56:14,466 INFO L290 TraceCheckUtils]: 66: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 10:56:14,467 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {4890#true} {5086#(and (= main_~y~0 8) (= main_~c~0 8))} #50#return; {5086#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 10:56:14,467 INFO L290 TraceCheckUtils]: 68: Hoare triple {5086#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5108#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 10:56:14,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {5108#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {5108#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 10:56:14,468 INFO L272 TraceCheckUtils]: 70: Hoare triple {5108#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4890#true} is VALID [2022-04-08 10:56:14,468 INFO L290 TraceCheckUtils]: 71: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 10:56:14,468 INFO L290 TraceCheckUtils]: 72: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 10:56:14,468 INFO L290 TraceCheckUtils]: 73: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 10:56:14,468 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {4890#true} {5108#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #50#return; {5108#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 10:56:14,469 INFO L290 TraceCheckUtils]: 75: Hoare triple {5108#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5130#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-08 10:56:14,469 INFO L290 TraceCheckUtils]: 76: Hoare triple {5130#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} assume !false; {5130#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-08 10:56:14,470 INFO L272 TraceCheckUtils]: 77: Hoare triple {5130#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4890#true} is VALID [2022-04-08 10:56:14,470 INFO L290 TraceCheckUtils]: 78: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 10:56:14,470 INFO L290 TraceCheckUtils]: 79: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 10:56:14,470 INFO L290 TraceCheckUtils]: 80: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 10:56:14,471 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {4890#true} {5130#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} #50#return; {5130#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-08 10:56:14,471 INFO L290 TraceCheckUtils]: 82: Hoare triple {5130#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {5152#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-08 10:56:14,472 INFO L272 TraceCheckUtils]: 83: Hoare triple {5152#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5156#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:56:14,472 INFO L290 TraceCheckUtils]: 84: Hoare triple {5156#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5160#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:14,473 INFO L290 TraceCheckUtils]: 85: Hoare triple {5160#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4891#false} is VALID [2022-04-08 10:56:14,473 INFO L290 TraceCheckUtils]: 86: Hoare triple {4891#false} assume !false; {4891#false} is VALID [2022-04-08 10:56:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 22 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 10:56:14,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:14,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:14,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662708332] [2022-04-08 10:56:14,811 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:14,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558075288] [2022-04-08 10:56:14,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558075288] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:56:14,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:56:14,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-08 10:56:14,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:14,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [536367046] [2022-04-08 10:56:14,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [536367046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:14,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:14,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:56:14,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31533880] [2022-04-08 10:56:14,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:14,815 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 87 [2022-04-08 10:56:14,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:14,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 10:56:14,852 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-08 10:56:14,852 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:56:14,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:14,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:56:14,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:56:14,853 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 10:56:15,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:15,686 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-08 10:56:15,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:56:15,687 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 87 [2022-04-08 10:56:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 10:56:15,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 66 transitions. [2022-04-08 10:56:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 10:56:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 66 transitions. [2022-04-08 10:56:15,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 66 transitions. [2022-04-08 10:56:15,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:15,739 INFO L225 Difference]: With dead ends: 60 [2022-04-08 10:56:15,739 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 10:56:15,739 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:56:15,739 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:15,739 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 363 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:56:15,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 10:56:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-08 10:56:15,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:15,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 15 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 10:56:15,781 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 15 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 10:56:15,782 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 15 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 10:56:15,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:15,783 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-08 10:56:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-04-08 10:56:15,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:15,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:15,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 15 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 55 states. [2022-04-08 10:56:15,784 INFO L87 Difference]: Start difference. First operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 15 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 55 states. [2022-04-08 10:56:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:15,785 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-08 10:56:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-04-08 10:56:15,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:15,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:15,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:15,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 15 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 10:56:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2022-04-08 10:56:15,786 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 87 [2022-04-08 10:56:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:15,787 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2022-04-08 10:56:15,787 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 10:56:15,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 65 transitions. [2022-04-08 10:56:16,317 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-08 10:56:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-04-08 10:56:16,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-08 10:56:16,318 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:16,318 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:56:16,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-08 10:56:16,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 10:56:16,519 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:16,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:16,520 INFO L85 PathProgramCache]: Analyzing trace with hash 169050565, now seen corresponding path program 21 times [2022-04-08 10:56:16,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:16,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1542252428] [2022-04-08 10:56:16,595 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:56:16,595 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:56:16,595 INFO L85 PathProgramCache]: Analyzing trace with hash 169050565, now seen corresponding path program 22 times [2022-04-08 10:56:16,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:16,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63660260] [2022-04-08 10:56:16,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:16,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:16,606 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:16,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1877569531] [2022-04-08 10:56:16,606 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:56:16,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:16,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:16,607 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-08 10:56:16,608 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-08 10:56:17,771 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:56:17,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:17,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 10:56:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:17,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:56:18,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {5552#true} call ULTIMATE.init(); {5552#true} is VALID [2022-04-08 10:56:18,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {5552#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(9, 2);call #Ultimate.allocInit(12, 3); {5552#true} is VALID [2022-04-08 10:56:18,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 10:56:18,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5552#true} {5552#true} #56#return; {5552#true} is VALID [2022-04-08 10:56:18,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {5552#true} call #t~ret5 := main(); {5552#true} is VALID [2022-04-08 10:56:18,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {5552#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5572#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:18,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {5572#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5572#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:18,374 INFO L272 TraceCheckUtils]: 7: Hoare triple {5572#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5552#true} is VALID [2022-04-08 10:56:18,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 10:56:18,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 10:56:18,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 10:56:18,375 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5552#true} {5572#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {5572#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:18,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {5572#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:56:18,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {5594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {5594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:56:18,376 INFO L272 TraceCheckUtils]: 14: Hoare triple {5594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5552#true} is VALID [2022-04-08 10:56:18,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 10:56:18,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 10:56:18,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 10:56:18,376 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5552#true} {5594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {5594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:56:18,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {5594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5616#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:18,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {5616#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {5616#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:18,377 INFO L272 TraceCheckUtils]: 21: Hoare triple {5616#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5552#true} is VALID [2022-04-08 10:56:18,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 10:56:18,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 10:56:18,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 10:56:18,378 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5552#true} {5616#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #50#return; {5616#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:18,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {5616#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5638#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 10:56:18,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {5638#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {5638#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 10:56:18,379 INFO L272 TraceCheckUtils]: 28: Hoare triple {5638#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5552#true} is VALID [2022-04-08 10:56:18,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 10:56:18,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 10:56:18,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 10:56:18,379 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5552#true} {5638#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #50#return; {5638#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 10:56:18,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {5638#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5660#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 10:56:18,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {5660#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {5660#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 10:56:18,380 INFO L272 TraceCheckUtils]: 35: Hoare triple {5660#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5552#true} is VALID [2022-04-08 10:56:18,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 10:56:18,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 10:56:18,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 10:56:18,381 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5552#true} {5660#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #50#return; {5660#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 10:56:18,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {5660#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5682#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 10:56:18,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {5682#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {5682#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 10:56:18,382 INFO L272 TraceCheckUtils]: 42: Hoare triple {5682#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5552#true} is VALID [2022-04-08 10:56:18,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 10:56:18,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 10:56:18,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 10:56:18,382 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5552#true} {5682#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #50#return; {5682#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 10:56:18,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {5682#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5704#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 10:56:18,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {5704#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {5704#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 10:56:18,383 INFO L272 TraceCheckUtils]: 49: Hoare triple {5704#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5552#true} is VALID [2022-04-08 10:56:18,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 10:56:18,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 10:56:18,384 INFO L290 TraceCheckUtils]: 52: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 10:56:18,384 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5552#true} {5704#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #50#return; {5704#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 10:56:18,384 INFO L290 TraceCheckUtils]: 54: Hoare triple {5704#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5726#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:18,385 INFO L290 TraceCheckUtils]: 55: Hoare triple {5726#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {5726#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:18,385 INFO L272 TraceCheckUtils]: 56: Hoare triple {5726#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5552#true} is VALID [2022-04-08 10:56:18,385 INFO L290 TraceCheckUtils]: 57: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 10:56:18,385 INFO L290 TraceCheckUtils]: 58: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 10:56:18,385 INFO L290 TraceCheckUtils]: 59: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 10:56:18,385 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5552#true} {5726#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #50#return; {5726#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:18,386 INFO L290 TraceCheckUtils]: 61: Hoare triple {5726#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5748#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 10:56:18,386 INFO L290 TraceCheckUtils]: 62: Hoare triple {5748#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} assume !false; {5748#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 10:56:18,386 INFO L272 TraceCheckUtils]: 63: Hoare triple {5748#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5552#true} is VALID [2022-04-08 10:56:18,386 INFO L290 TraceCheckUtils]: 64: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 10:56:18,386 INFO L290 TraceCheckUtils]: 65: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 10:56:18,387 INFO L290 TraceCheckUtils]: 66: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 10:56:18,387 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {5552#true} {5748#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} #50#return; {5748#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 10:56:18,388 INFO L290 TraceCheckUtils]: 68: Hoare triple {5748#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5770#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 10:56:18,388 INFO L290 TraceCheckUtils]: 69: Hoare triple {5770#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {5770#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 10:56:18,388 INFO L272 TraceCheckUtils]: 70: Hoare triple {5770#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5552#true} is VALID [2022-04-08 10:56:18,388 INFO L290 TraceCheckUtils]: 71: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 10:56:18,388 INFO L290 TraceCheckUtils]: 72: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 10:56:18,388 INFO L290 TraceCheckUtils]: 73: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 10:56:18,389 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {5552#true} {5770#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #50#return; {5770#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 10:56:18,389 INFO L290 TraceCheckUtils]: 75: Hoare triple {5770#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5792#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-08 10:56:18,389 INFO L290 TraceCheckUtils]: 76: Hoare triple {5792#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !false; {5792#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-08 10:56:18,390 INFO L272 TraceCheckUtils]: 77: Hoare triple {5792#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5552#true} is VALID [2022-04-08 10:56:18,390 INFO L290 TraceCheckUtils]: 78: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 10:56:18,390 INFO L290 TraceCheckUtils]: 79: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 10:56:18,390 INFO L290 TraceCheckUtils]: 80: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 10:56:18,390 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {5552#true} {5792#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} #50#return; {5792#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-08 10:56:18,391 INFO L290 TraceCheckUtils]: 82: Hoare triple {5792#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5814#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-08 10:56:18,391 INFO L290 TraceCheckUtils]: 83: Hoare triple {5814#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !false; {5814#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-08 10:56:18,391 INFO L272 TraceCheckUtils]: 84: Hoare triple {5814#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5552#true} is VALID [2022-04-08 10:56:18,391 INFO L290 TraceCheckUtils]: 85: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 10:56:18,391 INFO L290 TraceCheckUtils]: 86: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 10:56:18,392 INFO L290 TraceCheckUtils]: 87: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 10:56:18,392 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {5552#true} {5814#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} #50#return; {5814#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-08 10:56:18,393 INFO L290 TraceCheckUtils]: 89: Hoare triple {5814#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !(~c~0 < ~k~0); {5836#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} is VALID [2022-04-08 10:56:18,393 INFO L272 TraceCheckUtils]: 90: Hoare triple {5836#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5840#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:56:18,394 INFO L290 TraceCheckUtils]: 91: Hoare triple {5840#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5844#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:18,394 INFO L290 TraceCheckUtils]: 92: Hoare triple {5844#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5553#false} is VALID [2022-04-08 10:56:18,394 INFO L290 TraceCheckUtils]: 93: Hoare triple {5553#false} assume !false; {5553#false} is VALID [2022-04-08 10:56:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 10:56:18,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:18,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:18,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63660260] [2022-04-08 10:56:18,666 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:18,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877569531] [2022-04-08 10:56:18,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877569531] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:56:18,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:56:18,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-08 10:56:18,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:18,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1542252428] [2022-04-08 10:56:18,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1542252428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:18,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:18,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:56:18,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787715774] [2022-04-08 10:56:18,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:18,667 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 94 [2022-04-08 10:56:18,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:18,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 10:56:18,739 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-08 10:56:18,740 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:56:18,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:18,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:56:18,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:56:18,740 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 10:56:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:19,827 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-08 10:56:19,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:56:19,827 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 94 [2022-04-08 10:56:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 10:56:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2022-04-08 10:56:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 10:56:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2022-04-08 10:56:19,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 70 transitions. [2022-04-08 10:56:19,892 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-08 10:56:19,894 INFO L225 Difference]: With dead ends: 63 [2022-04-08 10:56:19,894 INFO L226 Difference]: Without dead ends: 58 [2022-04-08 10:56:19,895 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:56:19,895 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:19,895 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 404 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:56:19,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-08 10:56:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-08 10:56:19,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:19,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 16 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 10:56:19,942 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 16 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 10:56:19,942 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 16 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 10:56:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:19,943 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-08 10:56:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-08 10:56:19,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:19,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:19,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 16 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 58 states. [2022-04-08 10:56:19,944 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 16 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 58 states. [2022-04-08 10:56:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:19,946 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-08 10:56:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-08 10:56:19,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:19,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:19,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:19,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 16 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 10:56:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2022-04-08 10:56:19,950 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 94 [2022-04-08 10:56:19,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:19,950 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2022-04-08 10:56:19,950 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 10:56:19,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 69 transitions. [2022-04-08 10:56:20,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:20,521 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-08 10:56:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 10:56:20,522 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:20,522 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:56:20,528 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-08 10:56:20,722 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 10:56:20,723 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:20,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:20,723 INFO L85 PathProgramCache]: Analyzing trace with hash 555039154, now seen corresponding path program 23 times [2022-04-08 10:56:20,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:20,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1320563208] [2022-04-08 10:56:20,798 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:56:20,798 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:56:20,798 INFO L85 PathProgramCache]: Analyzing trace with hash 555039154, now seen corresponding path program 24 times [2022-04-08 10:56:20,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:20,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333406110] [2022-04-08 10:56:20,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:20,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:20,813 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:20,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283140250] [2022-04-08 10:56:20,814 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:56:20,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:20,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:20,816 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-08 10:56:20,817 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-08 10:56:21,466 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 10:56:21,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:21,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-08 10:56:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:21,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:56:21,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {6254#true} call ULTIMATE.init(); {6254#true} is VALID [2022-04-08 10:56:21,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {6254#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(9, 2);call #Ultimate.allocInit(12, 3); {6254#true} is VALID [2022-04-08 10:56:21,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 10:56:21,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6254#true} {6254#true} #56#return; {6254#true} is VALID [2022-04-08 10:56:21,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {6254#true} call #t~ret5 := main(); {6254#true} is VALID [2022-04-08 10:56:21,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {6254#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {6274#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:21,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {6274#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6274#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:21,978 INFO L272 TraceCheckUtils]: 7: Hoare triple {6274#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6254#true} is VALID [2022-04-08 10:56:21,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 10:56:21,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 10:56:21,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 10:56:21,979 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6254#true} {6274#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {6274#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:21,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {6274#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6296#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:56:21,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {6296#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {6296#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:56:21,979 INFO L272 TraceCheckUtils]: 14: Hoare triple {6296#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6254#true} is VALID [2022-04-08 10:56:21,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 10:56:21,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 10:56:21,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 10:56:21,980 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6254#true} {6296#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {6296#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:56:21,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {6296#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6318#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:56:21,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {6318#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {6318#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:56:21,981 INFO L272 TraceCheckUtils]: 21: Hoare triple {6318#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6254#true} is VALID [2022-04-08 10:56:21,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 10:56:21,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 10:56:21,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 10:56:21,982 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6254#true} {6318#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {6318#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:56:21,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {6318#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6340#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 10:56:21,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {6340#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {6340#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 10:56:21,983 INFO L272 TraceCheckUtils]: 28: Hoare triple {6340#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6254#true} is VALID [2022-04-08 10:56:21,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 10:56:21,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 10:56:21,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 10:56:21,984 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6254#true} {6340#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {6340#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 10:56:21,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {6340#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6362#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:21,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {6362#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {6362#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:21,985 INFO L272 TraceCheckUtils]: 35: Hoare triple {6362#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6254#true} is VALID [2022-04-08 10:56:21,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 10:56:21,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 10:56:21,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 10:56:21,986 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6254#true} {6362#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #50#return; {6362#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:21,986 INFO L290 TraceCheckUtils]: 40: Hoare triple {6362#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6384#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:21,986 INFO L290 TraceCheckUtils]: 41: Hoare triple {6384#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !false; {6384#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:21,987 INFO L272 TraceCheckUtils]: 42: Hoare triple {6384#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6254#true} is VALID [2022-04-08 10:56:21,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 10:56:21,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 10:56:21,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 10:56:21,987 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6254#true} {6384#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #50#return; {6384#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:21,988 INFO L290 TraceCheckUtils]: 47: Hoare triple {6384#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6406#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:21,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {6406#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} assume !false; {6406#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:21,988 INFO L272 TraceCheckUtils]: 49: Hoare triple {6406#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6254#true} is VALID [2022-04-08 10:56:21,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 10:56:21,988 INFO L290 TraceCheckUtils]: 51: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 10:56:21,988 INFO L290 TraceCheckUtils]: 52: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 10:56:21,989 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6254#true} {6406#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} #50#return; {6406#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:21,989 INFO L290 TraceCheckUtils]: 54: Hoare triple {6406#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6428#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 10:56:21,989 INFO L290 TraceCheckUtils]: 55: Hoare triple {6428#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {6428#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 10:56:21,989 INFO L272 TraceCheckUtils]: 56: Hoare triple {6428#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6254#true} is VALID [2022-04-08 10:56:21,990 INFO L290 TraceCheckUtils]: 57: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 10:56:21,990 INFO L290 TraceCheckUtils]: 58: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 10:56:21,990 INFO L290 TraceCheckUtils]: 59: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 10:56:21,990 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6254#true} {6428#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #50#return; {6428#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 10:56:21,991 INFO L290 TraceCheckUtils]: 61: Hoare triple {6428#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6450#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:56:21,991 INFO L290 TraceCheckUtils]: 62: Hoare triple {6450#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !false; {6450#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:56:21,991 INFO L272 TraceCheckUtils]: 63: Hoare triple {6450#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6254#true} is VALID [2022-04-08 10:56:21,991 INFO L290 TraceCheckUtils]: 64: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 10:56:21,991 INFO L290 TraceCheckUtils]: 65: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 10:56:21,991 INFO L290 TraceCheckUtils]: 66: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 10:56:21,992 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {6254#true} {6450#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} #50#return; {6450#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:56:21,992 INFO L290 TraceCheckUtils]: 68: Hoare triple {6450#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6472#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:21,992 INFO L290 TraceCheckUtils]: 69: Hoare triple {6472#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {6472#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:21,992 INFO L272 TraceCheckUtils]: 70: Hoare triple {6472#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6254#true} is VALID [2022-04-08 10:56:21,993 INFO L290 TraceCheckUtils]: 71: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 10:56:21,993 INFO L290 TraceCheckUtils]: 72: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 10:56:21,993 INFO L290 TraceCheckUtils]: 73: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 10:56:21,993 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6254#true} {6472#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #50#return; {6472#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:21,993 INFO L290 TraceCheckUtils]: 75: Hoare triple {6472#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6494#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:21,994 INFO L290 TraceCheckUtils]: 76: Hoare triple {6494#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {6494#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:21,994 INFO L272 TraceCheckUtils]: 77: Hoare triple {6494#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6254#true} is VALID [2022-04-08 10:56:21,994 INFO L290 TraceCheckUtils]: 78: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 10:56:21,994 INFO L290 TraceCheckUtils]: 79: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 10:56:21,994 INFO L290 TraceCheckUtils]: 80: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 10:56:21,994 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6254#true} {6494#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {6494#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:21,995 INFO L290 TraceCheckUtils]: 82: Hoare triple {6494#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6516#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:56:21,995 INFO L290 TraceCheckUtils]: 83: Hoare triple {6516#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {6516#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:56:21,995 INFO L272 TraceCheckUtils]: 84: Hoare triple {6516#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6254#true} is VALID [2022-04-08 10:56:21,995 INFO L290 TraceCheckUtils]: 85: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 10:56:21,995 INFO L290 TraceCheckUtils]: 86: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 10:56:21,996 INFO L290 TraceCheckUtils]: 87: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 10:56:21,996 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6254#true} {6516#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {6516#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:56:21,996 INFO L290 TraceCheckUtils]: 89: Hoare triple {6516#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6538#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} is VALID [2022-04-08 10:56:21,997 INFO L290 TraceCheckUtils]: 90: Hoare triple {6538#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} assume !false; {6538#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} is VALID [2022-04-08 10:56:21,997 INFO L272 TraceCheckUtils]: 91: Hoare triple {6538#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6254#true} is VALID [2022-04-08 10:56:21,997 INFO L290 TraceCheckUtils]: 92: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 10:56:21,997 INFO L290 TraceCheckUtils]: 93: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 10:56:21,997 INFO L290 TraceCheckUtils]: 94: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 10:56:21,997 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {6254#true} {6538#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} #50#return; {6538#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} is VALID [2022-04-08 10:56:21,998 INFO L290 TraceCheckUtils]: 96: Hoare triple {6538#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {6560#(and (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-08 10:56:21,998 INFO L272 TraceCheckUtils]: 97: Hoare triple {6560#(and (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6564#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:56:21,999 INFO L290 TraceCheckUtils]: 98: Hoare triple {6564#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6568#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:21,999 INFO L290 TraceCheckUtils]: 99: Hoare triple {6568#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6255#false} is VALID [2022-04-08 10:56:21,999 INFO L290 TraceCheckUtils]: 100: Hoare triple {6255#false} assume !false; {6255#false} is VALID [2022-04-08 10:56:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 26 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 10:56:22,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:22,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:22,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333406110] [2022-04-08 10:56:22,283 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:22,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283140250] [2022-04-08 10:56:22,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283140250] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:56:22,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:56:22,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-08 10:56:22,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:22,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1320563208] [2022-04-08 10:56:22,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1320563208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:22,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:22,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:56:22,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048790606] [2022-04-08 10:56:22,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:22,284 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 101 [2022-04-08 10:56:22,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:22,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 10:56:22,331 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-08 10:56:22,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:56:22,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:22,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:56:22,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:56:22,332 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 10:56:23,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:23,725 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-08 10:56:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:56:23,726 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 101 [2022-04-08 10:56:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 10:56:23,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-08 10:56:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 10:56:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-08 10:56:23,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 74 transitions. [2022-04-08 10:56:23,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:23,791 INFO L225 Difference]: With dead ends: 66 [2022-04-08 10:56:23,791 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 10:56:23,791 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:56:23,791 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:23,792 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 447 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:56:23,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 10:56:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-08 10:56:23,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:23,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 17 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:56:23,837 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 17 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:56:23,837 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 17 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:56:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:23,839 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-08 10:56:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-08 10:56:23,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:23,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:23,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 17 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 61 states. [2022-04-08 10:56:23,839 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 17 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 61 states. [2022-04-08 10:56:23,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:23,840 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-08 10:56:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-08 10:56:23,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:23,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:23,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:23,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:23,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 17 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:56:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-04-08 10:56:23,842 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 101 [2022-04-08 10:56:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:23,842 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-04-08 10:56:23,843 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 10:56:23,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 73 transitions. [2022-04-08 10:56:24,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-08 10:56:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-08 10:56:24,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:24,389 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:56:24,395 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-08 10:56:24,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:24,590 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:24,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:24,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2038312229, now seen corresponding path program 25 times [2022-04-08 10:56:24,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:24,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1801960144] [2022-04-08 10:56:24,682 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:56:24,682 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:56:24,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2038312229, now seen corresponding path program 26 times [2022-04-08 10:56:24,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:24,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549021234] [2022-04-08 10:56:24,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:24,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:24,700 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:24,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942688959] [2022-04-08 10:56:24,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:56:24,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:24,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:24,702 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-08 10:56:24,702 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-08 10:56:25,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:56:25,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:25,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-08 10:56:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:25,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:56:26,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {6996#true} call ULTIMATE.init(); {6996#true} is VALID [2022-04-08 10:56:26,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {6996#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(9, 2);call #Ultimate.allocInit(12, 3); {6996#true} is VALID [2022-04-08 10:56:26,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 10:56:26,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6996#true} {6996#true} #56#return; {6996#true} is VALID [2022-04-08 10:56:26,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {6996#true} call #t~ret5 := main(); {6996#true} is VALID [2022-04-08 10:56:26,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {6996#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {7016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:26,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {7016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:26,018 INFO L272 TraceCheckUtils]: 7: Hoare triple {7016#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6996#true} is VALID [2022-04-08 10:56:26,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 10:56:26,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 10:56:26,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 10:56:26,019 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6996#true} {7016#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {7016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:26,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {7016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7038#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:56:26,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {7038#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7038#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:56:26,020 INFO L272 TraceCheckUtils]: 14: Hoare triple {7038#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6996#true} is VALID [2022-04-08 10:56:26,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 10:56:26,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 10:56:26,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 10:56:26,020 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6996#true} {7038#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {7038#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:56:26,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {7038#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7060#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 10:56:26,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {7060#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {7060#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 10:56:26,021 INFO L272 TraceCheckUtils]: 21: Hoare triple {7060#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6996#true} is VALID [2022-04-08 10:56:26,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 10:56:26,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 10:56:26,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 10:56:26,022 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6996#true} {7060#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #50#return; {7060#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 10:56:26,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {7060#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7082#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 10:56:26,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {7082#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {7082#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 10:56:26,023 INFO L272 TraceCheckUtils]: 28: Hoare triple {7082#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6996#true} is VALID [2022-04-08 10:56:26,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 10:56:26,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 10:56:26,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 10:56:26,023 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6996#true} {7082#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #50#return; {7082#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 10:56:26,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {7082#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7104#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 10:56:26,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {7104#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {7104#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 10:56:26,024 INFO L272 TraceCheckUtils]: 35: Hoare triple {7104#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6996#true} is VALID [2022-04-08 10:56:26,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 10:56:26,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 10:56:26,024 INFO L290 TraceCheckUtils]: 38: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 10:56:26,025 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6996#true} {7104#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {7104#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 10:56:26,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {7104#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7126#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 10:56:26,026 INFO L290 TraceCheckUtils]: 41: Hoare triple {7126#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {7126#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 10:56:26,026 INFO L272 TraceCheckUtils]: 42: Hoare triple {7126#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6996#true} is VALID [2022-04-08 10:56:26,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 10:56:26,026 INFO L290 TraceCheckUtils]: 44: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 10:56:26,026 INFO L290 TraceCheckUtils]: 45: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 10:56:26,026 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6996#true} {7126#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #50#return; {7126#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 10:56:26,027 INFO L290 TraceCheckUtils]: 47: Hoare triple {7126#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7148#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 10:56:26,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {7148#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} assume !false; {7148#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 10:56:26,027 INFO L272 TraceCheckUtils]: 49: Hoare triple {7148#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6996#true} is VALID [2022-04-08 10:56:26,027 INFO L290 TraceCheckUtils]: 50: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 10:56:26,027 INFO L290 TraceCheckUtils]: 51: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 10:56:26,027 INFO L290 TraceCheckUtils]: 52: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 10:56:26,028 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6996#true} {7148#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} #50#return; {7148#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 10:56:26,028 INFO L290 TraceCheckUtils]: 54: Hoare triple {7148#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7170#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 10:56:26,028 INFO L290 TraceCheckUtils]: 55: Hoare triple {7170#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {7170#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 10:56:26,029 INFO L272 TraceCheckUtils]: 56: Hoare triple {7170#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6996#true} is VALID [2022-04-08 10:56:26,029 INFO L290 TraceCheckUtils]: 57: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 10:56:26,029 INFO L290 TraceCheckUtils]: 58: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 10:56:26,029 INFO L290 TraceCheckUtils]: 59: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 10:56:26,029 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6996#true} {7170#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {7170#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 10:56:26,030 INFO L290 TraceCheckUtils]: 61: Hoare triple {7170#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7192#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 10:56:26,030 INFO L290 TraceCheckUtils]: 62: Hoare triple {7192#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {7192#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 10:56:26,030 INFO L272 TraceCheckUtils]: 63: Hoare triple {7192#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6996#true} is VALID [2022-04-08 10:56:26,030 INFO L290 TraceCheckUtils]: 64: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 10:56:26,030 INFO L290 TraceCheckUtils]: 65: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 10:56:26,030 INFO L290 TraceCheckUtils]: 66: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 10:56:26,031 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {6996#true} {7192#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #50#return; {7192#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 10:56:26,031 INFO L290 TraceCheckUtils]: 68: Hoare triple {7192#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7214#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 10:56:26,031 INFO L290 TraceCheckUtils]: 69: Hoare triple {7214#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {7214#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 10:56:26,032 INFO L272 TraceCheckUtils]: 70: Hoare triple {7214#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6996#true} is VALID [2022-04-08 10:56:26,032 INFO L290 TraceCheckUtils]: 71: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 10:56:26,032 INFO L290 TraceCheckUtils]: 72: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 10:56:26,032 INFO L290 TraceCheckUtils]: 73: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 10:56:26,032 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6996#true} {7214#(and (= main_~y~0 9) (= main_~c~0 9))} #50#return; {7214#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 10:56:26,033 INFO L290 TraceCheckUtils]: 75: Hoare triple {7214#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7236#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:26,033 INFO L290 TraceCheckUtils]: 76: Hoare triple {7236#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {7236#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:26,033 INFO L272 TraceCheckUtils]: 77: Hoare triple {7236#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6996#true} is VALID [2022-04-08 10:56:26,033 INFO L290 TraceCheckUtils]: 78: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 10:56:26,033 INFO L290 TraceCheckUtils]: 79: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 10:56:26,033 INFO L290 TraceCheckUtils]: 80: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 10:56:26,034 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6996#true} {7236#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {7236#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:26,034 INFO L290 TraceCheckUtils]: 82: Hoare triple {7236#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7258#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 10:56:26,034 INFO L290 TraceCheckUtils]: 83: Hoare triple {7258#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !false; {7258#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 10:56:26,034 INFO L272 TraceCheckUtils]: 84: Hoare triple {7258#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6996#true} is VALID [2022-04-08 10:56:26,034 INFO L290 TraceCheckUtils]: 85: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 10:56:26,035 INFO L290 TraceCheckUtils]: 86: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 10:56:26,035 INFO L290 TraceCheckUtils]: 87: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 10:56:26,035 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6996#true} {7258#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} #50#return; {7258#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 10:56:26,035 INFO L290 TraceCheckUtils]: 89: Hoare triple {7258#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7280#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:56:26,036 INFO L290 TraceCheckUtils]: 90: Hoare triple {7280#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {7280#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:56:26,036 INFO L272 TraceCheckUtils]: 91: Hoare triple {7280#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6996#true} is VALID [2022-04-08 10:56:26,036 INFO L290 TraceCheckUtils]: 92: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 10:56:26,036 INFO L290 TraceCheckUtils]: 93: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 10:56:26,036 INFO L290 TraceCheckUtils]: 94: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 10:56:26,037 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {6996#true} {7280#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {7280#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:56:26,037 INFO L290 TraceCheckUtils]: 96: Hoare triple {7280#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7302#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 10:56:26,037 INFO L290 TraceCheckUtils]: 97: Hoare triple {7302#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !false; {7302#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 10:56:26,037 INFO L272 TraceCheckUtils]: 98: Hoare triple {7302#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6996#true} is VALID [2022-04-08 10:56:26,037 INFO L290 TraceCheckUtils]: 99: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 10:56:26,038 INFO L290 TraceCheckUtils]: 100: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 10:56:26,038 INFO L290 TraceCheckUtils]: 101: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 10:56:26,038 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {6996#true} {7302#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #50#return; {7302#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 10:56:26,039 INFO L290 TraceCheckUtils]: 103: Hoare triple {7302#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !(~c~0 < ~k~0); {7324#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-08 10:56:26,039 INFO L272 TraceCheckUtils]: 104: Hoare triple {7324#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7328#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:56:26,040 INFO L290 TraceCheckUtils]: 105: Hoare triple {7328#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7332#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:26,040 INFO L290 TraceCheckUtils]: 106: Hoare triple {7332#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6997#false} is VALID [2022-04-08 10:56:26,040 INFO L290 TraceCheckUtils]: 107: Hoare triple {6997#false} assume !false; {6997#false} is VALID [2022-04-08 10:56:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 28 proven. 273 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-08 10:56:26,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:26,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:26,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549021234] [2022-04-08 10:56:26,346 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:26,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942688959] [2022-04-08 10:56:26,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942688959] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:56:26,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:56:26,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-08 10:56:26,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:26,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1801960144] [2022-04-08 10:56:26,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1801960144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:26,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:26,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:56:26,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676448032] [2022-04-08 10:56:26,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:26,347 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 16 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 108 [2022-04-08 10:56:26,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:26,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 16 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:56:26,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:26,403 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:56:26,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:26,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:56:26,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:56:26,404 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 16 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:56:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:28,053 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-08 10:56:28,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:56:28,053 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 16 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 108 [2022-04-08 10:56:28,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 16 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:56:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 78 transitions. [2022-04-08 10:56:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 16 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:56:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 78 transitions. [2022-04-08 10:56:28,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 78 transitions. [2022-04-08 10:56:28,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:28,113 INFO L225 Difference]: With dead ends: 69 [2022-04-08 10:56:28,113 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 10:56:28,114 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:56:28,114 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:28,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 492 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:56:28,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 10:56:28,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-08 10:56:28,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:28,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 18 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 10:56:28,162 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 18 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 10:56:28,162 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 18 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 10:56:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:28,163 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-08 10:56:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-08 10:56:28,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:28,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:28,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 18 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 64 states. [2022-04-08 10:56:28,164 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 18 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 64 states. [2022-04-08 10:56:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:28,165 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-08 10:56:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-08 10:56:28,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:28,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:28,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:28,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 18 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 10:56:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2022-04-08 10:56:28,167 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 108 [2022-04-08 10:56:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:28,167 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2022-04-08 10:56:28,167 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 16 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:56:28,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 77 transitions. [2022-04-08 10:56:28,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:28,708 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-08 10:56:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-08 10:56:28,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:28,708 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:56:28,715 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-08 10:56:28,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 10:56:28,909 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:28,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:28,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1009450414, now seen corresponding path program 27 times [2022-04-08 10:56:28,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:28,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1036480087] [2022-04-08 10:56:28,977 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:56:28,978 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:56:28,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1009450414, now seen corresponding path program 28 times [2022-04-08 10:56:28,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:28,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780657733] [2022-04-08 10:56:28,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:28,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:28,987 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:28,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1473857198] [2022-04-08 10:56:28,987 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:56:28,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:28,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:28,988 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-08 10:56:28,989 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-08 10:56:30,038 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:56:30,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:30,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-08 10:56:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:30,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:56:30,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {7778#true} call ULTIMATE.init(); {7778#true} is VALID [2022-04-08 10:56:30,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {7778#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(9, 2);call #Ultimate.allocInit(12, 3); {7778#true} is VALID [2022-04-08 10:56:30,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 10:56:30,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7778#true} {7778#true} #56#return; {7778#true} is VALID [2022-04-08 10:56:30,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {7778#true} call #t~ret5 := main(); {7778#true} is VALID [2022-04-08 10:56:30,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {7778#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {7798#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:30,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {7798#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7798#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:30,679 INFO L272 TraceCheckUtils]: 7: Hoare triple {7798#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 10:56:30,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 10:56:30,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 10:56:30,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 10:56:30,680 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7778#true} {7798#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {7798#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:30,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {7798#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7820#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:56:30,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {7820#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {7820#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:56:30,681 INFO L272 TraceCheckUtils]: 14: Hoare triple {7820#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 10:56:30,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 10:56:30,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 10:56:30,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 10:56:30,681 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7778#true} {7820#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {7820#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:56:30,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {7820#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7842#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 10:56:30,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {7842#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {7842#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 10:56:30,682 INFO L272 TraceCheckUtils]: 21: Hoare triple {7842#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 10:56:30,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 10:56:30,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 10:56:30,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 10:56:30,683 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7778#true} {7842#(and (= main_~y~0 2) (= main_~c~0 2))} #50#return; {7842#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 10:56:30,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {7842#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7864#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 10:56:30,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {7864#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {7864#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 10:56:30,684 INFO L272 TraceCheckUtils]: 28: Hoare triple {7864#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 10:56:30,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 10:56:30,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 10:56:30,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 10:56:30,684 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7778#true} {7864#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #50#return; {7864#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 10:56:30,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {7864#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7886#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 10:56:30,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {7886#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {7886#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 10:56:30,685 INFO L272 TraceCheckUtils]: 35: Hoare triple {7886#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 10:56:30,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 10:56:30,685 INFO L290 TraceCheckUtils]: 37: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 10:56:30,685 INFO L290 TraceCheckUtils]: 38: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 10:56:30,686 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7778#true} {7886#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #50#return; {7886#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 10:56:30,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {7886#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7908#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:30,686 INFO L290 TraceCheckUtils]: 41: Hoare triple {7908#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {7908#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:30,686 INFO L272 TraceCheckUtils]: 42: Hoare triple {7908#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 10:56:30,687 INFO L290 TraceCheckUtils]: 43: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 10:56:30,687 INFO L290 TraceCheckUtils]: 44: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 10:56:30,687 INFO L290 TraceCheckUtils]: 45: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 10:56:30,687 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7778#true} {7908#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {7908#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:30,688 INFO L290 TraceCheckUtils]: 47: Hoare triple {7908#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7930#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:30,688 INFO L290 TraceCheckUtils]: 48: Hoare triple {7930#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {7930#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:30,688 INFO L272 TraceCheckUtils]: 49: Hoare triple {7930#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 10:56:30,688 INFO L290 TraceCheckUtils]: 50: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 10:56:30,688 INFO L290 TraceCheckUtils]: 51: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 10:56:30,688 INFO L290 TraceCheckUtils]: 52: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 10:56:30,689 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {7778#true} {7930#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #50#return; {7930#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:30,689 INFO L290 TraceCheckUtils]: 54: Hoare triple {7930#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7952#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 10:56:30,689 INFO L290 TraceCheckUtils]: 55: Hoare triple {7952#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {7952#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 10:56:30,689 INFO L272 TraceCheckUtils]: 56: Hoare triple {7952#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 10:56:30,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 10:56:30,690 INFO L290 TraceCheckUtils]: 58: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 10:56:30,690 INFO L290 TraceCheckUtils]: 59: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 10:56:30,690 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7778#true} {7952#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #50#return; {7952#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 10:56:30,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {7952#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7974#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 10:56:30,691 INFO L290 TraceCheckUtils]: 62: Hoare triple {7974#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !false; {7974#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 10:56:30,691 INFO L272 TraceCheckUtils]: 63: Hoare triple {7974#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 10:56:30,691 INFO L290 TraceCheckUtils]: 64: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 10:56:30,691 INFO L290 TraceCheckUtils]: 65: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 10:56:30,691 INFO L290 TraceCheckUtils]: 66: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 10:56:30,691 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7778#true} {7974#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #50#return; {7974#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 10:56:30,692 INFO L290 TraceCheckUtils]: 68: Hoare triple {7974#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7996#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 10:56:30,692 INFO L290 TraceCheckUtils]: 69: Hoare triple {7996#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {7996#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 10:56:30,692 INFO L272 TraceCheckUtils]: 70: Hoare triple {7996#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 10:56:30,692 INFO L290 TraceCheckUtils]: 71: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 10:56:30,692 INFO L290 TraceCheckUtils]: 72: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 10:56:30,693 INFO L290 TraceCheckUtils]: 73: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 10:56:30,693 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {7778#true} {7996#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #50#return; {7996#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 10:56:30,693 INFO L290 TraceCheckUtils]: 75: Hoare triple {7996#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8018#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:30,694 INFO L290 TraceCheckUtils]: 76: Hoare triple {8018#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {8018#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:30,694 INFO L272 TraceCheckUtils]: 77: Hoare triple {8018#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 10:56:30,694 INFO L290 TraceCheckUtils]: 78: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 10:56:30,694 INFO L290 TraceCheckUtils]: 79: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 10:56:30,694 INFO L290 TraceCheckUtils]: 80: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 10:56:30,694 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {7778#true} {8018#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {8018#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:30,695 INFO L290 TraceCheckUtils]: 82: Hoare triple {8018#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8040#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 10:56:30,695 INFO L290 TraceCheckUtils]: 83: Hoare triple {8040#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {8040#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 10:56:30,695 INFO L272 TraceCheckUtils]: 84: Hoare triple {8040#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 10:56:30,695 INFO L290 TraceCheckUtils]: 85: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 10:56:30,695 INFO L290 TraceCheckUtils]: 86: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 10:56:30,695 INFO L290 TraceCheckUtils]: 87: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 10:56:30,696 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7778#true} {8040#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #50#return; {8040#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 10:56:30,696 INFO L290 TraceCheckUtils]: 89: Hoare triple {8040#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8062#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:56:30,697 INFO L290 TraceCheckUtils]: 90: Hoare triple {8062#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {8062#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:56:30,697 INFO L272 TraceCheckUtils]: 91: Hoare triple {8062#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 10:56:30,697 INFO L290 TraceCheckUtils]: 92: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 10:56:30,697 INFO L290 TraceCheckUtils]: 93: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 10:56:30,697 INFO L290 TraceCheckUtils]: 94: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 10:56:30,697 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7778#true} {8062#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {8062#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:56:30,698 INFO L290 TraceCheckUtils]: 96: Hoare triple {8062#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8084#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:30,698 INFO L290 TraceCheckUtils]: 97: Hoare triple {8084#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !false; {8084#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:30,698 INFO L272 TraceCheckUtils]: 98: Hoare triple {8084#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 10:56:30,698 INFO L290 TraceCheckUtils]: 99: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 10:56:30,698 INFO L290 TraceCheckUtils]: 100: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 10:56:30,698 INFO L290 TraceCheckUtils]: 101: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 10:56:30,699 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {7778#true} {8084#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} #50#return; {8084#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:30,699 INFO L290 TraceCheckUtils]: 103: Hoare triple {8084#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8106#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-08 10:56:30,699 INFO L290 TraceCheckUtils]: 104: Hoare triple {8106#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !false; {8106#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-08 10:56:30,700 INFO L272 TraceCheckUtils]: 105: Hoare triple {8106#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 10:56:30,700 INFO L290 TraceCheckUtils]: 106: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 10:56:30,700 INFO L290 TraceCheckUtils]: 107: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 10:56:30,700 INFO L290 TraceCheckUtils]: 108: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 10:56:30,700 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {7778#true} {8106#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} #50#return; {8106#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-08 10:56:30,701 INFO L290 TraceCheckUtils]: 110: Hoare triple {8106#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {8128#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-08 10:56:30,702 INFO L272 TraceCheckUtils]: 111: Hoare triple {8128#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8132#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:56:30,702 INFO L290 TraceCheckUtils]: 112: Hoare triple {8132#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8136#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:30,702 INFO L290 TraceCheckUtils]: 113: Hoare triple {8136#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7779#false} is VALID [2022-04-08 10:56:30,702 INFO L290 TraceCheckUtils]: 114: Hoare triple {7779#false} assume !false; {7779#false} is VALID [2022-04-08 10:56:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 30 proven. 315 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-08 10:56:30,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:30,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:30,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780657733] [2022-04-08 10:56:30,938 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:30,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473857198] [2022-04-08 10:56:30,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473857198] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:56:30,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:56:30,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-08 10:56:30,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:30,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1036480087] [2022-04-08 10:56:30,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1036480087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:30,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:30,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:56:30,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165220882] [2022-04-08 10:56:30,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:30,939 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 115 [2022-04-08 10:56:30,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:30,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 10:56:30,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:30,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:56:30,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:30,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:56:30,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:56:30,991 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 10:56:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:32,747 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-04-08 10:56:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:56:32,747 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 115 [2022-04-08 10:56:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 10:56:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 82 transitions. [2022-04-08 10:56:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 10:56:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 82 transitions. [2022-04-08 10:56:32,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 82 transitions. [2022-04-08 10:56:32,812 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-08 10:56:32,813 INFO L225 Difference]: With dead ends: 72 [2022-04-08 10:56:32,814 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 10:56:32,814 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:56:32,814 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:32,814 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 539 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:56:32,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 10:56:32,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-08 10:56:32,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:32,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 19 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 10:56:32,866 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 19 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 10:56:32,866 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 19 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 10:56:32,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:32,867 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2022-04-08 10:56:32,868 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-04-08 10:56:32,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:32,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:32,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 19 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 67 states. [2022-04-08 10:56:32,868 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 19 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 67 states. [2022-04-08 10:56:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:32,869 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2022-04-08 10:56:32,869 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-04-08 10:56:32,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:32,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:32,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:32,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 19 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 10:56:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-04-08 10:56:32,871 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 115 [2022-04-08 10:56:32,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:32,871 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2022-04-08 10:56:32,872 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 10:56:32,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 81 transitions. [2022-04-08 10:56:33,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:33,419 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-04-08 10:56:33,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 10:56:33,420 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:33,420 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:56:33,425 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-08 10:56:33,625 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 10:56:33,625 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:33,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:33,626 INFO L85 PathProgramCache]: Analyzing trace with hash -374771579, now seen corresponding path program 29 times [2022-04-08 10:56:33,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:33,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1718547200] [2022-04-08 10:56:33,705 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:56:33,705 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:56:33,705 INFO L85 PathProgramCache]: Analyzing trace with hash -374771579, now seen corresponding path program 30 times [2022-04-08 10:56:33,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:33,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923531663] [2022-04-08 10:56:33,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:33,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:33,719 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:33,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [724464396] [2022-04-08 10:56:33,719 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:56:33,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:33,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:33,730 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-08 10:56:33,731 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-08 10:56:34,200 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-08 10:56:34,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:34,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-08 10:56:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:34,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:56:34,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {8600#true} call ULTIMATE.init(); {8600#true} is VALID [2022-04-08 10:56:34,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {8600#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(9, 2);call #Ultimate.allocInit(12, 3); {8600#true} is VALID [2022-04-08 10:56:34,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8600#true} {8600#true} #56#return; {8600#true} is VALID [2022-04-08 10:56:34,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {8600#true} call #t~ret5 := main(); {8600#true} is VALID [2022-04-08 10:56:34,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {8600#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {8620#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:34,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {8620#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {8620#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:34,897 INFO L272 TraceCheckUtils]: 7: Hoare triple {8620#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 10:56:34,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 10:56:34,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 10:56:34,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,898 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {8600#true} {8620#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {8620#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:34,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {8620#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8642#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:56:34,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {8642#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {8642#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:56:34,899 INFO L272 TraceCheckUtils]: 14: Hoare triple {8642#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 10:56:34,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 10:56:34,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 10:56:34,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,899 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8600#true} {8642#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {8642#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:56:34,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {8642#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8664#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 10:56:34,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {8664#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {8664#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 10:56:34,900 INFO L272 TraceCheckUtils]: 21: Hoare triple {8664#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 10:56:34,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 10:56:34,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 10:56:34,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,901 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8600#true} {8664#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #50#return; {8664#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 10:56:34,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {8664#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8686#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 10:56:34,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {8686#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !false; {8686#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 10:56:34,902 INFO L272 TraceCheckUtils]: 28: Hoare triple {8686#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 10:56:34,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 10:56:34,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 10:56:34,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,902 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8600#true} {8686#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #50#return; {8686#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 10:56:34,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {8686#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8708#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-08 10:56:34,903 INFO L290 TraceCheckUtils]: 34: Hoare triple {8708#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !false; {8708#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-08 10:56:34,903 INFO L272 TraceCheckUtils]: 35: Hoare triple {8708#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 10:56:34,903 INFO L290 TraceCheckUtils]: 36: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 10:56:34,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 10:56:34,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,904 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8600#true} {8708#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} #50#return; {8708#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-08 10:56:34,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {8708#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8730#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:34,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {8730#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {8730#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:34,905 INFO L272 TraceCheckUtils]: 42: Hoare triple {8730#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 10:56:34,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 10:56:34,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 10:56:34,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,905 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8600#true} {8730#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #50#return; {8730#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:34,906 INFO L290 TraceCheckUtils]: 47: Hoare triple {8730#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8752#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:34,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {8752#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !false; {8752#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:34,906 INFO L272 TraceCheckUtils]: 49: Hoare triple {8752#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 10:56:34,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 10:56:34,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 10:56:34,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,907 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {8600#true} {8752#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #50#return; {8752#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:34,907 INFO L290 TraceCheckUtils]: 54: Hoare triple {8752#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8774#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 10:56:34,907 INFO L290 TraceCheckUtils]: 55: Hoare triple {8774#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !false; {8774#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 10:56:34,908 INFO L272 TraceCheckUtils]: 56: Hoare triple {8774#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 10:56:34,908 INFO L290 TraceCheckUtils]: 57: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 10:56:34,908 INFO L290 TraceCheckUtils]: 58: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 10:56:34,908 INFO L290 TraceCheckUtils]: 59: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,908 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8600#true} {8774#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #50#return; {8774#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 10:56:34,909 INFO L290 TraceCheckUtils]: 61: Hoare triple {8774#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8796#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 10:56:34,909 INFO L290 TraceCheckUtils]: 62: Hoare triple {8796#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} assume !false; {8796#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 10:56:34,909 INFO L272 TraceCheckUtils]: 63: Hoare triple {8796#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 10:56:34,909 INFO L290 TraceCheckUtils]: 64: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 10:56:34,909 INFO L290 TraceCheckUtils]: 65: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 10:56:34,909 INFO L290 TraceCheckUtils]: 66: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,910 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {8600#true} {8796#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} #50#return; {8796#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 10:56:34,910 INFO L290 TraceCheckUtils]: 68: Hoare triple {8796#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8818#(and (= main_~y~0 9) (= (+ main_~c~0 (- 5)) 4))} is VALID [2022-04-08 10:56:34,910 INFO L290 TraceCheckUtils]: 69: Hoare triple {8818#(and (= main_~y~0 9) (= (+ main_~c~0 (- 5)) 4))} assume !false; {8818#(and (= main_~y~0 9) (= (+ main_~c~0 (- 5)) 4))} is VALID [2022-04-08 10:56:34,911 INFO L272 TraceCheckUtils]: 70: Hoare triple {8818#(and (= main_~y~0 9) (= (+ main_~c~0 (- 5)) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 10:56:34,911 INFO L290 TraceCheckUtils]: 71: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 10:56:34,911 INFO L290 TraceCheckUtils]: 72: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 10:56:34,911 INFO L290 TraceCheckUtils]: 73: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,911 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8600#true} {8818#(and (= main_~y~0 9) (= (+ main_~c~0 (- 5)) 4))} #50#return; {8818#(and (= main_~y~0 9) (= (+ main_~c~0 (- 5)) 4))} is VALID [2022-04-08 10:56:34,912 INFO L290 TraceCheckUtils]: 75: Hoare triple {8818#(and (= main_~y~0 9) (= (+ main_~c~0 (- 5)) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8840#(and (= 9 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 6)) 4))} is VALID [2022-04-08 10:56:34,912 INFO L290 TraceCheckUtils]: 76: Hoare triple {8840#(and (= 9 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 6)) 4))} assume !false; {8840#(and (= 9 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 6)) 4))} is VALID [2022-04-08 10:56:34,912 INFO L272 TraceCheckUtils]: 77: Hoare triple {8840#(and (= 9 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 6)) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 10:56:34,912 INFO L290 TraceCheckUtils]: 78: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 10:56:34,912 INFO L290 TraceCheckUtils]: 79: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 10:56:34,912 INFO L290 TraceCheckUtils]: 80: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,913 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8600#true} {8840#(and (= 9 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 6)) 4))} #50#return; {8840#(and (= 9 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 6)) 4))} is VALID [2022-04-08 10:56:34,913 INFO L290 TraceCheckUtils]: 82: Hoare triple {8840#(and (= 9 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 6)) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8862#(and (= (+ main_~c~0 (- 7)) 4) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 10:56:34,914 INFO L290 TraceCheckUtils]: 83: Hoare triple {8862#(and (= (+ main_~c~0 (- 7)) 4) (= (+ (- 2) main_~y~0) 9))} assume !false; {8862#(and (= (+ main_~c~0 (- 7)) 4) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 10:56:34,914 INFO L272 TraceCheckUtils]: 84: Hoare triple {8862#(and (= (+ main_~c~0 (- 7)) 4) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 10:56:34,914 INFO L290 TraceCheckUtils]: 85: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 10:56:34,914 INFO L290 TraceCheckUtils]: 86: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 10:56:34,914 INFO L290 TraceCheckUtils]: 87: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,914 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8600#true} {8862#(and (= (+ main_~c~0 (- 7)) 4) (= (+ (- 2) main_~y~0) 9))} #50#return; {8862#(and (= (+ main_~c~0 (- 7)) 4) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 10:56:34,915 INFO L290 TraceCheckUtils]: 89: Hoare triple {8862#(and (= (+ main_~c~0 (- 7)) 4) (= (+ (- 2) main_~y~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8884#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:56:34,915 INFO L290 TraceCheckUtils]: 90: Hoare triple {8884#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {8884#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:56:34,915 INFO L272 TraceCheckUtils]: 91: Hoare triple {8884#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 10:56:34,915 INFO L290 TraceCheckUtils]: 92: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 10:56:34,915 INFO L290 TraceCheckUtils]: 93: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 10:56:34,915 INFO L290 TraceCheckUtils]: 94: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,916 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {8600#true} {8884#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {8884#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:56:34,916 INFO L290 TraceCheckUtils]: 96: Hoare triple {8884#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8906#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 10:56:34,916 INFO L290 TraceCheckUtils]: 97: Hoare triple {8906#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {8906#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 10:56:34,917 INFO L272 TraceCheckUtils]: 98: Hoare triple {8906#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 10:56:34,917 INFO L290 TraceCheckUtils]: 99: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 10:56:34,917 INFO L290 TraceCheckUtils]: 100: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 10:56:34,917 INFO L290 TraceCheckUtils]: 101: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,917 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {8600#true} {8906#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #50#return; {8906#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 10:56:34,918 INFO L290 TraceCheckUtils]: 103: Hoare triple {8906#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8928#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 10:56:34,918 INFO L290 TraceCheckUtils]: 104: Hoare triple {8928#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {8928#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 10:56:34,918 INFO L272 TraceCheckUtils]: 105: Hoare triple {8928#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 10:56:34,918 INFO L290 TraceCheckUtils]: 106: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 10:56:34,918 INFO L290 TraceCheckUtils]: 107: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 10:56:34,918 INFO L290 TraceCheckUtils]: 108: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,919 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {8600#true} {8928#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #50#return; {8928#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 10:56:34,919 INFO L290 TraceCheckUtils]: 110: Hoare triple {8928#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8950#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} is VALID [2022-04-08 10:56:34,920 INFO L290 TraceCheckUtils]: 111: Hoare triple {8950#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} assume !false; {8950#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} is VALID [2022-04-08 10:56:34,920 INFO L272 TraceCheckUtils]: 112: Hoare triple {8950#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 10:56:34,920 INFO L290 TraceCheckUtils]: 113: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 10:56:34,920 INFO L290 TraceCheckUtils]: 114: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 10:56:34,920 INFO L290 TraceCheckUtils]: 115: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 10:56:34,920 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {8600#true} {8950#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} #50#return; {8950#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} is VALID [2022-04-08 10:56:34,921 INFO L290 TraceCheckUtils]: 117: Hoare triple {8950#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} assume !(~c~0 < ~k~0); {8972#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~k~0 15))} is VALID [2022-04-08 10:56:34,922 INFO L272 TraceCheckUtils]: 118: Hoare triple {8972#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~k~0 15))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8976#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:56:34,922 INFO L290 TraceCheckUtils]: 119: Hoare triple {8976#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8980#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:34,922 INFO L290 TraceCheckUtils]: 120: Hoare triple {8980#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8601#false} is VALID [2022-04-08 10:56:34,922 INFO L290 TraceCheckUtils]: 121: Hoare triple {8601#false} assume !false; {8601#false} is VALID [2022-04-08 10:56:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 32 proven. 360 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-08 10:56:34,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:35,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:35,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923531663] [2022-04-08 10:56:35,269 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:35,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724464396] [2022-04-08 10:56:35,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724464396] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:56:35,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:56:35,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-08 10:56:35,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:35,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1718547200] [2022-04-08 10:56:35,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1718547200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:35,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:35,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:56:35,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722432717] [2022-04-08 10:56:35,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:35,270 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 122 [2022-04-08 10:56:35,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:35,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 10:56:35,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:35,338 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:56:35,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:35,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:56:35,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:56:35,339 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 10:56:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:37,631 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-08 10:56:37,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:56:37,632 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 122 [2022-04-08 10:56:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 10:56:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 86 transitions. [2022-04-08 10:56:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 10:56:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 86 transitions. [2022-04-08 10:56:37,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 86 transitions. [2022-04-08 10:56:37,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:37,719 INFO L225 Difference]: With dead ends: 75 [2022-04-08 10:56:37,719 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 10:56:37,719 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:56:37,719 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:37,720 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 588 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:56:37,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 10:56:37,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 10:56:37,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:37,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 10:56:37,799 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 10:56:37,799 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 10:56:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:37,801 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-08 10:56:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-08 10:56:37,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:37,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:37,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 70 states. [2022-04-08 10:56:37,801 INFO L87 Difference]: Start difference. First operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 70 states. [2022-04-08 10:56:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:37,803 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-08 10:56:37,803 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-08 10:56:37,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:37,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:37,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:37,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:37,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 10:56:37,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-04-08 10:56:37,805 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 122 [2022-04-08 10:56:37,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:37,805 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-04-08 10:56:37,805 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 10:56:37,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 85 transitions. [2022-04-08 10:56:38,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:38,387 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-08 10:56:38,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-08 10:56:38,387 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:38,387 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:56:38,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 10:56:38,588 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 10:56:38,588 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:38,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:38,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1065798926, now seen corresponding path program 31 times [2022-04-08 10:56:38,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:38,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [734053367] [2022-04-08 10:56:38,666 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:56:38,666 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:56:38,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1065798926, now seen corresponding path program 32 times [2022-04-08 10:56:38,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:38,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641945350] [2022-04-08 10:56:38,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:38,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:38,677 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:38,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [147831433] [2022-04-08 10:56:38,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:56:38,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:38,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:38,678 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-08 10:56:38,679 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-08 10:56:39,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:56:39,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:39,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-08 10:56:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:39,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:56:40,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {9462#true} call ULTIMATE.init(); {9462#true} is VALID [2022-04-08 10:56:40,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {9462#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(9, 2);call #Ultimate.allocInit(12, 3); {9462#true} is VALID [2022-04-08 10:56:40,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9462#true} {9462#true} #56#return; {9462#true} is VALID [2022-04-08 10:56:40,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {9462#true} call #t~ret5 := main(); {9462#true} is VALID [2022-04-08 10:56:40,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {9462#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {9482#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:40,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {9482#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {9482#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:40,080 INFO L272 TraceCheckUtils]: 7: Hoare triple {9482#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,081 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {9462#true} {9482#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {9482#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:40,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {9482#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9504#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:56:40,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {9504#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {9504#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:56:40,082 INFO L272 TraceCheckUtils]: 14: Hoare triple {9504#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,082 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9462#true} {9504#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {9504#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:56:40,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {9504#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9526#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 10:56:40,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {9526#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {9526#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 10:56:40,083 INFO L272 TraceCheckUtils]: 21: Hoare triple {9526#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,084 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {9462#true} {9526#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #50#return; {9526#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 10:56:40,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {9526#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9548#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 10:56:40,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {9548#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !false; {9548#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 10:56:40,085 INFO L272 TraceCheckUtils]: 28: Hoare triple {9548#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,085 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9462#true} {9548#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #50#return; {9548#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 10:56:40,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {9548#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9570#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 10:56:40,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {9570#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {9570#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 10:56:40,086 INFO L272 TraceCheckUtils]: 35: Hoare triple {9570#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,087 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9462#true} {9570#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {9570#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 10:56:40,087 INFO L290 TraceCheckUtils]: 40: Hoare triple {9570#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9592#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:40,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {9592#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {9592#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:40,088 INFO L272 TraceCheckUtils]: 42: Hoare triple {9592#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,088 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {9462#true} {9592#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {9592#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:40,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {9592#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9614#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:40,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {9614#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {9614#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:40,089 INFO L272 TraceCheckUtils]: 49: Hoare triple {9614#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,089 INFO L290 TraceCheckUtils]: 50: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,089 INFO L290 TraceCheckUtils]: 51: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,090 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9462#true} {9614#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #50#return; {9614#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:40,090 INFO L290 TraceCheckUtils]: 54: Hoare triple {9614#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9636#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 10:56:40,091 INFO L290 TraceCheckUtils]: 55: Hoare triple {9636#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {9636#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 10:56:40,091 INFO L272 TraceCheckUtils]: 56: Hoare triple {9636#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,091 INFO L290 TraceCheckUtils]: 57: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,091 INFO L290 TraceCheckUtils]: 58: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,091 INFO L290 TraceCheckUtils]: 59: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,092 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9462#true} {9636#(and (= 7 main_~y~0) (= 7 main_~c~0))} #50#return; {9636#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 10:56:40,092 INFO L290 TraceCheckUtils]: 61: Hoare triple {9636#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9658#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:56:40,092 INFO L290 TraceCheckUtils]: 62: Hoare triple {9658#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {9658#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:56:40,092 INFO L272 TraceCheckUtils]: 63: Hoare triple {9658#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,092 INFO L290 TraceCheckUtils]: 64: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,093 INFO L290 TraceCheckUtils]: 65: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,093 INFO L290 TraceCheckUtils]: 66: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,093 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {9462#true} {9658#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #50#return; {9658#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:56:40,093 INFO L290 TraceCheckUtils]: 68: Hoare triple {9658#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9680#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:40,094 INFO L290 TraceCheckUtils]: 69: Hoare triple {9680#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !false; {9680#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:40,094 INFO L272 TraceCheckUtils]: 70: Hoare triple {9680#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,094 INFO L290 TraceCheckUtils]: 71: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,094 INFO L290 TraceCheckUtils]: 72: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,094 INFO L290 TraceCheckUtils]: 73: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,095 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9462#true} {9680#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} #50#return; {9680#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:40,095 INFO L290 TraceCheckUtils]: 75: Hoare triple {9680#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9702#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:40,095 INFO L290 TraceCheckUtils]: 76: Hoare triple {9702#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {9702#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:40,095 INFO L272 TraceCheckUtils]: 77: Hoare triple {9702#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,095 INFO L290 TraceCheckUtils]: 78: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,096 INFO L290 TraceCheckUtils]: 79: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,096 INFO L290 TraceCheckUtils]: 80: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,096 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9462#true} {9702#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {9702#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:40,096 INFO L290 TraceCheckUtils]: 82: Hoare triple {9702#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9724#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 10:56:40,097 INFO L290 TraceCheckUtils]: 83: Hoare triple {9724#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {9724#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 10:56:40,097 INFO L272 TraceCheckUtils]: 84: Hoare triple {9724#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,097 INFO L290 TraceCheckUtils]: 85: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,097 INFO L290 TraceCheckUtils]: 86: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,097 INFO L290 TraceCheckUtils]: 87: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,098 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9462#true} {9724#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {9724#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 10:56:40,098 INFO L290 TraceCheckUtils]: 89: Hoare triple {9724#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9746#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:56:40,098 INFO L290 TraceCheckUtils]: 90: Hoare triple {9746#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {9746#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:56:40,098 INFO L272 TraceCheckUtils]: 91: Hoare triple {9746#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,099 INFO L290 TraceCheckUtils]: 92: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,099 INFO L290 TraceCheckUtils]: 93: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,099 INFO L290 TraceCheckUtils]: 94: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,099 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {9462#true} {9746#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {9746#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:56:40,100 INFO L290 TraceCheckUtils]: 96: Hoare triple {9746#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9768#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:40,100 INFO L290 TraceCheckUtils]: 97: Hoare triple {9768#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !false; {9768#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:40,100 INFO L272 TraceCheckUtils]: 98: Hoare triple {9768#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,100 INFO L290 TraceCheckUtils]: 99: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,100 INFO L290 TraceCheckUtils]: 100: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,100 INFO L290 TraceCheckUtils]: 101: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,101 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {9462#true} {9768#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} #50#return; {9768#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:40,101 INFO L290 TraceCheckUtils]: 103: Hoare triple {9768#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9790#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:40,101 INFO L290 TraceCheckUtils]: 104: Hoare triple {9790#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} assume !false; {9790#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:40,102 INFO L272 TraceCheckUtils]: 105: Hoare triple {9790#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,102 INFO L290 TraceCheckUtils]: 106: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,102 INFO L290 TraceCheckUtils]: 107: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,102 INFO L290 TraceCheckUtils]: 108: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,102 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {9462#true} {9790#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} #50#return; {9790#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:40,103 INFO L290 TraceCheckUtils]: 110: Hoare triple {9790#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9812#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 10:56:40,103 INFO L290 TraceCheckUtils]: 111: Hoare triple {9812#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} assume !false; {9812#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 10:56:40,103 INFO L272 TraceCheckUtils]: 112: Hoare triple {9812#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,103 INFO L290 TraceCheckUtils]: 113: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,103 INFO L290 TraceCheckUtils]: 114: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,103 INFO L290 TraceCheckUtils]: 115: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,104 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {9462#true} {9812#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} #50#return; {9812#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 10:56:40,104 INFO L290 TraceCheckUtils]: 117: Hoare triple {9812#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9834#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-08 10:56:40,105 INFO L290 TraceCheckUtils]: 118: Hoare triple {9834#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !false; {9834#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-08 10:56:40,105 INFO L272 TraceCheckUtils]: 119: Hoare triple {9834#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 10:56:40,105 INFO L290 TraceCheckUtils]: 120: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 10:56:40,105 INFO L290 TraceCheckUtils]: 121: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 10:56:40,105 INFO L290 TraceCheckUtils]: 122: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 10:56:40,105 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {9462#true} {9834#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} #50#return; {9834#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-08 10:56:40,106 INFO L290 TraceCheckUtils]: 124: Hoare triple {9834#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !(~c~0 < ~k~0); {9856#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} is VALID [2022-04-08 10:56:40,107 INFO L272 TraceCheckUtils]: 125: Hoare triple {9856#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9860#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:56:40,107 INFO L290 TraceCheckUtils]: 126: Hoare triple {9860#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9864#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:40,108 INFO L290 TraceCheckUtils]: 127: Hoare triple {9864#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9463#false} is VALID [2022-04-08 10:56:40,108 INFO L290 TraceCheckUtils]: 128: Hoare triple {9463#false} assume !false; {9463#false} is VALID [2022-04-08 10:56:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 34 proven. 408 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-08 10:56:40,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:40,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:40,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641945350] [2022-04-08 10:56:40,415 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:40,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147831433] [2022-04-08 10:56:40,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147831433] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:56:40,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:56:40,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-08 10:56:40,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:40,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [734053367] [2022-04-08 10:56:40,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [734053367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:40,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:40,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:56:40,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147293523] [2022-04-08 10:56:40,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:40,417 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 129 [2022-04-08 10:56:40,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:40,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 10:56:40,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:40,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:56:40,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:40,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:56:40,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:56:40,494 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 10:56:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:43,356 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2022-04-08 10:56:43,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:56:43,357 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 129 [2022-04-08 10:56:43,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 10:56:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 90 transitions. [2022-04-08 10:56:43,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 10:56:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 90 transitions. [2022-04-08 10:56:43,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 90 transitions. [2022-04-08 10:56:43,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:43,465 INFO L225 Difference]: With dead ends: 78 [2022-04-08 10:56:43,465 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 10:56:43,466 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-04-08 10:56:43,466 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:43,466 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 639 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 10:56:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 10:56:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-08 10:56:43,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:43,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 21 states have call successors, (21), 5 states have call predecessors, (21), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 10:56:43,520 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 21 states have call successors, (21), 5 states have call predecessors, (21), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 10:56:43,520 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 21 states have call successors, (21), 5 states have call predecessors, (21), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 10:56:43,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:43,522 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-08 10:56:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-08 10:56:43,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:43,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:43,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 21 states have call successors, (21), 5 states have call predecessors, (21), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 73 states. [2022-04-08 10:56:43,522 INFO L87 Difference]: Start difference. First operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 21 states have call successors, (21), 5 states have call predecessors, (21), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 73 states. [2022-04-08 10:56:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:43,523 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-08 10:56:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-08 10:56:43,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:43,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:43,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:43,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 21 states have call successors, (21), 5 states have call predecessors, (21), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 10:56:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2022-04-08 10:56:43,525 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 129 [2022-04-08 10:56:43,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:43,526 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2022-04-08 10:56:43,526 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 10:56:43,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 89 transitions. [2022-04-08 10:56:44,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-08 10:56:44,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-08 10:56:44,115 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:44,115 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:56:44,120 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-08 10:56:44,315 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:44,316 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:44,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1370180581, now seen corresponding path program 33 times [2022-04-08 10:56:44,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:44,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1471268491] [2022-04-08 10:56:44,391 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:56:44,391 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:56:44,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1370180581, now seen corresponding path program 34 times [2022-04-08 10:56:44,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:44,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576625650] [2022-04-08 10:56:44,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:44,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:44,402 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:44,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188876505] [2022-04-08 10:56:44,402 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:56:44,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:44,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:44,403 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-08 10:56:44,404 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-08 10:56:45,587 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:56:45,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:45,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-08 10:56:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:45,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:56:46,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {10364#true} call ULTIMATE.init(); {10364#true} is VALID [2022-04-08 10:56:46,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {10364#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(9, 2);call #Ultimate.allocInit(12, 3); {10364#true} is VALID [2022-04-08 10:56:46,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10364#true} {10364#true} #56#return; {10364#true} is VALID [2022-04-08 10:56:46,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {10364#true} call #t~ret5 := main(); {10364#true} is VALID [2022-04-08 10:56:46,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {10364#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {10384#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:46,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {10384#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {10384#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:46,385 INFO L272 TraceCheckUtils]: 7: Hoare triple {10384#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,385 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {10364#true} {10384#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {10384#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:46,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {10384#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10406#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:56:46,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {10406#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {10406#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:56:46,386 INFO L272 TraceCheckUtils]: 14: Hoare triple {10406#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,388 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10364#true} {10406#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {10406#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:56:46,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {10406#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10428#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 10:56:46,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {10428#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {10428#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 10:56:46,389 INFO L272 TraceCheckUtils]: 21: Hoare triple {10428#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,390 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10364#true} {10428#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #50#return; {10428#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 10:56:46,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {10428#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10450#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 10:56:46,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {10450#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {10450#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 10:56:46,390 INFO L272 TraceCheckUtils]: 28: Hoare triple {10450#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,391 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10364#true} {10450#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #50#return; {10450#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 10:56:46,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {10450#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10472#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 10:56:46,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {10472#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {10472#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 10:56:46,392 INFO L272 TraceCheckUtils]: 35: Hoare triple {10472#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,392 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10364#true} {10472#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #50#return; {10472#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 10:56:46,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {10472#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10494#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 10:56:46,393 INFO L290 TraceCheckUtils]: 41: Hoare triple {10494#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {10494#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 10:56:46,393 INFO L272 TraceCheckUtils]: 42: Hoare triple {10494#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,393 INFO L290 TraceCheckUtils]: 43: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,393 INFO L290 TraceCheckUtils]: 44: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,393 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10364#true} {10494#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #50#return; {10494#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 10:56:46,394 INFO L290 TraceCheckUtils]: 47: Hoare triple {10494#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10516#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:56:46,394 INFO L290 TraceCheckUtils]: 48: Hoare triple {10516#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {10516#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:56:46,394 INFO L272 TraceCheckUtils]: 49: Hoare triple {10516#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,394 INFO L290 TraceCheckUtils]: 50: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,394 INFO L290 TraceCheckUtils]: 51: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,394 INFO L290 TraceCheckUtils]: 52: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,394 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10364#true} {10516#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {10516#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:56:46,395 INFO L290 TraceCheckUtils]: 54: Hoare triple {10516#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10538#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:46,395 INFO L290 TraceCheckUtils]: 55: Hoare triple {10538#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {10538#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:46,395 INFO L272 TraceCheckUtils]: 56: Hoare triple {10538#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,395 INFO L290 TraceCheckUtils]: 57: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,395 INFO L290 TraceCheckUtils]: 58: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,395 INFO L290 TraceCheckUtils]: 59: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,396 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10364#true} {10538#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #50#return; {10538#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:46,396 INFO L290 TraceCheckUtils]: 61: Hoare triple {10538#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10560#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 10:56:46,396 INFO L290 TraceCheckUtils]: 62: Hoare triple {10560#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {10560#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 10:56:46,396 INFO L272 TraceCheckUtils]: 63: Hoare triple {10560#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,396 INFO L290 TraceCheckUtils]: 64: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,397 INFO L290 TraceCheckUtils]: 65: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,397 INFO L290 TraceCheckUtils]: 66: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,397 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {10364#true} {10560#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #50#return; {10560#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 10:56:46,397 INFO L290 TraceCheckUtils]: 68: Hoare triple {10560#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10582#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-08 10:56:46,398 INFO L290 TraceCheckUtils]: 69: Hoare triple {10582#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !false; {10582#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-08 10:56:46,398 INFO L272 TraceCheckUtils]: 70: Hoare triple {10582#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,398 INFO L290 TraceCheckUtils]: 71: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,398 INFO L290 TraceCheckUtils]: 72: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,398 INFO L290 TraceCheckUtils]: 73: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,398 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10364#true} {10582#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} #50#return; {10582#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-08 10:56:46,398 INFO L290 TraceCheckUtils]: 75: Hoare triple {10582#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10604#(and (= 9 (+ (- 1) main_~y~0)) (= 6 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 10:56:46,399 INFO L290 TraceCheckUtils]: 76: Hoare triple {10604#(and (= 9 (+ (- 1) main_~y~0)) (= 6 (+ main_~c~0 (- 4))))} assume !false; {10604#(and (= 9 (+ (- 1) main_~y~0)) (= 6 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 10:56:46,399 INFO L272 TraceCheckUtils]: 77: Hoare triple {10604#(and (= 9 (+ (- 1) main_~y~0)) (= 6 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,399 INFO L290 TraceCheckUtils]: 78: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,399 INFO L290 TraceCheckUtils]: 79: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,399 INFO L290 TraceCheckUtils]: 80: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,399 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10364#true} {10604#(and (= 9 (+ (- 1) main_~y~0)) (= 6 (+ main_~c~0 (- 4))))} #50#return; {10604#(and (= 9 (+ (- 1) main_~y~0)) (= 6 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 10:56:46,400 INFO L290 TraceCheckUtils]: 82: Hoare triple {10604#(and (= 9 (+ (- 1) main_~y~0)) (= 6 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10626#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:56:46,413 INFO L290 TraceCheckUtils]: 83: Hoare triple {10626#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {10626#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:56:46,413 INFO L272 TraceCheckUtils]: 84: Hoare triple {10626#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,414 INFO L290 TraceCheckUtils]: 85: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,414 INFO L290 TraceCheckUtils]: 86: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,414 INFO L290 TraceCheckUtils]: 87: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,414 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10364#true} {10626#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {10626#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:56:46,414 INFO L290 TraceCheckUtils]: 89: Hoare triple {10626#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10648#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:56:46,415 INFO L290 TraceCheckUtils]: 90: Hoare triple {10648#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !false; {10648#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:56:46,415 INFO L272 TraceCheckUtils]: 91: Hoare triple {10648#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,415 INFO L290 TraceCheckUtils]: 92: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,415 INFO L290 TraceCheckUtils]: 93: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,415 INFO L290 TraceCheckUtils]: 94: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,415 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {10364#true} {10648#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #50#return; {10648#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:56:46,416 INFO L290 TraceCheckUtils]: 96: Hoare triple {10648#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10670#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 10:56:46,416 INFO L290 TraceCheckUtils]: 97: Hoare triple {10670#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !false; {10670#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 10:56:46,416 INFO L272 TraceCheckUtils]: 98: Hoare triple {10670#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,416 INFO L290 TraceCheckUtils]: 99: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,416 INFO L290 TraceCheckUtils]: 100: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,416 INFO L290 TraceCheckUtils]: 101: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,416 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {10364#true} {10670#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} #50#return; {10670#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 10:56:46,417 INFO L290 TraceCheckUtils]: 103: Hoare triple {10670#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10692#(and (= (+ main_~c~0 (- 3)) 11) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 10:56:46,417 INFO L290 TraceCheckUtils]: 104: Hoare triple {10692#(and (= (+ main_~c~0 (- 3)) 11) (= (+ (- 1) main_~y~0) 13))} assume !false; {10692#(and (= (+ main_~c~0 (- 3)) 11) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 10:56:46,417 INFO L272 TraceCheckUtils]: 105: Hoare triple {10692#(and (= (+ main_~c~0 (- 3)) 11) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,417 INFO L290 TraceCheckUtils]: 106: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,417 INFO L290 TraceCheckUtils]: 107: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,417 INFO L290 TraceCheckUtils]: 108: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,418 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {10364#true} {10692#(and (= (+ main_~c~0 (- 3)) 11) (= (+ (- 1) main_~y~0) 13))} #50#return; {10692#(and (= (+ main_~c~0 (- 3)) 11) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 10:56:46,418 INFO L290 TraceCheckUtils]: 110: Hoare triple {10692#(and (= (+ main_~c~0 (- 3)) 11) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10714#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 10:56:46,418 INFO L290 TraceCheckUtils]: 111: Hoare triple {10714#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} assume !false; {10714#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 10:56:46,418 INFO L272 TraceCheckUtils]: 112: Hoare triple {10714#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,418 INFO L290 TraceCheckUtils]: 113: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,419 INFO L290 TraceCheckUtils]: 114: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,419 INFO L290 TraceCheckUtils]: 115: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,419 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {10364#true} {10714#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} #50#return; {10714#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 10:56:46,419 INFO L290 TraceCheckUtils]: 117: Hoare triple {10714#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10736#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:46,420 INFO L290 TraceCheckUtils]: 118: Hoare triple {10736#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {10736#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:46,420 INFO L272 TraceCheckUtils]: 119: Hoare triple {10736#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,420 INFO L290 TraceCheckUtils]: 120: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,420 INFO L290 TraceCheckUtils]: 121: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,420 INFO L290 TraceCheckUtils]: 122: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,420 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {10364#true} {10736#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #50#return; {10736#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:46,420 INFO L290 TraceCheckUtils]: 124: Hoare triple {10736#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10758#(and (<= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 16 main_~k~0))} is VALID [2022-04-08 10:56:46,421 INFO L290 TraceCheckUtils]: 125: Hoare triple {10758#(and (<= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 16 main_~k~0))} assume !false; {10758#(and (<= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 16 main_~k~0))} is VALID [2022-04-08 10:56:46,421 INFO L272 TraceCheckUtils]: 126: Hoare triple {10758#(and (<= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 16 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 10:56:46,421 INFO L290 TraceCheckUtils]: 127: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 10:56:46,421 INFO L290 TraceCheckUtils]: 128: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 10:56:46,421 INFO L290 TraceCheckUtils]: 129: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 10:56:46,421 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {10364#true} {10758#(and (<= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 16 main_~k~0))} #50#return; {10758#(and (<= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 16 main_~k~0))} is VALID [2022-04-08 10:56:46,422 INFO L290 TraceCheckUtils]: 131: Hoare triple {10758#(and (<= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 16 main_~k~0))} assume !(~c~0 < ~k~0); {10780#(and (= (+ (- 2) main_~y~0) 15) (<= main_~k~0 17) (< 16 main_~k~0))} is VALID [2022-04-08 10:56:46,423 INFO L272 TraceCheckUtils]: 132: Hoare triple {10780#(and (= (+ (- 2) main_~y~0) 15) (<= main_~k~0 17) (< 16 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10784#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:56:46,423 INFO L290 TraceCheckUtils]: 133: Hoare triple {10784#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10788#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:46,423 INFO L290 TraceCheckUtils]: 134: Hoare triple {10788#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10365#false} is VALID [2022-04-08 10:56:46,423 INFO L290 TraceCheckUtils]: 135: Hoare triple {10365#false} assume !false; {10365#false} is VALID [2022-04-08 10:56:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 36 proven. 459 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-04-08 10:56:46,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:46,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:46,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576625650] [2022-04-08 10:56:46,652 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:46,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188876505] [2022-04-08 10:56:46,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188876505] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:56:46,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:56:46,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-08 10:56:46,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:46,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1471268491] [2022-04-08 10:56:46,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1471268491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:46,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:46,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:56:46,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195204087] [2022-04-08 10:56:46,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:46,653 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 20 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Word has length 136 [2022-04-08 10:56:46,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:46,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 20 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 10:56:46,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:46,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:56:46,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:46,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:56:46,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:56:46,709 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 20 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 10:56:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:48,990 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2022-04-08 10:56:48,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:56:48,990 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 20 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Word has length 136 [2022-04-08 10:56:48,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 20 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 10:56:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2022-04-08 10:56:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 20 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 10:56:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2022-04-08 10:56:48,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 94 transitions. [2022-04-08 10:56:49,052 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-08 10:56:49,053 INFO L225 Difference]: With dead ends: 81 [2022-04-08 10:56:49,053 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 10:56:49,054 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:56:49,055 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:49,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 692 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 10:56:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 10:56:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-08 10:56:49,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:49,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 22 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 10:56:49,106 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 22 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 10:56:49,106 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 22 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 10:56:49,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:49,107 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-08 10:56:49,108 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-08 10:56:49,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:49,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:49,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 22 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 76 states. [2022-04-08 10:56:49,108 INFO L87 Difference]: Start difference. First operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 22 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 76 states. [2022-04-08 10:56:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:49,110 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-08 10:56:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-08 10:56:49,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:49,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:49,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:49,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 22 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 10:56:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2022-04-08 10:56:49,128 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 136 [2022-04-08 10:56:49,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:49,128 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2022-04-08 10:56:49,129 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 20 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 10:56:49,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 93 transitions. [2022-04-08 10:56:49,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-08 10:56:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-08 10:56:49,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:49,751 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:56:49,757 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-08 10:56:49,952 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:49,952 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:49,952 INFO L85 PathProgramCache]: Analyzing trace with hash 455854994, now seen corresponding path program 35 times [2022-04-08 10:56:49,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:49,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [564682809] [2022-04-08 10:56:50,021 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:56:50,022 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:56:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash 455854994, now seen corresponding path program 36 times [2022-04-08 10:56:50,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:50,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595822106] [2022-04-08 10:56:50,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:50,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:50,039 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:50,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1677659095] [2022-04-08 10:56:50,039 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:56:50,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:50,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:50,040 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-08 10:56:50,041 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-08 10:56:51,858 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-08 10:56:51,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:51,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-08 10:56:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:51,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:56:52,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {11306#true} call ULTIMATE.init(); {11306#true} is VALID [2022-04-08 10:56:52,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {11306#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(9, 2);call #Ultimate.allocInit(12, 3); {11306#true} is VALID [2022-04-08 10:56:52,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11306#true} {11306#true} #56#return; {11306#true} is VALID [2022-04-08 10:56:52,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {11306#true} call #t~ret5 := main(); {11306#true} is VALID [2022-04-08 10:56:52,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {11306#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {11326#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:52,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {11326#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {11326#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:52,617 INFO L272 TraceCheckUtils]: 7: Hoare triple {11326#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,617 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {11306#true} {11326#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {11326#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:52,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {11326#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11348#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:56:52,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {11348#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {11348#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:56:52,618 INFO L272 TraceCheckUtils]: 14: Hoare triple {11348#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,618 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11306#true} {11348#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {11348#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:56:52,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {11348#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11370#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 10:56:52,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {11370#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {11370#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 10:56:52,619 INFO L272 TraceCheckUtils]: 21: Hoare triple {11370#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,619 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11306#true} {11370#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #50#return; {11370#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 10:56:52,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {11370#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11392#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 10:56:52,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {11392#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {11392#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 10:56:52,620 INFO L272 TraceCheckUtils]: 28: Hoare triple {11392#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,620 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11306#true} {11392#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #50#return; {11392#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 10:56:52,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {11392#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11414#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 10:56:52,621 INFO L290 TraceCheckUtils]: 34: Hoare triple {11414#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !false; {11414#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 10:56:52,621 INFO L272 TraceCheckUtils]: 35: Hoare triple {11414#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,621 INFO L290 TraceCheckUtils]: 36: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,621 INFO L290 TraceCheckUtils]: 37: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,621 INFO L290 TraceCheckUtils]: 38: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,621 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11306#true} {11414#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #50#return; {11414#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 10:56:52,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {11414#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11436#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 10:56:52,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {11436#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} assume !false; {11436#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 10:56:52,622 INFO L272 TraceCheckUtils]: 42: Hoare triple {11436#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,623 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11306#true} {11436#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} #50#return; {11436#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 10:56:52,623 INFO L290 TraceCheckUtils]: 47: Hoare triple {11436#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11458#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:56:52,623 INFO L290 TraceCheckUtils]: 48: Hoare triple {11458#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {11458#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:56:52,623 INFO L272 TraceCheckUtils]: 49: Hoare triple {11458#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,623 INFO L290 TraceCheckUtils]: 50: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,623 INFO L290 TraceCheckUtils]: 51: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,624 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {11306#true} {11458#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {11458#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:56:52,624 INFO L290 TraceCheckUtils]: 54: Hoare triple {11458#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11480#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:52,624 INFO L290 TraceCheckUtils]: 55: Hoare triple {11480#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {11480#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:52,624 INFO L272 TraceCheckUtils]: 56: Hoare triple {11480#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,624 INFO L290 TraceCheckUtils]: 57: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,624 INFO L290 TraceCheckUtils]: 58: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,625 INFO L290 TraceCheckUtils]: 59: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,625 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11306#true} {11480#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #50#return; {11480#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:52,625 INFO L290 TraceCheckUtils]: 61: Hoare triple {11480#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11502#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 10:56:52,625 INFO L290 TraceCheckUtils]: 62: Hoare triple {11502#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {11502#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 10:56:52,625 INFO L272 TraceCheckUtils]: 63: Hoare triple {11502#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,625 INFO L290 TraceCheckUtils]: 64: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,626 INFO L290 TraceCheckUtils]: 65: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,626 INFO L290 TraceCheckUtils]: 66: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,626 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {11306#true} {11502#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #50#return; {11502#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 10:56:52,626 INFO L290 TraceCheckUtils]: 68: Hoare triple {11502#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11524#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 10:56:52,626 INFO L290 TraceCheckUtils]: 69: Hoare triple {11524#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} assume !false; {11524#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 10:56:52,627 INFO L272 TraceCheckUtils]: 70: Hoare triple {11524#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,627 INFO L290 TraceCheckUtils]: 71: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,627 INFO L290 TraceCheckUtils]: 72: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,627 INFO L290 TraceCheckUtils]: 73: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,627 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11306#true} {11524#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} #50#return; {11524#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 10:56:52,627 INFO L290 TraceCheckUtils]: 75: Hoare triple {11524#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11546#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:52,628 INFO L290 TraceCheckUtils]: 76: Hoare triple {11546#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {11546#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:52,628 INFO L272 TraceCheckUtils]: 77: Hoare triple {11546#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,628 INFO L290 TraceCheckUtils]: 78: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,628 INFO L290 TraceCheckUtils]: 79: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,628 INFO L290 TraceCheckUtils]: 80: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,628 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {11306#true} {11546#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {11546#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:52,628 INFO L290 TraceCheckUtils]: 82: Hoare triple {11546#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11568#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:56:52,629 INFO L290 TraceCheckUtils]: 83: Hoare triple {11568#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {11568#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:56:52,629 INFO L272 TraceCheckUtils]: 84: Hoare triple {11568#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,629 INFO L290 TraceCheckUtils]: 85: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,629 INFO L290 TraceCheckUtils]: 86: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,629 INFO L290 TraceCheckUtils]: 87: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,629 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11306#true} {11568#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {11568#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:56:52,629 INFO L290 TraceCheckUtils]: 89: Hoare triple {11568#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11590#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:56:52,630 INFO L290 TraceCheckUtils]: 90: Hoare triple {11590#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !false; {11590#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:56:52,630 INFO L272 TraceCheckUtils]: 91: Hoare triple {11590#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,630 INFO L290 TraceCheckUtils]: 92: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,630 INFO L290 TraceCheckUtils]: 93: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,630 INFO L290 TraceCheckUtils]: 94: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,630 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {11306#true} {11590#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #50#return; {11590#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:56:52,631 INFO L290 TraceCheckUtils]: 96: Hoare triple {11590#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11612#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 10:56:52,631 INFO L290 TraceCheckUtils]: 97: Hoare triple {11612#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !false; {11612#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 10:56:52,631 INFO L272 TraceCheckUtils]: 98: Hoare triple {11612#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,631 INFO L290 TraceCheckUtils]: 99: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,631 INFO L290 TraceCheckUtils]: 100: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,631 INFO L290 TraceCheckUtils]: 101: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,631 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {11306#true} {11612#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} #50#return; {11612#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 10:56:52,632 INFO L290 TraceCheckUtils]: 103: Hoare triple {11612#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11634#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 10:56:52,632 INFO L290 TraceCheckUtils]: 104: Hoare triple {11634#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} assume !false; {11634#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 10:56:52,632 INFO L272 TraceCheckUtils]: 105: Hoare triple {11634#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,632 INFO L290 TraceCheckUtils]: 106: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,632 INFO L290 TraceCheckUtils]: 107: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,632 INFO L290 TraceCheckUtils]: 108: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,632 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {11306#true} {11634#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} #50#return; {11634#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 10:56:52,633 INFO L290 TraceCheckUtils]: 110: Hoare triple {11634#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11656#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 10:56:52,633 INFO L290 TraceCheckUtils]: 111: Hoare triple {11656#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {11656#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 10:56:52,633 INFO L272 TraceCheckUtils]: 112: Hoare triple {11656#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,633 INFO L290 TraceCheckUtils]: 113: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,633 INFO L290 TraceCheckUtils]: 114: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,633 INFO L290 TraceCheckUtils]: 115: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,634 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11306#true} {11656#(and (= main_~c~0 15) (= main_~y~0 15))} #50#return; {11656#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 10:56:52,634 INFO L290 TraceCheckUtils]: 117: Hoare triple {11656#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11678#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 10:56:52,634 INFO L290 TraceCheckUtils]: 118: Hoare triple {11678#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !false; {11678#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 10:56:52,634 INFO L272 TraceCheckUtils]: 119: Hoare triple {11678#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,634 INFO L290 TraceCheckUtils]: 120: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,634 INFO L290 TraceCheckUtils]: 121: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,634 INFO L290 TraceCheckUtils]: 122: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,635 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {11306#true} {11678#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} #50#return; {11678#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 10:56:52,635 INFO L290 TraceCheckUtils]: 124: Hoare triple {11678#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11700#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:52,635 INFO L290 TraceCheckUtils]: 125: Hoare triple {11700#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} assume !false; {11700#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:52,635 INFO L272 TraceCheckUtils]: 126: Hoare triple {11700#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,635 INFO L290 TraceCheckUtils]: 127: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,635 INFO L290 TraceCheckUtils]: 128: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,635 INFO L290 TraceCheckUtils]: 129: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,636 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {11306#true} {11700#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} #50#return; {11700#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:52,636 INFO L290 TraceCheckUtils]: 131: Hoare triple {11700#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11722#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 10:56:52,636 INFO L290 TraceCheckUtils]: 132: Hoare triple {11722#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !false; {11722#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 10:56:52,637 INFO L272 TraceCheckUtils]: 133: Hoare triple {11722#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 10:56:52,637 INFO L290 TraceCheckUtils]: 134: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 10:56:52,637 INFO L290 TraceCheckUtils]: 135: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 10:56:52,638 INFO L290 TraceCheckUtils]: 136: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 10:56:52,640 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {11306#true} {11722#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} #50#return; {11722#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 10:56:52,641 INFO L290 TraceCheckUtils]: 138: Hoare triple {11722#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !(~c~0 < ~k~0); {11744#(and (< 17 main_~k~0) (<= main_~k~0 18) (= main_~y~0 18))} is VALID [2022-04-08 10:56:52,641 INFO L272 TraceCheckUtils]: 139: Hoare triple {11744#(and (< 17 main_~k~0) (<= main_~k~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11748#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:56:52,642 INFO L290 TraceCheckUtils]: 140: Hoare triple {11748#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11752#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:52,642 INFO L290 TraceCheckUtils]: 141: Hoare triple {11752#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11307#false} is VALID [2022-04-08 10:56:52,642 INFO L290 TraceCheckUtils]: 142: Hoare triple {11307#false} assume !false; {11307#false} is VALID [2022-04-08 10:56:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 38 proven. 513 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2022-04-08 10:56:52,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:52,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:52,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595822106] [2022-04-08 10:56:52,864 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:52,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677659095] [2022-04-08 10:56:52,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677659095] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:56:52,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:56:52,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2022-04-08 10:56:52,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:52,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [564682809] [2022-04-08 10:56:52,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [564682809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:52,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:52,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:56:52,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650465725] [2022-04-08 10:56:52,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:52,865 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 21 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 143 [2022-04-08 10:56:52,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:52,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 21 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 10:56:52,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:52,927 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:56:52,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:52,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:56:52,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-04-08 10:56:52,928 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 21 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 10:56:55,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:55,810 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2022-04-08 10:56:55,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:56:55,810 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 21 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 143 [2022-04-08 10:56:55,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 21 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 10:56:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 98 transitions. [2022-04-08 10:56:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 21 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 10:56:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 98 transitions. [2022-04-08 10:56:55,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 98 transitions. [2022-04-08 10:56:55,903 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-08 10:56:55,904 INFO L225 Difference]: With dead ends: 84 [2022-04-08 10:56:55,904 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 10:56:55,905 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:56:55,905 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:55,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 747 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-08 10:56:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 10:56:55,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-08 10:56:55,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:55,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 23 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:56:55,968 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 23 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:56:55,968 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 23 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:56:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:55,970 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2022-04-08 10:56:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-08 10:56:55,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:55,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:55,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 23 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 79 states. [2022-04-08 10:56:55,970 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 23 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 79 states. [2022-04-08 10:56:55,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:55,972 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2022-04-08 10:56:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-08 10:56:55,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:55,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:55,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:55,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 23 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:56:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2022-04-08 10:56:55,973 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 143 [2022-04-08 10:56:55,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:55,974 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2022-04-08 10:56:55,974 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 21 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 10:56:55,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 97 transitions. [2022-04-08 10:56:56,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-08 10:56:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-08 10:56:56,555 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:56,555 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:56:56,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-08 10:56:56,756 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-08 10:56:56,756 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:56,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1978024123, now seen corresponding path program 37 times [2022-04-08 10:56:56,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:56,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [62311351] [2022-04-08 10:56:56,824 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:56:56,824 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:56:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1978024123, now seen corresponding path program 38 times [2022-04-08 10:56:56,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:56,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807693621] [2022-04-08 10:56:56,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:56,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:56,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:56,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [901798036] [2022-04-08 10:56:56,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:56:56,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:56,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:56,860 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-08 10:56:56,861 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-08 10:56:57,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:56:57,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:57,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 84 conjunts are in the unsatisfiable core [2022-04-08 10:56:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:57,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:56:58,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {12288#true} call ULTIMATE.init(); {12288#true} is VALID [2022-04-08 10:56:58,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {12288#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(9, 2);call #Ultimate.allocInit(12, 3); {12288#true} is VALID [2022-04-08 10:56:58,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12288#true} {12288#true} #56#return; {12288#true} is VALID [2022-04-08 10:56:58,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {12288#true} call #t~ret5 := main(); {12288#true} is VALID [2022-04-08 10:56:58,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {12288#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {12308#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:58,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {12308#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {12308#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:58,173 INFO L272 TraceCheckUtils]: 7: Hoare triple {12308#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,174 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {12288#true} {12308#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {12308#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:56:58,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {12308#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12330#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:56:58,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {12330#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {12330#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:56:58,174 INFO L272 TraceCheckUtils]: 14: Hoare triple {12330#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,175 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12288#true} {12330#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {12330#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:56:58,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {12330#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12352#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:56:58,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {12352#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {12352#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:56:58,176 INFO L272 TraceCheckUtils]: 21: Hoare triple {12352#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,176 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12288#true} {12352#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {12352#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:56:58,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {12352#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12374#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 10:56:58,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {12374#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {12374#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 10:56:58,177 INFO L272 TraceCheckUtils]: 28: Hoare triple {12374#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,178 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12288#true} {12374#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {12374#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 10:56:58,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {12374#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12396#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 10:56:58,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {12396#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {12396#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 10:56:58,179 INFO L272 TraceCheckUtils]: 35: Hoare triple {12396#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,179 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12288#true} {12396#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #50#return; {12396#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 10:56:58,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {12396#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12418#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:58,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {12418#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {12418#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:58,180 INFO L272 TraceCheckUtils]: 42: Hoare triple {12418#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,181 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12288#true} {12418#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {12418#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:56:58,181 INFO L290 TraceCheckUtils]: 47: Hoare triple {12418#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12440#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 10:56:58,181 INFO L290 TraceCheckUtils]: 48: Hoare triple {12440#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {12440#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 10:56:58,182 INFO L272 TraceCheckUtils]: 49: Hoare triple {12440#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,182 INFO L290 TraceCheckUtils]: 51: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,182 INFO L290 TraceCheckUtils]: 52: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,182 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12288#true} {12440#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #50#return; {12440#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 10:56:58,183 INFO L290 TraceCheckUtils]: 54: Hoare triple {12440#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12462#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:58,183 INFO L290 TraceCheckUtils]: 55: Hoare triple {12462#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {12462#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:58,183 INFO L272 TraceCheckUtils]: 56: Hoare triple {12462#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,183 INFO L290 TraceCheckUtils]: 57: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,183 INFO L290 TraceCheckUtils]: 58: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,183 INFO L290 TraceCheckUtils]: 59: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,184 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12288#true} {12462#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #50#return; {12462#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:58,184 INFO L290 TraceCheckUtils]: 61: Hoare triple {12462#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12484#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 10:56:58,184 INFO L290 TraceCheckUtils]: 62: Hoare triple {12484#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {12484#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 10:56:58,184 INFO L272 TraceCheckUtils]: 63: Hoare triple {12484#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,184 INFO L290 TraceCheckUtils]: 64: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,185 INFO L290 TraceCheckUtils]: 65: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,185 INFO L290 TraceCheckUtils]: 66: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,185 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {12288#true} {12484#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #50#return; {12484#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 10:56:58,185 INFO L290 TraceCheckUtils]: 68: Hoare triple {12484#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12506#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:58,186 INFO L290 TraceCheckUtils]: 69: Hoare triple {12506#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} assume !false; {12506#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:58,186 INFO L272 TraceCheckUtils]: 70: Hoare triple {12506#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,186 INFO L290 TraceCheckUtils]: 71: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,186 INFO L290 TraceCheckUtils]: 72: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,186 INFO L290 TraceCheckUtils]: 73: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,186 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12288#true} {12506#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} #50#return; {12506#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:56:58,187 INFO L290 TraceCheckUtils]: 75: Hoare triple {12506#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12528#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:58,187 INFO L290 TraceCheckUtils]: 76: Hoare triple {12528#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {12528#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:58,187 INFO L272 TraceCheckUtils]: 77: Hoare triple {12528#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,187 INFO L290 TraceCheckUtils]: 78: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,187 INFO L290 TraceCheckUtils]: 79: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,187 INFO L290 TraceCheckUtils]: 80: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,188 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {12288#true} {12528#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {12528#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:56:58,188 INFO L290 TraceCheckUtils]: 82: Hoare triple {12528#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12550#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 10:56:58,189 INFO L290 TraceCheckUtils]: 83: Hoare triple {12550#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {12550#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 10:56:58,189 INFO L272 TraceCheckUtils]: 84: Hoare triple {12550#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,189 INFO L290 TraceCheckUtils]: 85: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,189 INFO L290 TraceCheckUtils]: 86: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,189 INFO L290 TraceCheckUtils]: 87: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,189 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12288#true} {12550#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {12550#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 10:56:58,190 INFO L290 TraceCheckUtils]: 89: Hoare triple {12550#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12572#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:56:58,190 INFO L290 TraceCheckUtils]: 90: Hoare triple {12572#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {12572#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:56:58,190 INFO L272 TraceCheckUtils]: 91: Hoare triple {12572#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,190 INFO L290 TraceCheckUtils]: 92: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,190 INFO L290 TraceCheckUtils]: 93: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,190 INFO L290 TraceCheckUtils]: 94: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,191 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {12288#true} {12572#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #50#return; {12572#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:56:58,191 INFO L290 TraceCheckUtils]: 96: Hoare triple {12572#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12594#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 10:56:58,191 INFO L290 TraceCheckUtils]: 97: Hoare triple {12594#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {12594#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 10:56:58,192 INFO L272 TraceCheckUtils]: 98: Hoare triple {12594#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,192 INFO L290 TraceCheckUtils]: 99: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,192 INFO L290 TraceCheckUtils]: 100: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,192 INFO L290 TraceCheckUtils]: 101: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,192 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {12288#true} {12594#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #50#return; {12594#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 10:56:58,193 INFO L290 TraceCheckUtils]: 103: Hoare triple {12594#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12616#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 10:56:58,193 INFO L290 TraceCheckUtils]: 104: Hoare triple {12616#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {12616#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 10:56:58,193 INFO L272 TraceCheckUtils]: 105: Hoare triple {12616#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,193 INFO L290 TraceCheckUtils]: 106: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,193 INFO L290 TraceCheckUtils]: 107: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,193 INFO L290 TraceCheckUtils]: 108: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,194 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {12288#true} {12616#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #50#return; {12616#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 10:56:58,194 INFO L290 TraceCheckUtils]: 110: Hoare triple {12616#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12638#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 10:56:58,194 INFO L290 TraceCheckUtils]: 111: Hoare triple {12638#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !false; {12638#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 10:56:58,194 INFO L272 TraceCheckUtils]: 112: Hoare triple {12638#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,194 INFO L290 TraceCheckUtils]: 113: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,195 INFO L290 TraceCheckUtils]: 114: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,195 INFO L290 TraceCheckUtils]: 115: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,195 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {12288#true} {12638#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} #50#return; {12638#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 10:56:58,195 INFO L290 TraceCheckUtils]: 117: Hoare triple {12638#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12660#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 10:56:58,196 INFO L290 TraceCheckUtils]: 118: Hoare triple {12660#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {12660#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 10:56:58,196 INFO L272 TraceCheckUtils]: 119: Hoare triple {12660#(and (= main_~c~0 16) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,196 INFO L290 TraceCheckUtils]: 120: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,196 INFO L290 TraceCheckUtils]: 121: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,196 INFO L290 TraceCheckUtils]: 122: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,196 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {12288#true} {12660#(and (= main_~c~0 16) (= main_~y~0 16))} #50#return; {12660#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 10:56:58,197 INFO L290 TraceCheckUtils]: 124: Hoare triple {12660#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12682#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:58,197 INFO L290 TraceCheckUtils]: 125: Hoare triple {12682#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {12682#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:58,197 INFO L272 TraceCheckUtils]: 126: Hoare triple {12682#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,197 INFO L290 TraceCheckUtils]: 127: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,197 INFO L290 TraceCheckUtils]: 128: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,197 INFO L290 TraceCheckUtils]: 129: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,198 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {12288#true} {12682#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #50#return; {12682#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:56:58,198 INFO L290 TraceCheckUtils]: 131: Hoare triple {12682#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12704#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 10:56:58,199 INFO L290 TraceCheckUtils]: 132: Hoare triple {12704#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !false; {12704#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 10:56:58,199 INFO L272 TraceCheckUtils]: 133: Hoare triple {12704#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,199 INFO L290 TraceCheckUtils]: 134: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,199 INFO L290 TraceCheckUtils]: 135: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,199 INFO L290 TraceCheckUtils]: 136: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,199 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {12288#true} {12704#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} #50#return; {12704#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 10:56:58,200 INFO L290 TraceCheckUtils]: 138: Hoare triple {12704#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12726#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~c~0 19))} is VALID [2022-04-08 10:56:58,200 INFO L290 TraceCheckUtils]: 139: Hoare triple {12726#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~c~0 19))} assume !false; {12726#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~c~0 19))} is VALID [2022-04-08 10:56:58,200 INFO L272 TraceCheckUtils]: 140: Hoare triple {12726#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~c~0 19))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 10:56:58,200 INFO L290 TraceCheckUtils]: 141: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 10:56:58,200 INFO L290 TraceCheckUtils]: 142: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 10:56:58,200 INFO L290 TraceCheckUtils]: 143: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 10:56:58,201 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {12288#true} {12726#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~c~0 19))} #50#return; {12726#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~c~0 19))} is VALID [2022-04-08 10:56:58,202 INFO L290 TraceCheckUtils]: 145: Hoare triple {12726#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~c~0 19))} assume !(~c~0 < ~k~0); {12748#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~k~0 19))} is VALID [2022-04-08 10:56:58,203 INFO L272 TraceCheckUtils]: 146: Hoare triple {12748#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~k~0 19))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12752#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:56:58,203 INFO L290 TraceCheckUtils]: 147: Hoare triple {12752#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12756#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:58,203 INFO L290 TraceCheckUtils]: 148: Hoare triple {12756#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12289#false} is VALID [2022-04-08 10:56:58,203 INFO L290 TraceCheckUtils]: 149: Hoare triple {12289#false} assume !false; {12289#false} is VALID [2022-04-08 10:56:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 40 proven. 570 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-04-08 10:56:58,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:58,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:58,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807693621] [2022-04-08 10:56:58,489 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:58,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901798036] [2022-04-08 10:56:58,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901798036] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:56:58,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:56:58,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-04-08 10:56:58,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:58,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [62311351] [2022-04-08 10:56:58,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [62311351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:58,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:58,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:56:58,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353287600] [2022-04-08 10:56:58,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:58,491 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Word has length 150 [2022-04-08 10:56:58,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:58,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:56:58,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:58,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:56:58,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:58,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:56:58,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:56:58,574 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:57:02,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:02,300 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2022-04-08 10:57:02,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:57:02,301 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Word has length 150 [2022-04-08 10:57:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:57:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:57:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 102 transitions. [2022-04-08 10:57:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:57:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 102 transitions. [2022-04-08 10:57:02,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 102 transitions. [2022-04-08 10:57:02,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:57:02,434 INFO L225 Difference]: With dead ends: 87 [2022-04-08 10:57:02,434 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 10:57:02,435 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:57:02,435 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:57:02,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 804 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-08 10:57:02,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 10:57:02,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-08 10:57:02,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:57:02,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 24 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 10:57:02,488 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 24 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 10:57:02,488 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 24 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 10:57:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:02,489 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-08 10:57:02,490 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 10:57:02,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:57:02,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:57:02,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 24 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 82 states. [2022-04-08 10:57:02,490 INFO L87 Difference]: Start difference. First operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 24 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 82 states. [2022-04-08 10:57:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:02,491 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-08 10:57:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 10:57:02,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:57:02,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:57:02,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:57:02,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:57:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 24 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 10:57:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-08 10:57:02,493 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 150 [2022-04-08 10:57:02,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:57:02,494 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-08 10:57:02,494 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 10:57:02,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 101 transitions. [2022-04-08 10:57:03,116 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-08 10:57:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 10:57:03,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-08 10:57:03,117 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:57:03,117 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:57:03,134 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-08 10:57:03,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-08 10:57:03,324 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:57:03,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:57:03,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1184287794, now seen corresponding path program 39 times [2022-04-08 10:57:03,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:57:03,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [598160006] [2022-04-08 10:57:03,382 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:57:03,383 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:57:03,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1184287794, now seen corresponding path program 40 times [2022-04-08 10:57:03,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:57:03,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226292328] [2022-04-08 10:57:03,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:57:03,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:57:03,393 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:57:03,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [716953463] [2022-04-08 10:57:03,394 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:57:03,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:57:03,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:57:03,395 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-08 10:57:03,396 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-08 10:57:04,837 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:57:04,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:57:04,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-08 10:57:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:57:04,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:57:05,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {13310#true} call ULTIMATE.init(); {13310#true} is VALID [2022-04-08 10:57:05,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {13310#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(9, 2);call #Ultimate.allocInit(12, 3); {13310#true} is VALID [2022-04-08 10:57:05,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13310#true} {13310#true} #56#return; {13310#true} is VALID [2022-04-08 10:57:05,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {13310#true} call #t~ret5 := main(); {13310#true} is VALID [2022-04-08 10:57:05,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {13310#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {13330#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:05,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {13330#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {13330#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:05,588 INFO L272 TraceCheckUtils]: 7: Hoare triple {13330#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,589 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {13310#true} {13330#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {13330#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:05,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {13330#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13352#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:57:05,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {13352#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {13352#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:57:05,589 INFO L272 TraceCheckUtils]: 14: Hoare triple {13352#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,590 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13310#true} {13352#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {13352#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:57:05,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {13352#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13374#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 10:57:05,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {13374#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {13374#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 10:57:05,591 INFO L272 TraceCheckUtils]: 21: Hoare triple {13374#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,591 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13310#true} {13374#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #50#return; {13374#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 10:57:05,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {13374#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13396#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 10:57:05,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {13396#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} assume !false; {13396#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 10:57:05,592 INFO L272 TraceCheckUtils]: 28: Hoare triple {13396#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,592 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13310#true} {13396#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} #50#return; {13396#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 10:57:05,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {13396#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13418#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-08 10:57:05,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {13418#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} assume !false; {13418#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-08 10:57:05,593 INFO L272 TraceCheckUtils]: 35: Hoare triple {13418#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,601 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13310#true} {13418#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} #50#return; {13418#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-08 10:57:05,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {13418#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13440#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:05,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {13440#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {13440#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:05,602 INFO L272 TraceCheckUtils]: 42: Hoare triple {13440#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,602 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13310#true} {13440#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {13440#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:05,603 INFO L290 TraceCheckUtils]: 47: Hoare triple {13440#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13462#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:05,603 INFO L290 TraceCheckUtils]: 48: Hoare triple {13462#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {13462#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:05,603 INFO L272 TraceCheckUtils]: 49: Hoare triple {13462#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,603 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {13310#true} {13462#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #50#return; {13462#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:05,604 INFO L290 TraceCheckUtils]: 54: Hoare triple {13462#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13484#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 10:57:05,604 INFO L290 TraceCheckUtils]: 55: Hoare triple {13484#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {13484#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 10:57:05,604 INFO L272 TraceCheckUtils]: 56: Hoare triple {13484#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,604 INFO L290 TraceCheckUtils]: 57: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,604 INFO L290 TraceCheckUtils]: 58: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,605 INFO L290 TraceCheckUtils]: 59: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,605 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13310#true} {13484#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {13484#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 10:57:05,605 INFO L290 TraceCheckUtils]: 61: Hoare triple {13484#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13506#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 10:57:05,605 INFO L290 TraceCheckUtils]: 62: Hoare triple {13506#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {13506#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 10:57:05,605 INFO L272 TraceCheckUtils]: 63: Hoare triple {13506#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,605 INFO L290 TraceCheckUtils]: 64: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,606 INFO L290 TraceCheckUtils]: 65: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,606 INFO L290 TraceCheckUtils]: 66: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,606 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {13310#true} {13506#(and (= main_~y~0 8) (= main_~c~0 8))} #50#return; {13506#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 10:57:05,606 INFO L290 TraceCheckUtils]: 68: Hoare triple {13506#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13528#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 10:57:05,606 INFO L290 TraceCheckUtils]: 69: Hoare triple {13528#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {13528#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 10:57:05,606 INFO L272 TraceCheckUtils]: 70: Hoare triple {13528#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,607 INFO L290 TraceCheckUtils]: 71: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,607 INFO L290 TraceCheckUtils]: 72: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,607 INFO L290 TraceCheckUtils]: 73: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,607 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13310#true} {13528#(and (= main_~y~0 9) (= main_~c~0 9))} #50#return; {13528#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 10:57:05,607 INFO L290 TraceCheckUtils]: 75: Hoare triple {13528#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13550#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 10:57:05,607 INFO L290 TraceCheckUtils]: 76: Hoare triple {13550#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {13550#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 10:57:05,608 INFO L272 TraceCheckUtils]: 77: Hoare triple {13550#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,608 INFO L290 TraceCheckUtils]: 78: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,608 INFO L290 TraceCheckUtils]: 79: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,608 INFO L290 TraceCheckUtils]: 80: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,608 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13310#true} {13550#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #50#return; {13550#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 10:57:05,608 INFO L290 TraceCheckUtils]: 82: Hoare triple {13550#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13572#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:57:05,609 INFO L290 TraceCheckUtils]: 83: Hoare triple {13572#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {13572#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:57:05,609 INFO L272 TraceCheckUtils]: 84: Hoare triple {13572#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,609 INFO L290 TraceCheckUtils]: 85: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,609 INFO L290 TraceCheckUtils]: 86: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,609 INFO L290 TraceCheckUtils]: 87: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,609 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13310#true} {13572#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {13572#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:57:05,609 INFO L290 TraceCheckUtils]: 89: Hoare triple {13572#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13594#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:57:05,610 INFO L290 TraceCheckUtils]: 90: Hoare triple {13594#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {13594#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:57:05,610 INFO L272 TraceCheckUtils]: 91: Hoare triple {13594#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,610 INFO L290 TraceCheckUtils]: 92: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,610 INFO L290 TraceCheckUtils]: 93: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,610 INFO L290 TraceCheckUtils]: 94: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,610 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {13310#true} {13594#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #50#return; {13594#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:57:05,625 INFO L290 TraceCheckUtils]: 96: Hoare triple {13594#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13616#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 10:57:05,626 INFO L290 TraceCheckUtils]: 97: Hoare triple {13616#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !false; {13616#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 10:57:05,626 INFO L272 TraceCheckUtils]: 98: Hoare triple {13616#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,626 INFO L290 TraceCheckUtils]: 99: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,626 INFO L290 TraceCheckUtils]: 100: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,626 INFO L290 TraceCheckUtils]: 101: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,626 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {13310#true} {13616#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #50#return; {13616#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 10:57:05,627 INFO L290 TraceCheckUtils]: 103: Hoare triple {13616#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13638#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 10:57:05,627 INFO L290 TraceCheckUtils]: 104: Hoare triple {13638#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} assume !false; {13638#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 10:57:05,627 INFO L272 TraceCheckUtils]: 105: Hoare triple {13638#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,627 INFO L290 TraceCheckUtils]: 106: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,627 INFO L290 TraceCheckUtils]: 107: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,627 INFO L290 TraceCheckUtils]: 108: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,628 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {13310#true} {13638#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} #50#return; {13638#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 10:57:05,628 INFO L290 TraceCheckUtils]: 110: Hoare triple {13638#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13660#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:05,628 INFO L290 TraceCheckUtils]: 111: Hoare triple {13660#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !false; {13660#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:05,628 INFO L272 TraceCheckUtils]: 112: Hoare triple {13660#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,628 INFO L290 TraceCheckUtils]: 113: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,629 INFO L290 TraceCheckUtils]: 114: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,629 INFO L290 TraceCheckUtils]: 115: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,629 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13310#true} {13660#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} #50#return; {13660#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:05,629 INFO L290 TraceCheckUtils]: 117: Hoare triple {13660#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13682#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-08 10:57:05,630 INFO L290 TraceCheckUtils]: 118: Hoare triple {13682#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} assume !false; {13682#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-08 10:57:05,630 INFO L272 TraceCheckUtils]: 119: Hoare triple {13682#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,630 INFO L290 TraceCheckUtils]: 120: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,630 INFO L290 TraceCheckUtils]: 121: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,630 INFO L290 TraceCheckUtils]: 122: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,630 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {13310#true} {13682#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} #50#return; {13682#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-08 10:57:05,630 INFO L290 TraceCheckUtils]: 124: Hoare triple {13682#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13704#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:05,631 INFO L290 TraceCheckUtils]: 125: Hoare triple {13704#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {13704#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:05,631 INFO L272 TraceCheckUtils]: 126: Hoare triple {13704#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,631 INFO L290 TraceCheckUtils]: 127: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,631 INFO L290 TraceCheckUtils]: 128: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,631 INFO L290 TraceCheckUtils]: 129: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,631 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {13310#true} {13704#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #50#return; {13704#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:05,632 INFO L290 TraceCheckUtils]: 131: Hoare triple {13704#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13726#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-08 10:57:05,632 INFO L290 TraceCheckUtils]: 132: Hoare triple {13726#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} assume !false; {13726#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-08 10:57:05,632 INFO L272 TraceCheckUtils]: 133: Hoare triple {13726#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,632 INFO L290 TraceCheckUtils]: 134: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,632 INFO L290 TraceCheckUtils]: 135: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,632 INFO L290 TraceCheckUtils]: 136: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,633 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {13310#true} {13726#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} #50#return; {13726#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-08 10:57:05,633 INFO L290 TraceCheckUtils]: 138: Hoare triple {13726#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13748#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 10:57:05,633 INFO L290 TraceCheckUtils]: 139: Hoare triple {13748#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {13748#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 10:57:05,633 INFO L272 TraceCheckUtils]: 140: Hoare triple {13748#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,633 INFO L290 TraceCheckUtils]: 141: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,633 INFO L290 TraceCheckUtils]: 142: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,633 INFO L290 TraceCheckUtils]: 143: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,634 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {13310#true} {13748#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #50#return; {13748#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 10:57:05,635 INFO L290 TraceCheckUtils]: 145: Hoare triple {13748#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13770#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} is VALID [2022-04-08 10:57:05,635 INFO L290 TraceCheckUtils]: 146: Hoare triple {13770#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} assume !false; {13770#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} is VALID [2022-04-08 10:57:05,635 INFO L272 TraceCheckUtils]: 147: Hoare triple {13770#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13310#true} is VALID [2022-04-08 10:57:05,635 INFO L290 TraceCheckUtils]: 148: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 10:57:05,635 INFO L290 TraceCheckUtils]: 149: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 10:57:05,635 INFO L290 TraceCheckUtils]: 150: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 10:57:05,636 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {13310#true} {13770#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} #50#return; {13770#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} is VALID [2022-04-08 10:57:05,636 INFO L290 TraceCheckUtils]: 152: Hoare triple {13770#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} assume !(~c~0 < ~k~0); {13792#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~k~0 20) (< 19 main_~k~0))} is VALID [2022-04-08 10:57:05,637 INFO L272 TraceCheckUtils]: 153: Hoare triple {13792#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~k~0 20) (< 19 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:57:05,637 INFO L290 TraceCheckUtils]: 154: Hoare triple {13796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:57:05,637 INFO L290 TraceCheckUtils]: 155: Hoare triple {13800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13311#false} is VALID [2022-04-08 10:57:05,637 INFO L290 TraceCheckUtils]: 156: Hoare triple {13311#false} assume !false; {13311#false} is VALID [2022-04-08 10:57:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 630 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-08 10:57:05,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:57:05,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:57:05,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226292328] [2022-04-08 10:57:05,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:57:05,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716953463] [2022-04-08 10:57:05,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716953463] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:57:05,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:57:05,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-04-08 10:57:05,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:57:05,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [598160006] [2022-04-08 10:57:05,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [598160006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:57:05,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:57:05,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:57:05,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096482969] [2022-04-08 10:57:05,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:57:05,933 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 23 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Word has length 157 [2022-04-08 10:57:05,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:57:05,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 23 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 10:57:06,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:57:06,075 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:57:06,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:57:06,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:57:06,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:57:06,076 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 23 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 10:57:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:10,554 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-04-08 10:57:10,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:57:10,554 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 23 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Word has length 157 [2022-04-08 10:57:10,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:57:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 23 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 10:57:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 106 transitions. [2022-04-08 10:57:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 23 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 10:57:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 106 transitions. [2022-04-08 10:57:10,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 106 transitions. [2022-04-08 10:57:10,779 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-08 10:57:10,781 INFO L225 Difference]: With dead ends: 90 [2022-04-08 10:57:10,781 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 10:57:10,781 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:57:10,781 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:57:10,781 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 863 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 10:57:10,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 10:57:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-08 10:57:10,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:57:10,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 25 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 10:57:10,823 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 25 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 10:57:10,823 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 25 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 10:57:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:10,825 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2022-04-08 10:57:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2022-04-08 10:57:10,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:57:10,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:57:10,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 25 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 85 states. [2022-04-08 10:57:10,825 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 25 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 85 states. [2022-04-08 10:57:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:10,827 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2022-04-08 10:57:10,827 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2022-04-08 10:57:10,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:57:10,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:57:10,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:57:10,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:57:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 25 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 10:57:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2022-04-08 10:57:10,829 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 157 [2022-04-08 10:57:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:57:10,829 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2022-04-08 10:57:10,829 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 23 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 10:57:10,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 105 transitions. [2022-04-08 10:57:11,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:57:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2022-04-08 10:57:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-08 10:57:11,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:57:11,468 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:57:11,474 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-08 10:57:11,676 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:57:11,677 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:57:11,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:57:11,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1391801691, now seen corresponding path program 41 times [2022-04-08 10:57:11,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:57:11,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [726221066] [2022-04-08 10:57:11,747 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:57:11,747 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:57:11,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1391801691, now seen corresponding path program 42 times [2022-04-08 10:57:11,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:57:11,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96101049] [2022-04-08 10:57:11,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:57:11,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:57:11,780 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:57:11,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083427967] [2022-04-08 10:57:11,781 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:57:11,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:57:11,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:57:11,792 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:57:11,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 10:57:12,905 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-08 10:57:12,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:57:12,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-08 10:57:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:57:12,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:57:13,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {14372#true} call ULTIMATE.init(); {14372#true} is VALID [2022-04-08 10:57:13,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {14372#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(9, 2);call #Ultimate.allocInit(12, 3); {14372#true} is VALID [2022-04-08 10:57:13,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14372#true} {14372#true} #56#return; {14372#true} is VALID [2022-04-08 10:57:13,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {14372#true} call #t~ret5 := main(); {14372#true} is VALID [2022-04-08 10:57:13,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {14372#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {14392#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:13,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {14392#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {14392#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:13,794 INFO L272 TraceCheckUtils]: 7: Hoare triple {14392#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,795 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {14372#true} {14392#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {14392#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:13,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {14392#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14414#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:57:13,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {14414#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {14414#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:57:13,795 INFO L272 TraceCheckUtils]: 14: Hoare triple {14414#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,796 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14372#true} {14414#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {14414#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 10:57:13,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {14414#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14436#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:13,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {14436#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {14436#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:13,796 INFO L272 TraceCheckUtils]: 21: Hoare triple {14436#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,810 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14372#true} {14436#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #50#return; {14436#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:13,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {14436#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14458#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 10:57:13,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {14458#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {14458#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 10:57:13,810 INFO L272 TraceCheckUtils]: 28: Hoare triple {14458#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,811 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14372#true} {14458#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #50#return; {14458#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 10:57:13,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {14458#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14480#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:57:13,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {14480#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {14480#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:57:13,811 INFO L272 TraceCheckUtils]: 35: Hoare triple {14480#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,812 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14372#true} {14480#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #50#return; {14480#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:57:13,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {14480#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14502#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:13,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {14502#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {14502#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:13,813 INFO L272 TraceCheckUtils]: 42: Hoare triple {14502#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,813 INFO L290 TraceCheckUtils]: 44: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,813 INFO L290 TraceCheckUtils]: 45: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,813 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14372#true} {14502#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {14502#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:13,813 INFO L290 TraceCheckUtils]: 47: Hoare triple {14502#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14524#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:13,814 INFO L290 TraceCheckUtils]: 48: Hoare triple {14524#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {14524#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:13,814 INFO L272 TraceCheckUtils]: 49: Hoare triple {14524#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,814 INFO L290 TraceCheckUtils]: 50: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,814 INFO L290 TraceCheckUtils]: 51: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,814 INFO L290 TraceCheckUtils]: 52: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,814 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {14372#true} {14524#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #50#return; {14524#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:13,814 INFO L290 TraceCheckUtils]: 54: Hoare triple {14524#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14546#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:13,815 INFO L290 TraceCheckUtils]: 55: Hoare triple {14546#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {14546#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:13,815 INFO L272 TraceCheckUtils]: 56: Hoare triple {14546#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,815 INFO L290 TraceCheckUtils]: 57: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,815 INFO L290 TraceCheckUtils]: 58: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,815 INFO L290 TraceCheckUtils]: 59: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,815 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14372#true} {14546#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #50#return; {14546#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:13,816 INFO L290 TraceCheckUtils]: 61: Hoare triple {14546#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14568#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 10:57:13,816 INFO L290 TraceCheckUtils]: 62: Hoare triple {14568#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {14568#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 10:57:13,816 INFO L272 TraceCheckUtils]: 63: Hoare triple {14568#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,816 INFO L290 TraceCheckUtils]: 64: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,816 INFO L290 TraceCheckUtils]: 65: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,816 INFO L290 TraceCheckUtils]: 66: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,816 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {14372#true} {14568#(and (= main_~y~0 8) (= main_~c~0 8))} #50#return; {14568#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 10:57:13,817 INFO L290 TraceCheckUtils]: 68: Hoare triple {14568#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14590#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 10:57:13,817 INFO L290 TraceCheckUtils]: 69: Hoare triple {14590#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {14590#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 10:57:13,817 INFO L272 TraceCheckUtils]: 70: Hoare triple {14590#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,817 INFO L290 TraceCheckUtils]: 71: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,817 INFO L290 TraceCheckUtils]: 72: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,817 INFO L290 TraceCheckUtils]: 73: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,817 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14372#true} {14590#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #50#return; {14590#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 10:57:13,818 INFO L290 TraceCheckUtils]: 75: Hoare triple {14590#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14612#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:13,818 INFO L290 TraceCheckUtils]: 76: Hoare triple {14612#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} assume !false; {14612#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:13,818 INFO L272 TraceCheckUtils]: 77: Hoare triple {14612#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,818 INFO L290 TraceCheckUtils]: 78: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,818 INFO L290 TraceCheckUtils]: 79: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,818 INFO L290 TraceCheckUtils]: 80: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,818 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14372#true} {14612#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} #50#return; {14612#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:13,819 INFO L290 TraceCheckUtils]: 82: Hoare triple {14612#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14634#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} is VALID [2022-04-08 10:57:13,819 INFO L290 TraceCheckUtils]: 83: Hoare triple {14634#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} assume !false; {14634#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} is VALID [2022-04-08 10:57:13,819 INFO L272 TraceCheckUtils]: 84: Hoare triple {14634#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,819 INFO L290 TraceCheckUtils]: 85: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,819 INFO L290 TraceCheckUtils]: 86: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,819 INFO L290 TraceCheckUtils]: 87: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,820 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {14372#true} {14634#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} #50#return; {14634#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} is VALID [2022-04-08 10:57:13,820 INFO L290 TraceCheckUtils]: 89: Hoare triple {14634#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14656#(and (= 8 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 10:57:13,820 INFO L290 TraceCheckUtils]: 90: Hoare triple {14656#(and (= 8 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 9))} assume !false; {14656#(and (= 8 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 10:57:13,820 INFO L272 TraceCheckUtils]: 91: Hoare triple {14656#(and (= 8 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,820 INFO L290 TraceCheckUtils]: 92: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,820 INFO L290 TraceCheckUtils]: 93: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,820 INFO L290 TraceCheckUtils]: 94: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,821 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {14372#true} {14656#(and (= 8 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 9))} #50#return; {14656#(and (= 8 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 10:57:13,821 INFO L290 TraceCheckUtils]: 96: Hoare triple {14656#(and (= 8 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14678#(and (= (+ main_~c~0 (- 5)) 8) (= main_~y~0 13))} is VALID [2022-04-08 10:57:13,821 INFO L290 TraceCheckUtils]: 97: Hoare triple {14678#(and (= (+ main_~c~0 (- 5)) 8) (= main_~y~0 13))} assume !false; {14678#(and (= (+ main_~c~0 (- 5)) 8) (= main_~y~0 13))} is VALID [2022-04-08 10:57:13,821 INFO L272 TraceCheckUtils]: 98: Hoare triple {14678#(and (= (+ main_~c~0 (- 5)) 8) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,821 INFO L290 TraceCheckUtils]: 99: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,821 INFO L290 TraceCheckUtils]: 100: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,821 INFO L290 TraceCheckUtils]: 101: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,822 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {14372#true} {14678#(and (= (+ main_~c~0 (- 5)) 8) (= main_~y~0 13))} #50#return; {14678#(and (= (+ main_~c~0 (- 5)) 8) (= main_~y~0 13))} is VALID [2022-04-08 10:57:13,822 INFO L290 TraceCheckUtils]: 103: Hoare triple {14678#(and (= (+ main_~c~0 (- 5)) 8) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14700#(and (= (+ main_~c~0 (- 6)) 8) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 10:57:13,822 INFO L290 TraceCheckUtils]: 104: Hoare triple {14700#(and (= (+ main_~c~0 (- 6)) 8) (= (+ (- 1) main_~y~0) 13))} assume !false; {14700#(and (= (+ main_~c~0 (- 6)) 8) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 10:57:13,822 INFO L272 TraceCheckUtils]: 105: Hoare triple {14700#(and (= (+ main_~c~0 (- 6)) 8) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,822 INFO L290 TraceCheckUtils]: 106: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,822 INFO L290 TraceCheckUtils]: 107: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,823 INFO L290 TraceCheckUtils]: 108: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,823 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {14372#true} {14700#(and (= (+ main_~c~0 (- 6)) 8) (= (+ (- 1) main_~y~0) 13))} #50#return; {14700#(and (= (+ main_~c~0 (- 6)) 8) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 10:57:13,823 INFO L290 TraceCheckUtils]: 110: Hoare triple {14700#(and (= (+ main_~c~0 (- 6)) 8) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14722#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 10:57:13,823 INFO L290 TraceCheckUtils]: 111: Hoare triple {14722#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {14722#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 10:57:13,823 INFO L272 TraceCheckUtils]: 112: Hoare triple {14722#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,824 INFO L290 TraceCheckUtils]: 113: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,824 INFO L290 TraceCheckUtils]: 114: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,824 INFO L290 TraceCheckUtils]: 115: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,824 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {14372#true} {14722#(and (= main_~c~0 15) (= main_~y~0 15))} #50#return; {14722#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 10:57:13,824 INFO L290 TraceCheckUtils]: 117: Hoare triple {14722#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14744#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 10:57:13,824 INFO L290 TraceCheckUtils]: 118: Hoare triple {14744#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {14744#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 10:57:13,825 INFO L272 TraceCheckUtils]: 119: Hoare triple {14744#(and (= main_~c~0 16) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,825 INFO L290 TraceCheckUtils]: 120: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,825 INFO L290 TraceCheckUtils]: 121: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,825 INFO L290 TraceCheckUtils]: 122: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,825 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {14372#true} {14744#(and (= main_~c~0 16) (= main_~y~0 16))} #50#return; {14744#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 10:57:13,825 INFO L290 TraceCheckUtils]: 124: Hoare triple {14744#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14766#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:13,826 INFO L290 TraceCheckUtils]: 125: Hoare triple {14766#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {14766#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:13,826 INFO L272 TraceCheckUtils]: 126: Hoare triple {14766#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,826 INFO L290 TraceCheckUtils]: 127: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,826 INFO L290 TraceCheckUtils]: 128: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,826 INFO L290 TraceCheckUtils]: 129: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,826 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {14372#true} {14766#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #50#return; {14766#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:13,826 INFO L290 TraceCheckUtils]: 131: Hoare triple {14766#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14788#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 10:57:13,827 INFO L290 TraceCheckUtils]: 132: Hoare triple {14788#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !false; {14788#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 10:57:13,827 INFO L272 TraceCheckUtils]: 133: Hoare triple {14788#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,827 INFO L290 TraceCheckUtils]: 134: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,827 INFO L290 TraceCheckUtils]: 135: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,827 INFO L290 TraceCheckUtils]: 136: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,827 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {14372#true} {14788#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} #50#return; {14788#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 10:57:13,827 INFO L290 TraceCheckUtils]: 138: Hoare triple {14788#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14810#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 10:57:13,828 INFO L290 TraceCheckUtils]: 139: Hoare triple {14810#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !false; {14810#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 10:57:13,828 INFO L272 TraceCheckUtils]: 140: Hoare triple {14810#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,828 INFO L290 TraceCheckUtils]: 141: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,828 INFO L290 TraceCheckUtils]: 142: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,828 INFO L290 TraceCheckUtils]: 143: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,828 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {14372#true} {14810#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} #50#return; {14810#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 10:57:13,829 INFO L290 TraceCheckUtils]: 145: Hoare triple {14810#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14832#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} is VALID [2022-04-08 10:57:13,829 INFO L290 TraceCheckUtils]: 146: Hoare triple {14832#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} assume !false; {14832#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} is VALID [2022-04-08 10:57:13,829 INFO L272 TraceCheckUtils]: 147: Hoare triple {14832#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,829 INFO L290 TraceCheckUtils]: 148: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,829 INFO L290 TraceCheckUtils]: 149: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,829 INFO L290 TraceCheckUtils]: 150: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,829 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {14372#true} {14832#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} #50#return; {14832#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} is VALID [2022-04-08 10:57:13,830 INFO L290 TraceCheckUtils]: 152: Hoare triple {14832#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14854#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-08 10:57:13,830 INFO L290 TraceCheckUtils]: 153: Hoare triple {14854#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} assume !false; {14854#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-08 10:57:13,830 INFO L272 TraceCheckUtils]: 154: Hoare triple {14854#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 10:57:13,830 INFO L290 TraceCheckUtils]: 155: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 10:57:13,830 INFO L290 TraceCheckUtils]: 156: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 10:57:13,830 INFO L290 TraceCheckUtils]: 157: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 10:57:13,830 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {14372#true} {14854#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} #50#return; {14854#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-08 10:57:13,832 INFO L290 TraceCheckUtils]: 159: Hoare triple {14854#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} assume !(~c~0 < ~k~0); {14876#(and (< 20 main_~k~0) (= main_~y~0 21) (<= main_~k~0 21))} is VALID [2022-04-08 10:57:13,832 INFO L272 TraceCheckUtils]: 160: Hoare triple {14876#(and (< 20 main_~k~0) (= main_~y~0 21) (<= main_~k~0 21))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14880#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:57:13,832 INFO L290 TraceCheckUtils]: 161: Hoare triple {14880#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14884#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:57:13,833 INFO L290 TraceCheckUtils]: 162: Hoare triple {14884#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14373#false} is VALID [2022-04-08 10:57:13,833 INFO L290 TraceCheckUtils]: 163: Hoare triple {14373#false} assume !false; {14373#false} is VALID [2022-04-08 10:57:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 44 proven. 693 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-08 10:57:13,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:57:14,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:57:14,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96101049] [2022-04-08 10:57:14,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:57:14,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083427967] [2022-04-08 10:57:14,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083427967] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:57:14,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:57:14,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-04-08 10:57:14,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:57:14,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [726221066] [2022-04-08 10:57:14,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [726221066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:57:14,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:57:14,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 10:57:14,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336338488] [2022-04-08 10:57:14,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:57:14,058 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 24 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Word has length 164 [2022-04-08 10:57:14,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:57:14,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 24 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 10:57:14,135 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-08 10:57:14,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 10:57:14,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:57:14,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 10:57:14,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:57:14,136 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 24 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 10:57:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:18,465 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2022-04-08 10:57:18,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:57:18,465 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 24 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Word has length 164 [2022-04-08 10:57:18,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:57:18,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 24 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 10:57:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 110 transitions. [2022-04-08 10:57:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 24 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 10:57:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 110 transitions. [2022-04-08 10:57:18,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 110 transitions. [2022-04-08 10:57:18,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:57:18,694 INFO L225 Difference]: With dead ends: 93 [2022-04-08 10:57:18,694 INFO L226 Difference]: Without dead ends: 88 [2022-04-08 10:57:18,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:57:18,695 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:57:18,695 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 924 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1686 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 10:57:18,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-08 10:57:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-08 10:57:18,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:57:18,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 26 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:57:18,768 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 26 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:57:18,768 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 26 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:57:18,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:18,770 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2022-04-08 10:57:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-04-08 10:57:18,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:57:18,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:57:18,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 26 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 88 states. [2022-04-08 10:57:18,771 INFO L87 Difference]: Start difference. First operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 26 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 88 states. [2022-04-08 10:57:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:18,772 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2022-04-08 10:57:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-04-08 10:57:18,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:57:18,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:57:18,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:57:18,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:57:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 26 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:57:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-04-08 10:57:18,774 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 164 [2022-04-08 10:57:18,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:57:18,775 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-04-08 10:57:18,775 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 24 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 10:57:18,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 109 transitions. [2022-04-08 10:57:19,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:57:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-04-08 10:57:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-08 10:57:19,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:57:19,455 INFO L499 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:57:19,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-08 10:57:19,655 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:57:19,655 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:57:19,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:57:19,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1008454446, now seen corresponding path program 43 times [2022-04-08 10:57:19,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:57:19,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1424590461] [2022-04-08 10:57:19,733 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:57:19,734 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:57:19,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1008454446, now seen corresponding path program 44 times [2022-04-08 10:57:19,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:57:19,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760264742] [2022-04-08 10:57:19,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:57:19,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:57:19,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:57:19,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [541771581] [2022-04-08 10:57:19,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:57:19,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:57:19,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:57:19,747 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:57:19,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 10:57:20,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:57:20,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:57:20,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-08 10:57:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:57:20,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:57:21,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {15474#true} call ULTIMATE.init(); {15474#true} is VALID [2022-04-08 10:57:21,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {15474#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(9, 2);call #Ultimate.allocInit(12, 3); {15474#true} is VALID [2022-04-08 10:57:21,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15474#true} {15474#true} #56#return; {15474#true} is VALID [2022-04-08 10:57:21,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {15474#true} call #t~ret5 := main(); {15474#true} is VALID [2022-04-08 10:57:21,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {15474#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {15494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:21,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {15494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {15494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:21,373 INFO L272 TraceCheckUtils]: 7: Hoare triple {15494#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,374 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {15474#true} {15494#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {15494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:21,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {15494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15516#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:57:21,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {15516#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {15516#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:57:21,375 INFO L272 TraceCheckUtils]: 14: Hoare triple {15516#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,375 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15474#true} {15516#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {15516#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:57:21,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {15516#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15538#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:21,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {15538#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {15538#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:21,376 INFO L272 TraceCheckUtils]: 21: Hoare triple {15538#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,377 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15474#true} {15538#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #50#return; {15538#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:21,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {15538#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15560#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 10:57:21,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {15560#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {15560#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 10:57:21,377 INFO L272 TraceCheckUtils]: 28: Hoare triple {15560#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,380 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15474#true} {15560#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #50#return; {15560#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 10:57:21,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {15560#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15582#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:57:21,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {15582#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {15582#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:57:21,381 INFO L272 TraceCheckUtils]: 35: Hoare triple {15582#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,381 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15474#true} {15582#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #50#return; {15582#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:57:21,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {15582#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15604#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:21,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {15604#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {15604#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:21,382 INFO L272 TraceCheckUtils]: 42: Hoare triple {15604#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,383 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15474#true} {15604#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #50#return; {15604#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:21,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {15604#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15626#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:21,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {15626#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {15626#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:21,383 INFO L272 TraceCheckUtils]: 49: Hoare triple {15626#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,384 INFO L290 TraceCheckUtils]: 51: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,384 INFO L290 TraceCheckUtils]: 52: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,384 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15474#true} {15626#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #50#return; {15626#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:21,384 INFO L290 TraceCheckUtils]: 54: Hoare triple {15626#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15648#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 10:57:21,385 INFO L290 TraceCheckUtils]: 55: Hoare triple {15648#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {15648#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 10:57:21,385 INFO L272 TraceCheckUtils]: 56: Hoare triple {15648#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,385 INFO L290 TraceCheckUtils]: 57: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,385 INFO L290 TraceCheckUtils]: 58: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,385 INFO L290 TraceCheckUtils]: 59: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,385 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {15474#true} {15648#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {15648#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 10:57:21,386 INFO L290 TraceCheckUtils]: 61: Hoare triple {15648#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15670#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 10:57:21,386 INFO L290 TraceCheckUtils]: 62: Hoare triple {15670#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {15670#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 10:57:21,386 INFO L272 TraceCheckUtils]: 63: Hoare triple {15670#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,386 INFO L290 TraceCheckUtils]: 64: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,386 INFO L290 TraceCheckUtils]: 65: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,386 INFO L290 TraceCheckUtils]: 66: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,387 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {15474#true} {15670#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #50#return; {15670#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 10:57:21,387 INFO L290 TraceCheckUtils]: 68: Hoare triple {15670#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15692#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-08 10:57:21,388 INFO L290 TraceCheckUtils]: 69: Hoare triple {15692#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !false; {15692#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-08 10:57:21,388 INFO L272 TraceCheckUtils]: 70: Hoare triple {15692#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,388 INFO L290 TraceCheckUtils]: 71: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,388 INFO L290 TraceCheckUtils]: 72: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,388 INFO L290 TraceCheckUtils]: 73: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,388 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15474#true} {15692#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} #50#return; {15692#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-08 10:57:21,389 INFO L290 TraceCheckUtils]: 75: Hoare triple {15692#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15714#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:57:21,389 INFO L290 TraceCheckUtils]: 76: Hoare triple {15714#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {15714#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:57:21,389 INFO L272 TraceCheckUtils]: 77: Hoare triple {15714#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,389 INFO L290 TraceCheckUtils]: 78: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,389 INFO L290 TraceCheckUtils]: 79: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,389 INFO L290 TraceCheckUtils]: 80: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,390 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {15474#true} {15714#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {15714#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:57:21,390 INFO L290 TraceCheckUtils]: 82: Hoare triple {15714#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15736#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 10:57:21,390 INFO L290 TraceCheckUtils]: 83: Hoare triple {15736#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {15736#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 10:57:21,391 INFO L272 TraceCheckUtils]: 84: Hoare triple {15736#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,391 INFO L290 TraceCheckUtils]: 85: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,391 INFO L290 TraceCheckUtils]: 86: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,391 INFO L290 TraceCheckUtils]: 87: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,391 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {15474#true} {15736#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {15736#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 10:57:21,392 INFO L290 TraceCheckUtils]: 89: Hoare triple {15736#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15758#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:57:21,392 INFO L290 TraceCheckUtils]: 90: Hoare triple {15758#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {15758#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:57:21,392 INFO L272 TraceCheckUtils]: 91: Hoare triple {15758#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,392 INFO L290 TraceCheckUtils]: 92: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,392 INFO L290 TraceCheckUtils]: 93: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,392 INFO L290 TraceCheckUtils]: 94: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,393 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {15474#true} {15758#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #50#return; {15758#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:57:21,393 INFO L290 TraceCheckUtils]: 96: Hoare triple {15758#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15780#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 10:57:21,393 INFO L290 TraceCheckUtils]: 97: Hoare triple {15780#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {15780#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 10:57:21,393 INFO L272 TraceCheckUtils]: 98: Hoare triple {15780#(and (= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,393 INFO L290 TraceCheckUtils]: 99: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,394 INFO L290 TraceCheckUtils]: 100: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,394 INFO L290 TraceCheckUtils]: 101: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,394 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {15474#true} {15780#(and (= main_~c~0 13) (= main_~y~0 13))} #50#return; {15780#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 10:57:21,394 INFO L290 TraceCheckUtils]: 103: Hoare triple {15780#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15802#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 10:57:21,395 INFO L290 TraceCheckUtils]: 104: Hoare triple {15802#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {15802#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 10:57:21,395 INFO L272 TraceCheckUtils]: 105: Hoare triple {15802#(and (= main_~y~0 14) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,395 INFO L290 TraceCheckUtils]: 106: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,395 INFO L290 TraceCheckUtils]: 107: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,395 INFO L290 TraceCheckUtils]: 108: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,395 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {15474#true} {15802#(and (= main_~y~0 14) (= main_~c~0 14))} #50#return; {15802#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 10:57:21,396 INFO L290 TraceCheckUtils]: 110: Hoare triple {15802#(and (= main_~y~0 14) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15824#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:21,396 INFO L290 TraceCheckUtils]: 111: Hoare triple {15824#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {15824#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:21,396 INFO L272 TraceCheckUtils]: 112: Hoare triple {15824#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,396 INFO L290 TraceCheckUtils]: 113: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,396 INFO L290 TraceCheckUtils]: 114: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,396 INFO L290 TraceCheckUtils]: 115: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,397 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {15474#true} {15824#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #50#return; {15824#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:21,397 INFO L290 TraceCheckUtils]: 117: Hoare triple {15824#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15846#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 10:57:21,398 INFO L290 TraceCheckUtils]: 118: Hoare triple {15846#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {15846#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 10:57:21,398 INFO L272 TraceCheckUtils]: 119: Hoare triple {15846#(and (= main_~c~0 16) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,398 INFO L290 TraceCheckUtils]: 120: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,398 INFO L290 TraceCheckUtils]: 121: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,398 INFO L290 TraceCheckUtils]: 122: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,398 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {15474#true} {15846#(and (= main_~c~0 16) (= main_~y~0 16))} #50#return; {15846#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 10:57:21,399 INFO L290 TraceCheckUtils]: 124: Hoare triple {15846#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15868#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 10:57:21,399 INFO L290 TraceCheckUtils]: 125: Hoare triple {15868#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {15868#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 10:57:21,399 INFO L272 TraceCheckUtils]: 126: Hoare triple {15868#(and (= main_~c~0 17) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,399 INFO L290 TraceCheckUtils]: 127: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,399 INFO L290 TraceCheckUtils]: 128: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,399 INFO L290 TraceCheckUtils]: 129: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,400 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {15474#true} {15868#(and (= main_~c~0 17) (= main_~y~0 17))} #50#return; {15868#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 10:57:21,400 INFO L290 TraceCheckUtils]: 131: Hoare triple {15868#(and (= main_~c~0 17) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15890#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 10:57:21,400 INFO L290 TraceCheckUtils]: 132: Hoare triple {15890#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {15890#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 10:57:21,401 INFO L272 TraceCheckUtils]: 133: Hoare triple {15890#(and (= main_~c~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,401 INFO L290 TraceCheckUtils]: 134: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,401 INFO L290 TraceCheckUtils]: 135: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,401 INFO L290 TraceCheckUtils]: 136: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,401 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {15474#true} {15890#(and (= main_~c~0 18) (= main_~y~0 18))} #50#return; {15890#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 10:57:21,402 INFO L290 TraceCheckUtils]: 138: Hoare triple {15890#(and (= main_~c~0 18) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15912#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 10:57:21,402 INFO L290 TraceCheckUtils]: 139: Hoare triple {15912#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {15912#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 10:57:21,402 INFO L272 TraceCheckUtils]: 140: Hoare triple {15912#(and (= 19 main_~y~0) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,402 INFO L290 TraceCheckUtils]: 141: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,402 INFO L290 TraceCheckUtils]: 142: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,402 INFO L290 TraceCheckUtils]: 143: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,403 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {15474#true} {15912#(and (= 19 main_~y~0) (= 19 main_~c~0))} #50#return; {15912#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 10:57:21,403 INFO L290 TraceCheckUtils]: 145: Hoare triple {15912#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15934#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:57:21,403 INFO L290 TraceCheckUtils]: 146: Hoare triple {15934#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {15934#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:57:21,403 INFO L272 TraceCheckUtils]: 147: Hoare triple {15934#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,403 INFO L290 TraceCheckUtils]: 148: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,404 INFO L290 TraceCheckUtils]: 149: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,404 INFO L290 TraceCheckUtils]: 150: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,404 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {15474#true} {15934#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #50#return; {15934#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:57:21,404 INFO L290 TraceCheckUtils]: 152: Hoare triple {15934#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15956#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 10:57:21,405 INFO L290 TraceCheckUtils]: 153: Hoare triple {15956#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {15956#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 10:57:21,405 INFO L272 TraceCheckUtils]: 154: Hoare triple {15956#(and (= main_~c~0 21) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,405 INFO L290 TraceCheckUtils]: 155: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,405 INFO L290 TraceCheckUtils]: 156: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,405 INFO L290 TraceCheckUtils]: 157: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,405 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {15474#true} {15956#(and (= main_~c~0 21) (= main_~y~0 21))} #50#return; {15956#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 10:57:21,406 INFO L290 TraceCheckUtils]: 159: Hoare triple {15956#(and (= main_~c~0 21) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15978#(and (<= main_~c~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:21,406 INFO L290 TraceCheckUtils]: 160: Hoare triple {15978#(and (<= main_~c~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} assume !false; {15978#(and (<= main_~c~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:21,406 INFO L272 TraceCheckUtils]: 161: Hoare triple {15978#(and (<= main_~c~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 10:57:21,406 INFO L290 TraceCheckUtils]: 162: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 10:57:21,406 INFO L290 TraceCheckUtils]: 163: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 10:57:21,406 INFO L290 TraceCheckUtils]: 164: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 10:57:21,407 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {15474#true} {15978#(and (<= main_~c~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} #50#return; {15978#(and (<= main_~c~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:21,408 INFO L290 TraceCheckUtils]: 166: Hoare triple {15978#(and (<= main_~c~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} assume !(~c~0 < ~k~0); {16000#(and (<= main_~k~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:21,409 INFO L272 TraceCheckUtils]: 167: Hoare triple {16000#(and (<= main_~k~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16004#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:57:21,409 INFO L290 TraceCheckUtils]: 168: Hoare triple {16004#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16008#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:57:21,410 INFO L290 TraceCheckUtils]: 169: Hoare triple {16008#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15475#false} is VALID [2022-04-08 10:57:21,410 INFO L290 TraceCheckUtils]: 170: Hoare triple {15475#false} assume !false; {15475#false} is VALID [2022-04-08 10:57:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1817 backedges. 46 proven. 759 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2022-04-08 10:57:21,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:57:21,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:57:21,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760264742] [2022-04-08 10:57:21,765 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:57:21,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541771581] [2022-04-08 10:57:21,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541771581] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:57:21,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:57:21,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-04-08 10:57:21,766 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:57:21,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1424590461] [2022-04-08 10:57:21,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1424590461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:57:21,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:57:21,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 10:57:21,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515767284] [2022-04-08 10:57:21,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:57:21,767 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 25 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Word has length 171 [2022-04-08 10:57:21,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:57:21,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 25 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:57:21,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:57:21,882 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 10:57:21,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:57:21,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 10:57:21,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:57:21,883 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 25 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:57:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:27,959 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-08 10:57:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:57:27,959 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 25 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Word has length 171 [2022-04-08 10:57:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:57:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 25 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:57:27,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 114 transitions. [2022-04-08 10:57:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 25 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:57:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 114 transitions. [2022-04-08 10:57:27,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 114 transitions. [2022-04-08 10:57:28,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:57:28,188 INFO L225 Difference]: With dead ends: 96 [2022-04-08 10:57:28,188 INFO L226 Difference]: Without dead ends: 91 [2022-04-08 10:57:28,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:57:28,189 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 1831 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:57:28,189 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 987 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1831 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-08 10:57:28,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-08 10:57:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-08 10:57:28,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:57:28,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 27 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 10:57:28,264 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 27 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 10:57:28,264 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 27 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 10:57:28,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:28,266 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-04-08 10:57:28,266 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-04-08 10:57:28,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:57:28,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:57:28,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 27 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 91 states. [2022-04-08 10:57:28,266 INFO L87 Difference]: Start difference. First operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 27 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 91 states. [2022-04-08 10:57:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:28,268 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-04-08 10:57:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-04-08 10:57:28,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:57:28,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:57:28,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:57:28,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:57:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 27 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 10:57:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2022-04-08 10:57:28,270 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 171 [2022-04-08 10:57:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:57:28,270 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2022-04-08 10:57:28,270 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 25 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:57:28,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 113 transitions. [2022-04-08 10:57:29,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:57:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-04-08 10:57:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-08 10:57:29,026 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:57:29,026 INFO L499 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:57:29,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-08 10:57:29,226 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-08 10:57:29,227 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:57:29,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:57:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1981050373, now seen corresponding path program 45 times [2022-04-08 10:57:29,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:57:29,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1997951727] [2022-04-08 10:57:29,300 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:57:29,300 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:57:29,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1981050373, now seen corresponding path program 46 times [2022-04-08 10:57:29,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:57:29,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24364713] [2022-04-08 10:57:29,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:57:29,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:57:29,313 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:57:29,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [535743365] [2022-04-08 10:57:29,314 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:57:29,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:57:29,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:57:29,315 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:57:29,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-08 10:57:30,927 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:57:30,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:57:30,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-08 10:57:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:57:30,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:57:31,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {16616#true} call ULTIMATE.init(); {16616#true} is VALID [2022-04-08 10:57:31,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {16616#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(9, 2);call #Ultimate.allocInit(12, 3); {16616#true} is VALID [2022-04-08 10:57:31,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16616#true} {16616#true} #56#return; {16616#true} is VALID [2022-04-08 10:57:31,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {16616#true} call #t~ret5 := main(); {16616#true} is VALID [2022-04-08 10:57:31,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {16616#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {16636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:31,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {16636#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {16636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:31,795 INFO L272 TraceCheckUtils]: 7: Hoare triple {16636#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,796 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {16616#true} {16636#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {16636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:31,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {16636#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16658#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:57:31,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {16658#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {16658#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:57:31,796 INFO L272 TraceCheckUtils]: 14: Hoare triple {16658#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,797 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16616#true} {16658#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {16658#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:57:31,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {16658#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16680#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:31,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {16680#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {16680#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:31,798 INFO L272 TraceCheckUtils]: 21: Hoare triple {16680#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,798 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16616#true} {16680#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #50#return; {16680#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:31,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {16680#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16702#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 10:57:31,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {16702#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {16702#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 10:57:31,799 INFO L272 TraceCheckUtils]: 28: Hoare triple {16702#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,799 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16616#true} {16702#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #50#return; {16702#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 10:57:31,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {16702#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16724#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 10:57:31,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {16724#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} assume !false; {16724#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 10:57:31,800 INFO L272 TraceCheckUtils]: 35: Hoare triple {16724#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,800 INFO L290 TraceCheckUtils]: 36: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,800 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16616#true} {16724#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} #50#return; {16724#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 10:57:31,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {16724#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16746#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:31,801 INFO L290 TraceCheckUtils]: 41: Hoare triple {16746#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {16746#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:31,801 INFO L272 TraceCheckUtils]: 42: Hoare triple {16746#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,801 INFO L290 TraceCheckUtils]: 43: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,801 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16616#true} {16746#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {16746#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:31,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {16746#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16768#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:31,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {16768#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {16768#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:31,802 INFO L272 TraceCheckUtils]: 49: Hoare triple {16768#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,802 INFO L290 TraceCheckUtils]: 50: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,802 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16616#true} {16768#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #50#return; {16768#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:31,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {16768#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16790#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-08 10:57:31,803 INFO L290 TraceCheckUtils]: 55: Hoare triple {16790#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} assume !false; {16790#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-08 10:57:31,803 INFO L272 TraceCheckUtils]: 56: Hoare triple {16790#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,803 INFO L290 TraceCheckUtils]: 58: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,803 INFO L290 TraceCheckUtils]: 59: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,804 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16616#true} {16790#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} #50#return; {16790#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-08 10:57:31,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {16790#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16812#(and (= (+ main_~y~0 (- 3)) 5) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 10:57:31,804 INFO L290 TraceCheckUtils]: 62: Hoare triple {16812#(and (= (+ main_~y~0 (- 3)) 5) (= 5 (+ main_~c~0 (- 3))))} assume !false; {16812#(and (= (+ main_~y~0 (- 3)) 5) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 10:57:31,804 INFO L272 TraceCheckUtils]: 63: Hoare triple {16812#(and (= (+ main_~y~0 (- 3)) 5) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,804 INFO L290 TraceCheckUtils]: 64: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,804 INFO L290 TraceCheckUtils]: 65: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,804 INFO L290 TraceCheckUtils]: 66: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,805 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {16616#true} {16812#(and (= (+ main_~y~0 (- 3)) 5) (= 5 (+ main_~c~0 (- 3))))} #50#return; {16812#(and (= (+ main_~y~0 (- 3)) 5) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 10:57:31,805 INFO L290 TraceCheckUtils]: 68: Hoare triple {16812#(and (= (+ main_~y~0 (- 3)) 5) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16834#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 10:57:31,805 INFO L290 TraceCheckUtils]: 69: Hoare triple {16834#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {16834#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 10:57:31,805 INFO L272 TraceCheckUtils]: 70: Hoare triple {16834#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,805 INFO L290 TraceCheckUtils]: 71: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,805 INFO L290 TraceCheckUtils]: 72: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,805 INFO L290 TraceCheckUtils]: 73: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,806 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16616#true} {16834#(and (= main_~y~0 9) (= main_~c~0 9))} #50#return; {16834#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 10:57:31,806 INFO L290 TraceCheckUtils]: 75: Hoare triple {16834#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16856#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 10:57:31,806 INFO L290 TraceCheckUtils]: 76: Hoare triple {16856#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {16856#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 10:57:31,806 INFO L272 TraceCheckUtils]: 77: Hoare triple {16856#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,806 INFO L290 TraceCheckUtils]: 78: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,806 INFO L290 TraceCheckUtils]: 79: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,807 INFO L290 TraceCheckUtils]: 80: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,807 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {16616#true} {16856#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #50#return; {16856#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 10:57:31,807 INFO L290 TraceCheckUtils]: 82: Hoare triple {16856#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16878#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 10:57:31,807 INFO L290 TraceCheckUtils]: 83: Hoare triple {16878#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {16878#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 10:57:31,807 INFO L272 TraceCheckUtils]: 84: Hoare triple {16878#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,807 INFO L290 TraceCheckUtils]: 85: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,808 INFO L290 TraceCheckUtils]: 86: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,808 INFO L290 TraceCheckUtils]: 87: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,808 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {16616#true} {16878#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #50#return; {16878#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 10:57:31,808 INFO L290 TraceCheckUtils]: 89: Hoare triple {16878#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16900#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:57:31,808 INFO L290 TraceCheckUtils]: 90: Hoare triple {16900#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !false; {16900#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:57:31,809 INFO L272 TraceCheckUtils]: 91: Hoare triple {16900#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,809 INFO L290 TraceCheckUtils]: 92: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,809 INFO L290 TraceCheckUtils]: 93: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,809 INFO L290 TraceCheckUtils]: 94: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,809 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {16616#true} {16900#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} #50#return; {16900#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:57:31,809 INFO L290 TraceCheckUtils]: 96: Hoare triple {16900#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16922#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 10:57:31,810 INFO L290 TraceCheckUtils]: 97: Hoare triple {16922#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {16922#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 10:57:31,810 INFO L272 TraceCheckUtils]: 98: Hoare triple {16922#(and (= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,810 INFO L290 TraceCheckUtils]: 99: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,810 INFO L290 TraceCheckUtils]: 100: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,810 INFO L290 TraceCheckUtils]: 101: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,810 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {16616#true} {16922#(and (= main_~c~0 13) (= main_~y~0 13))} #50#return; {16922#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 10:57:31,810 INFO L290 TraceCheckUtils]: 103: Hoare triple {16922#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16944#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 10:57:31,811 INFO L290 TraceCheckUtils]: 104: Hoare triple {16944#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} assume !false; {16944#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 10:57:31,811 INFO L272 TraceCheckUtils]: 105: Hoare triple {16944#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,811 INFO L290 TraceCheckUtils]: 106: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,811 INFO L290 TraceCheckUtils]: 107: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,811 INFO L290 TraceCheckUtils]: 108: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,811 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {16616#true} {16944#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} #50#return; {16944#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 10:57:31,811 INFO L290 TraceCheckUtils]: 110: Hoare triple {16944#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16966#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-08 10:57:31,812 INFO L290 TraceCheckUtils]: 111: Hoare triple {16966#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} assume !false; {16966#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-08 10:57:31,812 INFO L272 TraceCheckUtils]: 112: Hoare triple {16966#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,812 INFO L290 TraceCheckUtils]: 113: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,812 INFO L290 TraceCheckUtils]: 114: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,812 INFO L290 TraceCheckUtils]: 115: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,812 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {16616#true} {16966#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} #50#return; {16966#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-08 10:57:31,813 INFO L290 TraceCheckUtils]: 117: Hoare triple {16966#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16988#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-08 10:57:31,813 INFO L290 TraceCheckUtils]: 118: Hoare triple {16988#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} assume !false; {16988#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-08 10:57:31,813 INFO L272 TraceCheckUtils]: 119: Hoare triple {16988#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,813 INFO L290 TraceCheckUtils]: 120: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,813 INFO L290 TraceCheckUtils]: 121: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,813 INFO L290 TraceCheckUtils]: 122: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,813 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {16616#true} {16988#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} #50#return; {16988#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-08 10:57:31,814 INFO L290 TraceCheckUtils]: 124: Hoare triple {16988#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17010#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13))} is VALID [2022-04-08 10:57:31,814 INFO L290 TraceCheckUtils]: 125: Hoare triple {17010#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13))} assume !false; {17010#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13))} is VALID [2022-04-08 10:57:31,814 INFO L272 TraceCheckUtils]: 126: Hoare triple {17010#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,814 INFO L290 TraceCheckUtils]: 127: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,814 INFO L290 TraceCheckUtils]: 128: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,814 INFO L290 TraceCheckUtils]: 129: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,814 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {16616#true} {17010#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13))} #50#return; {17010#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13))} is VALID [2022-04-08 10:57:31,815 INFO L290 TraceCheckUtils]: 131: Hoare triple {17010#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17032#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 10:57:31,815 INFO L290 TraceCheckUtils]: 132: Hoare triple {17032#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {17032#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 10:57:31,815 INFO L272 TraceCheckUtils]: 133: Hoare triple {17032#(and (= main_~c~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,815 INFO L290 TraceCheckUtils]: 134: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,815 INFO L290 TraceCheckUtils]: 135: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,815 INFO L290 TraceCheckUtils]: 136: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,816 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {16616#true} {17032#(and (= main_~c~0 18) (= main_~y~0 18))} #50#return; {17032#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 10:57:31,816 INFO L290 TraceCheckUtils]: 138: Hoare triple {17032#(and (= main_~c~0 18) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17054#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 10:57:31,816 INFO L290 TraceCheckUtils]: 139: Hoare triple {17054#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} assume !false; {17054#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 10:57:31,816 INFO L272 TraceCheckUtils]: 140: Hoare triple {17054#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,816 INFO L290 TraceCheckUtils]: 141: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,816 INFO L290 TraceCheckUtils]: 142: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,816 INFO L290 TraceCheckUtils]: 143: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,817 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {16616#true} {17054#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} #50#return; {17054#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 10:57:31,817 INFO L290 TraceCheckUtils]: 145: Hoare triple {17054#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17076#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 10:57:31,817 INFO L290 TraceCheckUtils]: 146: Hoare triple {17076#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {17076#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 10:57:31,817 INFO L272 TraceCheckUtils]: 147: Hoare triple {17076#(and (= main_~c~0 20) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,817 INFO L290 TraceCheckUtils]: 148: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,817 INFO L290 TraceCheckUtils]: 149: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,817 INFO L290 TraceCheckUtils]: 150: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,818 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {16616#true} {17076#(and (= main_~c~0 20) (= main_~y~0 20))} #50#return; {17076#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 10:57:31,818 INFO L290 TraceCheckUtils]: 152: Hoare triple {17076#(and (= main_~c~0 20) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17098#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:31,818 INFO L290 TraceCheckUtils]: 153: Hoare triple {17098#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !false; {17098#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:31,818 INFO L272 TraceCheckUtils]: 154: Hoare triple {17098#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,818 INFO L290 TraceCheckUtils]: 155: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,818 INFO L290 TraceCheckUtils]: 156: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,819 INFO L290 TraceCheckUtils]: 157: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,819 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {16616#true} {17098#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} #50#return; {17098#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:31,819 INFO L290 TraceCheckUtils]: 159: Hoare triple {17098#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17120#(and (= (+ (- 1) main_~c~0) 21) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 10:57:31,819 INFO L290 TraceCheckUtils]: 160: Hoare triple {17120#(and (= (+ (- 1) main_~c~0) 21) (= (+ (- 2) main_~y~0) 20))} assume !false; {17120#(and (= (+ (- 1) main_~c~0) 21) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 10:57:31,819 INFO L272 TraceCheckUtils]: 161: Hoare triple {17120#(and (= (+ (- 1) main_~c~0) 21) (= (+ (- 2) main_~y~0) 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,819 INFO L290 TraceCheckUtils]: 162: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,820 INFO L290 TraceCheckUtils]: 163: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,820 INFO L290 TraceCheckUtils]: 164: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,820 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {16616#true} {17120#(and (= (+ (- 1) main_~c~0) 21) (= (+ (- 2) main_~y~0) 20))} #50#return; {17120#(and (= (+ (- 1) main_~c~0) 21) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 10:57:31,820 INFO L290 TraceCheckUtils]: 166: Hoare triple {17120#(and (= (+ (- 1) main_~c~0) 21) (= (+ (- 2) main_~y~0) 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17142#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-08 10:57:31,820 INFO L290 TraceCheckUtils]: 167: Hoare triple {17142#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} assume !false; {17142#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-08 10:57:31,821 INFO L272 TraceCheckUtils]: 168: Hoare triple {17142#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 10:57:31,821 INFO L290 TraceCheckUtils]: 169: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 10:57:31,821 INFO L290 TraceCheckUtils]: 170: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 10:57:31,821 INFO L290 TraceCheckUtils]: 171: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 10:57:31,821 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {16616#true} {17142#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} #50#return; {17142#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-08 10:57:31,823 INFO L290 TraceCheckUtils]: 173: Hoare triple {17142#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} assume !(~c~0 < ~k~0); {17164#(and (< 22 main_~k~0) (<= main_~k~0 23) (= 23 main_~y~0))} is VALID [2022-04-08 10:57:31,823 INFO L272 TraceCheckUtils]: 174: Hoare triple {17164#(and (< 22 main_~k~0) (<= main_~k~0 23) (= 23 main_~y~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17168#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:57:31,823 INFO L290 TraceCheckUtils]: 175: Hoare triple {17168#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17172#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:57:31,824 INFO L290 TraceCheckUtils]: 176: Hoare triple {17172#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16617#false} is VALID [2022-04-08 10:57:31,824 INFO L290 TraceCheckUtils]: 177: Hoare triple {16617#false} assume !false; {16617#false} is VALID [2022-04-08 10:57:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 48 proven. 828 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2022-04-08 10:57:31,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:57:32,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:57:32,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24364713] [2022-04-08 10:57:32,073 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:57:32,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535743365] [2022-04-08 10:57:32,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535743365] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:57:32,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:57:32,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2022-04-08 10:57:32,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:57:32,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1997951727] [2022-04-08 10:57:32,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1997951727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:57:32,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:57:32,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-08 10:57:32,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639822946] [2022-04-08 10:57:32,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:57:32,075 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 26 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Word has length 178 [2022-04-08 10:57:32,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:57:32,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 26 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 10:57:32,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:57:32,344 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-08 10:57:32,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:57:32,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-08 10:57:32,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:57:32,345 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 26 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 10:57:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:39,478 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2022-04-08 10:57:39,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:57:39,478 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 26 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Word has length 178 [2022-04-08 10:57:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:57:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 26 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 10:57:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 118 transitions. [2022-04-08 10:57:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 26 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 10:57:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 118 transitions. [2022-04-08 10:57:39,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 118 transitions. [2022-04-08 10:57:39,761 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-08 10:57:39,762 INFO L225 Difference]: With dead ends: 99 [2022-04-08 10:57:39,762 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 10:57:39,763 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:57:39,763 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 2 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:57:39,763 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1052 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-08 10:57:39,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 10:57:39,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-08 10:57:39,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:57:39,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 28 states have call successors, (28), 5 states have call predecessors, (28), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 10:57:39,841 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 28 states have call successors, (28), 5 states have call predecessors, (28), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 10:57:39,841 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 28 states have call successors, (28), 5 states have call predecessors, (28), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 10:57:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:39,843 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-04-08 10:57:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-04-08 10:57:39,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:57:39,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:57:39,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 28 states have call successors, (28), 5 states have call predecessors, (28), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 94 states. [2022-04-08 10:57:39,844 INFO L87 Difference]: Start difference. First operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 28 states have call successors, (28), 5 states have call predecessors, (28), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 94 states. [2022-04-08 10:57:39,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:39,845 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-04-08 10:57:39,845 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-04-08 10:57:39,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:57:39,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:57:39,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:57:39,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:57:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 28 states have call successors, (28), 5 states have call predecessors, (28), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 10:57:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2022-04-08 10:57:39,848 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 178 [2022-04-08 10:57:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:57:39,848 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2022-04-08 10:57:39,848 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 26 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 10:57:39,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 117 transitions. [2022-04-08 10:57:40,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:57:40,589 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-04-08 10:57:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-04-08 10:57:40,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:57:40,590 INFO L499 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:57:40,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-08 10:57:40,790 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-08 10:57:40,790 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:57:40,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:57:40,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1027734158, now seen corresponding path program 47 times [2022-04-08 10:57:40,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:57:40,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [883586080] [2022-04-08 10:57:40,869 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:57:40,869 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:57:40,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1027734158, now seen corresponding path program 48 times [2022-04-08 10:57:40,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:57:40,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926031300] [2022-04-08 10:57:40,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:57:40,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:57:40,882 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:57:40,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [722708718] [2022-04-08 10:57:40,883 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:57:40,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:57:40,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:57:40,883 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:57:40,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-08 10:57:44,195 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-08 10:57:44,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:57:44,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-08 10:57:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:57:44,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:57:45,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {17798#true} call ULTIMATE.init(); {17798#true} is VALID [2022-04-08 10:57:45,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {17798#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(9, 2);call #Ultimate.allocInit(12, 3); {17798#true} is VALID [2022-04-08 10:57:45,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17798#true} {17798#true} #56#return; {17798#true} is VALID [2022-04-08 10:57:45,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {17798#true} call #t~ret5 := main(); {17798#true} is VALID [2022-04-08 10:57:45,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {17798#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {17818#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:45,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {17818#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {17818#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:45,104 INFO L272 TraceCheckUtils]: 7: Hoare triple {17818#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,104 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {17798#true} {17818#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {17818#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:45,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {17818#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17840#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:57:45,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {17840#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {17840#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:57:45,105 INFO L272 TraceCheckUtils]: 14: Hoare triple {17840#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,105 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17798#true} {17840#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {17840#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:57:45,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {17840#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17862#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:57:45,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {17862#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {17862#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:57:45,106 INFO L272 TraceCheckUtils]: 21: Hoare triple {17862#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,106 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17798#true} {17862#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {17862#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:57:45,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {17862#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17884#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 10:57:45,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {17884#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {17884#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 10:57:45,107 INFO L272 TraceCheckUtils]: 28: Hoare triple {17884#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,108 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17798#true} {17884#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #50#return; {17884#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 10:57:45,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {17884#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17906#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:45,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {17906#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} assume !false; {17906#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:45,108 INFO L272 TraceCheckUtils]: 35: Hoare triple {17906#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,108 INFO L290 TraceCheckUtils]: 36: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,109 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17798#true} {17906#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} #50#return; {17906#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:45,109 INFO L290 TraceCheckUtils]: 40: Hoare triple {17906#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17928#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:45,109 INFO L290 TraceCheckUtils]: 41: Hoare triple {17928#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {17928#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:45,109 INFO L272 TraceCheckUtils]: 42: Hoare triple {17928#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,109 INFO L290 TraceCheckUtils]: 43: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,109 INFO L290 TraceCheckUtils]: 44: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,110 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {17798#true} {17928#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {17928#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:45,110 INFO L290 TraceCheckUtils]: 47: Hoare triple {17928#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17950#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:45,110 INFO L290 TraceCheckUtils]: 48: Hoare triple {17950#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {17950#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:45,110 INFO L272 TraceCheckUtils]: 49: Hoare triple {17950#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,110 INFO L290 TraceCheckUtils]: 50: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,110 INFO L290 TraceCheckUtils]: 51: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,111 INFO L290 TraceCheckUtils]: 52: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,111 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {17798#true} {17950#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #50#return; {17950#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:45,111 INFO L290 TraceCheckUtils]: 54: Hoare triple {17950#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17972#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 10:57:45,111 INFO L290 TraceCheckUtils]: 55: Hoare triple {17972#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {17972#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 10:57:45,111 INFO L272 TraceCheckUtils]: 56: Hoare triple {17972#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,112 INFO L290 TraceCheckUtils]: 57: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,112 INFO L290 TraceCheckUtils]: 58: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,112 INFO L290 TraceCheckUtils]: 59: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,112 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {17798#true} {17972#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #50#return; {17972#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 10:57:45,112 INFO L290 TraceCheckUtils]: 61: Hoare triple {17972#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17994#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:57:45,112 INFO L290 TraceCheckUtils]: 62: Hoare triple {17994#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {17994#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:57:45,113 INFO L272 TraceCheckUtils]: 63: Hoare triple {17994#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,113 INFO L290 TraceCheckUtils]: 64: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,113 INFO L290 TraceCheckUtils]: 65: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,113 INFO L290 TraceCheckUtils]: 66: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,113 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {17798#true} {17994#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #50#return; {17994#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:57:45,113 INFO L290 TraceCheckUtils]: 68: Hoare triple {17994#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18016#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:45,114 INFO L290 TraceCheckUtils]: 69: Hoare triple {18016#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !false; {18016#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:45,114 INFO L272 TraceCheckUtils]: 70: Hoare triple {18016#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,114 INFO L290 TraceCheckUtils]: 71: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,114 INFO L290 TraceCheckUtils]: 72: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,114 INFO L290 TraceCheckUtils]: 73: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,114 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17798#true} {18016#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} #50#return; {18016#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:45,114 INFO L290 TraceCheckUtils]: 75: Hoare triple {18016#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18038#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-08 10:57:45,115 INFO L290 TraceCheckUtils]: 76: Hoare triple {18038#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !false; {18038#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-08 10:57:45,115 INFO L272 TraceCheckUtils]: 77: Hoare triple {18038#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,115 INFO L290 TraceCheckUtils]: 78: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,115 INFO L290 TraceCheckUtils]: 79: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,115 INFO L290 TraceCheckUtils]: 80: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,115 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17798#true} {18038#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} #50#return; {18038#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-08 10:57:45,115 INFO L290 TraceCheckUtils]: 82: Hoare triple {18038#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18060#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-08 10:57:45,116 INFO L290 TraceCheckUtils]: 83: Hoare triple {18060#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} assume !false; {18060#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-08 10:57:45,116 INFO L272 TraceCheckUtils]: 84: Hoare triple {18060#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,116 INFO L290 TraceCheckUtils]: 85: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,116 INFO L290 TraceCheckUtils]: 86: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,116 INFO L290 TraceCheckUtils]: 87: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,116 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {17798#true} {18060#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} #50#return; {18060#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-08 10:57:45,117 INFO L290 TraceCheckUtils]: 89: Hoare triple {18060#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18082#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:57:45,117 INFO L290 TraceCheckUtils]: 90: Hoare triple {18082#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {18082#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:57:45,117 INFO L272 TraceCheckUtils]: 91: Hoare triple {18082#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,117 INFO L290 TraceCheckUtils]: 92: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,117 INFO L290 TraceCheckUtils]: 93: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,117 INFO L290 TraceCheckUtils]: 94: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,117 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {17798#true} {18082#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {18082#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:57:45,118 INFO L290 TraceCheckUtils]: 96: Hoare triple {18082#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18104#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 10:57:45,118 INFO L290 TraceCheckUtils]: 97: Hoare triple {18104#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {18104#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 10:57:45,118 INFO L272 TraceCheckUtils]: 98: Hoare triple {18104#(and (= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,118 INFO L290 TraceCheckUtils]: 99: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,118 INFO L290 TraceCheckUtils]: 100: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,118 INFO L290 TraceCheckUtils]: 101: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,118 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {17798#true} {18104#(and (= main_~c~0 13) (= main_~y~0 13))} #50#return; {18104#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 10:57:45,119 INFO L290 TraceCheckUtils]: 103: Hoare triple {18104#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18126#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 10:57:45,119 INFO L290 TraceCheckUtils]: 104: Hoare triple {18126#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {18126#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 10:57:45,119 INFO L272 TraceCheckUtils]: 105: Hoare triple {18126#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,119 INFO L290 TraceCheckUtils]: 106: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,119 INFO L290 TraceCheckUtils]: 107: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,119 INFO L290 TraceCheckUtils]: 108: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,119 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {17798#true} {18126#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #50#return; {18126#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 10:57:45,120 INFO L290 TraceCheckUtils]: 110: Hoare triple {18126#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18148#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 10:57:45,120 INFO L290 TraceCheckUtils]: 111: Hoare triple {18148#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {18148#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 10:57:45,120 INFO L272 TraceCheckUtils]: 112: Hoare triple {18148#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,120 INFO L290 TraceCheckUtils]: 113: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,120 INFO L290 TraceCheckUtils]: 114: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,120 INFO L290 TraceCheckUtils]: 115: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,121 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {17798#true} {18148#(and (= main_~c~0 15) (= main_~y~0 15))} #50#return; {18148#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 10:57:45,121 INFO L290 TraceCheckUtils]: 117: Hoare triple {18148#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18170#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 10:57:45,121 INFO L290 TraceCheckUtils]: 118: Hoare triple {18170#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {18170#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 10:57:45,121 INFO L272 TraceCheckUtils]: 119: Hoare triple {18170#(and (= main_~c~0 16) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,121 INFO L290 TraceCheckUtils]: 120: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,121 INFO L290 TraceCheckUtils]: 121: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,121 INFO L290 TraceCheckUtils]: 122: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,122 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {17798#true} {18170#(and (= main_~c~0 16) (= main_~y~0 16))} #50#return; {18170#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 10:57:45,122 INFO L290 TraceCheckUtils]: 124: Hoare triple {18170#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18192#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-08 10:57:45,122 INFO L290 TraceCheckUtils]: 125: Hoare triple {18192#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !false; {18192#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-08 10:57:45,122 INFO L272 TraceCheckUtils]: 126: Hoare triple {18192#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,122 INFO L290 TraceCheckUtils]: 127: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,122 INFO L290 TraceCheckUtils]: 128: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,122 INFO L290 TraceCheckUtils]: 129: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,123 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {17798#true} {18192#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} #50#return; {18192#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-08 10:57:45,127 INFO L290 TraceCheckUtils]: 131: Hoare triple {18192#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18214#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-08 10:57:45,128 INFO L290 TraceCheckUtils]: 132: Hoare triple {18214#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} assume !false; {18214#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-08 10:57:45,128 INFO L272 TraceCheckUtils]: 133: Hoare triple {18214#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,128 INFO L290 TraceCheckUtils]: 134: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,128 INFO L290 TraceCheckUtils]: 135: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,128 INFO L290 TraceCheckUtils]: 136: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,129 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {17798#true} {18214#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} #50#return; {18214#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-08 10:57:45,129 INFO L290 TraceCheckUtils]: 138: Hoare triple {18214#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18236#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 10:57:45,130 INFO L290 TraceCheckUtils]: 139: Hoare triple {18236#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !false; {18236#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 10:57:45,130 INFO L272 TraceCheckUtils]: 140: Hoare triple {18236#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,130 INFO L290 TraceCheckUtils]: 141: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,130 INFO L290 TraceCheckUtils]: 142: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,130 INFO L290 TraceCheckUtils]: 143: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,130 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {17798#true} {18236#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} #50#return; {18236#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 10:57:45,131 INFO L290 TraceCheckUtils]: 145: Hoare triple {18236#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18258#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-08 10:57:45,131 INFO L290 TraceCheckUtils]: 146: Hoare triple {18258#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !false; {18258#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-08 10:57:45,131 INFO L272 TraceCheckUtils]: 147: Hoare triple {18258#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,131 INFO L290 TraceCheckUtils]: 148: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,131 INFO L290 TraceCheckUtils]: 149: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,132 INFO L290 TraceCheckUtils]: 150: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,132 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {17798#true} {18258#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} #50#return; {18258#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-08 10:57:45,132 INFO L290 TraceCheckUtils]: 152: Hoare triple {18258#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18280#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:45,133 INFO L290 TraceCheckUtils]: 153: Hoare triple {18280#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} assume !false; {18280#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:45,133 INFO L272 TraceCheckUtils]: 154: Hoare triple {18280#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,133 INFO L290 TraceCheckUtils]: 155: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,133 INFO L290 TraceCheckUtils]: 156: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,133 INFO L290 TraceCheckUtils]: 157: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,134 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {17798#true} {18280#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} #50#return; {18280#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:57:45,134 INFO L290 TraceCheckUtils]: 159: Hoare triple {18280#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18302#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 10:57:45,134 INFO L290 TraceCheckUtils]: 160: Hoare triple {18302#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {18302#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 10:57:45,135 INFO L272 TraceCheckUtils]: 161: Hoare triple {18302#(and (= main_~y~0 22) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,135 INFO L290 TraceCheckUtils]: 162: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,135 INFO L290 TraceCheckUtils]: 163: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,135 INFO L290 TraceCheckUtils]: 164: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,135 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {17798#true} {18302#(and (= main_~y~0 22) (= main_~c~0 22))} #50#return; {18302#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 10:57:45,136 INFO L290 TraceCheckUtils]: 166: Hoare triple {18302#(and (= main_~y~0 22) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18324#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 10:57:45,136 INFO L290 TraceCheckUtils]: 167: Hoare triple {18324#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !false; {18324#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 10:57:45,136 INFO L272 TraceCheckUtils]: 168: Hoare triple {18324#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,136 INFO L290 TraceCheckUtils]: 169: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,136 INFO L290 TraceCheckUtils]: 170: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,136 INFO L290 TraceCheckUtils]: 171: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,137 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {17798#true} {18324#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} #50#return; {18324#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 10:57:45,137 INFO L290 TraceCheckUtils]: 173: Hoare triple {18324#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18346#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-08 10:57:45,138 INFO L290 TraceCheckUtils]: 174: Hoare triple {18346#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} assume !false; {18346#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-08 10:57:45,138 INFO L272 TraceCheckUtils]: 175: Hoare triple {18346#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 10:57:45,138 INFO L290 TraceCheckUtils]: 176: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 10:57:45,138 INFO L290 TraceCheckUtils]: 177: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 10:57:45,138 INFO L290 TraceCheckUtils]: 178: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 10:57:45,139 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {17798#true} {18346#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} #50#return; {18346#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-08 10:57:45,140 INFO L290 TraceCheckUtils]: 180: Hoare triple {18346#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} assume !(~c~0 < ~k~0); {18368#(and (<= main_~k~0 24) (< 23 main_~k~0) (= main_~y~0 24))} is VALID [2022-04-08 10:57:45,140 INFO L272 TraceCheckUtils]: 181: Hoare triple {18368#(and (<= main_~k~0 24) (< 23 main_~k~0) (= main_~y~0 24))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18372#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:57:45,141 INFO L290 TraceCheckUtils]: 182: Hoare triple {18372#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18376#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:57:45,141 INFO L290 TraceCheckUtils]: 183: Hoare triple {18376#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17799#false} is VALID [2022-04-08 10:57:45,141 INFO L290 TraceCheckUtils]: 184: Hoare triple {17799#false} assume !false; {17799#false} is VALID [2022-04-08 10:57:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 50 proven. 900 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2022-04-08 10:57:45,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:57:45,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:57:45,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926031300] [2022-04-08 10:57:45,509 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:57:45,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722708718] [2022-04-08 10:57:45,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722708718] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:57:45,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:57:45,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2022-04-08 10:57:45,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:57:45,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [883586080] [2022-04-08 10:57:45,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [883586080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:57:45,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:57:45,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-08 10:57:45,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967562305] [2022-04-08 10:57:45,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:57:45,511 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 27 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Word has length 185 [2022-04-08 10:57:45,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:57:45,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 27 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 10:57:45,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:57:45,777 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-08 10:57:45,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:57:45,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-08 10:57:45,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:57:45,778 INFO L87 Difference]: Start difference. First operand 94 states and 117 transitions. Second operand has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 27 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 10:57:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:53,973 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2022-04-08 10:57:53,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 10:57:53,974 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 27 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Word has length 185 [2022-04-08 10:57:53,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:57:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 27 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 10:57:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 122 transitions. [2022-04-08 10:57:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 27 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 10:57:53,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 122 transitions. [2022-04-08 10:57:53,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 122 transitions. [2022-04-08 10:57:54,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:57:54,176 INFO L225 Difference]: With dead ends: 102 [2022-04-08 10:57:54,176 INFO L226 Difference]: Without dead ends: 97 [2022-04-08 10:57:54,177 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 10:57:54,177 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 2139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 2139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:57:54,177 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1119 Invalid, 2139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2139 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-08 10:57:54,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-08 10:57:54,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-04-08 10:57:54,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:57:54,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 29 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-08 10:57:54,259 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 29 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-08 10:57:54,260 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 29 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-08 10:57:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:54,262 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-04-08 10:57:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2022-04-08 10:57:54,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:57:54,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:57:54,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 29 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 97 states. [2022-04-08 10:57:54,263 INFO L87 Difference]: Start difference. First operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 29 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 97 states. [2022-04-08 10:57:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:54,264 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-04-08 10:57:54,264 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2022-04-08 10:57:54,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:57:54,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:57:54,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:57:54,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:57:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 29 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-08 10:57:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 121 transitions. [2022-04-08 10:57:54,266 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 121 transitions. Word has length 185 [2022-04-08 10:57:54,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:57:54,267 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 121 transitions. [2022-04-08 10:57:54,267 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 27 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 10:57:54,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 121 transitions. [2022-04-08 10:57:55,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:57:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2022-04-08 10:57:55,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-04-08 10:57:55,094 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:57:55,094 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:57:55,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-08 10:57:55,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 10:57:55,295 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:57:55,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:57:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1572034203, now seen corresponding path program 49 times [2022-04-08 10:57:55,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:57:55,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1899887730] [2022-04-08 10:57:55,380 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:57:55,380 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:57:55,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1572034203, now seen corresponding path program 50 times [2022-04-08 10:57:55,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:57:55,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424006277] [2022-04-08 10:57:55,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:57:55,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:57:55,402 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:57:55,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [5728423] [2022-04-08 10:57:55,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:57:55,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:57:55,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:57:55,403 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:57:55,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-08 10:57:56,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:57:56,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:57:56,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-08 10:57:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:57:56,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:57:57,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {19020#true} call ULTIMATE.init(); {19020#true} is VALID [2022-04-08 10:57:57,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {19020#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(9, 2);call #Ultimate.allocInit(12, 3); {19020#true} is VALID [2022-04-08 10:57:57,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19020#true} {19020#true} #56#return; {19020#true} is VALID [2022-04-08 10:57:57,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {19020#true} call #t~ret5 := main(); {19020#true} is VALID [2022-04-08 10:57:57,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {19020#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {19040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:57,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {19040#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {19040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:57,729 INFO L272 TraceCheckUtils]: 7: Hoare triple {19040#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,730 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {19020#true} {19040#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {19040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:57:57,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {19040#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19062#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:57:57,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {19062#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {19062#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:57:57,731 INFO L272 TraceCheckUtils]: 14: Hoare triple {19062#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,731 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {19020#true} {19062#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {19062#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 10:57:57,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {19062#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19084#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 10:57:57,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {19084#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {19084#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 10:57:57,732 INFO L272 TraceCheckUtils]: 21: Hoare triple {19084#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,733 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {19020#true} {19084#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #50#return; {19084#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 10:57:57,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {19084#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19106#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 10:57:57,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {19106#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} assume !false; {19106#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 10:57:57,734 INFO L272 TraceCheckUtils]: 28: Hoare triple {19106#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,734 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19020#true} {19106#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} #50#return; {19106#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 10:57:57,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {19106#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19128#(and (= (+ main_~y~0 (- 3)) 1) (= 2 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:57,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {19128#(and (= (+ main_~y~0 (- 3)) 1) (= 2 (+ (- 2) main_~c~0)))} assume !false; {19128#(and (= (+ main_~y~0 (- 3)) 1) (= 2 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:57,735 INFO L272 TraceCheckUtils]: 35: Hoare triple {19128#(and (= (+ main_~y~0 (- 3)) 1) (= 2 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,736 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {19020#true} {19128#(and (= (+ main_~y~0 (- 3)) 1) (= 2 (+ (- 2) main_~c~0)))} #50#return; {19128#(and (= (+ main_~y~0 (- 3)) 1) (= 2 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:57,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {19128#(and (= (+ main_~y~0 (- 3)) 1) (= 2 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:57,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {19150#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {19150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:57,737 INFO L272 TraceCheckUtils]: 42: Hoare triple {19150#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,737 INFO L290 TraceCheckUtils]: 44: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,737 INFO L290 TraceCheckUtils]: 45: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,737 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {19020#true} {19150#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {19150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:57:57,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {19150#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19172#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:57:57,738 INFO L290 TraceCheckUtils]: 48: Hoare triple {19172#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {19172#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:57:57,738 INFO L272 TraceCheckUtils]: 49: Hoare triple {19172#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,738 INFO L290 TraceCheckUtils]: 50: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,738 INFO L290 TraceCheckUtils]: 51: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,738 INFO L290 TraceCheckUtils]: 52: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,739 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {19020#true} {19172#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {19172#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:57:57,739 INFO L290 TraceCheckUtils]: 54: Hoare triple {19172#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19194#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 10:57:57,740 INFO L290 TraceCheckUtils]: 55: Hoare triple {19194#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {19194#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 10:57:57,740 INFO L272 TraceCheckUtils]: 56: Hoare triple {19194#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,740 INFO L290 TraceCheckUtils]: 57: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,740 INFO L290 TraceCheckUtils]: 58: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,740 INFO L290 TraceCheckUtils]: 59: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,740 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19020#true} {19194#(and (= 7 main_~y~0) (= 7 main_~c~0))} #50#return; {19194#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 10:57:57,741 INFO L290 TraceCheckUtils]: 61: Hoare triple {19194#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19216#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 10:57:57,741 INFO L290 TraceCheckUtils]: 62: Hoare triple {19216#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {19216#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 10:57:57,741 INFO L272 TraceCheckUtils]: 63: Hoare triple {19216#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,741 INFO L290 TraceCheckUtils]: 64: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,741 INFO L290 TraceCheckUtils]: 65: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,741 INFO L290 TraceCheckUtils]: 66: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,742 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {19020#true} {19216#(and (= main_~y~0 8) (= main_~c~0 8))} #50#return; {19216#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 10:57:57,742 INFO L290 TraceCheckUtils]: 68: Hoare triple {19216#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19238#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 10:57:57,742 INFO L290 TraceCheckUtils]: 69: Hoare triple {19238#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {19238#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 10:57:57,743 INFO L272 TraceCheckUtils]: 70: Hoare triple {19238#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,743 INFO L290 TraceCheckUtils]: 71: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,743 INFO L290 TraceCheckUtils]: 72: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,743 INFO L290 TraceCheckUtils]: 73: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,743 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {19020#true} {19238#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #50#return; {19238#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 10:57:57,744 INFO L290 TraceCheckUtils]: 75: Hoare triple {19238#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19260#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 10:57:57,744 INFO L290 TraceCheckUtils]: 76: Hoare triple {19260#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {19260#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 10:57:57,744 INFO L272 TraceCheckUtils]: 77: Hoare triple {19260#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,744 INFO L290 TraceCheckUtils]: 78: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,744 INFO L290 TraceCheckUtils]: 79: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,744 INFO L290 TraceCheckUtils]: 80: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,745 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19020#true} {19260#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #50#return; {19260#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 10:57:57,745 INFO L290 TraceCheckUtils]: 82: Hoare triple {19260#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19282#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 10:57:57,746 INFO L290 TraceCheckUtils]: 83: Hoare triple {19282#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} assume !false; {19282#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 10:57:57,746 INFO L272 TraceCheckUtils]: 84: Hoare triple {19282#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,746 INFO L290 TraceCheckUtils]: 85: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,746 INFO L290 TraceCheckUtils]: 86: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,746 INFO L290 TraceCheckUtils]: 87: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,746 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {19020#true} {19282#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} #50#return; {19282#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 10:57:57,747 INFO L290 TraceCheckUtils]: 89: Hoare triple {19282#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19304#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 10:57:57,747 INFO L290 TraceCheckUtils]: 90: Hoare triple {19304#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} assume !false; {19304#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 10:57:57,747 INFO L272 TraceCheckUtils]: 91: Hoare triple {19304#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,747 INFO L290 TraceCheckUtils]: 92: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,747 INFO L290 TraceCheckUtils]: 93: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,747 INFO L290 TraceCheckUtils]: 94: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,748 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {19020#true} {19304#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} #50#return; {19304#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 10:57:57,748 INFO L290 TraceCheckUtils]: 96: Hoare triple {19304#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19326#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-08 10:57:57,749 INFO L290 TraceCheckUtils]: 97: Hoare triple {19326#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} assume !false; {19326#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-08 10:57:57,749 INFO L272 TraceCheckUtils]: 98: Hoare triple {19326#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,749 INFO L290 TraceCheckUtils]: 99: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,749 INFO L290 TraceCheckUtils]: 100: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,749 INFO L290 TraceCheckUtils]: 101: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,749 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {19020#true} {19326#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} #50#return; {19326#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-08 10:57:57,750 INFO L290 TraceCheckUtils]: 103: Hoare triple {19326#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19348#(and (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 10:57:57,750 INFO L290 TraceCheckUtils]: 104: Hoare triple {19348#(and (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} assume !false; {19348#(and (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 10:57:57,750 INFO L272 TraceCheckUtils]: 105: Hoare triple {19348#(and (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,750 INFO L290 TraceCheckUtils]: 106: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,750 INFO L290 TraceCheckUtils]: 107: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,751 INFO L290 TraceCheckUtils]: 108: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,751 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {19020#true} {19348#(and (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} #50#return; {19348#(and (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 10:57:57,751 INFO L290 TraceCheckUtils]: 110: Hoare triple {19348#(and (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19370#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:57,752 INFO L290 TraceCheckUtils]: 111: Hoare triple {19370#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !false; {19370#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:57,752 INFO L272 TraceCheckUtils]: 112: Hoare triple {19370#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,752 INFO L290 TraceCheckUtils]: 113: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,752 INFO L290 TraceCheckUtils]: 114: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,752 INFO L290 TraceCheckUtils]: 115: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,752 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {19020#true} {19370#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} #50#return; {19370#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:57,753 INFO L290 TraceCheckUtils]: 117: Hoare triple {19370#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19392#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-08 10:57:57,753 INFO L290 TraceCheckUtils]: 118: Hoare triple {19392#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 13))} assume !false; {19392#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-08 10:57:57,753 INFO L272 TraceCheckUtils]: 119: Hoare triple {19392#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,753 INFO L290 TraceCheckUtils]: 120: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,754 INFO L290 TraceCheckUtils]: 121: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,754 INFO L290 TraceCheckUtils]: 122: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,754 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {19020#true} {19392#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 13))} #50#return; {19392#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-08 10:57:57,754 INFO L290 TraceCheckUtils]: 124: Hoare triple {19392#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19414#(and (= (+ (- 2) main_~y~0) 15) (= 13 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 10:57:57,755 INFO L290 TraceCheckUtils]: 125: Hoare triple {19414#(and (= (+ (- 2) main_~y~0) 15) (= 13 (+ main_~c~0 (- 4))))} assume !false; {19414#(and (= (+ (- 2) main_~y~0) 15) (= 13 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 10:57:57,755 INFO L272 TraceCheckUtils]: 126: Hoare triple {19414#(and (= (+ (- 2) main_~y~0) 15) (= 13 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,755 INFO L290 TraceCheckUtils]: 127: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,755 INFO L290 TraceCheckUtils]: 128: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,755 INFO L290 TraceCheckUtils]: 129: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,756 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {19020#true} {19414#(and (= (+ (- 2) main_~y~0) 15) (= 13 (+ main_~c~0 (- 4))))} #50#return; {19414#(and (= (+ (- 2) main_~y~0) 15) (= 13 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 10:57:57,756 INFO L290 TraceCheckUtils]: 131: Hoare triple {19414#(and (= (+ (- 2) main_~y~0) 15) (= 13 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19436#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} is VALID [2022-04-08 10:57:57,756 INFO L290 TraceCheckUtils]: 132: Hoare triple {19436#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} assume !false; {19436#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} is VALID [2022-04-08 10:57:57,757 INFO L272 TraceCheckUtils]: 133: Hoare triple {19436#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,757 INFO L290 TraceCheckUtils]: 134: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,757 INFO L290 TraceCheckUtils]: 135: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,757 INFO L290 TraceCheckUtils]: 136: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,757 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {19020#true} {19436#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} #50#return; {19436#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} is VALID [2022-04-08 10:57:57,758 INFO L290 TraceCheckUtils]: 138: Hoare triple {19436#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19458#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 10:57:57,758 INFO L290 TraceCheckUtils]: 139: Hoare triple {19458#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {19458#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 10:57:57,758 INFO L272 TraceCheckUtils]: 140: Hoare triple {19458#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,758 INFO L290 TraceCheckUtils]: 141: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,758 INFO L290 TraceCheckUtils]: 142: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,758 INFO L290 TraceCheckUtils]: 143: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,759 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {19020#true} {19458#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #50#return; {19458#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 10:57:57,759 INFO L290 TraceCheckUtils]: 145: Hoare triple {19458#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19480#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:57,760 INFO L290 TraceCheckUtils]: 146: Hoare triple {19480#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} assume !false; {19480#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:57,760 INFO L272 TraceCheckUtils]: 147: Hoare triple {19480#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,760 INFO L290 TraceCheckUtils]: 148: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,760 INFO L290 TraceCheckUtils]: 149: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,760 INFO L290 TraceCheckUtils]: 150: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,760 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {19020#true} {19480#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} #50#return; {19480#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:57:57,761 INFO L290 TraceCheckUtils]: 152: Hoare triple {19480#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19502#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-08 10:57:57,761 INFO L290 TraceCheckUtils]: 153: Hoare triple {19502#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} assume !false; {19502#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-08 10:57:57,761 INFO L272 TraceCheckUtils]: 154: Hoare triple {19502#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,761 INFO L290 TraceCheckUtils]: 155: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,761 INFO L290 TraceCheckUtils]: 156: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,762 INFO L290 TraceCheckUtils]: 157: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,762 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {19020#true} {19502#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} #50#return; {19502#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-08 10:57:57,762 INFO L290 TraceCheckUtils]: 159: Hoare triple {19502#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19524#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-08 10:57:57,763 INFO L290 TraceCheckUtils]: 160: Hoare triple {19524#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} assume !false; {19524#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-08 10:57:57,763 INFO L272 TraceCheckUtils]: 161: Hoare triple {19524#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,763 INFO L290 TraceCheckUtils]: 162: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,763 INFO L290 TraceCheckUtils]: 163: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,763 INFO L290 TraceCheckUtils]: 164: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,764 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {19020#true} {19524#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} #50#return; {19524#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-08 10:57:57,764 INFO L290 TraceCheckUtils]: 166: Hoare triple {19524#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19546#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 10:57:57,765 INFO L290 TraceCheckUtils]: 167: Hoare triple {19546#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {19546#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 10:57:57,765 INFO L272 TraceCheckUtils]: 168: Hoare triple {19546#(and (= 23 main_~y~0) (= 23 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,765 INFO L290 TraceCheckUtils]: 169: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,765 INFO L290 TraceCheckUtils]: 170: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,765 INFO L290 TraceCheckUtils]: 171: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,765 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {19020#true} {19546#(and (= 23 main_~y~0) (= 23 main_~c~0))} #50#return; {19546#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 10:57:57,766 INFO L290 TraceCheckUtils]: 173: Hoare triple {19546#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19568#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-08 10:57:57,766 INFO L290 TraceCheckUtils]: 174: Hoare triple {19568#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} assume !false; {19568#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-08 10:57:57,766 INFO L272 TraceCheckUtils]: 175: Hoare triple {19568#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,766 INFO L290 TraceCheckUtils]: 176: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,766 INFO L290 TraceCheckUtils]: 177: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,767 INFO L290 TraceCheckUtils]: 178: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,767 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {19020#true} {19568#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} #50#return; {19568#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-08 10:57:57,767 INFO L290 TraceCheckUtils]: 180: Hoare triple {19568#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19590#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} is VALID [2022-04-08 10:57:57,768 INFO L290 TraceCheckUtils]: 181: Hoare triple {19590#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} assume !false; {19590#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} is VALID [2022-04-08 10:57:57,768 INFO L272 TraceCheckUtils]: 182: Hoare triple {19590#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 10:57:57,768 INFO L290 TraceCheckUtils]: 183: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 10:57:57,768 INFO L290 TraceCheckUtils]: 184: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 10:57:57,768 INFO L290 TraceCheckUtils]: 185: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 10:57:57,769 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {19020#true} {19590#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} #50#return; {19590#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} is VALID [2022-04-08 10:57:57,771 INFO L290 TraceCheckUtils]: 187: Hoare triple {19590#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} assume !(~c~0 < ~k~0); {19612#(and (<= main_~k~0 25) (< 24 main_~k~0) (= main_~y~0 25))} is VALID [2022-04-08 10:57:57,772 INFO L272 TraceCheckUtils]: 188: Hoare triple {19612#(and (<= main_~k~0 25) (< 24 main_~k~0) (= main_~y~0 25))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19616#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:57:57,772 INFO L290 TraceCheckUtils]: 189: Hoare triple {19616#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19620#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:57:57,772 INFO L290 TraceCheckUtils]: 190: Hoare triple {19620#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19021#false} is VALID [2022-04-08 10:57:57,772 INFO L290 TraceCheckUtils]: 191: Hoare triple {19021#false} assume !false; {19021#false} is VALID [2022-04-08 10:57:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 52 proven. 975 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2022-04-08 10:57:57,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:57:58,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:57:58,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424006277] [2022-04-08 10:57:58,195 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:57:58,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5728423] [2022-04-08 10:57:58,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5728423] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:57:58,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:57:58,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2022-04-08 10:57:58,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:57:58,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1899887730] [2022-04-08 10:57:58,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1899887730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:57:58,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:57:58,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-08 10:57:58,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558843651] [2022-04-08 10:57:58,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:57:58,196 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 28 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Word has length 192 [2022-04-08 10:57:58,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:57:58,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 28 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-08 10:57:58,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:57:58,329 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-08 10:57:58,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:57:58,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-08 10:57:58,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:57:58,330 INFO L87 Difference]: Start difference. First operand 97 states and 121 transitions. Second operand has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 28 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-08 10:58:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:58:07,608 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2022-04-08 10:58:07,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 10:58:07,608 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 28 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Word has length 192 [2022-04-08 10:58:07,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:58:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 28 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-08 10:58:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2022-04-08 10:58:07,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 28 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-08 10:58:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2022-04-08 10:58:07,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 126 transitions. [2022-04-08 10:58:07,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:58:07,992 INFO L225 Difference]: With dead ends: 105 [2022-04-08 10:58:07,992 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 10:58:07,992 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=1154, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:58:07,993 INFO L913 BasicCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:58:07,993 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1188 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-08 10:58:07,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 10:58:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-08 10:58:08,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:58:08,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 30 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 10:58:08,075 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 30 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 10:58:08,075 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 30 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 10:58:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:58:08,077 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2022-04-08 10:58:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2022-04-08 10:58:08,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:58:08,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:58:08,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 30 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 100 states. [2022-04-08 10:58:08,077 INFO L87 Difference]: Start difference. First operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 30 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 100 states. [2022-04-08 10:58:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:58:08,079 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2022-04-08 10:58:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2022-04-08 10:58:08,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:58:08,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:58:08,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:58:08,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:58:08,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 30 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 10:58:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2022-04-08 10:58:08,082 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 192 [2022-04-08 10:58:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:58:08,082 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2022-04-08 10:58:08,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 28 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-08 10:58:08,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 125 transitions. [2022-04-08 10:58:08,897 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-08 10:58:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2022-04-08 10:58:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-04-08 10:58:08,898 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:58:08,898 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:58:08,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-08 10:58:09,098 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-08 10:58:09,098 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:58:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:58:09,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1051836910, now seen corresponding path program 51 times [2022-04-08 10:58:09,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:58:09,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [653035542] [2022-04-08 10:58:09,183 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:58:09,183 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:58:09,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1051836910, now seen corresponding path program 52 times [2022-04-08 10:58:09,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:58:09,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400289597] [2022-04-08 10:58:09,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:58:09,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:58:09,199 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:58:09,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41527497] [2022-04-08 10:58:09,200 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:58:09,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:58:09,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:58:09,200 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:58:09,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-08 10:58:13,718 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:58:13,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:58:13,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-08 10:58:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:58:13,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:58:14,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {20282#true} call ULTIMATE.init(); {20282#true} is VALID [2022-04-08 10:58:14,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {20282#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(9, 2);call #Ultimate.allocInit(12, 3); {20282#true} is VALID [2022-04-08 10:58:14,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20282#true} {20282#true} #56#return; {20282#true} is VALID [2022-04-08 10:58:14,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {20282#true} call #t~ret5 := main(); {20282#true} is VALID [2022-04-08 10:58:14,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {20282#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {20302#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:58:14,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {20302#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {20302#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:58:14,808 INFO L272 TraceCheckUtils]: 7: Hoare triple {20302#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,808 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {20282#true} {20302#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {20302#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:58:14,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {20302#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20324#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:58:14,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {20324#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {20324#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:58:14,809 INFO L272 TraceCheckUtils]: 14: Hoare triple {20324#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,810 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20282#true} {20324#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {20324#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:58:14,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {20324#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20346#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:58:14,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {20346#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {20346#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:58:14,811 INFO L272 TraceCheckUtils]: 21: Hoare triple {20346#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,811 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20282#true} {20346#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #50#return; {20346#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:58:14,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {20346#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20368#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 10:58:14,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {20368#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {20368#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 10:58:14,812 INFO L272 TraceCheckUtils]: 28: Hoare triple {20368#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,813 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20282#true} {20368#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #50#return; {20368#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 10:58:14,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {20368#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20390#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 10:58:14,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {20390#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !false; {20390#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 10:58:14,814 INFO L272 TraceCheckUtils]: 35: Hoare triple {20390#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,814 INFO L290 TraceCheckUtils]: 38: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,814 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20282#true} {20390#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #50#return; {20390#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 10:58:14,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {20390#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20412#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 10:58:14,815 INFO L290 TraceCheckUtils]: 41: Hoare triple {20412#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} assume !false; {20412#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 10:58:14,815 INFO L272 TraceCheckUtils]: 42: Hoare triple {20412#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,815 INFO L290 TraceCheckUtils]: 43: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,815 INFO L290 TraceCheckUtils]: 44: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,815 INFO L290 TraceCheckUtils]: 45: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,816 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {20282#true} {20412#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} #50#return; {20412#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 10:58:14,816 INFO L290 TraceCheckUtils]: 47: Hoare triple {20412#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20434#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 10:58:14,816 INFO L290 TraceCheckUtils]: 48: Hoare triple {20434#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {20434#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 10:58:14,816 INFO L272 TraceCheckUtils]: 49: Hoare triple {20434#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,816 INFO L290 TraceCheckUtils]: 50: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,816 INFO L290 TraceCheckUtils]: 51: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,817 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {20282#true} {20434#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #50#return; {20434#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 10:58:14,817 INFO L290 TraceCheckUtils]: 54: Hoare triple {20434#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20456#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:58:14,818 INFO L290 TraceCheckUtils]: 55: Hoare triple {20456#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {20456#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:58:14,818 INFO L272 TraceCheckUtils]: 56: Hoare triple {20456#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,818 INFO L290 TraceCheckUtils]: 57: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,818 INFO L290 TraceCheckUtils]: 58: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,818 INFO L290 TraceCheckUtils]: 59: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,818 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20282#true} {20456#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #50#return; {20456#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:58:14,819 INFO L290 TraceCheckUtils]: 61: Hoare triple {20456#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20478#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 10:58:14,819 INFO L290 TraceCheckUtils]: 62: Hoare triple {20478#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {20478#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 10:58:14,819 INFO L272 TraceCheckUtils]: 63: Hoare triple {20478#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,819 INFO L290 TraceCheckUtils]: 64: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,819 INFO L290 TraceCheckUtils]: 65: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,819 INFO L290 TraceCheckUtils]: 66: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,820 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {20282#true} {20478#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #50#return; {20478#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 10:58:14,820 INFO L290 TraceCheckUtils]: 68: Hoare triple {20478#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20500#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-08 10:58:14,820 INFO L290 TraceCheckUtils]: 69: Hoare triple {20500#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !false; {20500#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-08 10:58:14,821 INFO L272 TraceCheckUtils]: 70: Hoare triple {20500#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,821 INFO L290 TraceCheckUtils]: 71: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,821 INFO L290 TraceCheckUtils]: 72: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,821 INFO L290 TraceCheckUtils]: 73: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,821 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20282#true} {20500#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} #50#return; {20500#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-08 10:58:14,822 INFO L290 TraceCheckUtils]: 75: Hoare triple {20500#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20522#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 10:58:14,822 INFO L290 TraceCheckUtils]: 76: Hoare triple {20522#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {20522#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 10:58:14,822 INFO L272 TraceCheckUtils]: 77: Hoare triple {20522#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,822 INFO L290 TraceCheckUtils]: 78: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,822 INFO L290 TraceCheckUtils]: 79: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,822 INFO L290 TraceCheckUtils]: 80: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,823 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20282#true} {20522#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #50#return; {20522#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 10:58:14,823 INFO L290 TraceCheckUtils]: 82: Hoare triple {20522#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20544#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:58:14,823 INFO L290 TraceCheckUtils]: 83: Hoare triple {20544#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {20544#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:58:14,823 INFO L272 TraceCheckUtils]: 84: Hoare triple {20544#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,823 INFO L290 TraceCheckUtils]: 85: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,824 INFO L290 TraceCheckUtils]: 86: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,824 INFO L290 TraceCheckUtils]: 87: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,824 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {20282#true} {20544#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {20544#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:58:14,824 INFO L290 TraceCheckUtils]: 89: Hoare triple {20544#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20566#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:58:14,825 INFO L290 TraceCheckUtils]: 90: Hoare triple {20566#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !false; {20566#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:58:14,825 INFO L272 TraceCheckUtils]: 91: Hoare triple {20566#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,825 INFO L290 TraceCheckUtils]: 92: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,825 INFO L290 TraceCheckUtils]: 93: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,825 INFO L290 TraceCheckUtils]: 94: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,825 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {20282#true} {20566#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #50#return; {20566#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:58:14,826 INFO L290 TraceCheckUtils]: 96: Hoare triple {20566#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20588#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 10:58:14,826 INFO L290 TraceCheckUtils]: 97: Hoare triple {20588#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !false; {20588#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 10:58:14,826 INFO L272 TraceCheckUtils]: 98: Hoare triple {20588#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,826 INFO L290 TraceCheckUtils]: 99: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,826 INFO L290 TraceCheckUtils]: 100: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,826 INFO L290 TraceCheckUtils]: 101: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,827 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {20282#true} {20588#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} #50#return; {20588#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 10:58:14,827 INFO L290 TraceCheckUtils]: 103: Hoare triple {20588#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20610#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 10:58:14,828 INFO L290 TraceCheckUtils]: 104: Hoare triple {20610#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {20610#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 10:58:14,828 INFO L272 TraceCheckUtils]: 105: Hoare triple {20610#(and (= main_~y~0 14) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,828 INFO L290 TraceCheckUtils]: 106: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,828 INFO L290 TraceCheckUtils]: 107: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,828 INFO L290 TraceCheckUtils]: 108: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,828 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {20282#true} {20610#(and (= main_~y~0 14) (= main_~c~0 14))} #50#return; {20610#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 10:58:14,829 INFO L290 TraceCheckUtils]: 110: Hoare triple {20610#(and (= main_~y~0 14) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20632#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 10:58:14,829 INFO L290 TraceCheckUtils]: 111: Hoare triple {20632#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {20632#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 10:58:14,829 INFO L272 TraceCheckUtils]: 112: Hoare triple {20632#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,829 INFO L290 TraceCheckUtils]: 113: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,829 INFO L290 TraceCheckUtils]: 114: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,829 INFO L290 TraceCheckUtils]: 115: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,830 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {20282#true} {20632#(and (= main_~c~0 15) (= main_~y~0 15))} #50#return; {20632#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 10:58:14,830 INFO L290 TraceCheckUtils]: 117: Hoare triple {20632#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20654#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 10:58:14,830 INFO L290 TraceCheckUtils]: 118: Hoare triple {20654#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !false; {20654#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 10:58:14,830 INFO L272 TraceCheckUtils]: 119: Hoare triple {20654#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,830 INFO L290 TraceCheckUtils]: 120: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,831 INFO L290 TraceCheckUtils]: 121: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,831 INFO L290 TraceCheckUtils]: 122: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,831 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {20282#true} {20654#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} #50#return; {20654#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 10:58:14,831 INFO L290 TraceCheckUtils]: 124: Hoare triple {20654#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20676#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 10:58:14,832 INFO L290 TraceCheckUtils]: 125: Hoare triple {20676#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {20676#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 10:58:14,832 INFO L272 TraceCheckUtils]: 126: Hoare triple {20676#(and (= main_~c~0 17) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,832 INFO L290 TraceCheckUtils]: 127: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,832 INFO L290 TraceCheckUtils]: 128: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,832 INFO L290 TraceCheckUtils]: 129: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,832 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {20282#true} {20676#(and (= main_~c~0 17) (= main_~y~0 17))} #50#return; {20676#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 10:58:14,833 INFO L290 TraceCheckUtils]: 131: Hoare triple {20676#(and (= main_~c~0 17) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20698#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 10:58:14,833 INFO L290 TraceCheckUtils]: 132: Hoare triple {20698#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !false; {20698#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 10:58:14,833 INFO L272 TraceCheckUtils]: 133: Hoare triple {20698#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,833 INFO L290 TraceCheckUtils]: 134: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,833 INFO L290 TraceCheckUtils]: 135: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,833 INFO L290 TraceCheckUtils]: 136: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,834 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {20282#true} {20698#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} #50#return; {20698#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 10:58:14,834 INFO L290 TraceCheckUtils]: 138: Hoare triple {20698#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20720#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 10:58:14,835 INFO L290 TraceCheckUtils]: 139: Hoare triple {20720#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !false; {20720#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 10:58:14,835 INFO L272 TraceCheckUtils]: 140: Hoare triple {20720#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,835 INFO L290 TraceCheckUtils]: 141: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,835 INFO L290 TraceCheckUtils]: 142: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,835 INFO L290 TraceCheckUtils]: 143: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,835 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {20282#true} {20720#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} #50#return; {20720#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 10:58:14,836 INFO L290 TraceCheckUtils]: 145: Hoare triple {20720#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20742#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-08 10:58:14,836 INFO L290 TraceCheckUtils]: 146: Hoare triple {20742#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} assume !false; {20742#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-08 10:58:14,836 INFO L272 TraceCheckUtils]: 147: Hoare triple {20742#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,836 INFO L290 TraceCheckUtils]: 148: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,836 INFO L290 TraceCheckUtils]: 149: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,836 INFO L290 TraceCheckUtils]: 150: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,837 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {20282#true} {20742#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} #50#return; {20742#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-08 10:58:14,837 INFO L290 TraceCheckUtils]: 152: Hoare triple {20742#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20764#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:58:14,837 INFO L290 TraceCheckUtils]: 153: Hoare triple {20764#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} assume !false; {20764#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:58:14,837 INFO L272 TraceCheckUtils]: 154: Hoare triple {20764#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,837 INFO L290 TraceCheckUtils]: 155: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,837 INFO L290 TraceCheckUtils]: 156: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,837 INFO L290 TraceCheckUtils]: 157: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,838 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {20282#true} {20764#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} #50#return; {20764#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:58:14,838 INFO L290 TraceCheckUtils]: 159: Hoare triple {20764#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20786#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 10:58:14,838 INFO L290 TraceCheckUtils]: 160: Hoare triple {20786#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} assume !false; {20786#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 10:58:14,838 INFO L272 TraceCheckUtils]: 161: Hoare triple {20786#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,839 INFO L290 TraceCheckUtils]: 162: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,839 INFO L290 TraceCheckUtils]: 163: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,839 INFO L290 TraceCheckUtils]: 164: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,839 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {20282#true} {20786#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} #50#return; {20786#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 10:58:14,839 INFO L290 TraceCheckUtils]: 166: Hoare triple {20786#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20808#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} is VALID [2022-04-08 10:58:14,840 INFO L290 TraceCheckUtils]: 167: Hoare triple {20808#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} assume !false; {20808#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} is VALID [2022-04-08 10:58:14,840 INFO L272 TraceCheckUtils]: 168: Hoare triple {20808#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,840 INFO L290 TraceCheckUtils]: 169: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,840 INFO L290 TraceCheckUtils]: 170: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,840 INFO L290 TraceCheckUtils]: 171: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,840 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {20282#true} {20808#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} #50#return; {20808#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} is VALID [2022-04-08 10:58:14,841 INFO L290 TraceCheckUtils]: 173: Hoare triple {20808#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20830#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} is VALID [2022-04-08 10:58:14,841 INFO L290 TraceCheckUtils]: 174: Hoare triple {20830#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} assume !false; {20830#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} is VALID [2022-04-08 10:58:14,841 INFO L272 TraceCheckUtils]: 175: Hoare triple {20830#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,841 INFO L290 TraceCheckUtils]: 176: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,841 INFO L290 TraceCheckUtils]: 177: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,841 INFO L290 TraceCheckUtils]: 178: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,841 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {20282#true} {20830#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} #50#return; {20830#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} is VALID [2022-04-08 10:58:14,842 INFO L290 TraceCheckUtils]: 180: Hoare triple {20830#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20852#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 10:58:14,842 INFO L290 TraceCheckUtils]: 181: Hoare triple {20852#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} assume !false; {20852#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 10:58:14,842 INFO L272 TraceCheckUtils]: 182: Hoare triple {20852#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,842 INFO L290 TraceCheckUtils]: 183: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,842 INFO L290 TraceCheckUtils]: 184: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,842 INFO L290 TraceCheckUtils]: 185: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,843 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {20282#true} {20852#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} #50#return; {20852#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 10:58:14,843 INFO L290 TraceCheckUtils]: 187: Hoare triple {20852#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20874#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-08 10:58:14,843 INFO L290 TraceCheckUtils]: 188: Hoare triple {20874#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} assume !false; {20874#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-08 10:58:14,843 INFO L272 TraceCheckUtils]: 189: Hoare triple {20874#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 10:58:14,843 INFO L290 TraceCheckUtils]: 190: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 10:58:14,843 INFO L290 TraceCheckUtils]: 191: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 10:58:14,843 INFO L290 TraceCheckUtils]: 192: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 10:58:14,844 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {20282#true} {20874#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} #50#return; {20874#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-08 10:58:14,845 INFO L290 TraceCheckUtils]: 194: Hoare triple {20874#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} assume !(~c~0 < ~k~0); {20896#(and (<= main_~k~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-08 10:58:14,845 INFO L272 TraceCheckUtils]: 195: Hoare triple {20896#(and (<= main_~k~0 26) (< 25 main_~k~0) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:58:14,846 INFO L290 TraceCheckUtils]: 196: Hoare triple {20900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:58:14,846 INFO L290 TraceCheckUtils]: 197: Hoare triple {20904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20283#false} is VALID [2022-04-08 10:58:14,846 INFO L290 TraceCheckUtils]: 198: Hoare triple {20283#false} assume !false; {20283#false} is VALID [2022-04-08 10:58:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2511 backedges. 54 proven. 1053 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-04-08 10:58:14,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:58:15,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:58:15,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400289597] [2022-04-08 10:58:15,147 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:58:15,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41527497] [2022-04-08 10:58:15,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41527497] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:58:15,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:58:15,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2022-04-08 10:58:15,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:58:15,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [653035542] [2022-04-08 10:58:15,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [653035542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:58:15,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:58:15,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-08 10:58:15,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863265124] [2022-04-08 10:58:15,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:58:15,148 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 29 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Word has length 199 [2022-04-08 10:58:15,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:58:15,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 29 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 10:58:15,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:58:15,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-08 10:58:15,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:58:15,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-08 10:58:15,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 10:58:15,460 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 29 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 10:58:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:58:24,315 INFO L93 Difference]: Finished difference Result 108 states and 134 transitions. [2022-04-08 10:58:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 10:58:24,315 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 29 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Word has length 199 [2022-04-08 10:58:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:58:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 29 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 10:58:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 130 transitions. [2022-04-08 10:58:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 29 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 10:58:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 130 transitions. [2022-04-08 10:58:24,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 130 transitions. [2022-04-08 10:58:24,543 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-08 10:58:24,545 INFO L225 Difference]: With dead ends: 108 [2022-04-08 10:58:24,545 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 10:58:24,545 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=1223, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:58:24,546 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:58:24,546 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1259 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-08 10:58:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 10:58:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-08 10:58:24,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:58:24,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 31 states have call successors, (31), 5 states have call predecessors, (31), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 10:58:24,631 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 31 states have call successors, (31), 5 states have call predecessors, (31), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 10:58:24,631 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 31 states have call successors, (31), 5 states have call predecessors, (31), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 10:58:24,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:58:24,633 INFO L93 Difference]: Finished difference Result 103 states and 129 transitions. [2022-04-08 10:58:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2022-04-08 10:58:24,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:58:24,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:58:24,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 31 states have call successors, (31), 5 states have call predecessors, (31), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 103 states. [2022-04-08 10:58:24,633 INFO L87 Difference]: Start difference. First operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 31 states have call successors, (31), 5 states have call predecessors, (31), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 103 states. [2022-04-08 10:58:24,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:58:24,635 INFO L93 Difference]: Finished difference Result 103 states and 129 transitions. [2022-04-08 10:58:24,635 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2022-04-08 10:58:24,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:58:24,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:58:24,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:58:24,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:58:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 31 states have call successors, (31), 5 states have call predecessors, (31), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 10:58:24,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2022-04-08 10:58:24,637 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 199 [2022-04-08 10:58:24,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:58:24,637 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2022-04-08 10:58:24,638 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 29 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 10:58:24,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 129 transitions. [2022-04-08 10:58:25,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:58:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2022-04-08 10:58:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-04-08 10:58:25,374 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:58:25,374 INFO L499 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:58:25,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-08 10:58:25,574 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-08 10:58:25,575 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:58:25,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:58:25,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1346993349, now seen corresponding path program 53 times [2022-04-08 10:58:25,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:58:25,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1068429186] [2022-04-08 10:58:25,642 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:58:25,643 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:58:25,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1346993349, now seen corresponding path program 54 times [2022-04-08 10:58:25,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:58:25,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191898154] [2022-04-08 10:58:25,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:58:25,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:58:25,656 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:58:25,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1117697717] [2022-04-08 10:58:25,656 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:58:25,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:58:25,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:58:25,658 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:58:25,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-08 10:58:34,965 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-08 10:58:34,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:58:34,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 116 conjunts are in the unsatisfiable core [2022-04-08 10:58:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:58:35,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:58:36,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {21584#true} call ULTIMATE.init(); {21584#true} is VALID [2022-04-08 10:58:36,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {21584#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(9, 2);call #Ultimate.allocInit(12, 3); {21584#true} is VALID [2022-04-08 10:58:36,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21584#true} {21584#true} #56#return; {21584#true} is VALID [2022-04-08 10:58:36,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {21584#true} call #t~ret5 := main(); {21584#true} is VALID [2022-04-08 10:58:36,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {21584#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {21604#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:58:36,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {21604#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {21604#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:58:36,165 INFO L272 TraceCheckUtils]: 7: Hoare triple {21604#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,166 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {21584#true} {21604#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {21604#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:58:36,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {21604#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21626#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:58:36,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {21626#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {21626#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:58:36,166 INFO L272 TraceCheckUtils]: 14: Hoare triple {21626#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,167 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {21584#true} {21626#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {21626#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:58:36,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {21626#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21648#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:58:36,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {21648#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {21648#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:58:36,168 INFO L272 TraceCheckUtils]: 21: Hoare triple {21648#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,168 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {21584#true} {21648#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #50#return; {21648#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:58:36,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {21648#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21670#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 10:58:36,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {21670#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {21670#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 10:58:36,169 INFO L272 TraceCheckUtils]: 28: Hoare triple {21670#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,170 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21584#true} {21670#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #50#return; {21670#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 10:58:36,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {21670#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21692#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 10:58:36,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {21692#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !false; {21692#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 10:58:36,171 INFO L272 TraceCheckUtils]: 35: Hoare triple {21692#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,171 INFO L290 TraceCheckUtils]: 37: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,171 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21584#true} {21692#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #50#return; {21692#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 10:58:36,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {21692#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21714#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 10:58:36,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {21714#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} assume !false; {21714#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 10:58:36,172 INFO L272 TraceCheckUtils]: 42: Hoare triple {21714#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,173 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21584#true} {21714#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} #50#return; {21714#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 10:58:36,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {21714#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21736#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-08 10:58:36,173 INFO L290 TraceCheckUtils]: 48: Hoare triple {21736#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} assume !false; {21736#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-08 10:58:36,174 INFO L272 TraceCheckUtils]: 49: Hoare triple {21736#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,174 INFO L290 TraceCheckUtils]: 50: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,174 INFO L290 TraceCheckUtils]: 51: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,174 INFO L290 TraceCheckUtils]: 52: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,174 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {21584#true} {21736#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} #50#return; {21736#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-08 10:58:36,175 INFO L290 TraceCheckUtils]: 54: Hoare triple {21736#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21758#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-08 10:58:36,175 INFO L290 TraceCheckUtils]: 55: Hoare triple {21758#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 6)) 1))} assume !false; {21758#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-08 10:58:36,175 INFO L272 TraceCheckUtils]: 56: Hoare triple {21758#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,175 INFO L290 TraceCheckUtils]: 57: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,175 INFO L290 TraceCheckUtils]: 58: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,175 INFO L290 TraceCheckUtils]: 59: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,176 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {21584#true} {21758#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 6)) 1))} #50#return; {21758#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-08 10:58:36,176 INFO L290 TraceCheckUtils]: 61: Hoare triple {21758#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 6)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21780#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:58:36,176 INFO L290 TraceCheckUtils]: 62: Hoare triple {21780#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {21780#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:58:36,176 INFO L272 TraceCheckUtils]: 63: Hoare triple {21780#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,177 INFO L290 TraceCheckUtils]: 64: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,177 INFO L290 TraceCheckUtils]: 65: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,177 INFO L290 TraceCheckUtils]: 66: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,177 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {21584#true} {21780#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #50#return; {21780#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:58:36,177 INFO L290 TraceCheckUtils]: 68: Hoare triple {21780#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21802#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 10:58:36,178 INFO L290 TraceCheckUtils]: 69: Hoare triple {21802#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {21802#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 10:58:36,178 INFO L272 TraceCheckUtils]: 70: Hoare triple {21802#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,178 INFO L290 TraceCheckUtils]: 71: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,178 INFO L290 TraceCheckUtils]: 72: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,178 INFO L290 TraceCheckUtils]: 73: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,178 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {21584#true} {21802#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #50#return; {21802#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 10:58:36,179 INFO L290 TraceCheckUtils]: 75: Hoare triple {21802#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21824#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:58:36,179 INFO L290 TraceCheckUtils]: 76: Hoare triple {21824#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {21824#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:58:36,179 INFO L272 TraceCheckUtils]: 77: Hoare triple {21824#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,179 INFO L290 TraceCheckUtils]: 78: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,179 INFO L290 TraceCheckUtils]: 79: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,180 INFO L290 TraceCheckUtils]: 80: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,180 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {21584#true} {21824#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {21824#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 10:58:36,180 INFO L290 TraceCheckUtils]: 82: Hoare triple {21824#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21846#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 10:58:36,181 INFO L290 TraceCheckUtils]: 83: Hoare triple {21846#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {21846#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 10:58:36,181 INFO L272 TraceCheckUtils]: 84: Hoare triple {21846#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,181 INFO L290 TraceCheckUtils]: 85: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,181 INFO L290 TraceCheckUtils]: 86: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,181 INFO L290 TraceCheckUtils]: 87: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,181 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {21584#true} {21846#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {21846#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 10:58:36,182 INFO L290 TraceCheckUtils]: 89: Hoare triple {21846#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21868#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:58:36,182 INFO L290 TraceCheckUtils]: 90: Hoare triple {21868#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} assume !false; {21868#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:58:36,182 INFO L272 TraceCheckUtils]: 91: Hoare triple {21868#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,182 INFO L290 TraceCheckUtils]: 92: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,182 INFO L290 TraceCheckUtils]: 93: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,182 INFO L290 TraceCheckUtils]: 94: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,183 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {21584#true} {21868#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} #50#return; {21868#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:58:36,183 INFO L290 TraceCheckUtils]: 96: Hoare triple {21868#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21890#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:58:36,184 INFO L290 TraceCheckUtils]: 97: Hoare triple {21890#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} assume !false; {21890#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:58:36,184 INFO L272 TraceCheckUtils]: 98: Hoare triple {21890#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,184 INFO L290 TraceCheckUtils]: 99: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,184 INFO L290 TraceCheckUtils]: 100: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,184 INFO L290 TraceCheckUtils]: 101: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,184 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {21584#true} {21890#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} #50#return; {21890#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:58:36,185 INFO L290 TraceCheckUtils]: 103: Hoare triple {21890#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21912#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 10:58:36,185 INFO L290 TraceCheckUtils]: 104: Hoare triple {21912#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} assume !false; {21912#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 10:58:36,185 INFO L272 TraceCheckUtils]: 105: Hoare triple {21912#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,185 INFO L290 TraceCheckUtils]: 106: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,185 INFO L290 TraceCheckUtils]: 107: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,185 INFO L290 TraceCheckUtils]: 108: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,186 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {21584#true} {21912#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} #50#return; {21912#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 10:58:36,186 INFO L290 TraceCheckUtils]: 110: Hoare triple {21912#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21934#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 10:58:36,186 INFO L290 TraceCheckUtils]: 111: Hoare triple {21934#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} assume !false; {21934#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 10:58:36,187 INFO L272 TraceCheckUtils]: 112: Hoare triple {21934#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,187 INFO L290 TraceCheckUtils]: 113: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,187 INFO L290 TraceCheckUtils]: 114: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,187 INFO L290 TraceCheckUtils]: 115: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,187 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {21584#true} {21934#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} #50#return; {21934#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 10:58:36,188 INFO L290 TraceCheckUtils]: 117: Hoare triple {21934#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21956#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 10:58:36,188 INFO L290 TraceCheckUtils]: 118: Hoare triple {21956#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {21956#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 10:58:36,188 INFO L272 TraceCheckUtils]: 119: Hoare triple {21956#(and (= main_~c~0 16) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,188 INFO L290 TraceCheckUtils]: 120: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,188 INFO L290 TraceCheckUtils]: 121: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,188 INFO L290 TraceCheckUtils]: 122: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,189 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {21584#true} {21956#(and (= main_~c~0 16) (= main_~y~0 16))} #50#return; {21956#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 10:58:36,189 INFO L290 TraceCheckUtils]: 124: Hoare triple {21956#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21978#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 10:58:36,189 INFO L290 TraceCheckUtils]: 125: Hoare triple {21978#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {21978#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 10:58:36,189 INFO L272 TraceCheckUtils]: 126: Hoare triple {21978#(and (= main_~c~0 17) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,189 INFO L290 TraceCheckUtils]: 127: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,190 INFO L290 TraceCheckUtils]: 128: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,190 INFO L290 TraceCheckUtils]: 129: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,190 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {21584#true} {21978#(and (= main_~c~0 17) (= main_~y~0 17))} #50#return; {21978#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 10:58:36,190 INFO L290 TraceCheckUtils]: 131: Hoare triple {21978#(and (= main_~c~0 17) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22000#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 10:58:36,191 INFO L290 TraceCheckUtils]: 132: Hoare triple {22000#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {22000#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 10:58:36,191 INFO L272 TraceCheckUtils]: 133: Hoare triple {22000#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,191 INFO L290 TraceCheckUtils]: 134: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,191 INFO L290 TraceCheckUtils]: 135: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,191 INFO L290 TraceCheckUtils]: 136: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,191 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {21584#true} {22000#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #50#return; {22000#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 10:58:36,192 INFO L290 TraceCheckUtils]: 138: Hoare triple {22000#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22022#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 10:58:36,192 INFO L290 TraceCheckUtils]: 139: Hoare triple {22022#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !false; {22022#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 10:58:36,192 INFO L272 TraceCheckUtils]: 140: Hoare triple {22022#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,192 INFO L290 TraceCheckUtils]: 141: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,192 INFO L290 TraceCheckUtils]: 142: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,193 INFO L290 TraceCheckUtils]: 143: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,193 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {21584#true} {22022#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} #50#return; {22022#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 10:58:36,193 INFO L290 TraceCheckUtils]: 145: Hoare triple {22022#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22044#(and (= (+ main_~y~0 (- 3)) 17) (= main_~c~0 20))} is VALID [2022-04-08 10:58:36,194 INFO L290 TraceCheckUtils]: 146: Hoare triple {22044#(and (= (+ main_~y~0 (- 3)) 17) (= main_~c~0 20))} assume !false; {22044#(and (= (+ main_~y~0 (- 3)) 17) (= main_~c~0 20))} is VALID [2022-04-08 10:58:36,194 INFO L272 TraceCheckUtils]: 147: Hoare triple {22044#(and (= (+ main_~y~0 (- 3)) 17) (= main_~c~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,194 INFO L290 TraceCheckUtils]: 148: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,194 INFO L290 TraceCheckUtils]: 149: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,194 INFO L290 TraceCheckUtils]: 150: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,194 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {21584#true} {22044#(and (= (+ main_~y~0 (- 3)) 17) (= main_~c~0 20))} #50#return; {22044#(and (= (+ main_~y~0 (- 3)) 17) (= main_~c~0 20))} is VALID [2022-04-08 10:58:36,195 INFO L290 TraceCheckUtils]: 152: Hoare triple {22044#(and (= (+ main_~y~0 (- 3)) 17) (= main_~c~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22066#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} is VALID [2022-04-08 10:58:36,195 INFO L290 TraceCheckUtils]: 153: Hoare triple {22066#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} assume !false; {22066#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} is VALID [2022-04-08 10:58:36,195 INFO L272 TraceCheckUtils]: 154: Hoare triple {22066#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,195 INFO L290 TraceCheckUtils]: 155: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,195 INFO L290 TraceCheckUtils]: 156: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,195 INFO L290 TraceCheckUtils]: 157: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,196 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {21584#true} {22066#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} #50#return; {22066#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} is VALID [2022-04-08 10:58:36,196 INFO L290 TraceCheckUtils]: 159: Hoare triple {22066#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22088#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 10:58:36,197 INFO L290 TraceCheckUtils]: 160: Hoare triple {22088#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {22088#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 10:58:36,197 INFO L272 TraceCheckUtils]: 161: Hoare triple {22088#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,197 INFO L290 TraceCheckUtils]: 162: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,197 INFO L290 TraceCheckUtils]: 163: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,197 INFO L290 TraceCheckUtils]: 164: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,197 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {21584#true} {22088#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #50#return; {22088#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 10:58:36,198 INFO L290 TraceCheckUtils]: 166: Hoare triple {22088#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22110#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 10:58:36,198 INFO L290 TraceCheckUtils]: 167: Hoare triple {22110#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {22110#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 10:58:36,198 INFO L272 TraceCheckUtils]: 168: Hoare triple {22110#(and (= 23 main_~y~0) (= 23 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,198 INFO L290 TraceCheckUtils]: 169: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,198 INFO L290 TraceCheckUtils]: 170: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,198 INFO L290 TraceCheckUtils]: 171: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,199 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {21584#true} {22110#(and (= 23 main_~y~0) (= 23 main_~c~0))} #50#return; {22110#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 10:58:36,199 INFO L290 TraceCheckUtils]: 173: Hoare triple {22110#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22132#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 10:58:36,200 INFO L290 TraceCheckUtils]: 174: Hoare triple {22132#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {22132#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 10:58:36,200 INFO L272 TraceCheckUtils]: 175: Hoare triple {22132#(and (= main_~c~0 24) (= main_~y~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,200 INFO L290 TraceCheckUtils]: 176: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,200 INFO L290 TraceCheckUtils]: 177: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,200 INFO L290 TraceCheckUtils]: 178: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,200 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {21584#true} {22132#(and (= main_~c~0 24) (= main_~y~0 24))} #50#return; {22132#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 10:58:36,201 INFO L290 TraceCheckUtils]: 180: Hoare triple {22132#(and (= main_~c~0 24) (= main_~y~0 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22154#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 10:58:36,201 INFO L290 TraceCheckUtils]: 181: Hoare triple {22154#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} assume !false; {22154#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 10:58:36,201 INFO L272 TraceCheckUtils]: 182: Hoare triple {22154#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,201 INFO L290 TraceCheckUtils]: 183: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,201 INFO L290 TraceCheckUtils]: 184: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,202 INFO L290 TraceCheckUtils]: 185: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,202 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {21584#true} {22154#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} #50#return; {22154#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 10:58:36,202 INFO L290 TraceCheckUtils]: 187: Hoare triple {22154#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22176#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 10:58:36,203 INFO L290 TraceCheckUtils]: 188: Hoare triple {22176#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} assume !false; {22176#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 10:58:36,203 INFO L272 TraceCheckUtils]: 189: Hoare triple {22176#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,203 INFO L290 TraceCheckUtils]: 190: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,203 INFO L290 TraceCheckUtils]: 191: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,203 INFO L290 TraceCheckUtils]: 192: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,204 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {21584#true} {22176#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} #50#return; {22176#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 10:58:36,204 INFO L290 TraceCheckUtils]: 194: Hoare triple {22176#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22198#(and (<= main_~c~0 27) (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-08 10:58:36,204 INFO L290 TraceCheckUtils]: 195: Hoare triple {22198#(and (<= main_~c~0 27) (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25))} assume !false; {22198#(and (<= main_~c~0 27) (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-08 10:58:36,205 INFO L272 TraceCheckUtils]: 196: Hoare triple {22198#(and (<= main_~c~0 27) (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 10:58:36,205 INFO L290 TraceCheckUtils]: 197: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 10:58:36,205 INFO L290 TraceCheckUtils]: 198: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 10:58:36,205 INFO L290 TraceCheckUtils]: 199: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 10:58:36,205 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {21584#true} {22198#(and (<= main_~c~0 27) (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25))} #50#return; {22198#(and (<= main_~c~0 27) (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-08 10:58:36,206 INFO L290 TraceCheckUtils]: 201: Hoare triple {22198#(and (<= main_~c~0 27) (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25))} assume !(~c~0 < ~k~0); {22220#(and (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25) (<= main_~k~0 27))} is VALID [2022-04-08 10:58:36,206 INFO L272 TraceCheckUtils]: 202: Hoare triple {22220#(and (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25) (<= main_~k~0 27))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22224#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:58:36,207 INFO L290 TraceCheckUtils]: 203: Hoare triple {22224#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22228#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:58:36,207 INFO L290 TraceCheckUtils]: 204: Hoare triple {22228#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21585#false} is VALID [2022-04-08 10:58:36,207 INFO L290 TraceCheckUtils]: 205: Hoare triple {21585#false} assume !false; {21585#false} is VALID [2022-04-08 10:58:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2702 backedges. 56 proven. 1134 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2022-04-08 10:58:36,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:58:36,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:58:36,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191898154] [2022-04-08 10:58:36,571 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:58:36,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117697717] [2022-04-08 10:58:36,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117697717] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:58:36,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:58:36,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2022-04-08 10:58:36,571 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:58:36,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1068429186] [2022-04-08 10:58:36,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1068429186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:58:36,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:58:36,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-08 10:58:36,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977175041] [2022-04-08 10:58:36,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:58:36,572 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 30 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Word has length 206 [2022-04-08 10:58:36,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:58:36,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 30 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 10:58:36,872 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-08 10:58:36,872 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-08 10:58:36,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:58:36,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-08 10:58:36,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:58:36,873 INFO L87 Difference]: Start difference. First operand 103 states and 129 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 30 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 10:58:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:58:49,610 INFO L93 Difference]: Finished difference Result 111 states and 138 transitions. [2022-04-08 10:58:49,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 10:58:49,610 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 30 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Word has length 206 [2022-04-08 10:58:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:58:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 30 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 10:58:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 134 transitions. [2022-04-08 10:58:49,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 30 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 10:58:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 134 transitions. [2022-04-08 10:58:49,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 134 transitions. [2022-04-08 10:58:50,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:58:50,087 INFO L225 Difference]: With dead ends: 111 [2022-04-08 10:58:50,088 INFO L226 Difference]: Without dead ends: 106 [2022-04-08 10:58:50,088 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=1294, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:58:50,088 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 2646 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 2646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:58:50,088 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1332 Invalid, 2646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2646 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-04-08 10:58:50,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-08 10:58:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-04-08 10:58:50,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:58:50,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 32 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 10:58:50,175 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 32 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 10:58:50,175 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 32 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 10:58:50,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:58:50,177 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2022-04-08 10:58:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-08 10:58:50,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:58:50,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:58:50,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 32 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 106 states. [2022-04-08 10:58:50,178 INFO L87 Difference]: Start difference. First operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 32 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 106 states. [2022-04-08 10:58:50,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:58:50,180 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2022-04-08 10:58:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-08 10:58:50,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:58:50,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:58:50,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:58:50,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:58:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 32 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 10:58:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2022-04-08 10:58:50,183 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 206 [2022-04-08 10:58:50,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:58:50,183 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2022-04-08 10:58:50,183 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 30 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 10:58:50,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 133 transitions. [2022-04-08 10:58:51,004 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-08 10:58:51,004 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-08 10:58:51,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-04-08 10:58:51,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:58:51,005 INFO L499 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:58:51,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-08 10:58:51,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:58:51,206 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:58:51,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:58:51,206 INFO L85 PathProgramCache]: Analyzing trace with hash 742317746, now seen corresponding path program 55 times [2022-04-08 10:58:51,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:58:51,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [520977424] [2022-04-08 10:58:51,298 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:58:51,298 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:58:51,298 INFO L85 PathProgramCache]: Analyzing trace with hash 742317746, now seen corresponding path program 56 times [2022-04-08 10:58:51,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:58:51,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542603520] [2022-04-08 10:58:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:58:51,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:58:51,341 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:58:51,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [570663902] [2022-04-08 10:58:51,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:58:51,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:58:51,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:58:51,342 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:58:51,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-08 10:58:52,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:58:52,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:58:52,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 120 conjunts are in the unsatisfiable core [2022-04-08 10:58:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:58:52,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:58:53,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {22926#true} call ULTIMATE.init(); {22926#true} is VALID [2022-04-08 10:58:53,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {22926#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(9, 2);call #Ultimate.allocInit(12, 3); {22926#true} is VALID [2022-04-08 10:58:53,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22926#true} {22926#true} #56#return; {22926#true} is VALID [2022-04-08 10:58:53,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {22926#true} call #t~ret5 := main(); {22926#true} is VALID [2022-04-08 10:58:53,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {22926#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {22946#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:58:53,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {22946#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {22946#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:58:53,415 INFO L272 TraceCheckUtils]: 7: Hoare triple {22946#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,416 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {22926#true} {22946#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {22946#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:58:53,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {22946#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:58:53,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {22968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {22968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:58:53,417 INFO L272 TraceCheckUtils]: 14: Hoare triple {22968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,417 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22926#true} {22968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {22968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 10:58:53,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {22968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22990#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:58:53,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {22990#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {22990#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:58:53,418 INFO L272 TraceCheckUtils]: 21: Hoare triple {22990#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,420 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22926#true} {22990#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {22990#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 10:58:53,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {22990#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23012#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 10:58:53,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {23012#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {23012#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 10:58:53,422 INFO L272 TraceCheckUtils]: 28: Hoare triple {23012#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,422 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {22926#true} {23012#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #50#return; {23012#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 10:58:53,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {23012#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23034#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:58:53,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {23034#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {23034#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:58:53,424 INFO L272 TraceCheckUtils]: 35: Hoare triple {23034#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,424 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22926#true} {23034#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #50#return; {23034#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:58:53,425 INFO L290 TraceCheckUtils]: 40: Hoare triple {23034#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23056#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-08 10:58:53,425 INFO L290 TraceCheckUtils]: 41: Hoare triple {23056#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !false; {23056#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-08 10:58:53,425 INFO L272 TraceCheckUtils]: 42: Hoare triple {23056#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,425 INFO L290 TraceCheckUtils]: 43: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,426 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22926#true} {23056#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} #50#return; {23056#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-08 10:58:53,426 INFO L290 TraceCheckUtils]: 47: Hoare triple {23056#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23078#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:58:53,426 INFO L290 TraceCheckUtils]: 48: Hoare triple {23078#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {23078#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:58:53,427 INFO L272 TraceCheckUtils]: 49: Hoare triple {23078#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,427 INFO L290 TraceCheckUtils]: 50: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,427 INFO L290 TraceCheckUtils]: 51: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,427 INFO L290 TraceCheckUtils]: 52: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,427 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {22926#true} {23078#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {23078#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:58:53,428 INFO L290 TraceCheckUtils]: 54: Hoare triple {23078#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23100#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:58:53,428 INFO L290 TraceCheckUtils]: 55: Hoare triple {23100#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {23100#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:58:53,428 INFO L272 TraceCheckUtils]: 56: Hoare triple {23100#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,428 INFO L290 TraceCheckUtils]: 57: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,428 INFO L290 TraceCheckUtils]: 59: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,429 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {22926#true} {23100#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #50#return; {23100#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:58:53,429 INFO L290 TraceCheckUtils]: 61: Hoare triple {23100#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23122#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 10:58:53,429 INFO L290 TraceCheckUtils]: 62: Hoare triple {23122#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {23122#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 10:58:53,429 INFO L272 TraceCheckUtils]: 63: Hoare triple {23122#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,429 INFO L290 TraceCheckUtils]: 64: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,429 INFO L290 TraceCheckUtils]: 65: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,430 INFO L290 TraceCheckUtils]: 66: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,430 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {22926#true} {23122#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #50#return; {23122#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 10:58:53,430 INFO L290 TraceCheckUtils]: 68: Hoare triple {23122#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23144#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 10:58:53,431 INFO L290 TraceCheckUtils]: 69: Hoare triple {23144#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {23144#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 10:58:53,431 INFO L272 TraceCheckUtils]: 70: Hoare triple {23144#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,431 INFO L290 TraceCheckUtils]: 71: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,431 INFO L290 TraceCheckUtils]: 72: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,431 INFO L290 TraceCheckUtils]: 73: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,431 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22926#true} {23144#(and (= main_~y~0 9) (= main_~c~0 9))} #50#return; {23144#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 10:58:53,432 INFO L290 TraceCheckUtils]: 75: Hoare triple {23144#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 10:58:53,432 INFO L290 TraceCheckUtils]: 76: Hoare triple {23166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {23166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 10:58:53,432 INFO L272 TraceCheckUtils]: 77: Hoare triple {23166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,432 INFO L290 TraceCheckUtils]: 78: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,432 INFO L290 TraceCheckUtils]: 79: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,432 INFO L290 TraceCheckUtils]: 80: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,433 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {22926#true} {23166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #50#return; {23166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 10:58:53,433 INFO L290 TraceCheckUtils]: 82: Hoare triple {23166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 10:58:53,433 INFO L290 TraceCheckUtils]: 83: Hoare triple {23188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {23188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 10:58:53,434 INFO L272 TraceCheckUtils]: 84: Hoare triple {23188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,434 INFO L290 TraceCheckUtils]: 85: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,434 INFO L290 TraceCheckUtils]: 86: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,434 INFO L290 TraceCheckUtils]: 87: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,434 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {22926#true} {23188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #50#return; {23188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 10:58:53,435 INFO L290 TraceCheckUtils]: 89: Hoare triple {23188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23210#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:58:53,435 INFO L290 TraceCheckUtils]: 90: Hoare triple {23210#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !false; {23210#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:58:53,435 INFO L272 TraceCheckUtils]: 91: Hoare triple {23210#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,435 INFO L290 TraceCheckUtils]: 92: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,435 INFO L290 TraceCheckUtils]: 93: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,435 INFO L290 TraceCheckUtils]: 94: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,447 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {22926#true} {23210#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} #50#return; {23210#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 10:58:53,448 INFO L290 TraceCheckUtils]: 96: Hoare triple {23210#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23232#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 10:58:53,448 INFO L290 TraceCheckUtils]: 97: Hoare triple {23232#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !false; {23232#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 10:58:53,448 INFO L272 TraceCheckUtils]: 98: Hoare triple {23232#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,448 INFO L290 TraceCheckUtils]: 99: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,448 INFO L290 TraceCheckUtils]: 100: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,448 INFO L290 TraceCheckUtils]: 101: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,449 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {22926#true} {23232#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #50#return; {23232#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 10:58:53,449 INFO L290 TraceCheckUtils]: 103: Hoare triple {23232#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23254#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} is VALID [2022-04-08 10:58:53,450 INFO L290 TraceCheckUtils]: 104: Hoare triple {23254#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} assume !false; {23254#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} is VALID [2022-04-08 10:58:53,450 INFO L272 TraceCheckUtils]: 105: Hoare triple {23254#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,450 INFO L290 TraceCheckUtils]: 106: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,450 INFO L290 TraceCheckUtils]: 107: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,450 INFO L290 TraceCheckUtils]: 108: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,450 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {22926#true} {23254#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} #50#return; {23254#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} is VALID [2022-04-08 10:58:53,467 INFO L290 TraceCheckUtils]: 110: Hoare triple {23254#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23276#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 10:58:53,468 INFO L290 TraceCheckUtils]: 111: Hoare triple {23276#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !false; {23276#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 10:58:53,468 INFO L272 TraceCheckUtils]: 112: Hoare triple {23276#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,468 INFO L290 TraceCheckUtils]: 113: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,468 INFO L290 TraceCheckUtils]: 114: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,468 INFO L290 TraceCheckUtils]: 115: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,469 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {22926#true} {23276#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} #50#return; {23276#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 10:58:53,469 INFO L290 TraceCheckUtils]: 117: Hoare triple {23276#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23298#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 10:58:53,469 INFO L290 TraceCheckUtils]: 118: Hoare triple {23298#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} assume !false; {23298#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 10:58:53,469 INFO L272 TraceCheckUtils]: 119: Hoare triple {23298#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,469 INFO L290 TraceCheckUtils]: 120: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,470 INFO L290 TraceCheckUtils]: 121: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,470 INFO L290 TraceCheckUtils]: 122: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,470 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {22926#true} {23298#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} #50#return; {23298#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 10:58:53,470 INFO L290 TraceCheckUtils]: 124: Hoare triple {23298#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23320#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-08 10:58:53,471 INFO L290 TraceCheckUtils]: 125: Hoare triple {23320#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} assume !false; {23320#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-08 10:58:53,471 INFO L272 TraceCheckUtils]: 126: Hoare triple {23320#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,471 INFO L290 TraceCheckUtils]: 127: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,471 INFO L290 TraceCheckUtils]: 128: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,471 INFO L290 TraceCheckUtils]: 129: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,471 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {22926#true} {23320#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} #50#return; {23320#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-08 10:58:53,472 INFO L290 TraceCheckUtils]: 131: Hoare triple {23320#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23342#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 10:58:53,472 INFO L290 TraceCheckUtils]: 132: Hoare triple {23342#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {23342#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 10:58:53,472 INFO L272 TraceCheckUtils]: 133: Hoare triple {23342#(and (= main_~c~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,472 INFO L290 TraceCheckUtils]: 134: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,472 INFO L290 TraceCheckUtils]: 135: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,472 INFO L290 TraceCheckUtils]: 136: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,473 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {22926#true} {23342#(and (= main_~c~0 18) (= main_~y~0 18))} #50#return; {23342#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 10:58:53,473 INFO L290 TraceCheckUtils]: 138: Hoare triple {23342#(and (= main_~c~0 18) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23364#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 10:58:53,474 INFO L290 TraceCheckUtils]: 139: Hoare triple {23364#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !false; {23364#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 10:58:53,474 INFO L272 TraceCheckUtils]: 140: Hoare triple {23364#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,474 INFO L290 TraceCheckUtils]: 141: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,474 INFO L290 TraceCheckUtils]: 142: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,474 INFO L290 TraceCheckUtils]: 143: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,474 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {22926#true} {23364#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} #50#return; {23364#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 10:58:53,475 INFO L290 TraceCheckUtils]: 145: Hoare triple {23364#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23386#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 10:58:53,475 INFO L290 TraceCheckUtils]: 146: Hoare triple {23386#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {23386#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 10:58:53,475 INFO L272 TraceCheckUtils]: 147: Hoare triple {23386#(and (= main_~c~0 20) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,475 INFO L290 TraceCheckUtils]: 148: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,475 INFO L290 TraceCheckUtils]: 149: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,475 INFO L290 TraceCheckUtils]: 150: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,476 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {22926#true} {23386#(and (= main_~c~0 20) (= main_~y~0 20))} #50#return; {23386#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 10:58:53,476 INFO L290 TraceCheckUtils]: 152: Hoare triple {23386#(and (= main_~c~0 20) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23408#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 10:58:53,476 INFO L290 TraceCheckUtils]: 153: Hoare triple {23408#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {23408#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 10:58:53,476 INFO L272 TraceCheckUtils]: 154: Hoare triple {23408#(and (= main_~c~0 21) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,477 INFO L290 TraceCheckUtils]: 155: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,477 INFO L290 TraceCheckUtils]: 156: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,477 INFO L290 TraceCheckUtils]: 157: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,477 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {22926#true} {23408#(and (= main_~c~0 21) (= main_~y~0 21))} #50#return; {23408#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 10:58:53,477 INFO L290 TraceCheckUtils]: 159: Hoare triple {23408#(and (= main_~c~0 21) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23430#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 10:58:53,478 INFO L290 TraceCheckUtils]: 160: Hoare triple {23430#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {23430#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 10:58:53,478 INFO L272 TraceCheckUtils]: 161: Hoare triple {23430#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,478 INFO L290 TraceCheckUtils]: 162: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,478 INFO L290 TraceCheckUtils]: 163: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,478 INFO L290 TraceCheckUtils]: 164: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,479 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {22926#true} {23430#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #50#return; {23430#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 10:58:53,479 INFO L290 TraceCheckUtils]: 166: Hoare triple {23430#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23452#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:58:53,479 INFO L290 TraceCheckUtils]: 167: Hoare triple {23452#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} assume !false; {23452#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:58:53,479 INFO L272 TraceCheckUtils]: 168: Hoare triple {23452#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,480 INFO L290 TraceCheckUtils]: 169: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,480 INFO L290 TraceCheckUtils]: 170: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,480 INFO L290 TraceCheckUtils]: 171: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,480 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {22926#true} {23452#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} #50#return; {23452#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:58:53,481 INFO L290 TraceCheckUtils]: 173: Hoare triple {23452#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23474#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-08 10:58:53,481 INFO L290 TraceCheckUtils]: 174: Hoare triple {23474#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} assume !false; {23474#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-08 10:58:53,481 INFO L272 TraceCheckUtils]: 175: Hoare triple {23474#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,481 INFO L290 TraceCheckUtils]: 176: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,481 INFO L290 TraceCheckUtils]: 177: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,481 INFO L290 TraceCheckUtils]: 178: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,482 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {22926#true} {23474#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} #50#return; {23474#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-08 10:58:53,482 INFO L290 TraceCheckUtils]: 180: Hoare triple {23474#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23496#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} is VALID [2022-04-08 10:58:53,483 INFO L290 TraceCheckUtils]: 181: Hoare triple {23496#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} assume !false; {23496#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} is VALID [2022-04-08 10:58:53,483 INFO L272 TraceCheckUtils]: 182: Hoare triple {23496#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,483 INFO L290 TraceCheckUtils]: 183: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,483 INFO L290 TraceCheckUtils]: 184: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,483 INFO L290 TraceCheckUtils]: 185: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,483 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {22926#true} {23496#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} #50#return; {23496#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} is VALID [2022-04-08 10:58:53,484 INFO L290 TraceCheckUtils]: 187: Hoare triple {23496#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23518#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 10:58:53,484 INFO L290 TraceCheckUtils]: 188: Hoare triple {23518#(and (= main_~c~0 26) (= main_~y~0 26))} assume !false; {23518#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 10:58:53,484 INFO L272 TraceCheckUtils]: 189: Hoare triple {23518#(and (= main_~c~0 26) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,484 INFO L290 TraceCheckUtils]: 190: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,484 INFO L290 TraceCheckUtils]: 191: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,484 INFO L290 TraceCheckUtils]: 192: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,485 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {22926#true} {23518#(and (= main_~c~0 26) (= main_~y~0 26))} #50#return; {23518#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 10:58:53,485 INFO L290 TraceCheckUtils]: 194: Hoare triple {23518#(and (= main_~c~0 26) (= main_~y~0 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23540#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 10:58:53,486 INFO L290 TraceCheckUtils]: 195: Hoare triple {23540#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {23540#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 10:58:53,486 INFO L272 TraceCheckUtils]: 196: Hoare triple {23540#(and (= main_~y~0 27) (= main_~c~0 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,486 INFO L290 TraceCheckUtils]: 197: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,486 INFO L290 TraceCheckUtils]: 198: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,486 INFO L290 TraceCheckUtils]: 199: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,486 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {22926#true} {23540#(and (= main_~y~0 27) (= main_~c~0 27))} #50#return; {23540#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 10:58:53,487 INFO L290 TraceCheckUtils]: 201: Hoare triple {23540#(and (= main_~y~0 27) (= main_~c~0 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23562#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-08 10:58:53,487 INFO L290 TraceCheckUtils]: 202: Hoare triple {23562#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} assume !false; {23562#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-08 10:58:53,487 INFO L272 TraceCheckUtils]: 203: Hoare triple {23562#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 10:58:53,487 INFO L290 TraceCheckUtils]: 204: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 10:58:53,487 INFO L290 TraceCheckUtils]: 205: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 10:58:53,487 INFO L290 TraceCheckUtils]: 206: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 10:58:53,488 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {22926#true} {23562#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} #50#return; {23562#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-08 10:58:53,489 INFO L290 TraceCheckUtils]: 208: Hoare triple {23562#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} assume !(~c~0 < ~k~0); {23584#(and (<= main_~k~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-08 10:58:53,489 INFO L272 TraceCheckUtils]: 209: Hoare triple {23584#(and (<= main_~k~0 28) (< 27 main_~k~0) (= main_~y~0 28))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:58:53,490 INFO L290 TraceCheckUtils]: 210: Hoare triple {23588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:58:53,490 INFO L290 TraceCheckUtils]: 211: Hoare triple {23592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22927#false} is VALID [2022-04-08 10:58:53,490 INFO L290 TraceCheckUtils]: 212: Hoare triple {22927#false} assume !false; {22927#false} is VALID [2022-04-08 10:58:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2900 backedges. 58 proven. 1218 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2022-04-08 10:58:53,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:58:53,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:58:53,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542603520] [2022-04-08 10:58:53,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:58:53,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570663902] [2022-04-08 10:58:53,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570663902] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:58:53,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:58:53,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2022-04-08 10:58:53,854 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:58:53,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [520977424] [2022-04-08 10:58:53,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [520977424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:58:53,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:58:53,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-08 10:58:53,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227780917] [2022-04-08 10:58:53,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:58:53,855 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 31 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Word has length 213 [2022-04-08 10:58:53,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:58:53,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 31 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 10:58:54,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:58:54,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-08 10:58:54,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:58:54,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-08 10:58:54,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:58:54,117 INFO L87 Difference]: Start difference. First operand 106 states and 133 transitions. Second operand has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 31 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 10:59:11,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:59:11,659 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2022-04-08 10:59:11,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 10:59:11,659 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 31 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Word has length 213 [2022-04-08 10:59:11,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:59:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 31 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 10:59:11,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 138 transitions. [2022-04-08 10:59:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 31 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 10:59:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 138 transitions. [2022-04-08 10:59:11,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 138 transitions. [2022-04-08 10:59:12,214 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-08 10:59:12,215 INFO L225 Difference]: With dead ends: 114 [2022-04-08 10:59:12,215 INFO L226 Difference]: Without dead ends: 109 [2022-04-08 10:59:12,216 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=1367, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 10:59:12,216 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 2827 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 2827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:59:12,216 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1407 Invalid, 2827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2827 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-04-08 10:59:12,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-08 10:59:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-08 10:59:12,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:59:12,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 33 states have call successors, (33), 5 states have call predecessors, (33), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 10:59:12,301 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 33 states have call successors, (33), 5 states have call predecessors, (33), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 10:59:12,301 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 33 states have call successors, (33), 5 states have call predecessors, (33), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 10:59:12,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:59:12,303 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2022-04-08 10:59:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2022-04-08 10:59:12,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:59:12,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:59:12,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 33 states have call successors, (33), 5 states have call predecessors, (33), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 109 states. [2022-04-08 10:59:12,304 INFO L87 Difference]: Start difference. First operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 33 states have call successors, (33), 5 states have call predecessors, (33), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 109 states. [2022-04-08 10:59:12,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:59:12,306 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2022-04-08 10:59:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2022-04-08 10:59:12,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:59:12,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:59:12,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:59:12,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:59:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 33 states have call successors, (33), 5 states have call predecessors, (33), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 10:59:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 137 transitions. [2022-04-08 10:59:12,309 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 137 transitions. Word has length 213 [2022-04-08 10:59:12,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:59:12,309 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 137 transitions. [2022-04-08 10:59:12,309 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 31 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 10:59:12,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 137 transitions. [2022-04-08 10:59:13,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:59:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2022-04-08 10:59:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-04-08 10:59:13,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:59:13,304 INFO L499 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:59:13,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-08 10:59:13,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-08 10:59:13,505 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:59:13,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:59:13,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1612769317, now seen corresponding path program 57 times [2022-04-08 10:59:13,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:59:13,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1581083449] [2022-04-08 10:59:13,599 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:59:13,599 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:59:13,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1612769317, now seen corresponding path program 58 times [2022-04-08 10:59:13,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:59:13,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023163946] [2022-04-08 10:59:13,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:59:13,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:59:13,613 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:59:13,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [696902252] [2022-04-08 10:59:13,614 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:59:13,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:59:13,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:59:13,615 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:59:13,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-08 10:59:19,839 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:59:19,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:59:19,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 124 conjunts are in the unsatisfiable core [2022-04-08 10:59:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:59:19,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:59:21,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {24308#true} call ULTIMATE.init(); {24308#true} is VALID [2022-04-08 10:59:21,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {24308#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(9, 2);call #Ultimate.allocInit(12, 3); {24308#true} is VALID [2022-04-08 10:59:21,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24308#true} {24308#true} #56#return; {24308#true} is VALID [2022-04-08 10:59:21,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {24308#true} call #t~ret5 := main(); {24308#true} is VALID [2022-04-08 10:59:21,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {24308#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {24328#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:59:21,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {24328#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {24328#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:59:21,079 INFO L272 TraceCheckUtils]: 7: Hoare triple {24328#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,080 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {24308#true} {24328#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {24328#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:59:21,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {24328#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24350#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:59:21,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {24350#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {24350#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:59:21,080 INFO L272 TraceCheckUtils]: 14: Hoare triple {24350#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,081 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {24308#true} {24350#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {24350#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:59:21,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {24350#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24372#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 10:59:21,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {24372#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {24372#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 10:59:21,081 INFO L272 TraceCheckUtils]: 21: Hoare triple {24372#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,082 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {24308#true} {24372#(and (= main_~y~0 2) (= main_~c~0 2))} #50#return; {24372#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 10:59:21,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {24372#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24394#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 10:59:21,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {24394#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {24394#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 10:59:21,083 INFO L272 TraceCheckUtils]: 28: Hoare triple {24394#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,089 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {24308#true} {24394#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #50#return; {24394#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 10:59:21,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {24394#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24416#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:59:21,090 INFO L290 TraceCheckUtils]: 34: Hoare triple {24416#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {24416#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:59:21,090 INFO L272 TraceCheckUtils]: 35: Hoare triple {24416#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,090 INFO L290 TraceCheckUtils]: 36: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,090 INFO L290 TraceCheckUtils]: 37: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,090 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {24308#true} {24416#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #50#return; {24416#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:59:21,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {24416#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24438#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:59:21,108 INFO L290 TraceCheckUtils]: 41: Hoare triple {24438#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {24438#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:59:21,108 INFO L272 TraceCheckUtils]: 42: Hoare triple {24438#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,108 INFO L290 TraceCheckUtils]: 44: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,108 INFO L290 TraceCheckUtils]: 45: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,108 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24308#true} {24438#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {24438#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 10:59:21,109 INFO L290 TraceCheckUtils]: 47: Hoare triple {24438#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24460#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:59:21,109 INFO L290 TraceCheckUtils]: 48: Hoare triple {24460#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {24460#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:59:21,109 INFO L272 TraceCheckUtils]: 49: Hoare triple {24460#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,109 INFO L290 TraceCheckUtils]: 50: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,109 INFO L290 TraceCheckUtils]: 51: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,109 INFO L290 TraceCheckUtils]: 52: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,110 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {24308#true} {24460#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {24460#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 10:59:21,110 INFO L290 TraceCheckUtils]: 54: Hoare triple {24460#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24482#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:59:21,110 INFO L290 TraceCheckUtils]: 55: Hoare triple {24482#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {24482#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:59:21,110 INFO L272 TraceCheckUtils]: 56: Hoare triple {24482#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,110 INFO L290 TraceCheckUtils]: 57: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,110 INFO L290 TraceCheckUtils]: 58: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,111 INFO L290 TraceCheckUtils]: 59: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,111 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {24308#true} {24482#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #50#return; {24482#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:59:21,111 INFO L290 TraceCheckUtils]: 61: Hoare triple {24482#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24504#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 10:59:21,111 INFO L290 TraceCheckUtils]: 62: Hoare triple {24504#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {24504#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 10:59:21,112 INFO L272 TraceCheckUtils]: 63: Hoare triple {24504#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,112 INFO L290 TraceCheckUtils]: 64: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,112 INFO L290 TraceCheckUtils]: 66: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,112 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {24308#true} {24504#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #50#return; {24504#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 10:59:21,112 INFO L290 TraceCheckUtils]: 68: Hoare triple {24504#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24526#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 10:59:21,113 INFO L290 TraceCheckUtils]: 69: Hoare triple {24526#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} assume !false; {24526#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 10:59:21,113 INFO L272 TraceCheckUtils]: 70: Hoare triple {24526#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,113 INFO L290 TraceCheckUtils]: 71: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,113 INFO L290 TraceCheckUtils]: 72: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,113 INFO L290 TraceCheckUtils]: 73: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,113 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24308#true} {24526#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} #50#return; {24526#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 10:59:21,114 INFO L290 TraceCheckUtils]: 75: Hoare triple {24526#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24548#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:59:21,114 INFO L290 TraceCheckUtils]: 76: Hoare triple {24548#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} assume !false; {24548#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:59:21,114 INFO L272 TraceCheckUtils]: 77: Hoare triple {24548#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,115 INFO L290 TraceCheckUtils]: 78: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,115 INFO L290 TraceCheckUtils]: 79: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,115 INFO L290 TraceCheckUtils]: 80: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,115 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {24308#true} {24548#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} #50#return; {24548#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 10:59:21,115 INFO L290 TraceCheckUtils]: 82: Hoare triple {24548#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24570#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:59:21,116 INFO L290 TraceCheckUtils]: 83: Hoare triple {24570#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {24570#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:59:21,116 INFO L272 TraceCheckUtils]: 84: Hoare triple {24570#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,116 INFO L290 TraceCheckUtils]: 85: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,116 INFO L290 TraceCheckUtils]: 86: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,116 INFO L290 TraceCheckUtils]: 87: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,116 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {24308#true} {24570#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {24570#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 10:59:21,117 INFO L290 TraceCheckUtils]: 89: Hoare triple {24570#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24592#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:59:21,117 INFO L290 TraceCheckUtils]: 90: Hoare triple {24592#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {24592#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:59:21,117 INFO L272 TraceCheckUtils]: 91: Hoare triple {24592#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,117 INFO L290 TraceCheckUtils]: 92: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,117 INFO L290 TraceCheckUtils]: 93: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,117 INFO L290 TraceCheckUtils]: 94: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,117 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {24308#true} {24592#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {24592#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 10:59:21,118 INFO L290 TraceCheckUtils]: 96: Hoare triple {24592#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24614#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:59:21,118 INFO L290 TraceCheckUtils]: 97: Hoare triple {24614#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !false; {24614#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:59:21,118 INFO L272 TraceCheckUtils]: 98: Hoare triple {24614#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,118 INFO L290 TraceCheckUtils]: 99: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,118 INFO L290 TraceCheckUtils]: 100: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,118 INFO L290 TraceCheckUtils]: 101: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,119 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {24308#true} {24614#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} #50#return; {24614#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:59:21,119 INFO L290 TraceCheckUtils]: 103: Hoare triple {24614#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24636#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-08 10:59:21,119 INFO L290 TraceCheckUtils]: 104: Hoare triple {24636#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} assume !false; {24636#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-08 10:59:21,119 INFO L272 TraceCheckUtils]: 105: Hoare triple {24636#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,119 INFO L290 TraceCheckUtils]: 106: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,119 INFO L290 TraceCheckUtils]: 107: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,120 INFO L290 TraceCheckUtils]: 108: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,120 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {24308#true} {24636#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} #50#return; {24636#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-08 10:59:21,120 INFO L290 TraceCheckUtils]: 110: Hoare triple {24636#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24658#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 10:59:21,120 INFO L290 TraceCheckUtils]: 111: Hoare triple {24658#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12))} assume !false; {24658#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 10:59:21,121 INFO L272 TraceCheckUtils]: 112: Hoare triple {24658#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,121 INFO L290 TraceCheckUtils]: 113: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,121 INFO L290 TraceCheckUtils]: 114: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,121 INFO L290 TraceCheckUtils]: 115: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,121 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {24308#true} {24658#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12))} #50#return; {24658#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 10:59:21,121 INFO L290 TraceCheckUtils]: 117: Hoare triple {24658#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24680#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-08 10:59:21,122 INFO L290 TraceCheckUtils]: 118: Hoare triple {24680#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 4)) 12))} assume !false; {24680#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-08 10:59:21,122 INFO L272 TraceCheckUtils]: 119: Hoare triple {24680#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 4)) 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,122 INFO L290 TraceCheckUtils]: 120: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,122 INFO L290 TraceCheckUtils]: 121: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,122 INFO L290 TraceCheckUtils]: 122: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,122 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {24308#true} {24680#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 4)) 12))} #50#return; {24680#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-08 10:59:21,123 INFO L290 TraceCheckUtils]: 124: Hoare triple {24680#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 4)) 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24702#(and (= main_~c~0 17) (= (+ main_~y~0 (- 5)) 12))} is VALID [2022-04-08 10:59:21,123 INFO L290 TraceCheckUtils]: 125: Hoare triple {24702#(and (= main_~c~0 17) (= (+ main_~y~0 (- 5)) 12))} assume !false; {24702#(and (= main_~c~0 17) (= (+ main_~y~0 (- 5)) 12))} is VALID [2022-04-08 10:59:21,123 INFO L272 TraceCheckUtils]: 126: Hoare triple {24702#(and (= main_~c~0 17) (= (+ main_~y~0 (- 5)) 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,123 INFO L290 TraceCheckUtils]: 127: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,123 INFO L290 TraceCheckUtils]: 128: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,123 INFO L290 TraceCheckUtils]: 129: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,123 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {24308#true} {24702#(and (= main_~c~0 17) (= (+ main_~y~0 (- 5)) 12))} #50#return; {24702#(and (= main_~c~0 17) (= (+ main_~y~0 (- 5)) 12))} is VALID [2022-04-08 10:59:21,124 INFO L290 TraceCheckUtils]: 131: Hoare triple {24702#(and (= main_~c~0 17) (= (+ main_~y~0 (- 5)) 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24724#(and (= (+ main_~y~0 (- 6)) 12) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 10:59:21,124 INFO L290 TraceCheckUtils]: 132: Hoare triple {24724#(and (= (+ main_~y~0 (- 6)) 12) (= (+ (- 1) main_~c~0) 17))} assume !false; {24724#(and (= (+ main_~y~0 (- 6)) 12) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 10:59:21,124 INFO L272 TraceCheckUtils]: 133: Hoare triple {24724#(and (= (+ main_~y~0 (- 6)) 12) (= (+ (- 1) main_~c~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,124 INFO L290 TraceCheckUtils]: 134: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,124 INFO L290 TraceCheckUtils]: 135: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,124 INFO L290 TraceCheckUtils]: 136: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,125 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {24308#true} {24724#(and (= (+ main_~y~0 (- 6)) 12) (= (+ (- 1) main_~c~0) 17))} #50#return; {24724#(and (= (+ main_~y~0 (- 6)) 12) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 10:59:21,125 INFO L290 TraceCheckUtils]: 138: Hoare triple {24724#(and (= (+ main_~y~0 (- 6)) 12) (= (+ (- 1) main_~c~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24746#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 10:59:21,125 INFO L290 TraceCheckUtils]: 139: Hoare triple {24746#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !false; {24746#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 10:59:21,125 INFO L272 TraceCheckUtils]: 140: Hoare triple {24746#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,125 INFO L290 TraceCheckUtils]: 141: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,126 INFO L290 TraceCheckUtils]: 142: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,126 INFO L290 TraceCheckUtils]: 143: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,126 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {24308#true} {24746#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} #50#return; {24746#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 10:59:21,126 INFO L290 TraceCheckUtils]: 145: Hoare triple {24746#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24768#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} is VALID [2022-04-08 10:59:21,127 INFO L290 TraceCheckUtils]: 146: Hoare triple {24768#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} assume !false; {24768#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} is VALID [2022-04-08 10:59:21,127 INFO L272 TraceCheckUtils]: 147: Hoare triple {24768#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,127 INFO L290 TraceCheckUtils]: 148: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,127 INFO L290 TraceCheckUtils]: 149: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,127 INFO L290 TraceCheckUtils]: 150: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,127 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {24308#true} {24768#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} #50#return; {24768#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} is VALID [2022-04-08 10:59:21,127 INFO L290 TraceCheckUtils]: 152: Hoare triple {24768#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24790#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} is VALID [2022-04-08 10:59:21,128 INFO L290 TraceCheckUtils]: 153: Hoare triple {24790#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} assume !false; {24790#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} is VALID [2022-04-08 10:59:21,128 INFO L272 TraceCheckUtils]: 154: Hoare triple {24790#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,128 INFO L290 TraceCheckUtils]: 155: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,128 INFO L290 TraceCheckUtils]: 156: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,128 INFO L290 TraceCheckUtils]: 157: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,128 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {24308#true} {24790#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} #50#return; {24790#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} is VALID [2022-04-08 10:59:21,129 INFO L290 TraceCheckUtils]: 159: Hoare triple {24790#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24812#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 10:59:21,129 INFO L290 TraceCheckUtils]: 160: Hoare triple {24812#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {24812#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 10:59:21,129 INFO L272 TraceCheckUtils]: 161: Hoare triple {24812#(and (= main_~y~0 22) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,129 INFO L290 TraceCheckUtils]: 162: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,129 INFO L290 TraceCheckUtils]: 163: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,129 INFO L290 TraceCheckUtils]: 164: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,130 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {24308#true} {24812#(and (= main_~y~0 22) (= main_~c~0 22))} #50#return; {24812#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 10:59:21,130 INFO L290 TraceCheckUtils]: 166: Hoare triple {24812#(and (= main_~y~0 22) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24834#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 10:59:21,130 INFO L290 TraceCheckUtils]: 167: Hoare triple {24834#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {24834#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 10:59:21,130 INFO L272 TraceCheckUtils]: 168: Hoare triple {24834#(and (= 23 main_~y~0) (= 23 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,130 INFO L290 TraceCheckUtils]: 169: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,130 INFO L290 TraceCheckUtils]: 170: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,130 INFO L290 TraceCheckUtils]: 171: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,131 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {24308#true} {24834#(and (= 23 main_~y~0) (= 23 main_~c~0))} #50#return; {24834#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 10:59:21,131 INFO L290 TraceCheckUtils]: 173: Hoare triple {24834#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24856#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:59:21,131 INFO L290 TraceCheckUtils]: 174: Hoare triple {24856#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} assume !false; {24856#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:59:21,131 INFO L272 TraceCheckUtils]: 175: Hoare triple {24856#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,132 INFO L290 TraceCheckUtils]: 176: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,132 INFO L290 TraceCheckUtils]: 177: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,132 INFO L290 TraceCheckUtils]: 178: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,132 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {24308#true} {24856#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} #50#return; {24856#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 10:59:21,132 INFO L290 TraceCheckUtils]: 180: Hoare triple {24856#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24878#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} is VALID [2022-04-08 10:59:21,133 INFO L290 TraceCheckUtils]: 181: Hoare triple {24878#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} assume !false; {24878#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} is VALID [2022-04-08 10:59:21,133 INFO L272 TraceCheckUtils]: 182: Hoare triple {24878#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,133 INFO L290 TraceCheckUtils]: 183: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,133 INFO L290 TraceCheckUtils]: 184: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,133 INFO L290 TraceCheckUtils]: 185: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,133 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {24308#true} {24878#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} #50#return; {24878#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} is VALID [2022-04-08 10:59:21,133 INFO L290 TraceCheckUtils]: 187: Hoare triple {24878#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24900#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 10:59:21,134 INFO L290 TraceCheckUtils]: 188: Hoare triple {24900#(and (= main_~c~0 26) (= main_~y~0 26))} assume !false; {24900#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 10:59:21,134 INFO L272 TraceCheckUtils]: 189: Hoare triple {24900#(and (= main_~c~0 26) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,134 INFO L290 TraceCheckUtils]: 190: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,134 INFO L290 TraceCheckUtils]: 191: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,134 INFO L290 TraceCheckUtils]: 192: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,134 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {24308#true} {24900#(and (= main_~c~0 26) (= main_~y~0 26))} #50#return; {24900#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 10:59:21,135 INFO L290 TraceCheckUtils]: 194: Hoare triple {24900#(and (= main_~c~0 26) (= main_~y~0 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24922#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 10:59:21,135 INFO L290 TraceCheckUtils]: 195: Hoare triple {24922#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {24922#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 10:59:21,135 INFO L272 TraceCheckUtils]: 196: Hoare triple {24922#(and (= main_~y~0 27) (= main_~c~0 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,135 INFO L290 TraceCheckUtils]: 197: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,135 INFO L290 TraceCheckUtils]: 198: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,135 INFO L290 TraceCheckUtils]: 199: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,136 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {24308#true} {24922#(and (= main_~y~0 27) (= main_~c~0 27))} #50#return; {24922#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 10:59:21,136 INFO L290 TraceCheckUtils]: 201: Hoare triple {24922#(and (= main_~y~0 27) (= main_~c~0 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24944#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 10:59:21,136 INFO L290 TraceCheckUtils]: 202: Hoare triple {24944#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} assume !false; {24944#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 10:59:21,136 INFO L272 TraceCheckUtils]: 203: Hoare triple {24944#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,136 INFO L290 TraceCheckUtils]: 204: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,136 INFO L290 TraceCheckUtils]: 205: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,136 INFO L290 TraceCheckUtils]: 206: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,137 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {24308#true} {24944#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} #50#return; {24944#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 10:59:21,137 INFO L290 TraceCheckUtils]: 208: Hoare triple {24944#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24966#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} is VALID [2022-04-08 10:59:21,137 INFO L290 TraceCheckUtils]: 209: Hoare triple {24966#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} assume !false; {24966#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} is VALID [2022-04-08 10:59:21,137 INFO L272 TraceCheckUtils]: 210: Hoare triple {24966#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 10:59:21,137 INFO L290 TraceCheckUtils]: 211: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 10:59:21,138 INFO L290 TraceCheckUtils]: 212: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 10:59:21,138 INFO L290 TraceCheckUtils]: 213: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 10:59:21,138 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {24308#true} {24966#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} #50#return; {24966#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} is VALID [2022-04-08 10:59:21,141 INFO L290 TraceCheckUtils]: 215: Hoare triple {24966#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} assume !(~c~0 < ~k~0); {24988#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~k~0 29))} is VALID [2022-04-08 10:59:21,141 INFO L272 TraceCheckUtils]: 216: Hoare triple {24988#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~k~0 29))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24992#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:59:21,141 INFO L290 TraceCheckUtils]: 217: Hoare triple {24992#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24996#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:59:21,141 INFO L290 TraceCheckUtils]: 218: Hoare triple {24996#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24309#false} is VALID [2022-04-08 10:59:21,142 INFO L290 TraceCheckUtils]: 219: Hoare triple {24309#false} assume !false; {24309#false} is VALID [2022-04-08 10:59:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 60 proven. 1305 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2022-04-08 10:59:21,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:59:21,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:59:21,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023163946] [2022-04-08 10:59:21,442 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:59:21,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696902252] [2022-04-08 10:59:21,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696902252] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:59:21,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:59:21,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2022-04-08 10:59:21,442 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:59:21,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1581083449] [2022-04-08 10:59:21,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1581083449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:59:21,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:59:21,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-08 10:59:21,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29601018] [2022-04-08 10:59:21,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:59:21,444 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 32 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Word has length 220 [2022-04-08 10:59:21,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:59:21,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 32 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 10:59:21,725 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-08 10:59:21,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-08 10:59:21,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:59:21,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-08 10:59:21,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:59:21,729 INFO L87 Difference]: Start difference. First operand 109 states and 137 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 32 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 10:59:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:59:40,934 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2022-04-08 10:59:40,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 10:59:40,934 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 32 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Word has length 220 [2022-04-08 10:59:40,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:59:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 32 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 10:59:40,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 142 transitions. [2022-04-08 10:59:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 32 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 10:59:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 142 transitions. [2022-04-08 10:59:40,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 142 transitions. [2022-04-08 10:59:41,357 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-08 10:59:41,359 INFO L225 Difference]: With dead ends: 117 [2022-04-08 10:59:41,359 INFO L226 Difference]: Without dead ends: 112 [2022-04-08 10:59:41,359 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:59:41,359 INFO L913 BasicCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 3014 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 3014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:59:41,359 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1484 Invalid, 3014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3014 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2022-04-08 10:59:41,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-08 10:59:41,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-04-08 10:59:41,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:59:41,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 34 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 10:59:41,450 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 34 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 10:59:41,450 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 34 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 10:59:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:59:41,452 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2022-04-08 10:59:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2022-04-08 10:59:41,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:59:41,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:59:41,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 34 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 112 states. [2022-04-08 10:59:41,453 INFO L87 Difference]: Start difference. First operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 34 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 112 states. [2022-04-08 10:59:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:59:41,456 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2022-04-08 10:59:41,456 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2022-04-08 10:59:41,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:59:41,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:59:41,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:59:41,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:59:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 34 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 10:59:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 141 transitions. [2022-04-08 10:59:41,459 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 141 transitions. Word has length 220 [2022-04-08 10:59:41,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:59:41,460 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 141 transitions. [2022-04-08 10:59:41,460 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 32 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 10:59:41,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 141 transitions. [2022-04-08 10:59:42,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:59:42,380 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2022-04-08 10:59:42,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-04-08 10:59:42,381 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:59:42,381 INFO L499 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:59:42,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-08 10:59:42,581 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:59:42,582 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:59:42,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:59:42,582 INFO L85 PathProgramCache]: Analyzing trace with hash -21371054, now seen corresponding path program 59 times [2022-04-08 10:59:42,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:59:42,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [805984907] [2022-04-08 10:59:42,661 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:59:42,661 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:59:42,661 INFO L85 PathProgramCache]: Analyzing trace with hash -21371054, now seen corresponding path program 60 times [2022-04-08 10:59:42,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:59:42,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535129852] [2022-04-08 10:59:42,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:59:42,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:59:42,675 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:59:42,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173225413] [2022-04-08 10:59:42,676 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:59:42,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:59:42,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:59:42,677 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:59:42,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-08 10:59:52,207 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-08 10:59:52,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:59:52,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 129 conjunts are in the unsatisfiable core [2022-04-08 10:59:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:59:52,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:59:53,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {25730#true} call ULTIMATE.init(); {25730#true} is VALID [2022-04-08 10:59:53,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {25730#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(9, 2);call #Ultimate.allocInit(12, 3); {25730#true} is VALID [2022-04-08 10:59:53,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25730#true} {25730#true} #56#return; {25730#true} is VALID [2022-04-08 10:59:53,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {25730#true} call #t~ret5 := main(); {25730#true} is VALID [2022-04-08 10:59:53,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {25730#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {25750#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:59:53,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {25750#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {25750#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:59:53,937 INFO L272 TraceCheckUtils]: 7: Hoare triple {25750#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,937 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {25730#true} {25750#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {25750#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 10:59:53,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {25750#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25772#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 10:59:53,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {25772#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {25772#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 10:59:53,938 INFO L272 TraceCheckUtils]: 14: Hoare triple {25772#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,939 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25730#true} {25772#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #50#return; {25772#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 10:59:53,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {25772#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25794#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {25794#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !false; {25794#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,940 INFO L272 TraceCheckUtils]: 21: Hoare triple {25794#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,940 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25730#true} {25794#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} #50#return; {25794#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {25794#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25816#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 10:59:53,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {25816#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {25816#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 10:59:53,941 INFO L272 TraceCheckUtils]: 28: Hoare triple {25816#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,942 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25730#true} {25816#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} #50#return; {25816#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 10:59:53,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {25816#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25838#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:59:53,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {25838#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} assume !false; {25838#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:59:53,943 INFO L272 TraceCheckUtils]: 35: Hoare triple {25838#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,943 INFO L290 TraceCheckUtils]: 36: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,943 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {25730#true} {25838#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} #50#return; {25838#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 10:59:53,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {25838#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25860#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {25860#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {25860#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,944 INFO L272 TraceCheckUtils]: 42: Hoare triple {25860#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,944 INFO L290 TraceCheckUtils]: 43: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,944 INFO L290 TraceCheckUtils]: 44: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,944 INFO L290 TraceCheckUtils]: 45: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,945 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {25730#true} {25860#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} #50#return; {25860#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,945 INFO L290 TraceCheckUtils]: 47: Hoare triple {25860#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25882#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:59:53,945 INFO L290 TraceCheckUtils]: 48: Hoare triple {25882#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !false; {25882#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:59:53,946 INFO L272 TraceCheckUtils]: 49: Hoare triple {25882#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,946 INFO L290 TraceCheckUtils]: 50: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,946 INFO L290 TraceCheckUtils]: 51: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,946 INFO L290 TraceCheckUtils]: 52: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,946 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {25730#true} {25882#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} #50#return; {25882#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:59:53,947 INFO L290 TraceCheckUtils]: 54: Hoare triple {25882#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25904#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,947 INFO L290 TraceCheckUtils]: 55: Hoare triple {25904#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} assume !false; {25904#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,947 INFO L272 TraceCheckUtils]: 56: Hoare triple {25904#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,947 INFO L290 TraceCheckUtils]: 57: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,947 INFO L290 TraceCheckUtils]: 58: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,947 INFO L290 TraceCheckUtils]: 59: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,948 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25730#true} {25904#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} #50#return; {25904#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,948 INFO L290 TraceCheckUtils]: 61: Hoare triple {25904#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25926#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,948 INFO L290 TraceCheckUtils]: 62: Hoare triple {25926#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {25926#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,949 INFO L272 TraceCheckUtils]: 63: Hoare triple {25926#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,949 INFO L290 TraceCheckUtils]: 64: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,949 INFO L290 TraceCheckUtils]: 65: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,949 INFO L290 TraceCheckUtils]: 66: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,949 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {25730#true} {25926#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} #50#return; {25926#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,950 INFO L290 TraceCheckUtils]: 68: Hoare triple {25926#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25948#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,950 INFO L290 TraceCheckUtils]: 69: Hoare triple {25948#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {25948#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,950 INFO L272 TraceCheckUtils]: 70: Hoare triple {25948#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,950 INFO L290 TraceCheckUtils]: 71: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,950 INFO L290 TraceCheckUtils]: 72: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,950 INFO L290 TraceCheckUtils]: 73: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,951 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {25730#true} {25948#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} #50#return; {25948#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,951 INFO L290 TraceCheckUtils]: 75: Hoare triple {25948#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25970#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-08 10:59:53,951 INFO L290 TraceCheckUtils]: 76: Hoare triple {25970#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} assume !false; {25970#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-08 10:59:53,952 INFO L272 TraceCheckUtils]: 77: Hoare triple {25970#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,952 INFO L290 TraceCheckUtils]: 78: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,952 INFO L290 TraceCheckUtils]: 79: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,952 INFO L290 TraceCheckUtils]: 80: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,952 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25730#true} {25970#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} #50#return; {25970#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-08 10:59:53,953 INFO L290 TraceCheckUtils]: 82: Hoare triple {25970#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25992#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,953 INFO L290 TraceCheckUtils]: 83: Hoare triple {25992#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !false; {25992#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,953 INFO L272 TraceCheckUtils]: 84: Hoare triple {25992#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,953 INFO L290 TraceCheckUtils]: 85: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,953 INFO L290 TraceCheckUtils]: 86: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,953 INFO L290 TraceCheckUtils]: 87: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,954 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {25730#true} {25992#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} #50#return; {25992#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,954 INFO L290 TraceCheckUtils]: 89: Hoare triple {25992#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26014#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,954 INFO L290 TraceCheckUtils]: 90: Hoare triple {26014#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {26014#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,955 INFO L272 TraceCheckUtils]: 91: Hoare triple {26014#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,955 INFO L290 TraceCheckUtils]: 92: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,955 INFO L290 TraceCheckUtils]: 93: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,955 INFO L290 TraceCheckUtils]: 94: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,955 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {25730#true} {26014#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #50#return; {26014#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,956 INFO L290 TraceCheckUtils]: 96: Hoare triple {26014#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26036#(and (= main_~c~0 13) (< 0 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-08 10:59:53,956 INFO L290 TraceCheckUtils]: 97: Hoare triple {26036#(and (= main_~c~0 13) (< 0 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} assume !false; {26036#(and (= main_~c~0 13) (< 0 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-08 10:59:53,956 INFO L272 TraceCheckUtils]: 98: Hoare triple {26036#(and (= main_~c~0 13) (< 0 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,956 INFO L290 TraceCheckUtils]: 99: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,956 INFO L290 TraceCheckUtils]: 100: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,956 INFO L290 TraceCheckUtils]: 101: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,957 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {25730#true} {26036#(and (= main_~c~0 13) (< 0 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} #50#return; {26036#(and (= main_~c~0 13) (< 0 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-08 10:59:53,957 INFO L290 TraceCheckUtils]: 103: Hoare triple {26036#(and (= main_~c~0 13) (< 0 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26058#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,957 INFO L290 TraceCheckUtils]: 104: Hoare triple {26058#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} assume !false; {26058#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,958 INFO L272 TraceCheckUtils]: 105: Hoare triple {26058#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,958 INFO L290 TraceCheckUtils]: 106: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,958 INFO L290 TraceCheckUtils]: 107: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,958 INFO L290 TraceCheckUtils]: 108: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,958 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {25730#true} {26058#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} #50#return; {26058#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,959 INFO L290 TraceCheckUtils]: 110: Hoare triple {26058#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26080#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:59:53,959 INFO L290 TraceCheckUtils]: 111: Hoare triple {26080#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} assume !false; {26080#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:59:53,959 INFO L272 TraceCheckUtils]: 112: Hoare triple {26080#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,959 INFO L290 TraceCheckUtils]: 113: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,959 INFO L290 TraceCheckUtils]: 114: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,959 INFO L290 TraceCheckUtils]: 115: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,960 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25730#true} {26080#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} #50#return; {26080#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:59:53,960 INFO L290 TraceCheckUtils]: 117: Hoare triple {26080#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26102#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,960 INFO L290 TraceCheckUtils]: 118: Hoare triple {26102#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} assume !false; {26102#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,961 INFO L272 TraceCheckUtils]: 119: Hoare triple {26102#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,961 INFO L290 TraceCheckUtils]: 120: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,961 INFO L290 TraceCheckUtils]: 121: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,961 INFO L290 TraceCheckUtils]: 122: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,961 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {25730#true} {26102#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} #50#return; {26102#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,962 INFO L290 TraceCheckUtils]: 124: Hoare triple {26102#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26124#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,962 INFO L290 TraceCheckUtils]: 125: Hoare triple {26124#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14) (< 0 main_~k~0))} assume !false; {26124#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,962 INFO L272 TraceCheckUtils]: 126: Hoare triple {26124#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,962 INFO L290 TraceCheckUtils]: 127: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,962 INFO L290 TraceCheckUtils]: 128: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,962 INFO L290 TraceCheckUtils]: 129: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,963 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25730#true} {26124#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14) (< 0 main_~k~0))} #50#return; {26124#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,963 INFO L290 TraceCheckUtils]: 131: Hoare triple {26124#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26146#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 10:59:53,963 INFO L290 TraceCheckUtils]: 132: Hoare triple {26146#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !false; {26146#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 10:59:53,964 INFO L272 TraceCheckUtils]: 133: Hoare triple {26146#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,964 INFO L290 TraceCheckUtils]: 134: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,964 INFO L290 TraceCheckUtils]: 135: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,964 INFO L290 TraceCheckUtils]: 136: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,964 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {25730#true} {26146#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} #50#return; {26146#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 10:59:53,965 INFO L290 TraceCheckUtils]: 138: Hoare triple {26146#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26168#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 10:59:53,965 INFO L290 TraceCheckUtils]: 139: Hoare triple {26168#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {26168#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 10:59:53,965 INFO L272 TraceCheckUtils]: 140: Hoare triple {26168#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,965 INFO L290 TraceCheckUtils]: 141: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,965 INFO L290 TraceCheckUtils]: 142: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,965 INFO L290 TraceCheckUtils]: 143: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,966 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {25730#true} {26168#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} #50#return; {26168#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 10:59:53,966 INFO L290 TraceCheckUtils]: 145: Hoare triple {26168#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26190#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,966 INFO L290 TraceCheckUtils]: 146: Hoare triple {26190#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20) (< 0 main_~k~0))} assume !false; {26190#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,967 INFO L272 TraceCheckUtils]: 147: Hoare triple {26190#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,967 INFO L290 TraceCheckUtils]: 148: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,967 INFO L290 TraceCheckUtils]: 149: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,967 INFO L290 TraceCheckUtils]: 150: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,967 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {25730#true} {26190#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20) (< 0 main_~k~0))} #50#return; {26190#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,968 INFO L290 TraceCheckUtils]: 152: Hoare triple {26190#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26212#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,968 INFO L290 TraceCheckUtils]: 153: Hoare triple {26212#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} assume !false; {26212#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,968 INFO L272 TraceCheckUtils]: 154: Hoare triple {26212#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,968 INFO L290 TraceCheckUtils]: 155: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,968 INFO L290 TraceCheckUtils]: 156: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,968 INFO L290 TraceCheckUtils]: 157: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,969 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {25730#true} {26212#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} #50#return; {26212#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,969 INFO L290 TraceCheckUtils]: 159: Hoare triple {26212#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26234#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,969 INFO L290 TraceCheckUtils]: 160: Hoare triple {26234#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} assume !false; {26234#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,970 INFO L272 TraceCheckUtils]: 161: Hoare triple {26234#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,970 INFO L290 TraceCheckUtils]: 162: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,970 INFO L290 TraceCheckUtils]: 163: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,970 INFO L290 TraceCheckUtils]: 164: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,970 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {25730#true} {26234#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} #50#return; {26234#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,971 INFO L290 TraceCheckUtils]: 166: Hoare triple {26234#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26256#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:59:53,971 INFO L290 TraceCheckUtils]: 167: Hoare triple {26256#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} assume !false; {26256#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:59:53,971 INFO L272 TraceCheckUtils]: 168: Hoare triple {26256#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,971 INFO L290 TraceCheckUtils]: 169: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,971 INFO L290 TraceCheckUtils]: 170: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,971 INFO L290 TraceCheckUtils]: 171: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,972 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25730#true} {26256#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} #50#return; {26256#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:59:53,972 INFO L290 TraceCheckUtils]: 173: Hoare triple {26256#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26278#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,973 INFO L290 TraceCheckUtils]: 174: Hoare triple {26278#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} assume !false; {26278#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,973 INFO L272 TraceCheckUtils]: 175: Hoare triple {26278#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,973 INFO L290 TraceCheckUtils]: 176: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,973 INFO L290 TraceCheckUtils]: 177: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,973 INFO L290 TraceCheckUtils]: 178: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,973 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {25730#true} {26278#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} #50#return; {26278#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,974 INFO L290 TraceCheckUtils]: 180: Hoare triple {26278#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26300#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 10:59:53,974 INFO L290 TraceCheckUtils]: 181: Hoare triple {26300#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} assume !false; {26300#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 10:59:53,974 INFO L272 TraceCheckUtils]: 182: Hoare triple {26300#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,974 INFO L290 TraceCheckUtils]: 183: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,975 INFO L290 TraceCheckUtils]: 184: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,975 INFO L290 TraceCheckUtils]: 185: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,975 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {25730#true} {26300#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} #50#return; {26300#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 10:59:53,976 INFO L290 TraceCheckUtils]: 187: Hoare triple {26300#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26322#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} is VALID [2022-04-08 10:59:53,976 INFO L290 TraceCheckUtils]: 188: Hoare triple {26322#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} assume !false; {26322#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} is VALID [2022-04-08 10:59:53,976 INFO L272 TraceCheckUtils]: 189: Hoare triple {26322#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,976 INFO L290 TraceCheckUtils]: 190: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,976 INFO L290 TraceCheckUtils]: 191: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,976 INFO L290 TraceCheckUtils]: 192: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,977 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {25730#true} {26322#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} #50#return; {26322#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} is VALID [2022-04-08 10:59:53,977 INFO L290 TraceCheckUtils]: 194: Hoare triple {26322#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26344#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,978 INFO L290 TraceCheckUtils]: 195: Hoare triple {26344#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} assume !false; {26344#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,978 INFO L272 TraceCheckUtils]: 196: Hoare triple {26344#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,978 INFO L290 TraceCheckUtils]: 197: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,978 INFO L290 TraceCheckUtils]: 198: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,978 INFO L290 TraceCheckUtils]: 199: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,978 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {25730#true} {26344#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} #50#return; {26344#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,979 INFO L290 TraceCheckUtils]: 201: Hoare triple {26344#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26366#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,979 INFO L290 TraceCheckUtils]: 202: Hoare triple {26366#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} assume !false; {26366#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,979 INFO L272 TraceCheckUtils]: 203: Hoare triple {26366#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,979 INFO L290 TraceCheckUtils]: 204: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,980 INFO L290 TraceCheckUtils]: 205: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,980 INFO L290 TraceCheckUtils]: 206: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,980 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {25730#true} {26366#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} #50#return; {26366#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,981 INFO L290 TraceCheckUtils]: 208: Hoare triple {26366#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26388#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,981 INFO L290 TraceCheckUtils]: 209: Hoare triple {26388#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} assume !false; {26388#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,981 INFO L272 TraceCheckUtils]: 210: Hoare triple {26388#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,981 INFO L290 TraceCheckUtils]: 211: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,981 INFO L290 TraceCheckUtils]: 212: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,981 INFO L290 TraceCheckUtils]: 213: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,982 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {25730#true} {26388#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} #50#return; {26388#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 10:59:53,982 INFO L290 TraceCheckUtils]: 215: Hoare triple {26388#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26410#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-08 10:59:53,983 INFO L290 TraceCheckUtils]: 216: Hoare triple {26410#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} assume !false; {26410#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-08 10:59:53,983 INFO L272 TraceCheckUtils]: 217: Hoare triple {26410#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 10:59:53,983 INFO L290 TraceCheckUtils]: 218: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 10:59:53,983 INFO L290 TraceCheckUtils]: 219: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 10:59:53,983 INFO L290 TraceCheckUtils]: 220: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 10:59:53,983 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {25730#true} {26410#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} #50#return; {26410#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-08 10:59:53,984 INFO L290 TraceCheckUtils]: 222: Hoare triple {26410#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} assume !(~c~0 < ~k~0); {26432#(and (<= main_~k~0 30) (= 30 main_~y~0) (< 29 main_~k~0))} is VALID [2022-04-08 10:59:53,985 INFO L272 TraceCheckUtils]: 223: Hoare triple {26432#(and (<= main_~k~0 30) (= 30 main_~y~0) (< 29 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26436#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:59:53,985 INFO L290 TraceCheckUtils]: 224: Hoare triple {26436#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26440#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:59:53,985 INFO L290 TraceCheckUtils]: 225: Hoare triple {26440#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25731#false} is VALID [2022-04-08 10:59:53,985 INFO L290 TraceCheckUtils]: 226: Hoare triple {25731#false} assume !false; {25731#false} is VALID [2022-04-08 10:59:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3317 backedges. 62 proven. 1395 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2022-04-08 10:59:53,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:59:58,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:59:58,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535129852] [2022-04-08 10:59:58,997 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:59:58,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173225413] [2022-04-08 10:59:58,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173225413] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:59:58,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:59:58,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2022-04-08 10:59:58,997 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:59:58,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [805984907] [2022-04-08 10:59:58,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [805984907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:59:58,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:59:58,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-08 10:59:58,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515729938] [2022-04-08 10:59:58,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:59:58,998 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 33 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Word has length 227 [2022-04-08 10:59:58,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:59:58,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 33 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 10:59:59,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:59:59,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-08 10:59:59,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:59:59,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-08 10:59:59,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=3516, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 10:59:59,608 INFO L87 Difference]: Start difference. First operand 112 states and 141 transitions. Second operand has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 33 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 11:00:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:00:19,715 INFO L93 Difference]: Finished difference Result 120 states and 150 transitions. [2022-04-08 11:00:19,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 11:00:19,715 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 33 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Word has length 227 [2022-04-08 11:00:19,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:00:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 33 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 11:00:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 146 transitions. [2022-04-08 11:00:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 33 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 11:00:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 146 transitions. [2022-04-08 11:00:19,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 146 transitions. [2022-04-08 11:00:20,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:00:20,454 INFO L225 Difference]: With dead ends: 120 [2022-04-08 11:00:20,454 INFO L226 Difference]: Without dead ends: 115 [2022-04-08 11:00:20,455 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1050, Invalid=3780, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 11:00:20,455 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 3207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 3207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:00:20,455 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1563 Invalid, 3207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3207 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2022-04-08 11:00:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-08 11:00:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-08 11:00:20,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:00:20,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 35 states have call successors, (35), 5 states have call predecessors, (35), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 11:00:20,581 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 35 states have call successors, (35), 5 states have call predecessors, (35), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 11:00:20,581 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 35 states have call successors, (35), 5 states have call predecessors, (35), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 11:00:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:00:20,603 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2022-04-08 11:00:20,603 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2022-04-08 11:00:20,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:00:20,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:00:20,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 35 states have call successors, (35), 5 states have call predecessors, (35), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 115 states. [2022-04-08 11:00:20,604 INFO L87 Difference]: Start difference. First operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 35 states have call successors, (35), 5 states have call predecessors, (35), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 115 states. [2022-04-08 11:00:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:00:20,606 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2022-04-08 11:00:20,606 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2022-04-08 11:00:20,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:00:20,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:00:20,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:00:20,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:00:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 35 states have call successors, (35), 5 states have call predecessors, (35), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 11:00:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 145 transitions. [2022-04-08 11:00:20,609 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 145 transitions. Word has length 227 [2022-04-08 11:00:20,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:00:20,609 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 145 transitions. [2022-04-08 11:00:20,609 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 33 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 11:00:20,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 145 transitions. [2022-04-08 11:00:21,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:00:21,551 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2022-04-08 11:00:21,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-04-08 11:00:21,552 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:00:21,552 INFO L499 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:00:21,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-08 11:00:21,752 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:00:21,753 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:00:21,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:00:21,753 INFO L85 PathProgramCache]: Analyzing trace with hash -748098683, now seen corresponding path program 61 times [2022-04-08 11:00:21,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:00:21,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1793042159] [2022-04-08 11:00:21,852 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:00:21,852 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:00:21,852 INFO L85 PathProgramCache]: Analyzing trace with hash -748098683, now seen corresponding path program 62 times [2022-04-08 11:00:21,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:00:21,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393099407] [2022-04-08 11:00:21,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:00:21,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:00:21,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:00:21,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843204252] [2022-04-08 11:00:21,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:00:21,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:00:21,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:00:21,879 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:00:21,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-08 11:00:22,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:00:22,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:00:22,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 133 conjunts are in the unsatisfiable core [2022-04-08 11:00:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:00:23,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:00:24,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {27830#true} call ULTIMATE.init(); {27830#true} is VALID [2022-04-08 11:00:24,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {27830#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(9, 2);call #Ultimate.allocInit(12, 3); {27830#true} is VALID [2022-04-08 11:00:24,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27830#true} {27830#true} #56#return; {27830#true} is VALID [2022-04-08 11:00:24,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {27830#true} call #t~ret5 := main(); {27830#true} is VALID [2022-04-08 11:00:24,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {27830#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {27850#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:00:24,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {27850#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {27850#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:00:24,613 INFO L272 TraceCheckUtils]: 7: Hoare triple {27850#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,614 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {27830#true} {27850#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {27850#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:00:24,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {27850#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27872#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 11:00:24,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {27872#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {27872#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 11:00:24,614 INFO L272 TraceCheckUtils]: 14: Hoare triple {27872#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,615 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {27830#true} {27872#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #50#return; {27872#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 11:00:24,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {27872#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27894#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {27894#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !false; {27894#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,616 INFO L272 TraceCheckUtils]: 21: Hoare triple {27894#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,616 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {27830#true} {27894#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} #50#return; {27894#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {27894#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27916#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 11:00:24,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {27916#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {27916#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 11:00:24,617 INFO L272 TraceCheckUtils]: 28: Hoare triple {27916#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,617 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {27830#true} {27916#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #50#return; {27916#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 11:00:24,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {27916#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27938#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,618 INFO L290 TraceCheckUtils]: 34: Hoare triple {27938#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {27938#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,618 INFO L272 TraceCheckUtils]: 35: Hoare triple {27938#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,618 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {27830#true} {27938#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #50#return; {27938#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {27938#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27960#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {27960#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {27960#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,619 INFO L272 TraceCheckUtils]: 42: Hoare triple {27960#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,619 INFO L290 TraceCheckUtils]: 43: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,619 INFO L290 TraceCheckUtils]: 44: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,619 INFO L290 TraceCheckUtils]: 45: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,619 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {27830#true} {27960#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} #50#return; {27960#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,620 INFO L290 TraceCheckUtils]: 47: Hoare triple {27960#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27982#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,620 INFO L290 TraceCheckUtils]: 48: Hoare triple {27982#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !false; {27982#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,620 INFO L272 TraceCheckUtils]: 49: Hoare triple {27982#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,620 INFO L290 TraceCheckUtils]: 50: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,620 INFO L290 TraceCheckUtils]: 51: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,620 INFO L290 TraceCheckUtils]: 52: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,621 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27830#true} {27982#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} #50#return; {27982#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,621 INFO L290 TraceCheckUtils]: 54: Hoare triple {27982#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28004#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,621 INFO L290 TraceCheckUtils]: 55: Hoare triple {28004#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {28004#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,621 INFO L272 TraceCheckUtils]: 56: Hoare triple {28004#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,621 INFO L290 TraceCheckUtils]: 57: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,621 INFO L290 TraceCheckUtils]: 58: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,621 INFO L290 TraceCheckUtils]: 59: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,622 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {27830#true} {28004#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #50#return; {28004#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,622 INFO L290 TraceCheckUtils]: 61: Hoare triple {28004#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28026#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,622 INFO L290 TraceCheckUtils]: 62: Hoare triple {28026#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} assume !false; {28026#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,622 INFO L272 TraceCheckUtils]: 63: Hoare triple {28026#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,622 INFO L290 TraceCheckUtils]: 64: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,622 INFO L290 TraceCheckUtils]: 65: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,622 INFO L290 TraceCheckUtils]: 66: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,623 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {27830#true} {28026#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} #50#return; {28026#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,623 INFO L290 TraceCheckUtils]: 68: Hoare triple {28026#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28048#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,623 INFO L290 TraceCheckUtils]: 69: Hoare triple {28048#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {28048#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,623 INFO L272 TraceCheckUtils]: 70: Hoare triple {28048#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,623 INFO L290 TraceCheckUtils]: 71: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,624 INFO L290 TraceCheckUtils]: 72: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,624 INFO L290 TraceCheckUtils]: 73: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,624 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27830#true} {28048#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} #50#return; {28048#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,624 INFO L290 TraceCheckUtils]: 75: Hoare triple {28048#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28070#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,624 INFO L290 TraceCheckUtils]: 76: Hoare triple {28070#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} assume !false; {28070#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,625 INFO L272 TraceCheckUtils]: 77: Hoare triple {28070#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,625 INFO L290 TraceCheckUtils]: 78: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,625 INFO L290 TraceCheckUtils]: 79: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,625 INFO L290 TraceCheckUtils]: 80: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,625 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {27830#true} {28070#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} #50#return; {28070#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,625 INFO L290 TraceCheckUtils]: 82: Hoare triple {28070#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28092#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,626 INFO L290 TraceCheckUtils]: 83: Hoare triple {28092#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !false; {28092#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,626 INFO L272 TraceCheckUtils]: 84: Hoare triple {28092#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,626 INFO L290 TraceCheckUtils]: 85: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,626 INFO L290 TraceCheckUtils]: 86: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,626 INFO L290 TraceCheckUtils]: 87: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,626 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {27830#true} {28092#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} #50#return; {28092#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,626 INFO L290 TraceCheckUtils]: 89: Hoare triple {28092#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28114#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,627 INFO L290 TraceCheckUtils]: 90: Hoare triple {28114#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} assume !false; {28114#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,627 INFO L272 TraceCheckUtils]: 91: Hoare triple {28114#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,627 INFO L290 TraceCheckUtils]: 92: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,627 INFO L290 TraceCheckUtils]: 93: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,627 INFO L290 TraceCheckUtils]: 94: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,627 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {27830#true} {28114#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} #50#return; {28114#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,628 INFO L290 TraceCheckUtils]: 96: Hoare triple {28114#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28136#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,628 INFO L290 TraceCheckUtils]: 97: Hoare triple {28136#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} assume !false; {28136#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,628 INFO L272 TraceCheckUtils]: 98: Hoare triple {28136#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,628 INFO L290 TraceCheckUtils]: 99: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,628 INFO L290 TraceCheckUtils]: 100: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,628 INFO L290 TraceCheckUtils]: 101: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,628 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {27830#true} {28136#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} #50#return; {28136#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,629 INFO L290 TraceCheckUtils]: 103: Hoare triple {28136#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28158#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,629 INFO L290 TraceCheckUtils]: 104: Hoare triple {28158#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11) (< 0 main_~k~0))} assume !false; {28158#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,629 INFO L272 TraceCheckUtils]: 105: Hoare triple {28158#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,629 INFO L290 TraceCheckUtils]: 106: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,629 INFO L290 TraceCheckUtils]: 107: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,629 INFO L290 TraceCheckUtils]: 108: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,630 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {27830#true} {28158#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11) (< 0 main_~k~0))} #50#return; {28158#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,630 INFO L290 TraceCheckUtils]: 110: Hoare triple {28158#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28180#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,630 INFO L290 TraceCheckUtils]: 111: Hoare triple {28180#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} assume !false; {28180#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,630 INFO L272 TraceCheckUtils]: 112: Hoare triple {28180#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,630 INFO L290 TraceCheckUtils]: 113: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,630 INFO L290 TraceCheckUtils]: 114: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,630 INFO L290 TraceCheckUtils]: 115: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,631 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {27830#true} {28180#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} #50#return; {28180#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,631 INFO L290 TraceCheckUtils]: 117: Hoare triple {28180#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28202#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,631 INFO L290 TraceCheckUtils]: 118: Hoare triple {28202#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} assume !false; {28202#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,631 INFO L272 TraceCheckUtils]: 119: Hoare triple {28202#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,631 INFO L290 TraceCheckUtils]: 120: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,632 INFO L290 TraceCheckUtils]: 121: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,632 INFO L290 TraceCheckUtils]: 122: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,632 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {27830#true} {28202#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} #50#return; {28202#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,632 INFO L290 TraceCheckUtils]: 124: Hoare triple {28202#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28224#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,632 INFO L290 TraceCheckUtils]: 125: Hoare triple {28224#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0))} assume !false; {28224#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,633 INFO L272 TraceCheckUtils]: 126: Hoare triple {28224#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,633 INFO L290 TraceCheckUtils]: 127: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,633 INFO L290 TraceCheckUtils]: 128: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,633 INFO L290 TraceCheckUtils]: 129: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,633 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {27830#true} {28224#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0))} #50#return; {28224#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,633 INFO L290 TraceCheckUtils]: 131: Hoare triple {28224#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28246#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 11:00:24,634 INFO L290 TraceCheckUtils]: 132: Hoare triple {28246#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !false; {28246#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 11:00:24,634 INFO L272 TraceCheckUtils]: 133: Hoare triple {28246#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,634 INFO L290 TraceCheckUtils]: 134: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,634 INFO L290 TraceCheckUtils]: 135: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,634 INFO L290 TraceCheckUtils]: 136: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,634 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {27830#true} {28246#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} #50#return; {28246#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 11:00:24,634 INFO L290 TraceCheckUtils]: 138: Hoare triple {28246#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28268#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-08 11:00:24,635 INFO L290 TraceCheckUtils]: 139: Hoare triple {28268#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} assume !false; {28268#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-08 11:00:24,635 INFO L272 TraceCheckUtils]: 140: Hoare triple {28268#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,635 INFO L290 TraceCheckUtils]: 141: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,635 INFO L290 TraceCheckUtils]: 142: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,635 INFO L290 TraceCheckUtils]: 143: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,635 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {27830#true} {28268#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} #50#return; {28268#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-08 11:00:24,636 INFO L290 TraceCheckUtils]: 145: Hoare triple {28268#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28290#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,636 INFO L290 TraceCheckUtils]: 146: Hoare triple {28290#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20) (< 0 main_~k~0))} assume !false; {28290#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,636 INFO L272 TraceCheckUtils]: 147: Hoare triple {28290#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,636 INFO L290 TraceCheckUtils]: 148: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,636 INFO L290 TraceCheckUtils]: 149: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,636 INFO L290 TraceCheckUtils]: 150: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,636 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {27830#true} {28290#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20) (< 0 main_~k~0))} #50#return; {28290#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,637 INFO L290 TraceCheckUtils]: 152: Hoare triple {28290#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28312#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,637 INFO L290 TraceCheckUtils]: 153: Hoare triple {28312#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} assume !false; {28312#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,637 INFO L272 TraceCheckUtils]: 154: Hoare triple {28312#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,637 INFO L290 TraceCheckUtils]: 155: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,637 INFO L290 TraceCheckUtils]: 156: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,637 INFO L290 TraceCheckUtils]: 157: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,637 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {27830#true} {28312#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} #50#return; {28312#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,638 INFO L290 TraceCheckUtils]: 159: Hoare triple {28312#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28334#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,638 INFO L290 TraceCheckUtils]: 160: Hoare triple {28334#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} assume !false; {28334#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,638 INFO L272 TraceCheckUtils]: 161: Hoare triple {28334#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,638 INFO L290 TraceCheckUtils]: 162: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,638 INFO L290 TraceCheckUtils]: 163: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,638 INFO L290 TraceCheckUtils]: 164: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,639 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {27830#true} {28334#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} #50#return; {28334#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,639 INFO L290 TraceCheckUtils]: 166: Hoare triple {28334#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28356#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,639 INFO L290 TraceCheckUtils]: 167: Hoare triple {28356#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0) (< 0 main_~k~0))} assume !false; {28356#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,639 INFO L272 TraceCheckUtils]: 168: Hoare triple {28356#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,639 INFO L290 TraceCheckUtils]: 169: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,639 INFO L290 TraceCheckUtils]: 170: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,639 INFO L290 TraceCheckUtils]: 171: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,640 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {27830#true} {28356#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0) (< 0 main_~k~0))} #50#return; {28356#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,640 INFO L290 TraceCheckUtils]: 173: Hoare triple {28356#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28378#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,640 INFO L290 TraceCheckUtils]: 174: Hoare triple {28378#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} assume !false; {28378#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,640 INFO L272 TraceCheckUtils]: 175: Hoare triple {28378#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,640 INFO L290 TraceCheckUtils]: 176: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,641 INFO L290 TraceCheckUtils]: 177: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,641 INFO L290 TraceCheckUtils]: 178: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,641 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {27830#true} {28378#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} #50#return; {28378#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,641 INFO L290 TraceCheckUtils]: 180: Hoare triple {28378#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28400#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,641 INFO L290 TraceCheckUtils]: 181: Hoare triple {28400#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} assume !false; {28400#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,642 INFO L272 TraceCheckUtils]: 182: Hoare triple {28400#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,642 INFO L290 TraceCheckUtils]: 183: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,642 INFO L290 TraceCheckUtils]: 184: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,642 INFO L290 TraceCheckUtils]: 185: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,642 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {27830#true} {28400#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} #50#return; {28400#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,642 INFO L290 TraceCheckUtils]: 187: Hoare triple {28400#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28422#(and (= main_~c~0 26) (< 0 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-08 11:00:24,643 INFO L290 TraceCheckUtils]: 188: Hoare triple {28422#(and (= main_~c~0 26) (< 0 main_~k~0) (= main_~y~0 26))} assume !false; {28422#(and (= main_~c~0 26) (< 0 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-08 11:00:24,643 INFO L272 TraceCheckUtils]: 189: Hoare triple {28422#(and (= main_~c~0 26) (< 0 main_~k~0) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,643 INFO L290 TraceCheckUtils]: 190: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,643 INFO L290 TraceCheckUtils]: 191: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,643 INFO L290 TraceCheckUtils]: 192: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,643 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {27830#true} {28422#(and (= main_~c~0 26) (< 0 main_~k~0) (= main_~y~0 26))} #50#return; {28422#(and (= main_~c~0 26) (< 0 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-08 11:00:24,643 INFO L290 TraceCheckUtils]: 194: Hoare triple {28422#(and (= main_~c~0 26) (< 0 main_~k~0) (= main_~y~0 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28444#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,644 INFO L290 TraceCheckUtils]: 195: Hoare triple {28444#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} assume !false; {28444#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,644 INFO L272 TraceCheckUtils]: 196: Hoare triple {28444#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,644 INFO L290 TraceCheckUtils]: 197: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,644 INFO L290 TraceCheckUtils]: 198: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,644 INFO L290 TraceCheckUtils]: 199: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,644 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {27830#true} {28444#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} #50#return; {28444#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,645 INFO L290 TraceCheckUtils]: 201: Hoare triple {28444#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28466#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,645 INFO L290 TraceCheckUtils]: 202: Hoare triple {28466#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} assume !false; {28466#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,645 INFO L272 TraceCheckUtils]: 203: Hoare triple {28466#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,645 INFO L290 TraceCheckUtils]: 204: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,645 INFO L290 TraceCheckUtils]: 205: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,645 INFO L290 TraceCheckUtils]: 206: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,645 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {27830#true} {28466#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} #50#return; {28466#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,646 INFO L290 TraceCheckUtils]: 208: Hoare triple {28466#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28488#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,646 INFO L290 TraceCheckUtils]: 209: Hoare triple {28488#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} assume !false; {28488#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,646 INFO L272 TraceCheckUtils]: 210: Hoare triple {28488#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,646 INFO L290 TraceCheckUtils]: 211: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,646 INFO L290 TraceCheckUtils]: 212: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,646 INFO L290 TraceCheckUtils]: 213: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,646 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {27830#true} {28488#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} #50#return; {28488#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,647 INFO L290 TraceCheckUtils]: 215: Hoare triple {28488#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28510#(and (= 30 main_~y~0) (= 30 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,647 INFO L290 TraceCheckUtils]: 216: Hoare triple {28510#(and (= 30 main_~y~0) (= 30 main_~c~0) (< 0 main_~k~0))} assume !false; {28510#(and (= 30 main_~y~0) (= 30 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,647 INFO L272 TraceCheckUtils]: 217: Hoare triple {28510#(and (= 30 main_~y~0) (= 30 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,647 INFO L290 TraceCheckUtils]: 218: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,647 INFO L290 TraceCheckUtils]: 219: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,647 INFO L290 TraceCheckUtils]: 220: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,648 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {27830#true} {28510#(and (= 30 main_~y~0) (= 30 main_~c~0) (< 0 main_~k~0))} #50#return; {28510#(and (= 30 main_~y~0) (= 30 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:00:24,648 INFO L290 TraceCheckUtils]: 222: Hoare triple {28510#(and (= 30 main_~y~0) (= 30 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28532#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} is VALID [2022-04-08 11:00:24,648 INFO L290 TraceCheckUtils]: 223: Hoare triple {28532#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} assume !false; {28532#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} is VALID [2022-04-08 11:00:24,648 INFO L272 TraceCheckUtils]: 224: Hoare triple {28532#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 11:00:24,648 INFO L290 TraceCheckUtils]: 225: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 11:00:24,648 INFO L290 TraceCheckUtils]: 226: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 11:00:24,648 INFO L290 TraceCheckUtils]: 227: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 11:00:24,649 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {27830#true} {28532#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} #50#return; {28532#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} is VALID [2022-04-08 11:00:24,649 INFO L290 TraceCheckUtils]: 229: Hoare triple {28532#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} assume !(~c~0 < ~k~0); {28554#(and (= main_~y~0 31) (< 30 main_~k~0) (<= main_~k~0 31))} is VALID [2022-04-08 11:00:24,650 INFO L272 TraceCheckUtils]: 230: Hoare triple {28554#(and (= main_~y~0 31) (< 30 main_~k~0) (<= main_~k~0 31))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28558#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:00:24,650 INFO L290 TraceCheckUtils]: 231: Hoare triple {28558#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28562#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:00:24,650 INFO L290 TraceCheckUtils]: 232: Hoare triple {28562#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27831#false} is VALID [2022-04-08 11:00:24,650 INFO L290 TraceCheckUtils]: 233: Hoare triple {27831#false} assume !false; {27831#false} is VALID [2022-04-08 11:00:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3536 backedges. 64 proven. 1488 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2022-04-08 11:00:24,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:00:30,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:00:30,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393099407] [2022-04-08 11:00:30,421 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:00:30,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843204252] [2022-04-08 11:00:30,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843204252] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:00:30,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:00:30,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2022-04-08 11:00:30,421 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:00:30,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1793042159] [2022-04-08 11:00:30,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1793042159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:00:30,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:00:30,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-08 11:00:30,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814553180] [2022-04-08 11:00:30,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:00:30,431 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 34 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Word has length 234 [2022-04-08 11:00:30,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:00:30,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 34 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 11:00:30,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:00:30,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-08 11:00:30,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:00:30,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-08 11:00:30,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=3725, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 11:00:30,899 INFO L87 Difference]: Start difference. First operand 115 states and 145 transitions. Second operand has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 34 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 11:01:05,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:01:05,145 INFO L93 Difference]: Finished difference Result 123 states and 154 transitions. [2022-04-08 11:01:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 11:01:05,146 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 34 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Word has length 234 [2022-04-08 11:01:05,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:01:05,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 34 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 11:01:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 150 transitions. [2022-04-08 11:01:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 34 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 11:01:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 150 transitions. [2022-04-08 11:01:05,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 150 transitions. [2022-04-08 11:01:05,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:01:05,678 INFO L225 Difference]: With dead ends: 123 [2022-04-08 11:01:05,678 INFO L226 Difference]: Without dead ends: 118 [2022-04-08 11:01:05,679 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 387 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1115, Invalid=3997, Unknown=0, NotChecked=0, Total=5112 [2022-04-08 11:01:05,679 INFO L913 BasicCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 3406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 3406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:01:05,680 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1644 Invalid, 3406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3406 Invalid, 0 Unknown, 0 Unchecked, 18.0s Time] [2022-04-08 11:01:05,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-08 11:01:05,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-08 11:01:05,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:01:05,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 36 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 11:01:05,822 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 36 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 11:01:05,822 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 36 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 11:01:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:01:05,824 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2022-04-08 11:01:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2022-04-08 11:01:05,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:01:05,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:01:05,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 36 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 118 states. [2022-04-08 11:01:05,847 INFO L87 Difference]: Start difference. First operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 36 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 118 states. [2022-04-08 11:01:05,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:01:05,849 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2022-04-08 11:01:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2022-04-08 11:01:05,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:01:05,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:01:05,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:01:05,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:01:05,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 36 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 11:01:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2022-04-08 11:01:05,852 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 234 [2022-04-08 11:01:05,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:01:05,852 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2022-04-08 11:01:05,852 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 34 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 11:01:05,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 149 transitions. [2022-04-08 11:01:07,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:01:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2022-04-08 11:01:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-04-08 11:01:07,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:01:07,093 INFO L499 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:01:07,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-08 11:01:07,294 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-08 11:01:07,294 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:01:07,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:01:07,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1651070962, now seen corresponding path program 63 times [2022-04-08 11:01:07,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:01:07,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [269621532] [2022-04-08 11:01:07,393 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:01:07,393 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:01:07,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1651070962, now seen corresponding path program 64 times [2022-04-08 11:01:07,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:01:07,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703210121] [2022-04-08 11:01:07,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:01:07,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:01:07,408 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:01:07,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401055845] [2022-04-08 11:01:07,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:01:07,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:01:07,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:01:07,412 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:01:07,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-08 11:01:25,172 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:01:25,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:01:25,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 136 conjunts are in the unsatisfiable core [2022-04-08 11:01:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:01:25,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:01:26,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {29992#true} call ULTIMATE.init(); {29992#true} is VALID [2022-04-08 11:01:26,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {29992#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(9, 2);call #Ultimate.allocInit(12, 3); {29992#true} is VALID [2022-04-08 11:01:26,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29992#true} {29992#true} #56#return; {29992#true} is VALID [2022-04-08 11:01:26,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {29992#true} call #t~ret5 := main(); {29992#true} is VALID [2022-04-08 11:01:26,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {29992#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {30012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:01:26,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {30012#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {30012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:01:26,457 INFO L272 TraceCheckUtils]: 7: Hoare triple {30012#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,458 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {29992#true} {30012#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {30012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:01:26,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {30012#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30034#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 11:01:26,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {30034#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {30034#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 11:01:26,458 INFO L272 TraceCheckUtils]: 14: Hoare triple {30034#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,459 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29992#true} {30034#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {30034#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 11:01:26,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {30034#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30056#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 11:01:26,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {30056#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {30056#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 11:01:26,460 INFO L272 TraceCheckUtils]: 21: Hoare triple {30056#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,460 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29992#true} {30056#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {30056#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 11:01:26,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {30056#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30078#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 11:01:26,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {30078#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !false; {30078#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 11:01:26,461 INFO L272 TraceCheckUtils]: 28: Hoare triple {30078#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,461 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {29992#true} {30078#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #50#return; {30078#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 11:01:26,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {30078#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30100#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 11:01:26,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {30100#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {30100#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 11:01:26,462 INFO L272 TraceCheckUtils]: 35: Hoare triple {30100#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,462 INFO L290 TraceCheckUtils]: 37: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,462 INFO L290 TraceCheckUtils]: 38: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,462 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {29992#true} {30100#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {30100#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 11:01:26,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {30100#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30122#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 11:01:26,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {30122#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {30122#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 11:01:26,463 INFO L272 TraceCheckUtils]: 42: Hoare triple {30122#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,463 INFO L290 TraceCheckUtils]: 44: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,463 INFO L290 TraceCheckUtils]: 45: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,463 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29992#true} {30122#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {30122#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 11:01:26,463 INFO L290 TraceCheckUtils]: 47: Hoare triple {30122#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 11:01:26,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {30144#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {30144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 11:01:26,464 INFO L272 TraceCheckUtils]: 49: Hoare triple {30144#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,464 INFO L290 TraceCheckUtils]: 50: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,464 INFO L290 TraceCheckUtils]: 51: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,464 INFO L290 TraceCheckUtils]: 52: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,464 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29992#true} {30144#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {30144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 11:01:26,465 INFO L290 TraceCheckUtils]: 54: Hoare triple {30144#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30166#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 11:01:26,465 INFO L290 TraceCheckUtils]: 55: Hoare triple {30166#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {30166#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 11:01:26,465 INFO L272 TraceCheckUtils]: 56: Hoare triple {30166#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,465 INFO L290 TraceCheckUtils]: 57: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,465 INFO L290 TraceCheckUtils]: 58: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,466 INFO L290 TraceCheckUtils]: 59: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,466 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {29992#true} {30166#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {30166#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 11:01:26,466 INFO L290 TraceCheckUtils]: 61: Hoare triple {30166#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30188#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 11:01:26,466 INFO L290 TraceCheckUtils]: 62: Hoare triple {30188#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {30188#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 11:01:26,467 INFO L272 TraceCheckUtils]: 63: Hoare triple {30188#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,467 INFO L290 TraceCheckUtils]: 64: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,467 INFO L290 TraceCheckUtils]: 65: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,467 INFO L290 TraceCheckUtils]: 66: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,467 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {29992#true} {30188#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #50#return; {30188#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 11:01:26,467 INFO L290 TraceCheckUtils]: 68: Hoare triple {30188#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30210#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 11:01:26,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {30210#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !false; {30210#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 11:01:26,468 INFO L272 TraceCheckUtils]: 70: Hoare triple {30210#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,468 INFO L290 TraceCheckUtils]: 71: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,468 INFO L290 TraceCheckUtils]: 72: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,468 INFO L290 TraceCheckUtils]: 73: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,468 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29992#true} {30210#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #50#return; {30210#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 11:01:26,468 INFO L290 TraceCheckUtils]: 75: Hoare triple {30210#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30232#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 11:01:26,469 INFO L290 TraceCheckUtils]: 76: Hoare triple {30232#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {30232#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 11:01:26,469 INFO L272 TraceCheckUtils]: 77: Hoare triple {30232#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,469 INFO L290 TraceCheckUtils]: 78: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,469 INFO L290 TraceCheckUtils]: 79: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,469 INFO L290 TraceCheckUtils]: 80: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,469 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {29992#true} {30232#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {30232#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 11:01:26,470 INFO L290 TraceCheckUtils]: 82: Hoare triple {30232#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30254#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 11:01:26,470 INFO L290 TraceCheckUtils]: 83: Hoare triple {30254#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {30254#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 11:01:26,470 INFO L272 TraceCheckUtils]: 84: Hoare triple {30254#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,470 INFO L290 TraceCheckUtils]: 85: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,470 INFO L290 TraceCheckUtils]: 86: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,470 INFO L290 TraceCheckUtils]: 87: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,471 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {29992#true} {30254#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #50#return; {30254#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 11:01:26,471 INFO L290 TraceCheckUtils]: 89: Hoare triple {30254#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30276#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-08 11:01:26,471 INFO L290 TraceCheckUtils]: 90: Hoare triple {30276#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} assume !false; {30276#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-08 11:01:26,471 INFO L272 TraceCheckUtils]: 91: Hoare triple {30276#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,472 INFO L290 TraceCheckUtils]: 92: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,472 INFO L290 TraceCheckUtils]: 93: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,472 INFO L290 TraceCheckUtils]: 94: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,472 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {29992#true} {30276#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} #50#return; {30276#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-08 11:01:26,472 INFO L290 TraceCheckUtils]: 96: Hoare triple {30276#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30298#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-08 11:01:26,472 INFO L290 TraceCheckUtils]: 97: Hoare triple {30298#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} assume !false; {30298#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-08 11:01:26,473 INFO L272 TraceCheckUtils]: 98: Hoare triple {30298#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,473 INFO L290 TraceCheckUtils]: 99: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,473 INFO L290 TraceCheckUtils]: 100: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,473 INFO L290 TraceCheckUtils]: 101: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,473 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {29992#true} {30298#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} #50#return; {30298#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-08 11:01:26,473 INFO L290 TraceCheckUtils]: 103: Hoare triple {30298#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30320#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-08 11:01:26,473 INFO L290 TraceCheckUtils]: 104: Hoare triple {30320#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} assume !false; {30320#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-08 11:01:26,474 INFO L272 TraceCheckUtils]: 105: Hoare triple {30320#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,474 INFO L290 TraceCheckUtils]: 106: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,474 INFO L290 TraceCheckUtils]: 107: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,474 INFO L290 TraceCheckUtils]: 108: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,474 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {29992#true} {30320#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} #50#return; {30320#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-08 11:01:26,474 INFO L290 TraceCheckUtils]: 110: Hoare triple {30320#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30342#(and (= (+ main_~y~0 (- 5)) 10) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 11:01:26,475 INFO L290 TraceCheckUtils]: 111: Hoare triple {30342#(and (= (+ main_~y~0 (- 5)) 10) (= (+ (- 1) main_~c~0) 14))} assume !false; {30342#(and (= (+ main_~y~0 (- 5)) 10) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 11:01:26,475 INFO L272 TraceCheckUtils]: 112: Hoare triple {30342#(and (= (+ main_~y~0 (- 5)) 10) (= (+ (- 1) main_~c~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,475 INFO L290 TraceCheckUtils]: 113: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,475 INFO L290 TraceCheckUtils]: 114: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,475 INFO L290 TraceCheckUtils]: 115: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,475 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {29992#true} {30342#(and (= (+ main_~y~0 (- 5)) 10) (= (+ (- 1) main_~c~0) 14))} #50#return; {30342#(and (= (+ main_~y~0 (- 5)) 10) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 11:01:26,475 INFO L290 TraceCheckUtils]: 117: Hoare triple {30342#(and (= (+ main_~y~0 (- 5)) 10) (= (+ (- 1) main_~c~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30364#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 11:01:26,476 INFO L290 TraceCheckUtils]: 118: Hoare triple {30364#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} assume !false; {30364#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 11:01:26,476 INFO L272 TraceCheckUtils]: 119: Hoare triple {30364#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,476 INFO L290 TraceCheckUtils]: 120: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,476 INFO L290 TraceCheckUtils]: 121: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,476 INFO L290 TraceCheckUtils]: 122: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,476 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {29992#true} {30364#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} #50#return; {30364#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 11:01:26,476 INFO L290 TraceCheckUtils]: 124: Hoare triple {30364#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30386#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-08 11:01:26,477 INFO L290 TraceCheckUtils]: 125: Hoare triple {30386#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} assume !false; {30386#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-08 11:01:26,477 INFO L272 TraceCheckUtils]: 126: Hoare triple {30386#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,477 INFO L290 TraceCheckUtils]: 127: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,477 INFO L290 TraceCheckUtils]: 128: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,477 INFO L290 TraceCheckUtils]: 129: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,477 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29992#true} {30386#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} #50#return; {30386#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-08 11:01:26,478 INFO L290 TraceCheckUtils]: 131: Hoare triple {30386#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30408#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 11:01:26,478 INFO L290 TraceCheckUtils]: 132: Hoare triple {30408#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {30408#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 11:01:26,478 INFO L272 TraceCheckUtils]: 133: Hoare triple {30408#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,478 INFO L290 TraceCheckUtils]: 134: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,478 INFO L290 TraceCheckUtils]: 135: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,478 INFO L290 TraceCheckUtils]: 136: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,478 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {29992#true} {30408#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #50#return; {30408#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 11:01:26,479 INFO L290 TraceCheckUtils]: 138: Hoare triple {30408#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30430#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 11:01:26,479 INFO L290 TraceCheckUtils]: 139: Hoare triple {30430#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !false; {30430#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 11:01:26,479 INFO L272 TraceCheckUtils]: 140: Hoare triple {30430#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,479 INFO L290 TraceCheckUtils]: 141: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,479 INFO L290 TraceCheckUtils]: 142: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,479 INFO L290 TraceCheckUtils]: 143: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,480 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {29992#true} {30430#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} #50#return; {30430#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 11:01:26,481 INFO L290 TraceCheckUtils]: 145: Hoare triple {30430#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30452#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 11:01:26,481 INFO L290 TraceCheckUtils]: 146: Hoare triple {30452#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {30452#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 11:01:26,481 INFO L272 TraceCheckUtils]: 147: Hoare triple {30452#(and (= main_~c~0 20) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,481 INFO L290 TraceCheckUtils]: 148: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,481 INFO L290 TraceCheckUtils]: 149: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,481 INFO L290 TraceCheckUtils]: 150: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,481 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {29992#true} {30452#(and (= main_~c~0 20) (= main_~y~0 20))} #50#return; {30452#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 11:01:26,482 INFO L290 TraceCheckUtils]: 152: Hoare triple {30452#(and (= main_~c~0 20) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30474#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-08 11:01:26,482 INFO L290 TraceCheckUtils]: 153: Hoare triple {30474#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} assume !false; {30474#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-08 11:01:26,482 INFO L272 TraceCheckUtils]: 154: Hoare triple {30474#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,482 INFO L290 TraceCheckUtils]: 155: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,482 INFO L290 TraceCheckUtils]: 156: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,482 INFO L290 TraceCheckUtils]: 157: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,482 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {29992#true} {30474#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} #50#return; {30474#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-08 11:01:26,483 INFO L290 TraceCheckUtils]: 159: Hoare triple {30474#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30496#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:01:26,483 INFO L290 TraceCheckUtils]: 160: Hoare triple {30496#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} assume !false; {30496#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:01:26,483 INFO L272 TraceCheckUtils]: 161: Hoare triple {30496#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,483 INFO L290 TraceCheckUtils]: 162: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,496 INFO L290 TraceCheckUtils]: 163: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,496 INFO L290 TraceCheckUtils]: 164: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,497 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {29992#true} {30496#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} #50#return; {30496#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:01:26,497 INFO L290 TraceCheckUtils]: 166: Hoare triple {30496#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30518#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 11:01:26,497 INFO L290 TraceCheckUtils]: 167: Hoare triple {30518#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {30518#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 11:01:26,497 INFO L272 TraceCheckUtils]: 168: Hoare triple {30518#(and (= 23 main_~y~0) (= 23 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,497 INFO L290 TraceCheckUtils]: 169: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,497 INFO L290 TraceCheckUtils]: 170: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,497 INFO L290 TraceCheckUtils]: 171: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,498 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {29992#true} {30518#(and (= 23 main_~y~0) (= 23 main_~c~0))} #50#return; {30518#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 11:01:26,498 INFO L290 TraceCheckUtils]: 173: Hoare triple {30518#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30540#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 11:01:26,498 INFO L290 TraceCheckUtils]: 174: Hoare triple {30540#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {30540#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 11:01:26,498 INFO L272 TraceCheckUtils]: 175: Hoare triple {30540#(and (= main_~c~0 24) (= main_~y~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,498 INFO L290 TraceCheckUtils]: 176: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,498 INFO L290 TraceCheckUtils]: 177: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,498 INFO L290 TraceCheckUtils]: 178: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,499 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {29992#true} {30540#(and (= main_~c~0 24) (= main_~y~0 24))} #50#return; {30540#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 11:01:26,499 INFO L290 TraceCheckUtils]: 180: Hoare triple {30540#(and (= main_~c~0 24) (= main_~y~0 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30562#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 11:01:26,499 INFO L290 TraceCheckUtils]: 181: Hoare triple {30562#(and (= main_~y~0 25) (= main_~c~0 25))} assume !false; {30562#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 11:01:26,499 INFO L272 TraceCheckUtils]: 182: Hoare triple {30562#(and (= main_~y~0 25) (= main_~c~0 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,499 INFO L290 TraceCheckUtils]: 183: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,499 INFO L290 TraceCheckUtils]: 184: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,499 INFO L290 TraceCheckUtils]: 185: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,500 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {29992#true} {30562#(and (= main_~y~0 25) (= main_~c~0 25))} #50#return; {30562#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 11:01:26,500 INFO L290 TraceCheckUtils]: 187: Hoare triple {30562#(and (= main_~y~0 25) (= main_~c~0 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30584#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 11:01:26,500 INFO L290 TraceCheckUtils]: 188: Hoare triple {30584#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} assume !false; {30584#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 11:01:26,500 INFO L272 TraceCheckUtils]: 189: Hoare triple {30584#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,500 INFO L290 TraceCheckUtils]: 190: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,500 INFO L290 TraceCheckUtils]: 191: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,501 INFO L290 TraceCheckUtils]: 192: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,501 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {29992#true} {30584#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} #50#return; {30584#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 11:01:26,501 INFO L290 TraceCheckUtils]: 194: Hoare triple {30584#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30606#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} is VALID [2022-04-08 11:01:26,501 INFO L290 TraceCheckUtils]: 195: Hoare triple {30606#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} assume !false; {30606#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} is VALID [2022-04-08 11:01:26,501 INFO L272 TraceCheckUtils]: 196: Hoare triple {30606#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,501 INFO L290 TraceCheckUtils]: 197: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,502 INFO L290 TraceCheckUtils]: 198: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,502 INFO L290 TraceCheckUtils]: 199: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,502 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {29992#true} {30606#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} #50#return; {30606#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} is VALID [2022-04-08 11:01:26,502 INFO L290 TraceCheckUtils]: 201: Hoare triple {30606#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30628#(and (= (+ main_~c~0 (- 3)) 25) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 11:01:26,502 INFO L290 TraceCheckUtils]: 202: Hoare triple {30628#(and (= (+ main_~c~0 (- 3)) 25) (= (+ (- 1) main_~y~0) 27))} assume !false; {30628#(and (= (+ main_~c~0 (- 3)) 25) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 11:01:26,502 INFO L272 TraceCheckUtils]: 203: Hoare triple {30628#(and (= (+ main_~c~0 (- 3)) 25) (= (+ (- 1) main_~y~0) 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,503 INFO L290 TraceCheckUtils]: 204: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,503 INFO L290 TraceCheckUtils]: 205: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,503 INFO L290 TraceCheckUtils]: 206: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,503 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {29992#true} {30628#(and (= (+ main_~c~0 (- 3)) 25) (= (+ (- 1) main_~y~0) 27))} #50#return; {30628#(and (= (+ main_~c~0 (- 3)) 25) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 11:01:26,503 INFO L290 TraceCheckUtils]: 208: Hoare triple {30628#(and (= (+ main_~c~0 (- 3)) 25) (= (+ (- 1) main_~y~0) 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30650#(and (= 25 (+ main_~c~0 (- 4))) (= 29 main_~y~0))} is VALID [2022-04-08 11:01:26,503 INFO L290 TraceCheckUtils]: 209: Hoare triple {30650#(and (= 25 (+ main_~c~0 (- 4))) (= 29 main_~y~0))} assume !false; {30650#(and (= 25 (+ main_~c~0 (- 4))) (= 29 main_~y~0))} is VALID [2022-04-08 11:01:26,504 INFO L272 TraceCheckUtils]: 210: Hoare triple {30650#(and (= 25 (+ main_~c~0 (- 4))) (= 29 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,504 INFO L290 TraceCheckUtils]: 211: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,504 INFO L290 TraceCheckUtils]: 212: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,504 INFO L290 TraceCheckUtils]: 213: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,504 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {29992#true} {30650#(and (= 25 (+ main_~c~0 (- 4))) (= 29 main_~y~0))} #50#return; {30650#(and (= 25 (+ main_~c~0 (- 4))) (= 29 main_~y~0))} is VALID [2022-04-08 11:01:26,504 INFO L290 TraceCheckUtils]: 215: Hoare triple {30650#(and (= 25 (+ main_~c~0 (- 4))) (= 29 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30672#(and (= (+ main_~c~0 (- 5)) 25) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:01:26,505 INFO L290 TraceCheckUtils]: 216: Hoare triple {30672#(and (= (+ main_~c~0 (- 5)) 25) (= 29 (+ (- 1) main_~y~0)))} assume !false; {30672#(and (= (+ main_~c~0 (- 5)) 25) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:01:26,505 INFO L272 TraceCheckUtils]: 217: Hoare triple {30672#(and (= (+ main_~c~0 (- 5)) 25) (= 29 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,505 INFO L290 TraceCheckUtils]: 218: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,505 INFO L290 TraceCheckUtils]: 219: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,505 INFO L290 TraceCheckUtils]: 220: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,505 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {29992#true} {30672#(and (= (+ main_~c~0 (- 5)) 25) (= 29 (+ (- 1) main_~y~0)))} #50#return; {30672#(and (= (+ main_~c~0 (- 5)) 25) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:01:26,505 INFO L290 TraceCheckUtils]: 222: Hoare triple {30672#(and (= (+ main_~c~0 (- 5)) 25) (= 29 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30694#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-08 11:01:26,506 INFO L290 TraceCheckUtils]: 223: Hoare triple {30694#(and (= main_~y~0 31) (= main_~c~0 31))} assume !false; {30694#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-08 11:01:26,506 INFO L272 TraceCheckUtils]: 224: Hoare triple {30694#(and (= main_~y~0 31) (= main_~c~0 31))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,506 INFO L290 TraceCheckUtils]: 225: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,506 INFO L290 TraceCheckUtils]: 226: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,506 INFO L290 TraceCheckUtils]: 227: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,506 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {29992#true} {30694#(and (= main_~y~0 31) (= main_~c~0 31))} #50#return; {30694#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-08 11:01:26,506 INFO L290 TraceCheckUtils]: 229: Hoare triple {30694#(and (= main_~y~0 31) (= main_~c~0 31))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30716#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-08 11:01:26,507 INFO L290 TraceCheckUtils]: 230: Hoare triple {30716#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} assume !false; {30716#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-08 11:01:26,507 INFO L272 TraceCheckUtils]: 231: Hoare triple {30716#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 11:01:26,507 INFO L290 TraceCheckUtils]: 232: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 11:01:26,507 INFO L290 TraceCheckUtils]: 233: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 11:01:26,507 INFO L290 TraceCheckUtils]: 234: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 11:01:26,507 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {29992#true} {30716#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} #50#return; {30716#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-08 11:01:26,511 INFO L290 TraceCheckUtils]: 236: Hoare triple {30716#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} assume !(~c~0 < ~k~0); {30738#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~k~0 32))} is VALID [2022-04-08 11:01:26,511 INFO L272 TraceCheckUtils]: 237: Hoare triple {30738#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~k~0 32))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {30742#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:01:26,512 INFO L290 TraceCheckUtils]: 238: Hoare triple {30742#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30746#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:01:26,512 INFO L290 TraceCheckUtils]: 239: Hoare triple {30746#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29993#false} is VALID [2022-04-08 11:01:26,512 INFO L290 TraceCheckUtils]: 240: Hoare triple {29993#false} assume !false; {29993#false} is VALID [2022-04-08 11:01:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3762 backedges. 66 proven. 1584 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2022-04-08 11:01:26,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:01:26,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:01:26,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703210121] [2022-04-08 11:01:26,877 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:01:26,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401055845] [2022-04-08 11:01:26,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401055845] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:01:26,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:01:26,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2022-04-08 11:01:26,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:01:26,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [269621532] [2022-04-08 11:01:26,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [269621532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:01:26,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:01:26,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-08 11:01:26,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789706109] [2022-04-08 11:01:26,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:01:26,878 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 35 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Word has length 241 [2022-04-08 11:01:26,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:01:26,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 35 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 11:01:27,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:01:27,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-08 11:01:27,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:01:27,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-08 11:01:27,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 11:01:27,447 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 35 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 11:01:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:01:52,499 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2022-04-08 11:01:52,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 11:01:52,499 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 35 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Word has length 241 [2022-04-08 11:01:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:01:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 35 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 11:01:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 154 transitions. [2022-04-08 11:01:52,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 35 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 11:01:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 154 transitions. [2022-04-08 11:01:52,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 154 transitions. [2022-04-08 11:01:53,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:01:53,177 INFO L225 Difference]: With dead ends: 126 [2022-04-08 11:01:53,177 INFO L226 Difference]: Without dead ends: 121 [2022-04-08 11:01:53,177 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=1679, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 11:01:53,178 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 3611 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 3611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:01:53,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1727 Invalid, 3611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3611 Invalid, 0 Unknown, 0 Unchecked, 13.0s Time] [2022-04-08 11:01:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-08 11:01:53,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-04-08 11:01:53,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:01:53,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 37 states have call successors, (37), 5 states have call predecessors, (37), 3 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 11:01:53,320 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 37 states have call successors, (37), 5 states have call predecessors, (37), 3 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 11:01:53,320 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 37 states have call successors, (37), 5 states have call predecessors, (37), 3 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 11:01:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:01:53,322 INFO L93 Difference]: Finished difference Result 121 states and 153 transitions. [2022-04-08 11:01:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2022-04-08 11:01:53,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:01:53,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:01:53,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 37 states have call successors, (37), 5 states have call predecessors, (37), 3 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 121 states. [2022-04-08 11:01:53,322 INFO L87 Difference]: Start difference. First operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 37 states have call successors, (37), 5 states have call predecessors, (37), 3 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 121 states. [2022-04-08 11:01:53,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:01:53,324 INFO L93 Difference]: Finished difference Result 121 states and 153 transitions. [2022-04-08 11:01:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2022-04-08 11:01:53,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:01:53,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:01:53,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:01:53,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:01:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 37 states have call successors, (37), 5 states have call predecessors, (37), 3 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 11:01:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions. [2022-04-08 11:01:53,327 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 241 [2022-04-08 11:01:53,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:01:53,327 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions. [2022-04-08 11:01:53,327 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 35 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 11:01:53,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 153 transitions. [2022-04-08 11:01:54,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:01:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2022-04-08 11:01:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-04-08 11:01:54,432 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:01:54,432 INFO L499 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:01:54,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-08 11:01:54,632 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-08 11:01:54,632 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:01:54,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:01:54,633 INFO L85 PathProgramCache]: Analyzing trace with hash 758613733, now seen corresponding path program 65 times [2022-04-08 11:01:54,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:01:54,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1989436253] [2022-04-08 11:01:54,725 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:01:54,726 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:01:54,726 INFO L85 PathProgramCache]: Analyzing trace with hash 758613733, now seen corresponding path program 66 times [2022-04-08 11:01:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:01:54,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468405252] [2022-04-08 11:01:54,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:01:54,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:01:54,742 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:01:54,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [83894550] [2022-04-08 11:01:54,742 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:01:54,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:01:54,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:01:54,743 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:01:54,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-08 11:02:14,484 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2022-04-08 11:02:14,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:02:14,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 141 conjunts are in the unsatisfiable core [2022-04-08 11:02:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:02:14,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:02:16,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {31534#true} call ULTIMATE.init(); {31534#true} is VALID [2022-04-08 11:02:16,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {31534#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(9, 2);call #Ultimate.allocInit(12, 3); {31534#true} is VALID [2022-04-08 11:02:16,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31534#true} {31534#true} #56#return; {31534#true} is VALID [2022-04-08 11:02:16,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {31534#true} call #t~ret5 := main(); {31534#true} is VALID [2022-04-08 11:02:16,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {31534#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {31554#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:02:16,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {31554#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {31554#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:02:16,049 INFO L272 TraceCheckUtils]: 7: Hoare triple {31554#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,050 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {31534#true} {31554#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {31554#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:02:16,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {31554#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31576#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 11:02:16,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {31576#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {31576#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 11:02:16,051 INFO L272 TraceCheckUtils]: 14: Hoare triple {31576#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,051 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {31534#true} {31576#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #50#return; {31576#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 11:02:16,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {31576#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31598#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {31598#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} assume !false; {31598#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,052 INFO L272 TraceCheckUtils]: 21: Hoare triple {31598#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,052 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {31534#true} {31598#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} #50#return; {31598#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {31598#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31620#(and (= (+ (- 2) main_~y~0) 1) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 11:02:16,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {31620#(and (= (+ (- 2) main_~y~0) 1) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {31620#(and (= (+ (- 2) main_~y~0) 1) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 11:02:16,053 INFO L272 TraceCheckUtils]: 28: Hoare triple {31620#(and (= (+ (- 2) main_~y~0) 1) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,053 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {31534#true} {31620#(and (= (+ (- 2) main_~y~0) 1) (< 0 main_~k~0) (= main_~c~0 3))} #50#return; {31620#(and (= (+ (- 2) main_~y~0) 1) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 11:02:16,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {31620#(and (= (+ (- 2) main_~y~0) 1) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31642#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {31642#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0))} assume !false; {31642#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,054 INFO L272 TraceCheckUtils]: 35: Hoare triple {31642#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,054 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31534#true} {31642#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0))} #50#return; {31642#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {31642#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31664#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {31664#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {31664#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,055 INFO L272 TraceCheckUtils]: 42: Hoare triple {31664#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,055 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {31534#true} {31664#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} #50#return; {31664#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {31664#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31686#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {31686#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !false; {31686#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,056 INFO L272 TraceCheckUtils]: 49: Hoare triple {31686#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,056 INFO L290 TraceCheckUtils]: 51: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,056 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {31534#true} {31686#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} #50#return; {31686#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {31686#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31708#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,057 INFO L290 TraceCheckUtils]: 55: Hoare triple {31708#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {31708#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,057 INFO L272 TraceCheckUtils]: 56: Hoare triple {31708#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,057 INFO L290 TraceCheckUtils]: 57: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,057 INFO L290 TraceCheckUtils]: 59: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,058 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {31534#true} {31708#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #50#return; {31708#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,058 INFO L290 TraceCheckUtils]: 61: Hoare triple {31708#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31730#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,058 INFO L290 TraceCheckUtils]: 62: Hoare triple {31730#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} assume !false; {31730#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,058 INFO L272 TraceCheckUtils]: 63: Hoare triple {31730#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,058 INFO L290 TraceCheckUtils]: 64: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,058 INFO L290 TraceCheckUtils]: 65: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,058 INFO L290 TraceCheckUtils]: 66: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,059 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {31534#true} {31730#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} #50#return; {31730#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,059 INFO L290 TraceCheckUtils]: 68: Hoare triple {31730#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31752#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,059 INFO L290 TraceCheckUtils]: 69: Hoare triple {31752#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {31752#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,059 INFO L272 TraceCheckUtils]: 70: Hoare triple {31752#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,059 INFO L290 TraceCheckUtils]: 71: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,059 INFO L290 TraceCheckUtils]: 72: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,059 INFO L290 TraceCheckUtils]: 73: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,060 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {31534#true} {31752#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} #50#return; {31752#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,060 INFO L290 TraceCheckUtils]: 75: Hoare triple {31752#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31774#(and (= (+ main_~y~0 (- 4)) 6) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-08 11:02:16,060 INFO L290 TraceCheckUtils]: 76: Hoare triple {31774#(and (= (+ main_~y~0 (- 4)) 6) (< 0 main_~k~0) (= main_~c~0 10))} assume !false; {31774#(and (= (+ main_~y~0 (- 4)) 6) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-08 11:02:16,060 INFO L272 TraceCheckUtils]: 77: Hoare triple {31774#(and (= (+ main_~y~0 (- 4)) 6) (< 0 main_~k~0) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,060 INFO L290 TraceCheckUtils]: 78: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,061 INFO L290 TraceCheckUtils]: 79: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,061 INFO L290 TraceCheckUtils]: 80: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,061 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {31534#true} {31774#(and (= (+ main_~y~0 (- 4)) 6) (< 0 main_~k~0) (= main_~c~0 10))} #50#return; {31774#(and (= (+ main_~y~0 (- 4)) 6) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-08 11:02:16,061 INFO L290 TraceCheckUtils]: 82: Hoare triple {31774#(and (= (+ main_~y~0 (- 4)) 6) (< 0 main_~k~0) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31796#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,061 INFO L290 TraceCheckUtils]: 83: Hoare triple {31796#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} assume !false; {31796#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,061 INFO L272 TraceCheckUtils]: 84: Hoare triple {31796#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,062 INFO L290 TraceCheckUtils]: 85: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,062 INFO L290 TraceCheckUtils]: 86: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,062 INFO L290 TraceCheckUtils]: 87: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,062 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {31534#true} {31796#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} #50#return; {31796#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,062 INFO L290 TraceCheckUtils]: 89: Hoare triple {31796#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31818#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,062 INFO L290 TraceCheckUtils]: 90: Hoare triple {31818#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11) (< 0 main_~k~0))} assume !false; {31818#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,063 INFO L272 TraceCheckUtils]: 91: Hoare triple {31818#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,063 INFO L290 TraceCheckUtils]: 92: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,063 INFO L290 TraceCheckUtils]: 93: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,063 INFO L290 TraceCheckUtils]: 94: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,063 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {31534#true} {31818#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11) (< 0 main_~k~0))} #50#return; {31818#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,063 INFO L290 TraceCheckUtils]: 96: Hoare triple {31818#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31840#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 11:02:16,064 INFO L290 TraceCheckUtils]: 97: Hoare triple {31840#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {31840#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 11:02:16,064 INFO L272 TraceCheckUtils]: 98: Hoare triple {31840#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,064 INFO L290 TraceCheckUtils]: 99: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,064 INFO L290 TraceCheckUtils]: 100: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,064 INFO L290 TraceCheckUtils]: 101: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,064 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {31534#true} {31840#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} #50#return; {31840#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 11:02:16,064 INFO L290 TraceCheckUtils]: 103: Hoare triple {31840#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31862#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,065 INFO L290 TraceCheckUtils]: 104: Hoare triple {31862#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} assume !false; {31862#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,065 INFO L272 TraceCheckUtils]: 105: Hoare triple {31862#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,065 INFO L290 TraceCheckUtils]: 106: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,065 INFO L290 TraceCheckUtils]: 107: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,065 INFO L290 TraceCheckUtils]: 108: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,065 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {31534#true} {31862#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} #50#return; {31862#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,065 INFO L290 TraceCheckUtils]: 110: Hoare triple {31862#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31884#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,066 INFO L290 TraceCheckUtils]: 111: Hoare triple {31884#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} assume !false; {31884#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,066 INFO L272 TraceCheckUtils]: 112: Hoare triple {31884#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,066 INFO L290 TraceCheckUtils]: 113: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,066 INFO L290 TraceCheckUtils]: 114: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,066 INFO L290 TraceCheckUtils]: 115: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,066 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {31534#true} {31884#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} #50#return; {31884#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,067 INFO L290 TraceCheckUtils]: 117: Hoare triple {31884#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31906#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,067 INFO L290 TraceCheckUtils]: 118: Hoare triple {31906#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 0 main_~k~0))} assume !false; {31906#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,067 INFO L272 TraceCheckUtils]: 119: Hoare triple {31906#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,067 INFO L290 TraceCheckUtils]: 120: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,067 INFO L290 TraceCheckUtils]: 121: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,067 INFO L290 TraceCheckUtils]: 122: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,067 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {31534#true} {31906#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 0 main_~k~0))} #50#return; {31906#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,068 INFO L290 TraceCheckUtils]: 124: Hoare triple {31906#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31928#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-08 11:02:16,068 INFO L290 TraceCheckUtils]: 125: Hoare triple {31928#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !false; {31928#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-08 11:02:16,068 INFO L272 TraceCheckUtils]: 126: Hoare triple {31928#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,068 INFO L290 TraceCheckUtils]: 127: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,068 INFO L290 TraceCheckUtils]: 128: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,068 INFO L290 TraceCheckUtils]: 129: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,068 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {31534#true} {31928#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} #50#return; {31928#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-08 11:02:16,069 INFO L290 TraceCheckUtils]: 131: Hoare triple {31928#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31950#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 11:02:16,069 INFO L290 TraceCheckUtils]: 132: Hoare triple {31950#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !false; {31950#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 11:02:16,069 INFO L272 TraceCheckUtils]: 133: Hoare triple {31950#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,069 INFO L290 TraceCheckUtils]: 134: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,069 INFO L290 TraceCheckUtils]: 135: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,069 INFO L290 TraceCheckUtils]: 136: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,070 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {31534#true} {31950#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} #50#return; {31950#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 11:02:16,070 INFO L290 TraceCheckUtils]: 138: Hoare triple {31950#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31972#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 11:02:16,070 INFO L290 TraceCheckUtils]: 139: Hoare triple {31972#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {31972#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 11:02:16,070 INFO L272 TraceCheckUtils]: 140: Hoare triple {31972#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,070 INFO L290 TraceCheckUtils]: 141: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,070 INFO L290 TraceCheckUtils]: 142: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,070 INFO L290 TraceCheckUtils]: 143: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,071 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {31534#true} {31972#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} #50#return; {31972#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 11:02:16,071 INFO L290 TraceCheckUtils]: 145: Hoare triple {31972#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31994#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,071 INFO L290 TraceCheckUtils]: 146: Hoare triple {31994#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} assume !false; {31994#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,071 INFO L272 TraceCheckUtils]: 147: Hoare triple {31994#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,071 INFO L290 TraceCheckUtils]: 148: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,071 INFO L290 TraceCheckUtils]: 149: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,071 INFO L290 TraceCheckUtils]: 150: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,072 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {31534#true} {31994#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} #50#return; {31994#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,072 INFO L290 TraceCheckUtils]: 152: Hoare triple {31994#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32016#(and (= (+ main_~c~0 (- 3)) 18) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,072 INFO L290 TraceCheckUtils]: 153: Hoare triple {32016#(and (= (+ main_~c~0 (- 3)) 18) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} assume !false; {32016#(and (= (+ main_~c~0 (- 3)) 18) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,072 INFO L272 TraceCheckUtils]: 154: Hoare triple {32016#(and (= (+ main_~c~0 (- 3)) 18) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,072 INFO L290 TraceCheckUtils]: 155: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,073 INFO L290 TraceCheckUtils]: 156: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,073 INFO L290 TraceCheckUtils]: 157: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,073 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {31534#true} {32016#(and (= (+ main_~c~0 (- 3)) 18) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} #50#return; {32016#(and (= (+ main_~c~0 (- 3)) 18) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,073 INFO L290 TraceCheckUtils]: 159: Hoare triple {32016#(and (= (+ main_~c~0 (- 3)) 18) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32038#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,073 INFO L290 TraceCheckUtils]: 160: Hoare triple {32038#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} assume !false; {32038#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,073 INFO L272 TraceCheckUtils]: 161: Hoare triple {32038#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,074 INFO L290 TraceCheckUtils]: 162: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,074 INFO L290 TraceCheckUtils]: 163: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,074 INFO L290 TraceCheckUtils]: 164: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,074 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {31534#true} {32038#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} #50#return; {32038#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,074 INFO L290 TraceCheckUtils]: 166: Hoare triple {32038#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32060#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:02:16,075 INFO L290 TraceCheckUtils]: 167: Hoare triple {32060#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} assume !false; {32060#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:02:16,075 INFO L272 TraceCheckUtils]: 168: Hoare triple {32060#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,075 INFO L290 TraceCheckUtils]: 169: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,075 INFO L290 TraceCheckUtils]: 170: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,075 INFO L290 TraceCheckUtils]: 171: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,075 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {31534#true} {32060#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} #50#return; {32060#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:02:16,075 INFO L290 TraceCheckUtils]: 173: Hoare triple {32060#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32082#(and (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:02:16,076 INFO L290 TraceCheckUtils]: 174: Hoare triple {32082#(and (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0) (= 23 (+ (- 1) main_~c~0)))} assume !false; {32082#(and (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:02:16,076 INFO L272 TraceCheckUtils]: 175: Hoare triple {32082#(and (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0) (= 23 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,076 INFO L290 TraceCheckUtils]: 176: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,076 INFO L290 TraceCheckUtils]: 177: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,076 INFO L290 TraceCheckUtils]: 178: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,076 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {31534#true} {32082#(and (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0) (= 23 (+ (- 1) main_~c~0)))} #50#return; {32082#(and (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:02:16,077 INFO L290 TraceCheckUtils]: 180: Hoare triple {32082#(and (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0) (= 23 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32104#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,077 INFO L290 TraceCheckUtils]: 181: Hoare triple {32104#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22) (< 0 main_~k~0))} assume !false; {32104#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,077 INFO L272 TraceCheckUtils]: 182: Hoare triple {32104#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,077 INFO L290 TraceCheckUtils]: 183: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,077 INFO L290 TraceCheckUtils]: 184: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,077 INFO L290 TraceCheckUtils]: 185: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,077 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {31534#true} {32104#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22) (< 0 main_~k~0))} #50#return; {32104#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,078 INFO L290 TraceCheckUtils]: 187: Hoare triple {32104#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32126#(and (= (+ main_~y~0 (- 4)) 22) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-08 11:02:16,078 INFO L290 TraceCheckUtils]: 188: Hoare triple {32126#(and (= (+ main_~y~0 (- 4)) 22) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25))} assume !false; {32126#(and (= (+ main_~y~0 (- 4)) 22) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-08 11:02:16,078 INFO L272 TraceCheckUtils]: 189: Hoare triple {32126#(and (= (+ main_~y~0 (- 4)) 22) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,078 INFO L290 TraceCheckUtils]: 190: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,078 INFO L290 TraceCheckUtils]: 191: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,078 INFO L290 TraceCheckUtils]: 192: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,078 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {31534#true} {32126#(and (= (+ main_~y~0 (- 4)) 22) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25))} #50#return; {32126#(and (= (+ main_~y~0 (- 4)) 22) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-08 11:02:16,079 INFO L290 TraceCheckUtils]: 194: Hoare triple {32126#(and (= (+ main_~y~0 (- 4)) 22) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32148#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,079 INFO L290 TraceCheckUtils]: 195: Hoare triple {32148#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27) (< 0 main_~k~0))} assume !false; {32148#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,079 INFO L272 TraceCheckUtils]: 196: Hoare triple {32148#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,079 INFO L290 TraceCheckUtils]: 197: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,079 INFO L290 TraceCheckUtils]: 198: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,079 INFO L290 TraceCheckUtils]: 199: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,080 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {31534#true} {32148#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27) (< 0 main_~k~0))} #50#return; {32148#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,080 INFO L290 TraceCheckUtils]: 201: Hoare triple {32148#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32170#(and (= (+ (- 1) main_~c~0) 27) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 22))} is VALID [2022-04-08 11:02:16,080 INFO L290 TraceCheckUtils]: 202: Hoare triple {32170#(and (= (+ (- 1) main_~c~0) 27) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 22))} assume !false; {32170#(and (= (+ (- 1) main_~c~0) 27) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 22))} is VALID [2022-04-08 11:02:16,080 INFO L272 TraceCheckUtils]: 203: Hoare triple {32170#(and (= (+ (- 1) main_~c~0) 27) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,080 INFO L290 TraceCheckUtils]: 204: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,080 INFO L290 TraceCheckUtils]: 205: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,080 INFO L290 TraceCheckUtils]: 206: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,081 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {31534#true} {32170#(and (= (+ (- 1) main_~c~0) 27) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 22))} #50#return; {32170#(and (= (+ (- 1) main_~c~0) 27) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 22))} is VALID [2022-04-08 11:02:16,081 INFO L290 TraceCheckUtils]: 208: Hoare triple {32170#(and (= (+ (- 1) main_~c~0) 27) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32192#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,081 INFO L290 TraceCheckUtils]: 209: Hoare triple {32192#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} assume !false; {32192#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,081 INFO L272 TraceCheckUtils]: 210: Hoare triple {32192#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,081 INFO L290 TraceCheckUtils]: 211: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,081 INFO L290 TraceCheckUtils]: 212: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,081 INFO L290 TraceCheckUtils]: 213: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,082 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {31534#true} {32192#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} #50#return; {32192#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,082 INFO L290 TraceCheckUtils]: 215: Hoare triple {32192#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32214#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,082 INFO L290 TraceCheckUtils]: 216: Hoare triple {32214#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29) (< 0 main_~k~0))} assume !false; {32214#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,082 INFO L272 TraceCheckUtils]: 217: Hoare triple {32214#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,082 INFO L290 TraceCheckUtils]: 218: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,082 INFO L290 TraceCheckUtils]: 219: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,083 INFO L290 TraceCheckUtils]: 220: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,083 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {31534#true} {32214#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29) (< 0 main_~k~0))} #50#return; {32214#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,083 INFO L290 TraceCheckUtils]: 222: Hoare triple {32214#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32236#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,083 INFO L290 TraceCheckUtils]: 223: Hoare triple {32236#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {32236#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,083 INFO L272 TraceCheckUtils]: 224: Hoare triple {32236#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,084 INFO L290 TraceCheckUtils]: 225: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,084 INFO L290 TraceCheckUtils]: 226: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,084 INFO L290 TraceCheckUtils]: 227: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,084 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {31534#true} {32236#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #50#return; {32236#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,084 INFO L290 TraceCheckUtils]: 229: Hoare triple {32236#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32258#(and (= 29 (+ main_~c~0 (- 3))) (= 31 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,085 INFO L290 TraceCheckUtils]: 230: Hoare triple {32258#(and (= 29 (+ main_~c~0 (- 3))) (= 31 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {32258#(and (= 29 (+ main_~c~0 (- 3))) (= 31 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,085 INFO L272 TraceCheckUtils]: 231: Hoare triple {32258#(and (= 29 (+ main_~c~0 (- 3))) (= 31 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,085 INFO L290 TraceCheckUtils]: 232: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,085 INFO L290 TraceCheckUtils]: 233: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,085 INFO L290 TraceCheckUtils]: 234: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,085 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {31534#true} {32258#(and (= 29 (+ main_~c~0 (- 3))) (= 31 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #50#return; {32258#(and (= 29 (+ main_~c~0 (- 3))) (= 31 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 11:02:16,085 INFO L290 TraceCheckUtils]: 236: Hoare triple {32258#(and (= 29 (+ main_~c~0 (- 3))) (= 31 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32280#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-08 11:02:16,086 INFO L290 TraceCheckUtils]: 237: Hoare triple {32280#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} assume !false; {32280#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-08 11:02:16,086 INFO L272 TraceCheckUtils]: 238: Hoare triple {32280#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 11:02:16,086 INFO L290 TraceCheckUtils]: 239: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 11:02:16,086 INFO L290 TraceCheckUtils]: 240: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 11:02:16,086 INFO L290 TraceCheckUtils]: 241: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 11:02:16,086 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {31534#true} {32280#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} #50#return; {32280#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-08 11:02:16,087 INFO L290 TraceCheckUtils]: 243: Hoare triple {32280#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} assume !(~c~0 < ~k~0); {32302#(and (= main_~y~0 33) (<= main_~k~0 33) (< 32 main_~k~0))} is VALID [2022-04-08 11:02:16,087 INFO L272 TraceCheckUtils]: 244: Hoare triple {32302#(and (= main_~y~0 33) (<= main_~k~0 33) (< 32 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {32306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:02:16,087 INFO L290 TraceCheckUtils]: 245: Hoare triple {32306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:02:16,087 INFO L290 TraceCheckUtils]: 246: Hoare triple {32310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31535#false} is VALID [2022-04-08 11:02:16,087 INFO L290 TraceCheckUtils]: 247: Hoare triple {31535#false} assume !false; {31535#false} is VALID [2022-04-08 11:02:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3995 backedges. 68 proven. 1683 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2022-04-08 11:02:16,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:02:21,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:02:21,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468405252] [2022-04-08 11:02:21,153 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:02:21,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83894550] [2022-04-08 11:02:21,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83894550] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:02:21,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:02:21,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2022-04-08 11:02:21,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:02:21,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1989436253] [2022-04-08 11:02:21,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1989436253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:02:21,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:02:21,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-08 11:02:21,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298136905] [2022-04-08 11:02:21,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:02:21,154 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 36 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Word has length 248 [2022-04-08 11:02:21,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:02:21,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 36 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 11:02:21,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:02:21,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-08 11:02:21,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:02:21,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-08 11:02:21,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1241, Invalid=4161, Unknown=0, NotChecked=0, Total=5402 [2022-04-08 11:02:21,768 INFO L87 Difference]: Start difference. First operand 121 states and 153 transitions. Second operand has 39 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 36 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 11:02:52,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:02:52,070 INFO L93 Difference]: Finished difference Result 129 states and 162 transitions. [2022-04-08 11:02:52,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-08 11:02:52,070 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 36 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Word has length 248 [2022-04-08 11:02:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:02:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 36 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 11:02:52,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 158 transitions. [2022-04-08 11:02:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 36 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 11:02:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 158 transitions. [2022-04-08 11:02:52,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 158 transitions. [2022-04-08 11:02:52,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:02:52,821 INFO L225 Difference]: With dead ends: 129 [2022-04-08 11:02:52,822 INFO L226 Difference]: Without dead ends: 124 [2022-04-08 11:02:52,822 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1251, Invalid=4449, Unknown=0, NotChecked=0, Total=5700 [2022-04-08 11:02:52,822 INFO L913 BasicCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 3822 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 3822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-04-08 11:02:52,823 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1812 Invalid, 3822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3822 Invalid, 0 Unknown, 0 Unchecked, 15.6s Time] [2022-04-08 11:02:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-08 11:02:52,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-04-08 11:02:52,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:02:52,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 38 states have call successors, (38), 5 states have call predecessors, (38), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 11:02:52,965 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 38 states have call successors, (38), 5 states have call predecessors, (38), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 11:02:52,965 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 38 states have call successors, (38), 5 states have call predecessors, (38), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 11:02:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:02:52,967 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2022-04-08 11:02:52,967 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-04-08 11:02:52,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:02:52,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:02:52,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 38 states have call successors, (38), 5 states have call predecessors, (38), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 124 states. [2022-04-08 11:02:52,968 INFO L87 Difference]: Start difference. First operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 38 states have call successors, (38), 5 states have call predecessors, (38), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 124 states. [2022-04-08 11:02:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:02:52,970 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2022-04-08 11:02:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-04-08 11:02:52,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:02:52,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:02:52,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:02:52,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:02:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 38 states have call successors, (38), 5 states have call predecessors, (38), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 11:02:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 157 transitions. [2022-04-08 11:02:52,972 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 157 transitions. Word has length 248 [2022-04-08 11:02:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:02:52,972 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 157 transitions. [2022-04-08 11:02:52,973 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 36 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 11:02:52,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 157 transitions. [2022-04-08 11:02:54,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:02:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-04-08 11:02:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-04-08 11:02:54,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:02:54,095 INFO L499 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:02:54,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-08 11:02:54,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-08 11:02:54,295 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:02:54,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:02:54,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1333211282, now seen corresponding path program 67 times [2022-04-08 11:02:54,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:02:54,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [164727385] [2022-04-08 11:02:54,365 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:02:54,366 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:02:54,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1333211282, now seen corresponding path program 68 times [2022-04-08 11:02:54,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:02:54,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459680127] [2022-04-08 11:02:54,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:02:54,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:02:54,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:02:54,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1185051085] [2022-04-08 11:02:54,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:02:54,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:02:54,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:02:54,381 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:02:54,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-08 11:02:55,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:02:55,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:02:55,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 144 conjunts are in the unsatisfiable core [2022-04-08 11:02:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:02:55,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:02:56,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {33820#true} call ULTIMATE.init(); {33820#true} is VALID [2022-04-08 11:02:56,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {33820#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(9, 2);call #Ultimate.allocInit(12, 3); {33820#true} is VALID [2022-04-08 11:02:56,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33820#true} {33820#true} #56#return; {33820#true} is VALID [2022-04-08 11:02:56,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {33820#true} call #t~ret5 := main(); {33820#true} is VALID [2022-04-08 11:02:56,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {33820#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {33840#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:02:56,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {33840#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {33840#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:02:56,881 INFO L272 TraceCheckUtils]: 7: Hoare triple {33840#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,882 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {33820#true} {33840#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {33840#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:02:56,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {33840#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33862#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 11:02:56,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {33862#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {33862#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 11:02:56,882 INFO L272 TraceCheckUtils]: 14: Hoare triple {33862#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,883 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {33820#true} {33862#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {33862#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 11:02:56,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {33862#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33884#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 11:02:56,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {33884#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {33884#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 11:02:56,884 INFO L272 TraceCheckUtils]: 21: Hoare triple {33884#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,884 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {33820#true} {33884#(and (= main_~y~0 2) (= main_~c~0 2))} #50#return; {33884#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 11:02:56,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {33884#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33906#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 11:02:56,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {33906#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {33906#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 11:02:56,885 INFO L272 TraceCheckUtils]: 28: Hoare triple {33906#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,886 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {33820#true} {33906#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {33906#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 11:02:56,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {33906#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33928#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 11:02:56,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {33928#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {33928#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 11:02:56,886 INFO L272 TraceCheckUtils]: 35: Hoare triple {33928#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,887 INFO L290 TraceCheckUtils]: 36: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,887 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {33820#true} {33928#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {33928#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 11:02:56,887 INFO L290 TraceCheckUtils]: 40: Hoare triple {33928#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33950#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 11:02:56,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {33950#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {33950#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 11:02:56,888 INFO L272 TraceCheckUtils]: 42: Hoare triple {33950#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,888 INFO L290 TraceCheckUtils]: 45: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,888 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {33820#true} {33950#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {33950#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 11:02:56,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {33950#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33972#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 11:02:56,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {33972#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {33972#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 11:02:56,889 INFO L272 TraceCheckUtils]: 49: Hoare triple {33972#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,889 INFO L290 TraceCheckUtils]: 50: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,889 INFO L290 TraceCheckUtils]: 51: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,890 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {33820#true} {33972#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #50#return; {33972#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 11:02:56,890 INFO L290 TraceCheckUtils]: 54: Hoare triple {33972#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33994#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:02:56,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {33994#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !false; {33994#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:02:56,891 INFO L272 TraceCheckUtils]: 56: Hoare triple {33994#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,891 INFO L290 TraceCheckUtils]: 57: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,891 INFO L290 TraceCheckUtils]: 58: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,891 INFO L290 TraceCheckUtils]: 59: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,891 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {33820#true} {33994#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} #50#return; {33994#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:02:56,892 INFO L290 TraceCheckUtils]: 61: Hoare triple {33994#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34016#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 11:02:56,892 INFO L290 TraceCheckUtils]: 62: Hoare triple {34016#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} assume !false; {34016#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 11:02:56,892 INFO L272 TraceCheckUtils]: 63: Hoare triple {34016#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,892 INFO L290 TraceCheckUtils]: 64: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,892 INFO L290 TraceCheckUtils]: 65: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,892 INFO L290 TraceCheckUtils]: 66: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,893 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {33820#true} {34016#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} #50#return; {34016#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 11:02:56,893 INFO L290 TraceCheckUtils]: 68: Hoare triple {34016#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34038#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-08 11:02:56,893 INFO L290 TraceCheckUtils]: 69: Hoare triple {34038#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !false; {34038#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-08 11:02:56,893 INFO L272 TraceCheckUtils]: 70: Hoare triple {34038#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,894 INFO L290 TraceCheckUtils]: 71: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,894 INFO L290 TraceCheckUtils]: 72: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,894 INFO L290 TraceCheckUtils]: 73: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,894 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {33820#true} {34038#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} #50#return; {34038#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-08 11:02:56,894 INFO L290 TraceCheckUtils]: 75: Hoare triple {34038#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34060#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 11:02:56,895 INFO L290 TraceCheckUtils]: 76: Hoare triple {34060#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} assume !false; {34060#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 11:02:56,895 INFO L272 TraceCheckUtils]: 77: Hoare triple {34060#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,895 INFO L290 TraceCheckUtils]: 78: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,895 INFO L290 TraceCheckUtils]: 79: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,895 INFO L290 TraceCheckUtils]: 80: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,896 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {33820#true} {34060#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} #50#return; {34060#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 11:02:56,896 INFO L290 TraceCheckUtils]: 82: Hoare triple {34060#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34082#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 11:02:56,896 INFO L290 TraceCheckUtils]: 83: Hoare triple {34082#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} assume !false; {34082#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 11:02:56,896 INFO L272 TraceCheckUtils]: 84: Hoare triple {34082#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,896 INFO L290 TraceCheckUtils]: 85: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,896 INFO L290 TraceCheckUtils]: 86: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,897 INFO L290 TraceCheckUtils]: 87: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,897 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {33820#true} {34082#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} #50#return; {34082#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 11:02:56,897 INFO L290 TraceCheckUtils]: 89: Hoare triple {34082#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34104#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 11:02:56,898 INFO L290 TraceCheckUtils]: 90: Hoare triple {34104#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} assume !false; {34104#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 11:02:56,898 INFO L272 TraceCheckUtils]: 91: Hoare triple {34104#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,898 INFO L290 TraceCheckUtils]: 92: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,898 INFO L290 TraceCheckUtils]: 93: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,898 INFO L290 TraceCheckUtils]: 94: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,898 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {33820#true} {34104#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} #50#return; {34104#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 11:02:56,899 INFO L290 TraceCheckUtils]: 96: Hoare triple {34104#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34126#(and (= 11 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 7))))} is VALID [2022-04-08 11:02:56,899 INFO L290 TraceCheckUtils]: 97: Hoare triple {34126#(and (= 11 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 7))))} assume !false; {34126#(and (= 11 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 7))))} is VALID [2022-04-08 11:02:56,899 INFO L272 TraceCheckUtils]: 98: Hoare triple {34126#(and (= 11 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,899 INFO L290 TraceCheckUtils]: 99: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,899 INFO L290 TraceCheckUtils]: 100: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,899 INFO L290 TraceCheckUtils]: 101: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,900 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {33820#true} {34126#(and (= 11 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 7))))} #50#return; {34126#(and (= 11 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 7))))} is VALID [2022-04-08 11:02:56,900 INFO L290 TraceCheckUtils]: 103: Hoare triple {34126#(and (= 11 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 7))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34148#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 11:02:56,901 INFO L290 TraceCheckUtils]: 104: Hoare triple {34148#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {34148#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 11:02:56,901 INFO L272 TraceCheckUtils]: 105: Hoare triple {34148#(and (= main_~y~0 14) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,901 INFO L290 TraceCheckUtils]: 106: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,901 INFO L290 TraceCheckUtils]: 107: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,901 INFO L290 TraceCheckUtils]: 108: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,901 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {33820#true} {34148#(and (= main_~y~0 14) (= main_~c~0 14))} #50#return; {34148#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 11:02:56,902 INFO L290 TraceCheckUtils]: 110: Hoare triple {34148#(and (= main_~y~0 14) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34170#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:02:56,902 INFO L290 TraceCheckUtils]: 111: Hoare triple {34170#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {34170#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:02:56,902 INFO L272 TraceCheckUtils]: 112: Hoare triple {34170#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,902 INFO L290 TraceCheckUtils]: 113: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,902 INFO L290 TraceCheckUtils]: 114: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,902 INFO L290 TraceCheckUtils]: 115: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,903 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {33820#true} {34170#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #50#return; {34170#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:02:56,903 INFO L290 TraceCheckUtils]: 117: Hoare triple {34170#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34192#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 11:02:56,903 INFO L290 TraceCheckUtils]: 118: Hoare triple {34192#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} assume !false; {34192#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 11:02:56,904 INFO L272 TraceCheckUtils]: 119: Hoare triple {34192#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,904 INFO L290 TraceCheckUtils]: 120: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,904 INFO L290 TraceCheckUtils]: 121: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,904 INFO L290 TraceCheckUtils]: 122: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,904 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {33820#true} {34192#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} #50#return; {34192#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 11:02:56,905 INFO L290 TraceCheckUtils]: 124: Hoare triple {34192#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34214#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 11:02:56,905 INFO L290 TraceCheckUtils]: 125: Hoare triple {34214#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {34214#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 11:02:56,905 INFO L272 TraceCheckUtils]: 126: Hoare triple {34214#(and (= main_~c~0 17) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,905 INFO L290 TraceCheckUtils]: 127: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,905 INFO L290 TraceCheckUtils]: 128: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,905 INFO L290 TraceCheckUtils]: 129: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,906 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {33820#true} {34214#(and (= main_~c~0 17) (= main_~y~0 17))} #50#return; {34214#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 11:02:56,906 INFO L290 TraceCheckUtils]: 131: Hoare triple {34214#(and (= main_~c~0 17) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34236#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 11:02:56,906 INFO L290 TraceCheckUtils]: 132: Hoare triple {34236#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {34236#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 11:02:56,906 INFO L272 TraceCheckUtils]: 133: Hoare triple {34236#(and (= main_~c~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,906 INFO L290 TraceCheckUtils]: 134: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,906 INFO L290 TraceCheckUtils]: 135: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,907 INFO L290 TraceCheckUtils]: 136: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,907 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {33820#true} {34236#(and (= main_~c~0 18) (= main_~y~0 18))} #50#return; {34236#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 11:02:56,907 INFO L290 TraceCheckUtils]: 138: Hoare triple {34236#(and (= main_~c~0 18) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34258#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 11:02:56,908 INFO L290 TraceCheckUtils]: 139: Hoare triple {34258#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !false; {34258#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 11:02:56,908 INFO L272 TraceCheckUtils]: 140: Hoare triple {34258#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,908 INFO L290 TraceCheckUtils]: 141: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,908 INFO L290 TraceCheckUtils]: 142: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,908 INFO L290 TraceCheckUtils]: 143: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,908 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {33820#true} {34258#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} #50#return; {34258#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 11:02:56,909 INFO L290 TraceCheckUtils]: 145: Hoare triple {34258#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34280#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-08 11:02:56,909 INFO L290 TraceCheckUtils]: 146: Hoare triple {34280#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} assume !false; {34280#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-08 11:02:56,909 INFO L272 TraceCheckUtils]: 147: Hoare triple {34280#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,909 INFO L290 TraceCheckUtils]: 148: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,909 INFO L290 TraceCheckUtils]: 149: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,909 INFO L290 TraceCheckUtils]: 150: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,910 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {33820#true} {34280#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} #50#return; {34280#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-08 11:02:56,910 INFO L290 TraceCheckUtils]: 152: Hoare triple {34280#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34302#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-08 11:02:56,910 INFO L290 TraceCheckUtils]: 153: Hoare triple {34302#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} assume !false; {34302#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-08 11:02:56,911 INFO L272 TraceCheckUtils]: 154: Hoare triple {34302#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,911 INFO L290 TraceCheckUtils]: 155: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,911 INFO L290 TraceCheckUtils]: 156: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,911 INFO L290 TraceCheckUtils]: 157: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,911 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {33820#true} {34302#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} #50#return; {34302#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-08 11:02:56,912 INFO L290 TraceCheckUtils]: 159: Hoare triple {34302#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34324#(and (= (+ main_~y~0 (- 4)) 18) (= main_~c~0 22))} is VALID [2022-04-08 11:02:56,912 INFO L290 TraceCheckUtils]: 160: Hoare triple {34324#(and (= (+ main_~y~0 (- 4)) 18) (= main_~c~0 22))} assume !false; {34324#(and (= (+ main_~y~0 (- 4)) 18) (= main_~c~0 22))} is VALID [2022-04-08 11:02:56,912 INFO L272 TraceCheckUtils]: 161: Hoare triple {34324#(and (= (+ main_~y~0 (- 4)) 18) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,912 INFO L290 TraceCheckUtils]: 162: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,912 INFO L290 TraceCheckUtils]: 163: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,912 INFO L290 TraceCheckUtils]: 164: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,913 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {33820#true} {34324#(and (= (+ main_~y~0 (- 4)) 18) (= main_~c~0 22))} #50#return; {34324#(and (= (+ main_~y~0 (- 4)) 18) (= main_~c~0 22))} is VALID [2022-04-08 11:02:56,913 INFO L290 TraceCheckUtils]: 166: Hoare triple {34324#(and (= (+ main_~y~0 (- 4)) 18) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34346#(and (= 23 main_~c~0) (= (+ main_~y~0 (- 5)) 18))} is VALID [2022-04-08 11:02:56,913 INFO L290 TraceCheckUtils]: 167: Hoare triple {34346#(and (= 23 main_~c~0) (= (+ main_~y~0 (- 5)) 18))} assume !false; {34346#(and (= 23 main_~c~0) (= (+ main_~y~0 (- 5)) 18))} is VALID [2022-04-08 11:02:56,913 INFO L272 TraceCheckUtils]: 168: Hoare triple {34346#(and (= 23 main_~c~0) (= (+ main_~y~0 (- 5)) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,913 INFO L290 TraceCheckUtils]: 169: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,914 INFO L290 TraceCheckUtils]: 170: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,914 INFO L290 TraceCheckUtils]: 171: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,914 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {33820#true} {34346#(and (= 23 main_~c~0) (= (+ main_~y~0 (- 5)) 18))} #50#return; {34346#(and (= 23 main_~c~0) (= (+ main_~y~0 (- 5)) 18))} is VALID [2022-04-08 11:02:56,914 INFO L290 TraceCheckUtils]: 173: Hoare triple {34346#(and (= 23 main_~c~0) (= (+ main_~y~0 (- 5)) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34368#(and (= main_~c~0 24) (= (+ main_~y~0 (- 6)) 18))} is VALID [2022-04-08 11:02:56,915 INFO L290 TraceCheckUtils]: 174: Hoare triple {34368#(and (= main_~c~0 24) (= (+ main_~y~0 (- 6)) 18))} assume !false; {34368#(and (= main_~c~0 24) (= (+ main_~y~0 (- 6)) 18))} is VALID [2022-04-08 11:02:56,915 INFO L272 TraceCheckUtils]: 175: Hoare triple {34368#(and (= main_~c~0 24) (= (+ main_~y~0 (- 6)) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,915 INFO L290 TraceCheckUtils]: 176: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,915 INFO L290 TraceCheckUtils]: 177: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,915 INFO L290 TraceCheckUtils]: 178: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,916 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {33820#true} {34368#(and (= main_~c~0 24) (= (+ main_~y~0 (- 6)) 18))} #50#return; {34368#(and (= main_~c~0 24) (= (+ main_~y~0 (- 6)) 18))} is VALID [2022-04-08 11:02:56,916 INFO L290 TraceCheckUtils]: 180: Hoare triple {34368#(and (= main_~c~0 24) (= (+ main_~y~0 (- 6)) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34390#(and (= (+ (- 1) main_~c~0) 24) (= 18 (+ main_~y~0 (- 7))))} is VALID [2022-04-08 11:02:56,916 INFO L290 TraceCheckUtils]: 181: Hoare triple {34390#(and (= (+ (- 1) main_~c~0) 24) (= 18 (+ main_~y~0 (- 7))))} assume !false; {34390#(and (= (+ (- 1) main_~c~0) 24) (= 18 (+ main_~y~0 (- 7))))} is VALID [2022-04-08 11:02:56,916 INFO L272 TraceCheckUtils]: 182: Hoare triple {34390#(and (= (+ (- 1) main_~c~0) 24) (= 18 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,917 INFO L290 TraceCheckUtils]: 183: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,917 INFO L290 TraceCheckUtils]: 184: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,917 INFO L290 TraceCheckUtils]: 185: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,917 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {33820#true} {34390#(and (= (+ (- 1) main_~c~0) 24) (= 18 (+ main_~y~0 (- 7))))} #50#return; {34390#(and (= (+ (- 1) main_~c~0) 24) (= 18 (+ main_~y~0 (- 7))))} is VALID [2022-04-08 11:02:56,918 INFO L290 TraceCheckUtils]: 187: Hoare triple {34390#(and (= (+ (- 1) main_~c~0) 24) (= 18 (+ main_~y~0 (- 7))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34412#(and (= main_~c~0 26) (= 18 (+ main_~y~0 (- 8))))} is VALID [2022-04-08 11:02:56,918 INFO L290 TraceCheckUtils]: 188: Hoare triple {34412#(and (= main_~c~0 26) (= 18 (+ main_~y~0 (- 8))))} assume !false; {34412#(and (= main_~c~0 26) (= 18 (+ main_~y~0 (- 8))))} is VALID [2022-04-08 11:02:56,918 INFO L272 TraceCheckUtils]: 189: Hoare triple {34412#(and (= main_~c~0 26) (= 18 (+ main_~y~0 (- 8))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,918 INFO L290 TraceCheckUtils]: 190: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,918 INFO L290 TraceCheckUtils]: 191: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,918 INFO L290 TraceCheckUtils]: 192: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,919 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {33820#true} {34412#(and (= main_~c~0 26) (= 18 (+ main_~y~0 (- 8))))} #50#return; {34412#(and (= main_~c~0 26) (= 18 (+ main_~y~0 (- 8))))} is VALID [2022-04-08 11:02:56,919 INFO L290 TraceCheckUtils]: 194: Hoare triple {34412#(and (= main_~c~0 26) (= 18 (+ main_~y~0 (- 8))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34434#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 9) main_~y~0) 18))} is VALID [2022-04-08 11:02:56,919 INFO L290 TraceCheckUtils]: 195: Hoare triple {34434#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 9) main_~y~0) 18))} assume !false; {34434#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 9) main_~y~0) 18))} is VALID [2022-04-08 11:02:56,920 INFO L272 TraceCheckUtils]: 196: Hoare triple {34434#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 9) main_~y~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,920 INFO L290 TraceCheckUtils]: 197: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,920 INFO L290 TraceCheckUtils]: 198: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,920 INFO L290 TraceCheckUtils]: 199: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,920 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {33820#true} {34434#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 9) main_~y~0) 18))} #50#return; {34434#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 9) main_~y~0) 18))} is VALID [2022-04-08 11:02:56,921 INFO L290 TraceCheckUtils]: 201: Hoare triple {34434#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 9) main_~y~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34456#(and (= main_~c~0 28) (= 18 (+ main_~y~0 (- 10))))} is VALID [2022-04-08 11:02:56,921 INFO L290 TraceCheckUtils]: 202: Hoare triple {34456#(and (= main_~c~0 28) (= 18 (+ main_~y~0 (- 10))))} assume !false; {34456#(and (= main_~c~0 28) (= 18 (+ main_~y~0 (- 10))))} is VALID [2022-04-08 11:02:56,921 INFO L272 TraceCheckUtils]: 203: Hoare triple {34456#(and (= main_~c~0 28) (= 18 (+ main_~y~0 (- 10))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,921 INFO L290 TraceCheckUtils]: 204: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,921 INFO L290 TraceCheckUtils]: 205: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,921 INFO L290 TraceCheckUtils]: 206: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,922 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {33820#true} {34456#(and (= main_~c~0 28) (= 18 (+ main_~y~0 (- 10))))} #50#return; {34456#(and (= main_~c~0 28) (= 18 (+ main_~y~0 (- 10))))} is VALID [2022-04-08 11:02:56,922 INFO L290 TraceCheckUtils]: 208: Hoare triple {34456#(and (= main_~c~0 28) (= 18 (+ main_~y~0 (- 10))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34478#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 11:02:56,923 INFO L290 TraceCheckUtils]: 209: Hoare triple {34478#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} assume !false; {34478#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 11:02:56,923 INFO L272 TraceCheckUtils]: 210: Hoare triple {34478#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,923 INFO L290 TraceCheckUtils]: 211: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,923 INFO L290 TraceCheckUtils]: 212: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,923 INFO L290 TraceCheckUtils]: 213: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,923 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {33820#true} {34478#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} #50#return; {34478#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 11:02:56,924 INFO L290 TraceCheckUtils]: 215: Hoare triple {34478#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34500#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 11:02:56,924 INFO L290 TraceCheckUtils]: 216: Hoare triple {34500#(and (= 30 main_~y~0) (= 30 main_~c~0))} assume !false; {34500#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 11:02:56,924 INFO L272 TraceCheckUtils]: 217: Hoare triple {34500#(and (= 30 main_~y~0) (= 30 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,924 INFO L290 TraceCheckUtils]: 218: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,924 INFO L290 TraceCheckUtils]: 219: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,924 INFO L290 TraceCheckUtils]: 220: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,925 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {33820#true} {34500#(and (= 30 main_~y~0) (= 30 main_~c~0))} #50#return; {34500#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 11:02:56,925 INFO L290 TraceCheckUtils]: 222: Hoare triple {34500#(and (= 30 main_~y~0) (= 30 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34522#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-08 11:02:56,926 INFO L290 TraceCheckUtils]: 223: Hoare triple {34522#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} assume !false; {34522#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-08 11:02:56,926 INFO L272 TraceCheckUtils]: 224: Hoare triple {34522#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,926 INFO L290 TraceCheckUtils]: 225: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,926 INFO L290 TraceCheckUtils]: 226: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,926 INFO L290 TraceCheckUtils]: 227: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,926 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {33820#true} {34522#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} #50#return; {34522#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-08 11:02:56,927 INFO L290 TraceCheckUtils]: 229: Hoare triple {34522#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34544#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 11:02:56,927 INFO L290 TraceCheckUtils]: 230: Hoare triple {34544#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !false; {34544#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 11:02:56,927 INFO L272 TraceCheckUtils]: 231: Hoare triple {34544#(and (= 32 main_~y~0) (= 32 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,927 INFO L290 TraceCheckUtils]: 232: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,927 INFO L290 TraceCheckUtils]: 233: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,927 INFO L290 TraceCheckUtils]: 234: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,928 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {33820#true} {34544#(and (= 32 main_~y~0) (= 32 main_~c~0))} #50#return; {34544#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 11:02:56,928 INFO L290 TraceCheckUtils]: 236: Hoare triple {34544#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34566#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} is VALID [2022-04-08 11:02:56,929 INFO L290 TraceCheckUtils]: 237: Hoare triple {34566#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} assume !false; {34566#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} is VALID [2022-04-08 11:02:56,929 INFO L272 TraceCheckUtils]: 238: Hoare triple {34566#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,929 INFO L290 TraceCheckUtils]: 239: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,929 INFO L290 TraceCheckUtils]: 240: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,929 INFO L290 TraceCheckUtils]: 241: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,929 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {33820#true} {34566#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} #50#return; {34566#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} is VALID [2022-04-08 11:02:56,930 INFO L290 TraceCheckUtils]: 243: Hoare triple {34566#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34588#(and (<= main_~c~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} is VALID [2022-04-08 11:02:56,930 INFO L290 TraceCheckUtils]: 244: Hoare triple {34588#(and (<= main_~c~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} assume !false; {34588#(and (<= main_~c~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} is VALID [2022-04-08 11:02:56,930 INFO L272 TraceCheckUtils]: 245: Hoare triple {34588#(and (<= main_~c~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 11:02:56,930 INFO L290 TraceCheckUtils]: 246: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 11:02:56,930 INFO L290 TraceCheckUtils]: 247: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 11:02:56,930 INFO L290 TraceCheckUtils]: 248: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 11:02:56,931 INFO L284 TraceCheckUtils]: 249: Hoare quadruple {33820#true} {34588#(and (<= main_~c~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} #50#return; {34588#(and (<= main_~c~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} is VALID [2022-04-08 11:02:56,931 INFO L290 TraceCheckUtils]: 250: Hoare triple {34588#(and (<= main_~c~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} assume !(~c~0 < ~k~0); {34610#(and (<= main_~k~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} is VALID [2022-04-08 11:02:56,932 INFO L272 TraceCheckUtils]: 251: Hoare triple {34610#(and (<= main_~k~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34614#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:02:56,932 INFO L290 TraceCheckUtils]: 252: Hoare triple {34614#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34618#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:02:56,932 INFO L290 TraceCheckUtils]: 253: Hoare triple {34618#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33821#false} is VALID [2022-04-08 11:02:56,933 INFO L290 TraceCheckUtils]: 254: Hoare triple {33821#false} assume !false; {33821#false} is VALID [2022-04-08 11:02:56,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 70 proven. 1785 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2022-04-08 11:02:56,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:02:57,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:02:57,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459680127] [2022-04-08 11:02:57,383 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:02:57,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185051085] [2022-04-08 11:02:57,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185051085] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:02:57,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:02:57,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2022-04-08 11:02:57,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:02:57,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [164727385] [2022-04-08 11:02:57,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [164727385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:02:57,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:02:57,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-08 11:02:57,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800172517] [2022-04-08 11:02:57,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:02:57,385 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 37 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Word has length 255 [2022-04-08 11:02:57,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:02:57,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 37 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 11:02:58,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:02:58,029 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-08 11:02:58,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:02:58,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-08 11:02:58,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 11:02:58,029 INFO L87 Difference]: Start difference. First operand 124 states and 157 transitions. Second operand has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 37 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 11:03:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:32,188 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2022-04-08 11:03:32,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-08 11:03:32,189 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 37 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Word has length 255 [2022-04-08 11:03:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:03:32,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 37 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 11:03:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 162 transitions. [2022-04-08 11:03:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 37 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 11:03:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 162 transitions. [2022-04-08 11:03:32,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 162 transitions. [2022-04-08 11:03:33,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:03:33,042 INFO L225 Difference]: With dead ends: 132 [2022-04-08 11:03:33,042 INFO L226 Difference]: Without dead ends: 127 [2022-04-08 11:03:33,042 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=1847, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 11:03:33,043 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 4039 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 4039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2022-04-08 11:03:33,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1899 Invalid, 4039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4039 Invalid, 0 Unknown, 0 Unchecked, 17.7s Time] [2022-04-08 11:03:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-08 11:03:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-04-08 11:03:33,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:03:33,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 39 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 11:03:33,184 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 39 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 11:03:33,184 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 39 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 11:03:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:33,186 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2022-04-08 11:03:33,186 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 161 transitions. [2022-04-08 11:03:33,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:03:33,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:03:33,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 39 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 127 states. [2022-04-08 11:03:33,187 INFO L87 Difference]: Start difference. First operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 39 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 127 states. [2022-04-08 11:03:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:33,189 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2022-04-08 11:03:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 161 transitions. [2022-04-08 11:03:33,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:03:33,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:03:33,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:03:33,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:03:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 39 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 11:03:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 161 transitions. [2022-04-08 11:03:33,192 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 161 transitions. Word has length 255 [2022-04-08 11:03:33,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:03:33,192 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 161 transitions. [2022-04-08 11:03:33,192 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 37 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 11:03:33,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 161 transitions. [2022-04-08 11:03:34,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:03:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 161 transitions. [2022-04-08 11:03:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-04-08 11:03:34,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:03:34,344 INFO L499 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:03:34,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-08 11:03:34,544 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:03:34,545 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:03:34,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:03:34,545 INFO L85 PathProgramCache]: Analyzing trace with hash -769476027, now seen corresponding path program 69 times [2022-04-08 11:03:34,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:03:34,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1733510016] [2022-04-08 11:03:34,627 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:03:34,627 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:03:34,627 INFO L85 PathProgramCache]: Analyzing trace with hash -769476027, now seen corresponding path program 70 times [2022-04-08 11:03:34,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:03:34,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095663800] [2022-04-08 11:03:34,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:03:34,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:03:34,642 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:03:34,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [168616109] [2022-04-08 11:03:34,643 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:03:34,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:03:34,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:03:34,643 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:03:34,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-08 11:03:39,300 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:03:39,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:03:39,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 148 conjunts are in the unsatisfiable core [2022-04-08 11:03:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:03:39,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:03:40,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {35442#true} call ULTIMATE.init(); {35442#true} is VALID [2022-04-08 11:03:40,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {35442#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(9, 2);call #Ultimate.allocInit(12, 3); {35442#true} is VALID [2022-04-08 11:03:40,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35442#true} {35442#true} #56#return; {35442#true} is VALID [2022-04-08 11:03:40,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {35442#true} call #t~ret5 := main(); {35442#true} is VALID [2022-04-08 11:03:40,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {35442#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {35462#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:03:40,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {35462#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {35462#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:03:40,831 INFO L272 TraceCheckUtils]: 7: Hoare triple {35462#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,831 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {35442#true} {35462#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {35462#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:03:40,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {35462#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 11:03:40,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {35484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {35484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 11:03:40,832 INFO L272 TraceCheckUtils]: 14: Hoare triple {35484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,833 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {35442#true} {35484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {35484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 11:03:40,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {35484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35506#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 11:03:40,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {35506#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {35506#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 11:03:40,834 INFO L272 TraceCheckUtils]: 21: Hoare triple {35506#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,834 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {35442#true} {35506#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {35506#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 11:03:40,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {35506#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35528#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 11:03:40,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {35528#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {35528#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 11:03:40,835 INFO L272 TraceCheckUtils]: 28: Hoare triple {35528#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,836 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {35442#true} {35528#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #50#return; {35528#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 11:03:40,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {35528#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35550#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:03:40,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {35550#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} assume !false; {35550#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:03:40,836 INFO L272 TraceCheckUtils]: 35: Hoare triple {35550#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,837 INFO L290 TraceCheckUtils]: 36: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,837 INFO L290 TraceCheckUtils]: 38: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,837 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {35442#true} {35550#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} #50#return; {35550#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:03:40,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {35550#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35572#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} is VALID [2022-04-08 11:03:40,838 INFO L290 TraceCheckUtils]: 41: Hoare triple {35572#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} assume !false; {35572#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} is VALID [2022-04-08 11:03:40,838 INFO L272 TraceCheckUtils]: 42: Hoare triple {35572#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,838 INFO L290 TraceCheckUtils]: 43: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,838 INFO L290 TraceCheckUtils]: 44: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,838 INFO L290 TraceCheckUtils]: 45: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,838 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35442#true} {35572#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} #50#return; {35572#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} is VALID [2022-04-08 11:03:40,839 INFO L290 TraceCheckUtils]: 47: Hoare triple {35572#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35594#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 11:03:40,839 INFO L290 TraceCheckUtils]: 48: Hoare triple {35594#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {35594#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 11:03:40,839 INFO L272 TraceCheckUtils]: 49: Hoare triple {35594#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,839 INFO L290 TraceCheckUtils]: 50: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,839 INFO L290 TraceCheckUtils]: 51: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,839 INFO L290 TraceCheckUtils]: 52: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,840 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {35442#true} {35594#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {35594#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 11:03:40,840 INFO L290 TraceCheckUtils]: 54: Hoare triple {35594#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35616#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 11:03:40,840 INFO L290 TraceCheckUtils]: 55: Hoare triple {35616#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {35616#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 11:03:40,841 INFO L272 TraceCheckUtils]: 56: Hoare triple {35616#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,841 INFO L290 TraceCheckUtils]: 57: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,841 INFO L290 TraceCheckUtils]: 58: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,841 INFO L290 TraceCheckUtils]: 59: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,841 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {35442#true} {35616#(and (= 7 main_~y~0) (= 7 main_~c~0))} #50#return; {35616#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 11:03:40,842 INFO L290 TraceCheckUtils]: 61: Hoare triple {35616#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35638#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:03:40,842 INFO L290 TraceCheckUtils]: 62: Hoare triple {35638#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {35638#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:03:40,842 INFO L272 TraceCheckUtils]: 63: Hoare triple {35638#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,842 INFO L290 TraceCheckUtils]: 64: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,842 INFO L290 TraceCheckUtils]: 66: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,843 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {35442#true} {35638#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #50#return; {35638#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:03:40,843 INFO L290 TraceCheckUtils]: 68: Hoare triple {35638#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35660#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:03:40,843 INFO L290 TraceCheckUtils]: 69: Hoare triple {35660#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !false; {35660#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:03:40,843 INFO L272 TraceCheckUtils]: 70: Hoare triple {35660#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,843 INFO L290 TraceCheckUtils]: 71: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,843 INFO L290 TraceCheckUtils]: 72: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,844 INFO L290 TraceCheckUtils]: 73: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,844 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {35442#true} {35660#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} #50#return; {35660#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:03:40,844 INFO L290 TraceCheckUtils]: 75: Hoare triple {35660#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35682#(and (= 7 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 3))))} is VALID [2022-04-08 11:03:40,845 INFO L290 TraceCheckUtils]: 76: Hoare triple {35682#(and (= 7 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 3))))} assume !false; {35682#(and (= 7 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 3))))} is VALID [2022-04-08 11:03:40,845 INFO L272 TraceCheckUtils]: 77: Hoare triple {35682#(and (= 7 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,845 INFO L290 TraceCheckUtils]: 78: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,845 INFO L290 TraceCheckUtils]: 79: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,845 INFO L290 TraceCheckUtils]: 80: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,845 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {35442#true} {35682#(and (= 7 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 3))))} #50#return; {35682#(and (= 7 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 3))))} is VALID [2022-04-08 11:03:40,846 INFO L290 TraceCheckUtils]: 82: Hoare triple {35682#(and (= 7 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35704#(and (= 7 (+ main_~y~0 (- 4))) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 11:03:40,846 INFO L290 TraceCheckUtils]: 83: Hoare triple {35704#(and (= 7 (+ main_~y~0 (- 4))) (= 7 (+ main_~c~0 (- 4))))} assume !false; {35704#(and (= 7 (+ main_~y~0 (- 4))) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 11:03:40,846 INFO L272 TraceCheckUtils]: 84: Hoare triple {35704#(and (= 7 (+ main_~y~0 (- 4))) (= 7 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,846 INFO L290 TraceCheckUtils]: 85: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,846 INFO L290 TraceCheckUtils]: 86: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,846 INFO L290 TraceCheckUtils]: 87: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,847 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {35442#true} {35704#(and (= 7 (+ main_~y~0 (- 4))) (= 7 (+ main_~c~0 (- 4))))} #50#return; {35704#(and (= 7 (+ main_~y~0 (- 4))) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 11:03:40,847 INFO L290 TraceCheckUtils]: 89: Hoare triple {35704#(and (= 7 (+ main_~y~0 (- 4))) (= 7 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35726#(and (= 7 (+ main_~c~0 (- 5))) (= 7 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 11:03:40,847 INFO L290 TraceCheckUtils]: 90: Hoare triple {35726#(and (= 7 (+ main_~c~0 (- 5))) (= 7 (+ main_~y~0 (- 5))))} assume !false; {35726#(and (= 7 (+ main_~c~0 (- 5))) (= 7 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 11:03:40,848 INFO L272 TraceCheckUtils]: 91: Hoare triple {35726#(and (= 7 (+ main_~c~0 (- 5))) (= 7 (+ main_~y~0 (- 5))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,848 INFO L290 TraceCheckUtils]: 92: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,848 INFO L290 TraceCheckUtils]: 93: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,848 INFO L290 TraceCheckUtils]: 94: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,848 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {35442#true} {35726#(and (= 7 (+ main_~c~0 (- 5))) (= 7 (+ main_~y~0 (- 5))))} #50#return; {35726#(and (= 7 (+ main_~c~0 (- 5))) (= 7 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 11:03:40,848 INFO L290 TraceCheckUtils]: 96: Hoare triple {35726#(and (= 7 (+ main_~c~0 (- 5))) (= 7 (+ main_~y~0 (- 5))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35748#(and (= 7 (+ main_~c~0 (- 6))) (= (+ main_~y~0 (- 6)) 7))} is VALID [2022-04-08 11:03:40,849 INFO L290 TraceCheckUtils]: 97: Hoare triple {35748#(and (= 7 (+ main_~c~0 (- 6))) (= (+ main_~y~0 (- 6)) 7))} assume !false; {35748#(and (= 7 (+ main_~c~0 (- 6))) (= (+ main_~y~0 (- 6)) 7))} is VALID [2022-04-08 11:03:40,849 INFO L272 TraceCheckUtils]: 98: Hoare triple {35748#(and (= 7 (+ main_~c~0 (- 6))) (= (+ main_~y~0 (- 6)) 7))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,849 INFO L290 TraceCheckUtils]: 99: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,849 INFO L290 TraceCheckUtils]: 100: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,849 INFO L290 TraceCheckUtils]: 101: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,849 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {35442#true} {35748#(and (= 7 (+ main_~c~0 (- 6))) (= (+ main_~y~0 (- 6)) 7))} #50#return; {35748#(and (= 7 (+ main_~c~0 (- 6))) (= (+ main_~y~0 (- 6)) 7))} is VALID [2022-04-08 11:03:40,850 INFO L290 TraceCheckUtils]: 103: Hoare triple {35748#(and (= 7 (+ main_~c~0 (- 6))) (= (+ main_~y~0 (- 6)) 7))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35770#(and (= 7 (+ main_~y~0 (- 7))) (= main_~c~0 14))} is VALID [2022-04-08 11:03:40,850 INFO L290 TraceCheckUtils]: 104: Hoare triple {35770#(and (= 7 (+ main_~y~0 (- 7))) (= main_~c~0 14))} assume !false; {35770#(and (= 7 (+ main_~y~0 (- 7))) (= main_~c~0 14))} is VALID [2022-04-08 11:03:40,850 INFO L272 TraceCheckUtils]: 105: Hoare triple {35770#(and (= 7 (+ main_~y~0 (- 7))) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,850 INFO L290 TraceCheckUtils]: 106: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,850 INFO L290 TraceCheckUtils]: 107: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,850 INFO L290 TraceCheckUtils]: 108: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,851 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {35442#true} {35770#(and (= 7 (+ main_~y~0 (- 7))) (= main_~c~0 14))} #50#return; {35770#(and (= 7 (+ main_~y~0 (- 7))) (= main_~c~0 14))} is VALID [2022-04-08 11:03:40,851 INFO L290 TraceCheckUtils]: 110: Hoare triple {35770#(and (= 7 (+ main_~y~0 (- 7))) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35792#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 11:03:40,852 INFO L290 TraceCheckUtils]: 111: Hoare triple {35792#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !false; {35792#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 11:03:40,852 INFO L272 TraceCheckUtils]: 112: Hoare triple {35792#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,852 INFO L290 TraceCheckUtils]: 113: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,852 INFO L290 TraceCheckUtils]: 114: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,852 INFO L290 TraceCheckUtils]: 115: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,852 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {35442#true} {35792#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} #50#return; {35792#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 11:03:40,853 INFO L290 TraceCheckUtils]: 117: Hoare triple {35792#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35814#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 11:03:40,853 INFO L290 TraceCheckUtils]: 118: Hoare triple {35814#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} assume !false; {35814#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 11:03:40,853 INFO L272 TraceCheckUtils]: 119: Hoare triple {35814#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,853 INFO L290 TraceCheckUtils]: 120: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,853 INFO L290 TraceCheckUtils]: 121: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,853 INFO L290 TraceCheckUtils]: 122: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,854 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {35442#true} {35814#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} #50#return; {35814#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 11:03:40,854 INFO L290 TraceCheckUtils]: 124: Hoare triple {35814#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35836#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 11:03:40,854 INFO L290 TraceCheckUtils]: 125: Hoare triple {35836#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {35836#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 11:03:40,854 INFO L272 TraceCheckUtils]: 126: Hoare triple {35836#(and (= main_~c~0 17) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,854 INFO L290 TraceCheckUtils]: 127: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,855 INFO L290 TraceCheckUtils]: 128: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,855 INFO L290 TraceCheckUtils]: 129: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,855 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {35442#true} {35836#(and (= main_~c~0 17) (= main_~y~0 17))} #50#return; {35836#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 11:03:40,855 INFO L290 TraceCheckUtils]: 131: Hoare triple {35836#(and (= main_~c~0 17) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35858#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 11:03:40,856 INFO L290 TraceCheckUtils]: 132: Hoare triple {35858#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {35858#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 11:03:40,856 INFO L272 TraceCheckUtils]: 133: Hoare triple {35858#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,856 INFO L290 TraceCheckUtils]: 134: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,856 INFO L290 TraceCheckUtils]: 135: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,856 INFO L290 TraceCheckUtils]: 136: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,856 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {35442#true} {35858#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #50#return; {35858#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 11:03:40,857 INFO L290 TraceCheckUtils]: 138: Hoare triple {35858#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35880#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 11:03:40,857 INFO L290 TraceCheckUtils]: 139: Hoare triple {35880#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {35880#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 11:03:40,857 INFO L272 TraceCheckUtils]: 140: Hoare triple {35880#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,857 INFO L290 TraceCheckUtils]: 141: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,857 INFO L290 TraceCheckUtils]: 142: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,857 INFO L290 TraceCheckUtils]: 143: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,858 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {35442#true} {35880#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #50#return; {35880#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 11:03:40,858 INFO L290 TraceCheckUtils]: 145: Hoare triple {35880#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35902#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:03:40,859 INFO L290 TraceCheckUtils]: 146: Hoare triple {35902#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} assume !false; {35902#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:03:40,859 INFO L272 TraceCheckUtils]: 147: Hoare triple {35902#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,859 INFO L290 TraceCheckUtils]: 148: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,859 INFO L290 TraceCheckUtils]: 149: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,859 INFO L290 TraceCheckUtils]: 150: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,859 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {35442#true} {35902#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} #50#return; {35902#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:03:40,860 INFO L290 TraceCheckUtils]: 152: Hoare triple {35902#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35924#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-08 11:03:40,860 INFO L290 TraceCheckUtils]: 153: Hoare triple {35924#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} assume !false; {35924#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-08 11:03:40,860 INFO L272 TraceCheckUtils]: 154: Hoare triple {35924#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,860 INFO L290 TraceCheckUtils]: 155: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,860 INFO L290 TraceCheckUtils]: 156: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,860 INFO L290 TraceCheckUtils]: 157: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,861 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {35442#true} {35924#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} #50#return; {35924#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-08 11:03:40,861 INFO L290 TraceCheckUtils]: 159: Hoare triple {35924#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35946#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 11:03:40,861 INFO L290 TraceCheckUtils]: 160: Hoare triple {35946#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {35946#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 11:03:40,861 INFO L272 TraceCheckUtils]: 161: Hoare triple {35946#(and (= main_~y~0 22) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,861 INFO L290 TraceCheckUtils]: 162: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,861 INFO L290 TraceCheckUtils]: 163: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,862 INFO L290 TraceCheckUtils]: 164: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,862 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {35442#true} {35946#(and (= main_~y~0 22) (= main_~c~0 22))} #50#return; {35946#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 11:03:40,862 INFO L290 TraceCheckUtils]: 166: Hoare triple {35946#(and (= main_~y~0 22) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35968#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:03:40,863 INFO L290 TraceCheckUtils]: 167: Hoare triple {35968#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} assume !false; {35968#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:03:40,863 INFO L272 TraceCheckUtils]: 168: Hoare triple {35968#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,863 INFO L290 TraceCheckUtils]: 169: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,863 INFO L290 TraceCheckUtils]: 170: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,863 INFO L290 TraceCheckUtils]: 171: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,863 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {35442#true} {35968#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} #50#return; {35968#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:03:40,864 INFO L290 TraceCheckUtils]: 173: Hoare triple {35968#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35990#(and (= (+ (- 2) main_~y~0) 22) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:03:40,864 INFO L290 TraceCheckUtils]: 174: Hoare triple {35990#(and (= (+ (- 2) main_~y~0) 22) (= 23 (+ (- 1) main_~c~0)))} assume !false; {35990#(and (= (+ (- 2) main_~y~0) 22) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:03:40,864 INFO L272 TraceCheckUtils]: 175: Hoare triple {35990#(and (= (+ (- 2) main_~y~0) 22) (= 23 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,864 INFO L290 TraceCheckUtils]: 176: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,864 INFO L290 TraceCheckUtils]: 177: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,864 INFO L290 TraceCheckUtils]: 178: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,865 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {35442#true} {35990#(and (= (+ (- 2) main_~y~0) 22) (= 23 (+ (- 1) main_~c~0)))} #50#return; {35990#(and (= (+ (- 2) main_~y~0) 22) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:03:40,865 INFO L290 TraceCheckUtils]: 180: Hoare triple {35990#(and (= (+ (- 2) main_~y~0) 22) (= 23 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36012#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 11:03:40,866 INFO L290 TraceCheckUtils]: 181: Hoare triple {36012#(and (= main_~y~0 25) (= main_~c~0 25))} assume !false; {36012#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 11:03:40,866 INFO L272 TraceCheckUtils]: 182: Hoare triple {36012#(and (= main_~y~0 25) (= main_~c~0 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,866 INFO L290 TraceCheckUtils]: 183: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,866 INFO L290 TraceCheckUtils]: 184: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,866 INFO L290 TraceCheckUtils]: 185: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,866 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {35442#true} {36012#(and (= main_~y~0 25) (= main_~c~0 25))} #50#return; {36012#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 11:03:40,867 INFO L290 TraceCheckUtils]: 187: Hoare triple {36012#(and (= main_~y~0 25) (= main_~c~0 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36034#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 11:03:40,867 INFO L290 TraceCheckUtils]: 188: Hoare triple {36034#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} assume !false; {36034#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 11:03:40,867 INFO L272 TraceCheckUtils]: 189: Hoare triple {36034#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,867 INFO L290 TraceCheckUtils]: 190: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,867 INFO L290 TraceCheckUtils]: 191: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,867 INFO L290 TraceCheckUtils]: 192: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,868 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {35442#true} {36034#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} #50#return; {36034#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 11:03:40,868 INFO L290 TraceCheckUtils]: 194: Hoare triple {36034#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36056#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 11:03:40,869 INFO L290 TraceCheckUtils]: 195: Hoare triple {36056#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {36056#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 11:03:40,869 INFO L272 TraceCheckUtils]: 196: Hoare triple {36056#(and (= main_~y~0 27) (= main_~c~0 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,869 INFO L290 TraceCheckUtils]: 197: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,869 INFO L290 TraceCheckUtils]: 198: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,869 INFO L290 TraceCheckUtils]: 199: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,869 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {35442#true} {36056#(and (= main_~y~0 27) (= main_~c~0 27))} #50#return; {36056#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 11:03:40,870 INFO L290 TraceCheckUtils]: 201: Hoare triple {36056#(and (= main_~y~0 27) (= main_~c~0 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36078#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-08 11:03:40,870 INFO L290 TraceCheckUtils]: 202: Hoare triple {36078#(and (= main_~c~0 28) (= main_~y~0 28))} assume !false; {36078#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-08 11:03:40,870 INFO L272 TraceCheckUtils]: 203: Hoare triple {36078#(and (= main_~c~0 28) (= main_~y~0 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,870 INFO L290 TraceCheckUtils]: 204: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,870 INFO L290 TraceCheckUtils]: 205: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,871 INFO L290 TraceCheckUtils]: 206: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,871 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {35442#true} {36078#(and (= main_~c~0 28) (= main_~y~0 28))} #50#return; {36078#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-08 11:03:40,871 INFO L290 TraceCheckUtils]: 208: Hoare triple {36078#(and (= main_~c~0 28) (= main_~y~0 28))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36100#(and (= 28 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 11:03:40,872 INFO L290 TraceCheckUtils]: 209: Hoare triple {36100#(and (= 28 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 28))} assume !false; {36100#(and (= 28 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 11:03:40,872 INFO L272 TraceCheckUtils]: 210: Hoare triple {36100#(and (= 28 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,872 INFO L290 TraceCheckUtils]: 211: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,872 INFO L290 TraceCheckUtils]: 212: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,872 INFO L290 TraceCheckUtils]: 213: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,873 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {35442#true} {36100#(and (= 28 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 28))} #50#return; {36100#(and (= 28 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 11:03:40,873 INFO L290 TraceCheckUtils]: 215: Hoare triple {36100#(and (= 28 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 28))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36122#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 11:03:40,873 INFO L290 TraceCheckUtils]: 216: Hoare triple {36122#(and (= 30 main_~y~0) (= 30 main_~c~0))} assume !false; {36122#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 11:03:40,873 INFO L272 TraceCheckUtils]: 217: Hoare triple {36122#(and (= 30 main_~y~0) (= 30 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,873 INFO L290 TraceCheckUtils]: 218: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,874 INFO L290 TraceCheckUtils]: 219: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,874 INFO L290 TraceCheckUtils]: 220: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,874 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {35442#true} {36122#(and (= 30 main_~y~0) (= 30 main_~c~0))} #50#return; {36122#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 11:03:40,874 INFO L290 TraceCheckUtils]: 222: Hoare triple {36122#(and (= 30 main_~y~0) (= 30 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36144#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} is VALID [2022-04-08 11:03:40,875 INFO L290 TraceCheckUtils]: 223: Hoare triple {36144#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} assume !false; {36144#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} is VALID [2022-04-08 11:03:40,875 INFO L272 TraceCheckUtils]: 224: Hoare triple {36144#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,875 INFO L290 TraceCheckUtils]: 225: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,875 INFO L290 TraceCheckUtils]: 226: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,875 INFO L290 TraceCheckUtils]: 227: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,876 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {35442#true} {36144#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} #50#return; {36144#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} is VALID [2022-04-08 11:03:40,876 INFO L290 TraceCheckUtils]: 229: Hoare triple {36144#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36166#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} is VALID [2022-04-08 11:03:40,876 INFO L290 TraceCheckUtils]: 230: Hoare triple {36166#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} assume !false; {36166#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} is VALID [2022-04-08 11:03:40,876 INFO L272 TraceCheckUtils]: 231: Hoare triple {36166#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,876 INFO L290 TraceCheckUtils]: 232: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,877 INFO L290 TraceCheckUtils]: 233: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,877 INFO L290 TraceCheckUtils]: 234: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,877 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {35442#true} {36166#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} #50#return; {36166#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} is VALID [2022-04-08 11:03:40,877 INFO L290 TraceCheckUtils]: 236: Hoare triple {36166#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36188#(and (= main_~y~0 33) (= 31 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:03:40,878 INFO L290 TraceCheckUtils]: 237: Hoare triple {36188#(and (= main_~y~0 33) (= 31 (+ (- 2) main_~c~0)))} assume !false; {36188#(and (= main_~y~0 33) (= 31 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:03:40,878 INFO L272 TraceCheckUtils]: 238: Hoare triple {36188#(and (= main_~y~0 33) (= 31 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,878 INFO L290 TraceCheckUtils]: 239: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,878 INFO L290 TraceCheckUtils]: 240: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,878 INFO L290 TraceCheckUtils]: 241: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,879 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {35442#true} {36188#(and (= main_~y~0 33) (= 31 (+ (- 2) main_~c~0)))} #50#return; {36188#(and (= main_~y~0 33) (= 31 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:03:40,879 INFO L290 TraceCheckUtils]: 243: Hoare triple {36188#(and (= main_~y~0 33) (= 31 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36210#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} is VALID [2022-04-08 11:03:40,879 INFO L290 TraceCheckUtils]: 244: Hoare triple {36210#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} assume !false; {36210#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} is VALID [2022-04-08 11:03:40,879 INFO L272 TraceCheckUtils]: 245: Hoare triple {36210#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,879 INFO L290 TraceCheckUtils]: 246: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,879 INFO L290 TraceCheckUtils]: 247: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,880 INFO L290 TraceCheckUtils]: 248: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,880 INFO L284 TraceCheckUtils]: 249: Hoare quadruple {35442#true} {36210#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} #50#return; {36210#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} is VALID [2022-04-08 11:03:40,880 INFO L290 TraceCheckUtils]: 250: Hoare triple {36210#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36232#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} is VALID [2022-04-08 11:03:40,881 INFO L290 TraceCheckUtils]: 251: Hoare triple {36232#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} assume !false; {36232#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} is VALID [2022-04-08 11:03:40,881 INFO L272 TraceCheckUtils]: 252: Hoare triple {36232#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 11:03:40,881 INFO L290 TraceCheckUtils]: 253: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 11:03:40,881 INFO L290 TraceCheckUtils]: 254: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 11:03:40,881 INFO L290 TraceCheckUtils]: 255: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 11:03:40,881 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {35442#true} {36232#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} #50#return; {36232#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} is VALID [2022-04-08 11:03:40,882 INFO L290 TraceCheckUtils]: 257: Hoare triple {36232#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} assume !(~c~0 < ~k~0); {36254#(and (= 35 main_~y~0) (<= main_~k~0 35) (< 34 main_~k~0))} is VALID [2022-04-08 11:03:40,882 INFO L272 TraceCheckUtils]: 258: Hoare triple {36254#(and (= 35 main_~y~0) (<= main_~k~0 35) (< 34 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36258#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:03:40,883 INFO L290 TraceCheckUtils]: 259: Hoare triple {36258#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36262#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:03:40,883 INFO L290 TraceCheckUtils]: 260: Hoare triple {36262#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35443#false} is VALID [2022-04-08 11:03:40,883 INFO L290 TraceCheckUtils]: 261: Hoare triple {35443#false} assume !false; {35443#false} is VALID [2022-04-08 11:03:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4482 backedges. 72 proven. 1890 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2022-04-08 11:03:40,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:03:41,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:03:41,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095663800] [2022-04-08 11:03:41,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:03:41,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168616109] [2022-04-08 11:03:41,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168616109] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:03:41,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:03:41,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2022-04-08 11:03:41,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:03:41,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1733510016] [2022-04-08 11:03:41,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1733510016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:03:41,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:03:41,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-08 11:03:41,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410490596] [2022-04-08 11:03:41,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:03:41,340 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.025) internal successors, (81), 40 states have internal predecessors, (81), 38 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Word has length 262 [2022-04-08 11:03:41,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:03:41,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 40 states have (on average 2.025) internal successors, (81), 40 states have internal predecessors, (81), 38 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 11:03:42,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:03:42,134 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-08 11:03:42,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:03:42,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-08 11:03:42,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 11:03:42,135 INFO L87 Difference]: Start difference. First operand 127 states and 161 transitions. Second operand has 41 states, 40 states have (on average 2.025) internal successors, (81), 40 states have internal predecessors, (81), 38 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 11:04:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:22,033 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2022-04-08 11:04:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-08 11:04:22,034 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.025) internal successors, (81), 40 states have internal predecessors, (81), 38 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Word has length 262 [2022-04-08 11:04:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:04:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.025) internal successors, (81), 40 states have internal predecessors, (81), 38 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 11:04:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 166 transitions. [2022-04-08 11:04:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.025) internal successors, (81), 40 states have internal predecessors, (81), 38 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 11:04:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 166 transitions. [2022-04-08 11:04:22,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 166 transitions. [2022-04-08 11:04:22,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:04:22,977 INFO L225 Difference]: With dead ends: 135 [2022-04-08 11:04:22,977 INFO L226 Difference]: Without dead ends: 130 [2022-04-08 11:04:22,977 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=1934, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 11:04:22,978 INFO L913 BasicCegarLoop]: 121 mSDtfsCounter, 2 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 4262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 4262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:04:22,978 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1988 Invalid, 4262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4262 Invalid, 0 Unknown, 0 Unchecked, 20.4s Time] [2022-04-08 11:04:22,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-08 11:04:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-04-08 11:04:23,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:04:23,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 40 states have call successors, (40), 5 states have call predecessors, (40), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 11:04:23,122 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 40 states have call successors, (40), 5 states have call predecessors, (40), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 11:04:23,122 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 40 states have call successors, (40), 5 states have call predecessors, (40), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 11:04:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:23,124 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2022-04-08 11:04:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2022-04-08 11:04:23,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:04:23,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:04:23,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 40 states have call successors, (40), 5 states have call predecessors, (40), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand 130 states. [2022-04-08 11:04:23,125 INFO L87 Difference]: Start difference. First operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 40 states have call successors, (40), 5 states have call predecessors, (40), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand 130 states. [2022-04-08 11:04:23,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:23,127 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2022-04-08 11:04:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2022-04-08 11:04:23,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:04:23,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:04:23,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:04:23,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:04:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 40 states have call successors, (40), 5 states have call predecessors, (40), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 11:04:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2022-04-08 11:04:23,130 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 262 [2022-04-08 11:04:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:04:23,130 INFO L478 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2022-04-08 11:04:23,130 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.025) internal successors, (81), 40 states have internal predecessors, (81), 38 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 11:04:23,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 165 transitions. [2022-04-08 11:04:24,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:04:24,425 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2022-04-08 11:04:24,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-04-08 11:04:24,426 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:04:24,426 INFO L499 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:04:24,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-08 11:04:24,634 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-08 11:04:24,635 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:04:24,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:04:24,635 INFO L85 PathProgramCache]: Analyzing trace with hash 747467058, now seen corresponding path program 71 times [2022-04-08 11:04:24,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:04:24,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [246519300] [2022-04-08 11:04:24,704 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:04:24,704 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:04:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash 747467058, now seen corresponding path program 72 times [2022-04-08 11:04:24,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:04:24,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62848736] [2022-04-08 11:04:24,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:04:24,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:04:24,726 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:04:24,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2605986] [2022-04-08 11:04:24,727 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:04:24,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:04:24,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:04:24,728 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:04:24,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-08 11:04:32,796 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2022-04-08 11:04:32,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:04:32,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 152 conjunts are in the unsatisfiable core [2022-04-08 11:04:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:04:32,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:04:34,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {37104#true} call ULTIMATE.init(); {37104#true} is VALID [2022-04-08 11:04:34,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {37104#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(9, 2);call #Ultimate.allocInit(12, 3); {37104#true} is VALID [2022-04-08 11:04:34,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37104#true} {37104#true} #56#return; {37104#true} is VALID [2022-04-08 11:04:34,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {37104#true} call #t~ret5 := main(); {37104#true} is VALID [2022-04-08 11:04:34,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {37104#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {37124#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:04:34,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {37124#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {37124#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:04:34,274 INFO L272 TraceCheckUtils]: 7: Hoare triple {37124#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,275 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {37104#true} {37124#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {37124#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:04:34,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {37124#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37146#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 11:04:34,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {37146#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {37146#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 11:04:34,276 INFO L272 TraceCheckUtils]: 14: Hoare triple {37146#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,276 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {37104#true} {37146#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {37146#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 11:04:34,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {37146#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37168#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:04:34,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {37168#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {37168#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:04:34,277 INFO L272 TraceCheckUtils]: 21: Hoare triple {37168#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,277 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {37104#true} {37168#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #50#return; {37168#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:04:34,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {37168#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37190#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 11:04:34,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {37190#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {37190#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 11:04:34,278 INFO L272 TraceCheckUtils]: 28: Hoare triple {37190#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,279 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {37104#true} {37190#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #50#return; {37190#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 11:04:34,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {37190#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37212#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 11:04:34,280 INFO L290 TraceCheckUtils]: 34: Hoare triple {37212#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} assume !false; {37212#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 11:04:34,280 INFO L272 TraceCheckUtils]: 35: Hoare triple {37212#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,280 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37104#true} {37212#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} #50#return; {37212#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 11:04:34,281 INFO L290 TraceCheckUtils]: 40: Hoare triple {37212#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37234#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 11:04:34,281 INFO L290 TraceCheckUtils]: 41: Hoare triple {37234#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 2) main_~y~0) 3))} assume !false; {37234#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 11:04:34,281 INFO L272 TraceCheckUtils]: 42: Hoare triple {37234#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 2) main_~y~0) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,281 INFO L290 TraceCheckUtils]: 43: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,282 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {37104#true} {37234#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 2) main_~y~0) 3))} #50#return; {37234#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 11:04:34,282 INFO L290 TraceCheckUtils]: 47: Hoare triple {37234#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 2) main_~y~0) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37256#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-08 11:04:34,282 INFO L290 TraceCheckUtils]: 48: Hoare triple {37256#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} assume !false; {37256#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-08 11:04:34,282 INFO L272 TraceCheckUtils]: 49: Hoare triple {37256#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,283 INFO L290 TraceCheckUtils]: 50: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,283 INFO L290 TraceCheckUtils]: 51: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,283 INFO L290 TraceCheckUtils]: 52: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,283 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {37104#true} {37256#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} #50#return; {37256#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-08 11:04:34,284 INFO L290 TraceCheckUtils]: 54: Hoare triple {37256#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37278#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 11:04:34,284 INFO L290 TraceCheckUtils]: 55: Hoare triple {37278#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {37278#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 11:04:34,284 INFO L272 TraceCheckUtils]: 56: Hoare triple {37278#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,284 INFO L290 TraceCheckUtils]: 57: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,284 INFO L290 TraceCheckUtils]: 58: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,284 INFO L290 TraceCheckUtils]: 59: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,285 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {37104#true} {37278#(and (= 7 main_~y~0) (= 7 main_~c~0))} #50#return; {37278#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 11:04:34,285 INFO L290 TraceCheckUtils]: 61: Hoare triple {37278#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37300#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:04:34,285 INFO L290 TraceCheckUtils]: 62: Hoare triple {37300#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {37300#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:04:34,285 INFO L272 TraceCheckUtils]: 63: Hoare triple {37300#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,285 INFO L290 TraceCheckUtils]: 64: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,285 INFO L290 TraceCheckUtils]: 65: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,286 INFO L290 TraceCheckUtils]: 66: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,286 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {37104#true} {37300#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #50#return; {37300#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:04:34,286 INFO L290 TraceCheckUtils]: 68: Hoare triple {37300#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37322#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 11:04:34,286 INFO L290 TraceCheckUtils]: 69: Hoare triple {37322#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {37322#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 11:04:34,287 INFO L272 TraceCheckUtils]: 70: Hoare triple {37322#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,287 INFO L290 TraceCheckUtils]: 71: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,287 INFO L290 TraceCheckUtils]: 72: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,287 INFO L290 TraceCheckUtils]: 73: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,287 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {37104#true} {37322#(and (= main_~y~0 9) (= main_~c~0 9))} #50#return; {37322#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 11:04:34,287 INFO L290 TraceCheckUtils]: 75: Hoare triple {37322#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37344#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 11:04:34,288 INFO L290 TraceCheckUtils]: 76: Hoare triple {37344#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {37344#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 11:04:34,288 INFO L272 TraceCheckUtils]: 77: Hoare triple {37344#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,288 INFO L290 TraceCheckUtils]: 78: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,288 INFO L290 TraceCheckUtils]: 79: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,288 INFO L290 TraceCheckUtils]: 80: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,295 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {37104#true} {37344#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #50#return; {37344#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 11:04:34,295 INFO L290 TraceCheckUtils]: 82: Hoare triple {37344#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37366#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 11:04:34,296 INFO L290 TraceCheckUtils]: 83: Hoare triple {37366#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {37366#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 11:04:34,296 INFO L272 TraceCheckUtils]: 84: Hoare triple {37366#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,296 INFO L290 TraceCheckUtils]: 85: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,296 INFO L290 TraceCheckUtils]: 86: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,296 INFO L290 TraceCheckUtils]: 87: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,296 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {37104#true} {37366#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {37366#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 11:04:34,297 INFO L290 TraceCheckUtils]: 89: Hoare triple {37366#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37388#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 11:04:34,297 INFO L290 TraceCheckUtils]: 90: Hoare triple {37388#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !false; {37388#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 11:04:34,297 INFO L272 TraceCheckUtils]: 91: Hoare triple {37388#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,297 INFO L290 TraceCheckUtils]: 92: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,297 INFO L290 TraceCheckUtils]: 93: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,297 INFO L290 TraceCheckUtils]: 94: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,298 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {37104#true} {37388#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #50#return; {37388#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 11:04:34,298 INFO L290 TraceCheckUtils]: 96: Hoare triple {37388#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37410#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 11:04:34,298 INFO L290 TraceCheckUtils]: 97: Hoare triple {37410#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {37410#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 11:04:34,299 INFO L272 TraceCheckUtils]: 98: Hoare triple {37410#(and (= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,299 INFO L290 TraceCheckUtils]: 99: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,299 INFO L290 TraceCheckUtils]: 100: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,299 INFO L290 TraceCheckUtils]: 101: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,299 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {37104#true} {37410#(and (= main_~c~0 13) (= main_~y~0 13))} #50#return; {37410#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 11:04:34,299 INFO L290 TraceCheckUtils]: 103: Hoare triple {37410#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37432#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 11:04:34,300 INFO L290 TraceCheckUtils]: 104: Hoare triple {37432#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {37432#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 11:04:34,300 INFO L272 TraceCheckUtils]: 105: Hoare triple {37432#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,300 INFO L290 TraceCheckUtils]: 106: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,300 INFO L290 TraceCheckUtils]: 107: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,300 INFO L290 TraceCheckUtils]: 108: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,300 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {37104#true} {37432#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #50#return; {37432#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 11:04:34,301 INFO L290 TraceCheckUtils]: 110: Hoare triple {37432#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37454#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:04:34,301 INFO L290 TraceCheckUtils]: 111: Hoare triple {37454#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {37454#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:04:34,301 INFO L272 TraceCheckUtils]: 112: Hoare triple {37454#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,301 INFO L290 TraceCheckUtils]: 113: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,301 INFO L290 TraceCheckUtils]: 114: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,301 INFO L290 TraceCheckUtils]: 115: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,302 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {37104#true} {37454#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #50#return; {37454#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:04:34,302 INFO L290 TraceCheckUtils]: 117: Hoare triple {37454#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37476#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 11:04:34,303 INFO L290 TraceCheckUtils]: 118: Hoare triple {37476#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} assume !false; {37476#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 11:04:34,303 INFO L272 TraceCheckUtils]: 119: Hoare triple {37476#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,303 INFO L290 TraceCheckUtils]: 120: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,303 INFO L290 TraceCheckUtils]: 121: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,303 INFO L290 TraceCheckUtils]: 122: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,303 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {37104#true} {37476#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} #50#return; {37476#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 11:04:34,304 INFO L290 TraceCheckUtils]: 124: Hoare triple {37476#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37498#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-08 11:04:34,304 INFO L290 TraceCheckUtils]: 125: Hoare triple {37498#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {37498#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-08 11:04:34,304 INFO L272 TraceCheckUtils]: 126: Hoare triple {37498#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,304 INFO L290 TraceCheckUtils]: 127: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,304 INFO L290 TraceCheckUtils]: 128: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,304 INFO L290 TraceCheckUtils]: 129: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,305 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {37104#true} {37498#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #50#return; {37498#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-08 11:04:34,305 INFO L290 TraceCheckUtils]: 131: Hoare triple {37498#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37520#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 11:04:34,305 INFO L290 TraceCheckUtils]: 132: Hoare triple {37520#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} assume !false; {37520#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 11:04:34,305 INFO L272 TraceCheckUtils]: 133: Hoare triple {37520#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,306 INFO L290 TraceCheckUtils]: 134: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,306 INFO L290 TraceCheckUtils]: 135: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,306 INFO L290 TraceCheckUtils]: 136: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,306 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {37104#true} {37520#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} #50#return; {37520#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 11:04:34,306 INFO L290 TraceCheckUtils]: 138: Hoare triple {37520#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37542#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 11:04:34,307 INFO L290 TraceCheckUtils]: 139: Hoare triple {37542#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !false; {37542#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 11:04:34,307 INFO L272 TraceCheckUtils]: 140: Hoare triple {37542#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,307 INFO L290 TraceCheckUtils]: 141: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,307 INFO L290 TraceCheckUtils]: 142: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,307 INFO L290 TraceCheckUtils]: 143: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,307 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {37104#true} {37542#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} #50#return; {37542#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 11:04:34,308 INFO L290 TraceCheckUtils]: 145: Hoare triple {37542#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37564#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-08 11:04:34,308 INFO L290 TraceCheckUtils]: 146: Hoare triple {37564#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !false; {37564#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-08 11:04:34,308 INFO L272 TraceCheckUtils]: 147: Hoare triple {37564#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,308 INFO L290 TraceCheckUtils]: 148: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,308 INFO L290 TraceCheckUtils]: 149: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,308 INFO L290 TraceCheckUtils]: 150: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,309 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {37104#true} {37564#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} #50#return; {37564#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-08 11:04:34,309 INFO L290 TraceCheckUtils]: 152: Hoare triple {37564#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37586#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:04:34,310 INFO L290 TraceCheckUtils]: 153: Hoare triple {37586#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !false; {37586#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:04:34,310 INFO L272 TraceCheckUtils]: 154: Hoare triple {37586#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,310 INFO L290 TraceCheckUtils]: 155: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,310 INFO L290 TraceCheckUtils]: 156: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,310 INFO L290 TraceCheckUtils]: 157: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,310 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {37104#true} {37586#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} #50#return; {37586#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:04:34,311 INFO L290 TraceCheckUtils]: 159: Hoare triple {37586#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37608#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 11:04:34,311 INFO L290 TraceCheckUtils]: 160: Hoare triple {37608#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {37608#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 11:04:34,311 INFO L272 TraceCheckUtils]: 161: Hoare triple {37608#(and (= main_~y~0 22) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,311 INFO L290 TraceCheckUtils]: 162: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,311 INFO L290 TraceCheckUtils]: 163: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,311 INFO L290 TraceCheckUtils]: 164: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,312 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {37104#true} {37608#(and (= main_~y~0 22) (= main_~c~0 22))} #50#return; {37608#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 11:04:34,312 INFO L290 TraceCheckUtils]: 166: Hoare triple {37608#(and (= main_~y~0 22) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37630#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 11:04:34,313 INFO L290 TraceCheckUtils]: 167: Hoare triple {37630#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !false; {37630#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 11:04:34,313 INFO L272 TraceCheckUtils]: 168: Hoare triple {37630#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,313 INFO L290 TraceCheckUtils]: 169: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,313 INFO L290 TraceCheckUtils]: 170: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,313 INFO L290 TraceCheckUtils]: 171: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,313 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {37104#true} {37630#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} #50#return; {37630#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 11:04:34,314 INFO L290 TraceCheckUtils]: 173: Hoare triple {37630#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37652#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} is VALID [2022-04-08 11:04:34,314 INFO L290 TraceCheckUtils]: 174: Hoare triple {37652#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} assume !false; {37652#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} is VALID [2022-04-08 11:04:34,314 INFO L272 TraceCheckUtils]: 175: Hoare triple {37652#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,314 INFO L290 TraceCheckUtils]: 176: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,314 INFO L290 TraceCheckUtils]: 177: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,315 INFO L290 TraceCheckUtils]: 178: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,315 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {37104#true} {37652#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} #50#return; {37652#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} is VALID [2022-04-08 11:04:34,315 INFO L290 TraceCheckUtils]: 180: Hoare triple {37652#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37674#(and (= (+ main_~c~0 (- 3)) 22) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 11:04:34,322 INFO L290 TraceCheckUtils]: 181: Hoare triple {37674#(and (= (+ main_~c~0 (- 3)) 22) (= (+ (- 1) main_~y~0) 24))} assume !false; {37674#(and (= (+ main_~c~0 (- 3)) 22) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 11:04:34,322 INFO L272 TraceCheckUtils]: 182: Hoare triple {37674#(and (= (+ main_~c~0 (- 3)) 22) (= (+ (- 1) main_~y~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,322 INFO L290 TraceCheckUtils]: 183: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,322 INFO L290 TraceCheckUtils]: 184: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,322 INFO L290 TraceCheckUtils]: 185: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,323 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {37104#true} {37674#(and (= (+ main_~c~0 (- 3)) 22) (= (+ (- 1) main_~y~0) 24))} #50#return; {37674#(and (= (+ main_~c~0 (- 3)) 22) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 11:04:34,323 INFO L290 TraceCheckUtils]: 187: Hoare triple {37674#(and (= (+ main_~c~0 (- 3)) 22) (= (+ (- 1) main_~y~0) 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37696#(and (= 22 (+ main_~c~0 (- 4))) (= main_~y~0 26))} is VALID [2022-04-08 11:04:34,324 INFO L290 TraceCheckUtils]: 188: Hoare triple {37696#(and (= 22 (+ main_~c~0 (- 4))) (= main_~y~0 26))} assume !false; {37696#(and (= 22 (+ main_~c~0 (- 4))) (= main_~y~0 26))} is VALID [2022-04-08 11:04:34,324 INFO L272 TraceCheckUtils]: 189: Hoare triple {37696#(and (= 22 (+ main_~c~0 (- 4))) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,324 INFO L290 TraceCheckUtils]: 190: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,324 INFO L290 TraceCheckUtils]: 191: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,324 INFO L290 TraceCheckUtils]: 192: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,324 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {37104#true} {37696#(and (= 22 (+ main_~c~0 (- 4))) (= main_~y~0 26))} #50#return; {37696#(and (= 22 (+ main_~c~0 (- 4))) (= main_~y~0 26))} is VALID [2022-04-08 11:04:34,324 INFO L290 TraceCheckUtils]: 194: Hoare triple {37696#(and (= 22 (+ main_~c~0 (- 4))) (= main_~y~0 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37718#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 11:04:34,325 INFO L290 TraceCheckUtils]: 195: Hoare triple {37718#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {37718#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 11:04:34,325 INFO L272 TraceCheckUtils]: 196: Hoare triple {37718#(and (= main_~y~0 27) (= main_~c~0 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,325 INFO L290 TraceCheckUtils]: 197: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,325 INFO L290 TraceCheckUtils]: 198: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,325 INFO L290 TraceCheckUtils]: 199: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,325 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {37104#true} {37718#(and (= main_~y~0 27) (= main_~c~0 27))} #50#return; {37718#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 11:04:34,326 INFO L290 TraceCheckUtils]: 201: Hoare triple {37718#(and (= main_~y~0 27) (= main_~c~0 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37740#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 11:04:34,326 INFO L290 TraceCheckUtils]: 202: Hoare triple {37740#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} assume !false; {37740#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 11:04:34,326 INFO L272 TraceCheckUtils]: 203: Hoare triple {37740#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,326 INFO L290 TraceCheckUtils]: 204: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,326 INFO L290 TraceCheckUtils]: 205: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,326 INFO L290 TraceCheckUtils]: 206: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,327 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {37104#true} {37740#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} #50#return; {37740#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 11:04:34,327 INFO L290 TraceCheckUtils]: 208: Hoare triple {37740#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37762#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:04:34,327 INFO L290 TraceCheckUtils]: 209: Hoare triple {37762#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} assume !false; {37762#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:04:34,327 INFO L272 TraceCheckUtils]: 210: Hoare triple {37762#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,327 INFO L290 TraceCheckUtils]: 211: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,327 INFO L290 TraceCheckUtils]: 212: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,327 INFO L290 TraceCheckUtils]: 213: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,328 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {37104#true} {37762#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} #50#return; {37762#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:04:34,328 INFO L290 TraceCheckUtils]: 215: Hoare triple {37762#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37784#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:04:34,328 INFO L290 TraceCheckUtils]: 216: Hoare triple {37784#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} assume !false; {37784#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:04:34,328 INFO L272 TraceCheckUtils]: 217: Hoare triple {37784#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,329 INFO L290 TraceCheckUtils]: 218: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,329 INFO L290 TraceCheckUtils]: 219: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,329 INFO L290 TraceCheckUtils]: 220: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,329 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {37104#true} {37784#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} #50#return; {37784#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:04:34,329 INFO L290 TraceCheckUtils]: 222: Hoare triple {37784#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37806#(and (= (+ main_~c~0 (- 4)) 27) (= (+ (- 2) main_~y~0) 29))} is VALID [2022-04-08 11:04:34,330 INFO L290 TraceCheckUtils]: 223: Hoare triple {37806#(and (= (+ main_~c~0 (- 4)) 27) (= (+ (- 2) main_~y~0) 29))} assume !false; {37806#(and (= (+ main_~c~0 (- 4)) 27) (= (+ (- 2) main_~y~0) 29))} is VALID [2022-04-08 11:04:34,345 INFO L272 TraceCheckUtils]: 224: Hoare triple {37806#(and (= (+ main_~c~0 (- 4)) 27) (= (+ (- 2) main_~y~0) 29))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,345 INFO L290 TraceCheckUtils]: 225: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,345 INFO L290 TraceCheckUtils]: 226: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,345 INFO L290 TraceCheckUtils]: 227: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,346 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {37104#true} {37806#(and (= (+ main_~c~0 (- 4)) 27) (= (+ (- 2) main_~y~0) 29))} #50#return; {37806#(and (= (+ main_~c~0 (- 4)) 27) (= (+ (- 2) main_~y~0) 29))} is VALID [2022-04-08 11:04:34,346 INFO L290 TraceCheckUtils]: 229: Hoare triple {37806#(and (= (+ main_~c~0 (- 4)) 27) (= (+ (- 2) main_~y~0) 29))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37828#(and (= (+ main_~c~0 (- 5)) 27) (= (+ main_~y~0 (- 3)) 29))} is VALID [2022-04-08 11:04:34,346 INFO L290 TraceCheckUtils]: 230: Hoare triple {37828#(and (= (+ main_~c~0 (- 5)) 27) (= (+ main_~y~0 (- 3)) 29))} assume !false; {37828#(and (= (+ main_~c~0 (- 5)) 27) (= (+ main_~y~0 (- 3)) 29))} is VALID [2022-04-08 11:04:34,347 INFO L272 TraceCheckUtils]: 231: Hoare triple {37828#(and (= (+ main_~c~0 (- 5)) 27) (= (+ main_~y~0 (- 3)) 29))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,347 INFO L290 TraceCheckUtils]: 232: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,347 INFO L290 TraceCheckUtils]: 233: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,347 INFO L290 TraceCheckUtils]: 234: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,347 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {37104#true} {37828#(and (= (+ main_~c~0 (- 5)) 27) (= (+ main_~y~0 (- 3)) 29))} #50#return; {37828#(and (= (+ main_~c~0 (- 5)) 27) (= (+ main_~y~0 (- 3)) 29))} is VALID [2022-04-08 11:04:34,348 INFO L290 TraceCheckUtils]: 236: Hoare triple {37828#(and (= (+ main_~c~0 (- 5)) 27) (= (+ main_~y~0 (- 3)) 29))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37850#(and (= 29 (+ main_~y~0 (- 4))) (= (+ main_~c~0 (- 6)) 27))} is VALID [2022-04-08 11:04:34,348 INFO L290 TraceCheckUtils]: 237: Hoare triple {37850#(and (= 29 (+ main_~y~0 (- 4))) (= (+ main_~c~0 (- 6)) 27))} assume !false; {37850#(and (= 29 (+ main_~y~0 (- 4))) (= (+ main_~c~0 (- 6)) 27))} is VALID [2022-04-08 11:04:34,348 INFO L272 TraceCheckUtils]: 238: Hoare triple {37850#(and (= 29 (+ main_~y~0 (- 4))) (= (+ main_~c~0 (- 6)) 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,348 INFO L290 TraceCheckUtils]: 239: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,348 INFO L290 TraceCheckUtils]: 240: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,348 INFO L290 TraceCheckUtils]: 241: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,349 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {37104#true} {37850#(and (= 29 (+ main_~y~0 (- 4))) (= (+ main_~c~0 (- 6)) 27))} #50#return; {37850#(and (= 29 (+ main_~y~0 (- 4))) (= (+ main_~c~0 (- 6)) 27))} is VALID [2022-04-08 11:04:34,349 INFO L290 TraceCheckUtils]: 243: Hoare triple {37850#(and (= 29 (+ main_~y~0 (- 4))) (= (+ main_~c~0 (- 6)) 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37872#(and (= (+ main_~c~0 (- 7)) 27) (= 29 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 11:04:34,349 INFO L290 TraceCheckUtils]: 244: Hoare triple {37872#(and (= (+ main_~c~0 (- 7)) 27) (= 29 (+ main_~y~0 (- 5))))} assume !false; {37872#(and (= (+ main_~c~0 (- 7)) 27) (= 29 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 11:04:34,349 INFO L272 TraceCheckUtils]: 245: Hoare triple {37872#(and (= (+ main_~c~0 (- 7)) 27) (= 29 (+ main_~y~0 (- 5))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,349 INFO L290 TraceCheckUtils]: 246: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,350 INFO L290 TraceCheckUtils]: 247: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,350 INFO L290 TraceCheckUtils]: 248: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,350 INFO L284 TraceCheckUtils]: 249: Hoare quadruple {37104#true} {37872#(and (= (+ main_~c~0 (- 7)) 27) (= 29 (+ main_~y~0 (- 5))))} #50#return; {37872#(and (= (+ main_~c~0 (- 7)) 27) (= 29 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 11:04:34,350 INFO L290 TraceCheckUtils]: 250: Hoare triple {37872#(and (= (+ main_~c~0 (- 7)) 27) (= 29 (+ main_~y~0 (- 5))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37894#(and (= (+ main_~y~0 (- 6)) 29) (= 27 (+ main_~c~0 (- 8))))} is VALID [2022-04-08 11:04:34,351 INFO L290 TraceCheckUtils]: 251: Hoare triple {37894#(and (= (+ main_~y~0 (- 6)) 29) (= 27 (+ main_~c~0 (- 8))))} assume !false; {37894#(and (= (+ main_~y~0 (- 6)) 29) (= 27 (+ main_~c~0 (- 8))))} is VALID [2022-04-08 11:04:34,351 INFO L272 TraceCheckUtils]: 252: Hoare triple {37894#(and (= (+ main_~y~0 (- 6)) 29) (= 27 (+ main_~c~0 (- 8))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,351 INFO L290 TraceCheckUtils]: 253: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,351 INFO L290 TraceCheckUtils]: 254: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,351 INFO L290 TraceCheckUtils]: 255: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,351 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {37104#true} {37894#(and (= (+ main_~y~0 (- 6)) 29) (= 27 (+ main_~c~0 (- 8))))} #50#return; {37894#(and (= (+ main_~y~0 (- 6)) 29) (= 27 (+ main_~c~0 (- 8))))} is VALID [2022-04-08 11:04:34,352 INFO L290 TraceCheckUtils]: 257: Hoare triple {37894#(and (= (+ main_~y~0 (- 6)) 29) (= 27 (+ main_~c~0 (- 8))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37916#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} is VALID [2022-04-08 11:04:34,352 INFO L290 TraceCheckUtils]: 258: Hoare triple {37916#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} assume !false; {37916#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} is VALID [2022-04-08 11:04:34,352 INFO L272 TraceCheckUtils]: 259: Hoare triple {37916#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 11:04:34,352 INFO L290 TraceCheckUtils]: 260: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 11:04:34,352 INFO L290 TraceCheckUtils]: 261: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 11:04:34,352 INFO L290 TraceCheckUtils]: 262: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 11:04:34,353 INFO L284 TraceCheckUtils]: 263: Hoare quadruple {37104#true} {37916#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} #50#return; {37916#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} is VALID [2022-04-08 11:04:34,353 INFO L290 TraceCheckUtils]: 264: Hoare triple {37916#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} assume !(~c~0 < ~k~0); {37938#(and (<= main_~k~0 36) (= main_~y~0 36) (< 35 main_~k~0))} is VALID [2022-04-08 11:04:34,354 INFO L272 TraceCheckUtils]: 265: Hoare triple {37938#(and (<= main_~k~0 36) (= main_~y~0 36) (< 35 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37942#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:04:34,354 INFO L290 TraceCheckUtils]: 266: Hoare triple {37942#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37946#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:04:34,355 INFO L290 TraceCheckUtils]: 267: Hoare triple {37946#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37105#false} is VALID [2022-04-08 11:04:34,355 INFO L290 TraceCheckUtils]: 268: Hoare triple {37105#false} assume !false; {37105#false} is VALID [2022-04-08 11:04:34,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4736 backedges. 74 proven. 1998 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2022-04-08 11:04:34,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:04:34,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:04:34,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62848736] [2022-04-08 11:04:34,838 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:04:34,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2605986] [2022-04-08 11:04:34,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2605986] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:04:34,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:04:34,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2022-04-08 11:04:34,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:04:34,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [246519300] [2022-04-08 11:04:34,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [246519300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:04:34,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:04:34,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-08 11:04:34,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421907387] [2022-04-08 11:04:34,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:04:34,839 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 39 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Word has length 269 [2022-04-08 11:04:34,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:04:34,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 39 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 11:04:35,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:04:35,771 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-08 11:04:35,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:04:35,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-08 11:04:35,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 11:04:35,771 INFO L87 Difference]: Start difference. First operand 130 states and 165 transitions. Second operand has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 39 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 11:05:21,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:05:21,251 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2022-04-08 11:05:21,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-08 11:05:21,251 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 39 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Word has length 269 [2022-04-08 11:05:21,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:05:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 39 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 11:05:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 170 transitions. [2022-04-08 11:05:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 39 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 11:05:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 170 transitions. [2022-04-08 11:05:21,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 170 transitions. [2022-04-08 11:05:22,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:05:22,360 INFO L225 Difference]: With dead ends: 138 [2022-04-08 11:05:22,360 INFO L226 Difference]: Without dead ends: 133 [2022-04-08 11:05:22,361 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=2023, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 11:05:22,366 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 2 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 4491 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 4491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2022-04-08 11:05:22,366 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2079 Invalid, 4491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4491 Invalid, 0 Unknown, 0 Unchecked, 23.5s Time] [2022-04-08 11:05:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-08 11:05:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-04-08 11:05:22,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:05:22,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 11:05:22,523 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 11:05:22,523 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 11:05:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:05:22,525 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2022-04-08 11:05:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions. [2022-04-08 11:05:22,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:05:22,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:05:22,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 133 states. [2022-04-08 11:05:22,526 INFO L87 Difference]: Start difference. First operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 133 states. [2022-04-08 11:05:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:05:22,528 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2022-04-08 11:05:22,528 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions. [2022-04-08 11:05:22,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:05:22,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:05:22,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:05:22,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:05:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 11:05:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 169 transitions. [2022-04-08 11:05:22,531 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 169 transitions. Word has length 269 [2022-04-08 11:05:22,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:05:22,531 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 169 transitions. [2022-04-08 11:05:22,531 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 39 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 11:05:22,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 169 transitions. [2022-04-08 11:05:23,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:05:23,844 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions. [2022-04-08 11:05:23,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2022-04-08 11:05:23,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:05:23,845 INFO L499 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:05:23,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-08 11:05:24,046 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-08 11:05:24,046 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:05:24,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:05:24,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1749058981, now seen corresponding path program 73 times [2022-04-08 11:05:24,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:05:24,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1790849424] [2022-04-08 11:05:24,128 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:05:24,128 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:05:24,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1749058981, now seen corresponding path program 74 times [2022-04-08 11:05:24,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:05:24,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709457813] [2022-04-08 11:05:24,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:05:24,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:05:24,143 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:05:24,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [613623263] [2022-04-08 11:05:24,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:05:24,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:05:24,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:05:24,147 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:05:24,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-08 11:05:25,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:05:25,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:05:25,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 156 conjunts are in the unsatisfiable core [2022-04-08 11:05:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:05:25,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:05:27,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {38806#true} call ULTIMATE.init(); {38806#true} is VALID [2022-04-08 11:05:27,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {38806#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(9, 2);call #Ultimate.allocInit(12, 3); {38806#true} is VALID [2022-04-08 11:05:27,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38806#true} {38806#true} #56#return; {38806#true} is VALID [2022-04-08 11:05:27,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {38806#true} call #t~ret5 := main(); {38806#true} is VALID [2022-04-08 11:05:27,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {38806#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {38826#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:05:27,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {38826#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {38826#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:05:27,160 INFO L272 TraceCheckUtils]: 7: Hoare triple {38826#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,161 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {38806#true} {38826#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {38826#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:05:27,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {38826#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {38848#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 11:05:27,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {38848#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {38848#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 11:05:27,162 INFO L272 TraceCheckUtils]: 14: Hoare triple {38848#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,162 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {38806#true} {38848#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {38848#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 11:05:27,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {38848#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {38870#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 11:05:27,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {38870#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {38870#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 11:05:27,163 INFO L272 TraceCheckUtils]: 21: Hoare triple {38870#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,164 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {38806#true} {38870#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #50#return; {38870#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 11:05:27,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {38870#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {38892#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 11:05:27,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {38892#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} assume !false; {38892#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 11:05:27,164 INFO L272 TraceCheckUtils]: 28: Hoare triple {38892#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,165 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {38806#true} {38892#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} #50#return; {38892#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 11:05:27,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {38892#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {38914#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-08 11:05:27,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {38914#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} assume !false; {38914#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-08 11:05:27,166 INFO L272 TraceCheckUtils]: 35: Hoare triple {38914#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,166 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {38806#true} {38914#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} #50#return; {38914#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-08 11:05:27,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {38914#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {38936#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 11:05:27,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {38936#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {38936#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 11:05:27,167 INFO L272 TraceCheckUtils]: 42: Hoare triple {38936#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,167 INFO L290 TraceCheckUtils]: 43: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,167 INFO L290 TraceCheckUtils]: 45: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,168 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {38806#true} {38936#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {38936#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 11:05:27,168 INFO L290 TraceCheckUtils]: 47: Hoare triple {38936#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {38958#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,169 INFO L290 TraceCheckUtils]: 48: Hoare triple {38958#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {38958#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,169 INFO L272 TraceCheckUtils]: 49: Hoare triple {38958#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,169 INFO L290 TraceCheckUtils]: 50: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,169 INFO L290 TraceCheckUtils]: 51: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,169 INFO L290 TraceCheckUtils]: 52: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,169 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {38806#true} {38958#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #50#return; {38958#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,170 INFO L290 TraceCheckUtils]: 54: Hoare triple {38958#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {38980#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 11:05:27,170 INFO L290 TraceCheckUtils]: 55: Hoare triple {38980#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {38980#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 11:05:27,170 INFO L272 TraceCheckUtils]: 56: Hoare triple {38980#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,170 INFO L290 TraceCheckUtils]: 57: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,170 INFO L290 TraceCheckUtils]: 58: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,170 INFO L290 TraceCheckUtils]: 59: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,171 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {38806#true} {38980#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {38980#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 11:05:27,171 INFO L290 TraceCheckUtils]: 61: Hoare triple {38980#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39002#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,171 INFO L290 TraceCheckUtils]: 62: Hoare triple {39002#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !false; {39002#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,172 INFO L272 TraceCheckUtils]: 63: Hoare triple {39002#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,172 INFO L290 TraceCheckUtils]: 64: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,172 INFO L290 TraceCheckUtils]: 65: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,172 INFO L290 TraceCheckUtils]: 66: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,172 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {38806#true} {39002#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #50#return; {39002#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,173 INFO L290 TraceCheckUtils]: 68: Hoare triple {39002#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39024#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 11:05:27,173 INFO L290 TraceCheckUtils]: 69: Hoare triple {39024#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} assume !false; {39024#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 11:05:27,173 INFO L272 TraceCheckUtils]: 70: Hoare triple {39024#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,173 INFO L290 TraceCheckUtils]: 71: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,173 INFO L290 TraceCheckUtils]: 72: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,173 INFO L290 TraceCheckUtils]: 73: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,174 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {38806#true} {39024#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} #50#return; {39024#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 11:05:27,174 INFO L290 TraceCheckUtils]: 75: Hoare triple {39024#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39046#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 11:05:27,174 INFO L290 TraceCheckUtils]: 76: Hoare triple {39046#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !false; {39046#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 11:05:27,174 INFO L272 TraceCheckUtils]: 77: Hoare triple {39046#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,174 INFO L290 TraceCheckUtils]: 78: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,174 INFO L290 TraceCheckUtils]: 79: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,175 INFO L290 TraceCheckUtils]: 80: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,175 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {38806#true} {39046#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} #50#return; {39046#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 11:05:27,175 INFO L290 TraceCheckUtils]: 82: Hoare triple {39046#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39068#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 11:05:27,176 INFO L290 TraceCheckUtils]: 83: Hoare triple {39068#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} assume !false; {39068#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 11:05:27,176 INFO L272 TraceCheckUtils]: 84: Hoare triple {39068#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,176 INFO L290 TraceCheckUtils]: 85: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,176 INFO L290 TraceCheckUtils]: 86: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,176 INFO L290 TraceCheckUtils]: 87: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,176 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {38806#true} {39068#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} #50#return; {39068#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 11:05:27,177 INFO L290 TraceCheckUtils]: 89: Hoare triple {39068#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39090#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 11:05:27,177 INFO L290 TraceCheckUtils]: 90: Hoare triple {39090#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {39090#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 11:05:27,177 INFO L272 TraceCheckUtils]: 91: Hoare triple {39090#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,177 INFO L290 TraceCheckUtils]: 92: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,177 INFO L290 TraceCheckUtils]: 93: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,177 INFO L290 TraceCheckUtils]: 94: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,178 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {38806#true} {39090#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {39090#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 11:05:27,178 INFO L290 TraceCheckUtils]: 96: Hoare triple {39090#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39112#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,178 INFO L290 TraceCheckUtils]: 97: Hoare triple {39112#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {39112#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,179 INFO L272 TraceCheckUtils]: 98: Hoare triple {39112#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,179 INFO L290 TraceCheckUtils]: 99: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,179 INFO L290 TraceCheckUtils]: 100: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,179 INFO L290 TraceCheckUtils]: 101: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,179 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {38806#true} {39112#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #50#return; {39112#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,180 INFO L290 TraceCheckUtils]: 103: Hoare triple {39112#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39134#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-08 11:05:27,180 INFO L290 TraceCheckUtils]: 104: Hoare triple {39134#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} assume !false; {39134#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-08 11:05:27,180 INFO L272 TraceCheckUtils]: 105: Hoare triple {39134#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,180 INFO L290 TraceCheckUtils]: 106: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,180 INFO L290 TraceCheckUtils]: 107: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,180 INFO L290 TraceCheckUtils]: 108: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,181 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {38806#true} {39134#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} #50#return; {39134#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-08 11:05:27,181 INFO L290 TraceCheckUtils]: 110: Hoare triple {39134#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39156#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 11:05:27,181 INFO L290 TraceCheckUtils]: 111: Hoare triple {39156#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {39156#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 11:05:27,181 INFO L272 TraceCheckUtils]: 112: Hoare triple {39156#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,181 INFO L290 TraceCheckUtils]: 113: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,181 INFO L290 TraceCheckUtils]: 114: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,182 INFO L290 TraceCheckUtils]: 115: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,182 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {38806#true} {39156#(and (= main_~c~0 15) (= main_~y~0 15))} #50#return; {39156#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 11:05:27,182 INFO L290 TraceCheckUtils]: 117: Hoare triple {39156#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39178#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,183 INFO L290 TraceCheckUtils]: 118: Hoare triple {39178#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {39178#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,183 INFO L272 TraceCheckUtils]: 119: Hoare triple {39178#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,183 INFO L290 TraceCheckUtils]: 120: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,183 INFO L290 TraceCheckUtils]: 121: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,183 INFO L290 TraceCheckUtils]: 122: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,183 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {38806#true} {39178#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #50#return; {39178#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,184 INFO L290 TraceCheckUtils]: 124: Hoare triple {39178#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39200#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-08 11:05:27,184 INFO L290 TraceCheckUtils]: 125: Hoare triple {39200#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !false; {39200#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-08 11:05:27,184 INFO L272 TraceCheckUtils]: 126: Hoare triple {39200#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,184 INFO L290 TraceCheckUtils]: 127: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,184 INFO L290 TraceCheckUtils]: 128: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,184 INFO L290 TraceCheckUtils]: 129: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,185 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {38806#true} {39200#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} #50#return; {39200#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-08 11:05:27,185 INFO L290 TraceCheckUtils]: 131: Hoare triple {39200#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39222#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} is VALID [2022-04-08 11:05:27,186 INFO L290 TraceCheckUtils]: 132: Hoare triple {39222#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} assume !false; {39222#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} is VALID [2022-04-08 11:05:27,186 INFO L272 TraceCheckUtils]: 133: Hoare triple {39222#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,186 INFO L290 TraceCheckUtils]: 134: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,186 INFO L290 TraceCheckUtils]: 135: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,186 INFO L290 TraceCheckUtils]: 136: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,186 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {38806#true} {39222#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} #50#return; {39222#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} is VALID [2022-04-08 11:05:27,187 INFO L290 TraceCheckUtils]: 138: Hoare triple {39222#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39244#(and (= (+ main_~y~0 (- 4)) 15) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 11:05:27,187 INFO L290 TraceCheckUtils]: 139: Hoare triple {39244#(and (= (+ main_~y~0 (- 4)) 15) (= (+ (- 1) main_~c~0) 18))} assume !false; {39244#(and (= (+ main_~y~0 (- 4)) 15) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 11:05:27,187 INFO L272 TraceCheckUtils]: 140: Hoare triple {39244#(and (= (+ main_~y~0 (- 4)) 15) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,187 INFO L290 TraceCheckUtils]: 141: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,187 INFO L290 TraceCheckUtils]: 142: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,187 INFO L290 TraceCheckUtils]: 143: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,188 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {38806#true} {39244#(and (= (+ main_~y~0 (- 4)) 15) (= (+ (- 1) main_~c~0) 18))} #50#return; {39244#(and (= (+ main_~y~0 (- 4)) 15) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 11:05:27,188 INFO L290 TraceCheckUtils]: 145: Hoare triple {39244#(and (= (+ main_~y~0 (- 4)) 15) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39266#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 11:05:27,188 INFO L290 TraceCheckUtils]: 146: Hoare triple {39266#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {39266#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 11:05:27,188 INFO L272 TraceCheckUtils]: 147: Hoare triple {39266#(and (= main_~c~0 20) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,189 INFO L290 TraceCheckUtils]: 148: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,189 INFO L290 TraceCheckUtils]: 149: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,189 INFO L290 TraceCheckUtils]: 150: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,189 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {38806#true} {39266#(and (= main_~c~0 20) (= main_~y~0 20))} #50#return; {39266#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 11:05:27,189 INFO L290 TraceCheckUtils]: 152: Hoare triple {39266#(and (= main_~c~0 20) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39288#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,190 INFO L290 TraceCheckUtils]: 153: Hoare triple {39288#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !false; {39288#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,190 INFO L272 TraceCheckUtils]: 154: Hoare triple {39288#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,190 INFO L290 TraceCheckUtils]: 155: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,190 INFO L290 TraceCheckUtils]: 156: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,190 INFO L290 TraceCheckUtils]: 157: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,191 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {38806#true} {39288#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} #50#return; {39288#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,191 INFO L290 TraceCheckUtils]: 159: Hoare triple {39288#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39310#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 11:05:27,191 INFO L290 TraceCheckUtils]: 160: Hoare triple {39310#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {39310#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 11:05:27,191 INFO L272 TraceCheckUtils]: 161: Hoare triple {39310#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,191 INFO L290 TraceCheckUtils]: 162: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,192 INFO L290 TraceCheckUtils]: 163: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,192 INFO L290 TraceCheckUtils]: 164: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,192 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {38806#true} {39310#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #50#return; {39310#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 11:05:27,192 INFO L290 TraceCheckUtils]: 166: Hoare triple {39310#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39332#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} is VALID [2022-04-08 11:05:27,193 INFO L290 TraceCheckUtils]: 167: Hoare triple {39332#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} assume !false; {39332#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} is VALID [2022-04-08 11:05:27,193 INFO L272 TraceCheckUtils]: 168: Hoare triple {39332#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,193 INFO L290 TraceCheckUtils]: 169: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,193 INFO L290 TraceCheckUtils]: 170: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,193 INFO L290 TraceCheckUtils]: 171: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,194 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {38806#true} {39332#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} #50#return; {39332#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} is VALID [2022-04-08 11:05:27,194 INFO L290 TraceCheckUtils]: 173: Hoare triple {39332#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39354#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24))} is VALID [2022-04-08 11:05:27,194 INFO L290 TraceCheckUtils]: 174: Hoare triple {39354#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24))} assume !false; {39354#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24))} is VALID [2022-04-08 11:05:27,194 INFO L272 TraceCheckUtils]: 175: Hoare triple {39354#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,195 INFO L290 TraceCheckUtils]: 176: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,195 INFO L290 TraceCheckUtils]: 177: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,195 INFO L290 TraceCheckUtils]: 178: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,195 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {38806#true} {39354#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24))} #50#return; {39354#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24))} is VALID [2022-04-08 11:05:27,196 INFO L290 TraceCheckUtils]: 180: Hoare triple {39354#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39376#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 11:05:27,196 INFO L290 TraceCheckUtils]: 181: Hoare triple {39376#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !false; {39376#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 11:05:27,196 INFO L272 TraceCheckUtils]: 182: Hoare triple {39376#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,196 INFO L290 TraceCheckUtils]: 183: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,196 INFO L290 TraceCheckUtils]: 184: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,196 INFO L290 TraceCheckUtils]: 185: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,197 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {38806#true} {39376#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} #50#return; {39376#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 11:05:27,197 INFO L290 TraceCheckUtils]: 187: Hoare triple {39376#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39398#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} is VALID [2022-04-08 11:05:27,198 INFO L290 TraceCheckUtils]: 188: Hoare triple {39398#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} assume !false; {39398#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} is VALID [2022-04-08 11:05:27,198 INFO L272 TraceCheckUtils]: 189: Hoare triple {39398#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,198 INFO L290 TraceCheckUtils]: 190: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,198 INFO L290 TraceCheckUtils]: 191: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,198 INFO L290 TraceCheckUtils]: 192: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,198 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {38806#true} {39398#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} #50#return; {39398#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} is VALID [2022-04-08 11:05:27,199 INFO L290 TraceCheckUtils]: 194: Hoare triple {39398#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39420#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} is VALID [2022-04-08 11:05:27,199 INFO L290 TraceCheckUtils]: 195: Hoare triple {39420#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} assume !false; {39420#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} is VALID [2022-04-08 11:05:27,199 INFO L272 TraceCheckUtils]: 196: Hoare triple {39420#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,199 INFO L290 TraceCheckUtils]: 197: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,199 INFO L290 TraceCheckUtils]: 198: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,200 INFO L290 TraceCheckUtils]: 199: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,200 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {38806#true} {39420#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} #50#return; {39420#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} is VALID [2022-04-08 11:05:27,200 INFO L290 TraceCheckUtils]: 201: Hoare triple {39420#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39442#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} is VALID [2022-04-08 11:05:27,201 INFO L290 TraceCheckUtils]: 202: Hoare triple {39442#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} assume !false; {39442#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} is VALID [2022-04-08 11:05:27,201 INFO L272 TraceCheckUtils]: 203: Hoare triple {39442#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,201 INFO L290 TraceCheckUtils]: 204: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,201 INFO L290 TraceCheckUtils]: 205: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,201 INFO L290 TraceCheckUtils]: 206: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,202 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {38806#true} {39442#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} #50#return; {39442#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} is VALID [2022-04-08 11:05:27,202 INFO L290 TraceCheckUtils]: 208: Hoare triple {39442#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39464#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 11:05:27,202 INFO L290 TraceCheckUtils]: 209: Hoare triple {39464#(and (= 29 main_~y~0) (= 29 main_~c~0))} assume !false; {39464#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 11:05:27,202 INFO L272 TraceCheckUtils]: 210: Hoare triple {39464#(and (= 29 main_~y~0) (= 29 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,203 INFO L290 TraceCheckUtils]: 211: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,203 INFO L290 TraceCheckUtils]: 212: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,203 INFO L290 TraceCheckUtils]: 213: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,203 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {38806#true} {39464#(and (= 29 main_~y~0) (= 29 main_~c~0))} #50#return; {39464#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 11:05:27,204 INFO L290 TraceCheckUtils]: 215: Hoare triple {39464#(and (= 29 main_~y~0) (= 29 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39486#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,204 INFO L290 TraceCheckUtils]: 216: Hoare triple {39486#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} assume !false; {39486#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,204 INFO L272 TraceCheckUtils]: 217: Hoare triple {39486#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,204 INFO L290 TraceCheckUtils]: 218: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,204 INFO L290 TraceCheckUtils]: 219: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,204 INFO L290 TraceCheckUtils]: 220: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,205 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {38806#true} {39486#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} #50#return; {39486#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,205 INFO L290 TraceCheckUtils]: 222: Hoare triple {39486#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39508#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29))} is VALID [2022-04-08 11:05:27,205 INFO L290 TraceCheckUtils]: 223: Hoare triple {39508#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29))} assume !false; {39508#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29))} is VALID [2022-04-08 11:05:27,206 INFO L272 TraceCheckUtils]: 224: Hoare triple {39508#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,206 INFO L290 TraceCheckUtils]: 225: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,206 INFO L290 TraceCheckUtils]: 226: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,206 INFO L290 TraceCheckUtils]: 227: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,206 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {38806#true} {39508#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29))} #50#return; {39508#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29))} is VALID [2022-04-08 11:05:27,207 INFO L290 TraceCheckUtils]: 229: Hoare triple {39508#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39530#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} is VALID [2022-04-08 11:05:27,207 INFO L290 TraceCheckUtils]: 230: Hoare triple {39530#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} assume !false; {39530#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} is VALID [2022-04-08 11:05:27,207 INFO L272 TraceCheckUtils]: 231: Hoare triple {39530#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,207 INFO L290 TraceCheckUtils]: 232: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,207 INFO L290 TraceCheckUtils]: 233: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,207 INFO L290 TraceCheckUtils]: 234: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,208 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {38806#true} {39530#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} #50#return; {39530#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} is VALID [2022-04-08 11:05:27,208 INFO L290 TraceCheckUtils]: 236: Hoare triple {39530#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39552#(and (= main_~y~0 33) (= 30 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 11:05:27,208 INFO L290 TraceCheckUtils]: 237: Hoare triple {39552#(and (= main_~y~0 33) (= 30 (+ main_~c~0 (- 3))))} assume !false; {39552#(and (= main_~y~0 33) (= 30 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 11:05:27,208 INFO L272 TraceCheckUtils]: 238: Hoare triple {39552#(and (= main_~y~0 33) (= 30 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,209 INFO L290 TraceCheckUtils]: 239: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,209 INFO L290 TraceCheckUtils]: 240: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,209 INFO L290 TraceCheckUtils]: 241: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,209 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {38806#true} {39552#(and (= main_~y~0 33) (= 30 (+ main_~c~0 (- 3))))} #50#return; {39552#(and (= main_~y~0 33) (= 30 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 11:05:27,210 INFO L290 TraceCheckUtils]: 243: Hoare triple {39552#(and (= main_~y~0 33) (= 30 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39574#(and (= 33 (+ (- 1) main_~y~0)) (= 30 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 11:05:27,210 INFO L290 TraceCheckUtils]: 244: Hoare triple {39574#(and (= 33 (+ (- 1) main_~y~0)) (= 30 (+ main_~c~0 (- 4))))} assume !false; {39574#(and (= 33 (+ (- 1) main_~y~0)) (= 30 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 11:05:27,210 INFO L272 TraceCheckUtils]: 245: Hoare triple {39574#(and (= 33 (+ (- 1) main_~y~0)) (= 30 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,210 INFO L290 TraceCheckUtils]: 246: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,210 INFO L290 TraceCheckUtils]: 247: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,210 INFO L290 TraceCheckUtils]: 248: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,211 INFO L284 TraceCheckUtils]: 249: Hoare quadruple {38806#true} {39574#(and (= 33 (+ (- 1) main_~y~0)) (= 30 (+ main_~c~0 (- 4))))} #50#return; {39574#(and (= 33 (+ (- 1) main_~y~0)) (= 30 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 11:05:27,211 INFO L290 TraceCheckUtils]: 250: Hoare triple {39574#(and (= 33 (+ (- 1) main_~y~0)) (= 30 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39596#(and (= 30 (+ main_~c~0 (- 5))) (= 35 main_~y~0))} is VALID [2022-04-08 11:05:27,211 INFO L290 TraceCheckUtils]: 251: Hoare triple {39596#(and (= 30 (+ main_~c~0 (- 5))) (= 35 main_~y~0))} assume !false; {39596#(and (= 30 (+ main_~c~0 (- 5))) (= 35 main_~y~0))} is VALID [2022-04-08 11:05:27,211 INFO L272 TraceCheckUtils]: 252: Hoare triple {39596#(and (= 30 (+ main_~c~0 (- 5))) (= 35 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,211 INFO L290 TraceCheckUtils]: 253: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,212 INFO L290 TraceCheckUtils]: 254: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,212 INFO L290 TraceCheckUtils]: 255: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,212 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {38806#true} {39596#(and (= 30 (+ main_~c~0 (- 5))) (= 35 main_~y~0))} #50#return; {39596#(and (= 30 (+ main_~c~0 (- 5))) (= 35 main_~y~0))} is VALID [2022-04-08 11:05:27,212 INFO L290 TraceCheckUtils]: 257: Hoare triple {39596#(and (= 30 (+ main_~c~0 (- 5))) (= 35 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39618#(and (= 30 (+ main_~c~0 (- 6))) (= 35 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,213 INFO L290 TraceCheckUtils]: 258: Hoare triple {39618#(and (= 30 (+ main_~c~0 (- 6))) (= 35 (+ (- 1) main_~y~0)))} assume !false; {39618#(and (= 30 (+ main_~c~0 (- 6))) (= 35 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,213 INFO L272 TraceCheckUtils]: 259: Hoare triple {39618#(and (= 30 (+ main_~c~0 (- 6))) (= 35 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,213 INFO L290 TraceCheckUtils]: 260: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,213 INFO L290 TraceCheckUtils]: 261: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,213 INFO L290 TraceCheckUtils]: 262: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,213 INFO L284 TraceCheckUtils]: 263: Hoare quadruple {38806#true} {39618#(and (= 30 (+ main_~c~0 (- 6))) (= 35 (+ (- 1) main_~y~0)))} #50#return; {39618#(and (= 30 (+ main_~c~0 (- 6))) (= 35 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:05:27,214 INFO L290 TraceCheckUtils]: 264: Hoare triple {39618#(and (= 30 (+ main_~c~0 (- 6))) (= 35 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39640#(and (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0) (<= main_~c~0 37))} is VALID [2022-04-08 11:05:27,214 INFO L290 TraceCheckUtils]: 265: Hoare triple {39640#(and (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0) (<= main_~c~0 37))} assume !false; {39640#(and (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0) (<= main_~c~0 37))} is VALID [2022-04-08 11:05:27,214 INFO L272 TraceCheckUtils]: 266: Hoare triple {39640#(and (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0) (<= main_~c~0 37))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 11:05:27,214 INFO L290 TraceCheckUtils]: 267: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 11:05:27,214 INFO L290 TraceCheckUtils]: 268: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 11:05:27,215 INFO L290 TraceCheckUtils]: 269: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 11:05:27,215 INFO L284 TraceCheckUtils]: 270: Hoare quadruple {38806#true} {39640#(and (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0) (<= main_~c~0 37))} #50#return; {39640#(and (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0) (<= main_~c~0 37))} is VALID [2022-04-08 11:05:27,216 INFO L290 TraceCheckUtils]: 271: Hoare triple {39640#(and (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0) (<= main_~c~0 37))} assume !(~c~0 < ~k~0); {39662#(and (<= main_~k~0 37) (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0))} is VALID [2022-04-08 11:05:27,216 INFO L272 TraceCheckUtils]: 272: Hoare triple {39662#(and (<= main_~k~0 37) (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {39666#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:05:27,216 INFO L290 TraceCheckUtils]: 273: Hoare triple {39666#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {39670#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:05:27,217 INFO L290 TraceCheckUtils]: 274: Hoare triple {39670#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {38807#false} is VALID [2022-04-08 11:05:27,217 INFO L290 TraceCheckUtils]: 275: Hoare triple {38807#false} assume !false; {38807#false} is VALID [2022-04-08 11:05:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4997 backedges. 76 proven. 2109 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2022-04-08 11:05:27,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:05:27,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:05:27,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709457813] [2022-04-08 11:05:27,753 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:05:27,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613623263] [2022-04-08 11:05:27,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613623263] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:05:27,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:05:27,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2022-04-08 11:05:27,753 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:05:27,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1790849424] [2022-04-08 11:05:27,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1790849424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:05:27,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:05:27,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-08 11:05:27,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225534908] [2022-04-08 11:05:27,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:05:27,754 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 40 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Word has length 276 [2022-04-08 11:05:27,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:05:27,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 40 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 11:05:28,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:05:28,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-08 11:05:28,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:05:28,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-08 11:05:28,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 11:05:28,985 INFO L87 Difference]: Start difference. First operand 133 states and 169 transitions. Second operand has 43 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 40 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 11:06:21,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:21,486 INFO L93 Difference]: Finished difference Result 141 states and 178 transitions. [2022-04-08 11:06:21,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-08 11:06:21,486 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 40 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Word has length 276 [2022-04-08 11:06:21,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:06:21,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 40 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 11:06:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 174 transitions. [2022-04-08 11:06:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 40 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 11:06:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 174 transitions. [2022-04-08 11:06:21,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 174 transitions. [2022-04-08 11:06:22,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:06:22,640 INFO L225 Difference]: With dead ends: 141 [2022-04-08 11:06:22,640 INFO L226 Difference]: Without dead ends: 136 [2022-04-08 11:06:22,641 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=142, Invalid=2114, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 11:06:22,641 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 2 mSDsluCounter, 2045 mSDsCounter, 0 mSdLazyCounter, 4726 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 4726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.3s IncrementalHoareTripleChecker+Time [2022-04-08 11:06:22,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2172 Invalid, 4726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4726 Invalid, 0 Unknown, 0 Unchecked, 27.3s Time] [2022-04-08 11:06:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-08 11:06:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-04-08 11:06:22,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:06:22,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 42 states have call successors, (42), 5 states have call predecessors, (42), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 11:06:22,789 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 42 states have call successors, (42), 5 states have call predecessors, (42), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 11:06:22,789 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 42 states have call successors, (42), 5 states have call predecessors, (42), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 11:06:22,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:22,792 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2022-04-08 11:06:22,792 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2022-04-08 11:06:22,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:06:22,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:06:22,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 42 states have call successors, (42), 5 states have call predecessors, (42), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 136 states. [2022-04-08 11:06:22,792 INFO L87 Difference]: Start difference. First operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 42 states have call successors, (42), 5 states have call predecessors, (42), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 136 states. [2022-04-08 11:06:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:22,794 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2022-04-08 11:06:22,795 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2022-04-08 11:06:22,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:06:22,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:06:22,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:06:22,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:06:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 42 states have call successors, (42), 5 states have call predecessors, (42), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 11:06:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 173 transitions. [2022-04-08 11:06:22,798 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 173 transitions. Word has length 276 [2022-04-08 11:06:22,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:06:22,798 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 173 transitions. [2022-04-08 11:06:22,798 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 40 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 11:06:22,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 173 transitions. [2022-04-08 11:06:24,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:06:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2022-04-08 11:06:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-04-08 11:06:24,224 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:06:24,224 INFO L499 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:06:24,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-08 11:06:24,424 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-08 11:06:24,424 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:06:24,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:06:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1859525074, now seen corresponding path program 75 times [2022-04-08 11:06:24,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:06:24,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [210705528] [2022-04-08 11:06:24,540 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:06:24,541 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:06:24,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1859525074, now seen corresponding path program 76 times [2022-04-08 11:06:24,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:06:24,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272464761] [2022-04-08 11:06:24,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:06:24,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:06:24,558 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:06:24,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2130453230] [2022-04-08 11:06:24,558 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:06:24,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:06:24,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:06:24,559 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:06:24,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-08 11:06:29,506 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:06:29,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:06:29,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 160 conjunts are in the unsatisfiable core [2022-04-08 11:06:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:06:29,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:06:30,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {40548#true} call ULTIMATE.init(); {40548#true} is VALID [2022-04-08 11:06:30,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {40548#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(9, 2);call #Ultimate.allocInit(12, 3); {40548#true} is VALID [2022-04-08 11:06:30,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40548#true} {40548#true} #56#return; {40548#true} is VALID [2022-04-08 11:06:30,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {40548#true} call #t~ret5 := main(); {40548#true} is VALID [2022-04-08 11:06:30,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {40548#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {40568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:06:30,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {40568#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {40568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:06:30,716 INFO L272 TraceCheckUtils]: 7: Hoare triple {40568#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,717 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {40548#true} {40568#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {40568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:06:30,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {40568#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40590#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 11:06:30,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {40590#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {40590#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 11:06:30,717 INFO L272 TraceCheckUtils]: 14: Hoare triple {40590#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,718 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {40548#true} {40590#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {40590#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 11:06:30,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {40590#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40612#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 11:06:30,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {40612#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {40612#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 11:06:30,718 INFO L272 TraceCheckUtils]: 21: Hoare triple {40612#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,719 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {40548#true} {40612#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #50#return; {40612#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 11:06:30,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {40612#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40634#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 11:06:30,719 INFO L290 TraceCheckUtils]: 27: Hoare triple {40634#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {40634#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 11:06:30,719 INFO L272 TraceCheckUtils]: 28: Hoare triple {40634#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,720 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {40548#true} {40634#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {40634#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 11:06:30,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {40634#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40656#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 11:06:30,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {40656#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {40656#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 11:06:30,720 INFO L272 TraceCheckUtils]: 35: Hoare triple {40656#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,721 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40548#true} {40656#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {40656#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 11:06:30,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {40656#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40678#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 11:06:30,721 INFO L290 TraceCheckUtils]: 41: Hoare triple {40678#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {40678#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 11:06:30,722 INFO L272 TraceCheckUtils]: 42: Hoare triple {40678#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,722 INFO L290 TraceCheckUtils]: 44: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,722 INFO L290 TraceCheckUtils]: 45: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,722 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {40548#true} {40678#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #50#return; {40678#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 11:06:30,722 INFO L290 TraceCheckUtils]: 47: Hoare triple {40678#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40700#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:06:30,723 INFO L290 TraceCheckUtils]: 48: Hoare triple {40700#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {40700#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:06:30,723 INFO L272 TraceCheckUtils]: 49: Hoare triple {40700#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,723 INFO L290 TraceCheckUtils]: 50: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,723 INFO L290 TraceCheckUtils]: 51: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,723 INFO L290 TraceCheckUtils]: 52: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,723 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {40548#true} {40700#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #50#return; {40700#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:06:30,723 INFO L290 TraceCheckUtils]: 54: Hoare triple {40700#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40722#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:06:30,724 INFO L290 TraceCheckUtils]: 55: Hoare triple {40722#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {40722#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:06:30,724 INFO L272 TraceCheckUtils]: 56: Hoare triple {40722#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,724 INFO L290 TraceCheckUtils]: 58: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,724 INFO L290 TraceCheckUtils]: 59: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,724 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {40548#true} {40722#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #50#return; {40722#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:06:30,724 INFO L290 TraceCheckUtils]: 61: Hoare triple {40722#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40744#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 11:06:30,725 INFO L290 TraceCheckUtils]: 62: Hoare triple {40744#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {40744#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 11:06:30,725 INFO L272 TraceCheckUtils]: 63: Hoare triple {40744#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,725 INFO L290 TraceCheckUtils]: 64: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,725 INFO L290 TraceCheckUtils]: 65: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,725 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {40548#true} {40744#(and (= main_~y~0 8) (= main_~c~0 8))} #50#return; {40744#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 11:06:30,725 INFO L290 TraceCheckUtils]: 68: Hoare triple {40744#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40766#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 11:06:30,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {40766#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {40766#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 11:06:30,726 INFO L272 TraceCheckUtils]: 70: Hoare triple {40766#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,726 INFO L290 TraceCheckUtils]: 71: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,726 INFO L290 TraceCheckUtils]: 72: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,726 INFO L290 TraceCheckUtils]: 73: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,726 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {40548#true} {40766#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #50#return; {40766#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 11:06:30,726 INFO L290 TraceCheckUtils]: 75: Hoare triple {40766#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40788#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 11:06:30,727 INFO L290 TraceCheckUtils]: 76: Hoare triple {40788#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {40788#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 11:06:30,727 INFO L272 TraceCheckUtils]: 77: Hoare triple {40788#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,727 INFO L290 TraceCheckUtils]: 78: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,727 INFO L290 TraceCheckUtils]: 79: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,727 INFO L290 TraceCheckUtils]: 80: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,727 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {40548#true} {40788#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {40788#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 11:06:30,728 INFO L290 TraceCheckUtils]: 82: Hoare triple {40788#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40810#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 11:06:30,728 INFO L290 TraceCheckUtils]: 83: Hoare triple {40810#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {40810#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 11:06:30,728 INFO L272 TraceCheckUtils]: 84: Hoare triple {40810#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,728 INFO L290 TraceCheckUtils]: 85: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,728 INFO L290 TraceCheckUtils]: 86: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,728 INFO L290 TraceCheckUtils]: 87: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,728 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {40548#true} {40810#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {40810#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 11:06:30,729 INFO L290 TraceCheckUtils]: 89: Hoare triple {40810#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40832#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 11:06:30,729 INFO L290 TraceCheckUtils]: 90: Hoare triple {40832#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {40832#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 11:06:30,729 INFO L272 TraceCheckUtils]: 91: Hoare triple {40832#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,729 INFO L290 TraceCheckUtils]: 92: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,729 INFO L290 TraceCheckUtils]: 93: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,729 INFO L290 TraceCheckUtils]: 94: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,729 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40548#true} {40832#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #50#return; {40832#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 11:06:30,730 INFO L290 TraceCheckUtils]: 96: Hoare triple {40832#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40854#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 11:06:30,730 INFO L290 TraceCheckUtils]: 97: Hoare triple {40854#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !false; {40854#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 11:06:30,730 INFO L272 TraceCheckUtils]: 98: Hoare triple {40854#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,730 INFO L290 TraceCheckUtils]: 99: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,730 INFO L290 TraceCheckUtils]: 100: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,730 INFO L290 TraceCheckUtils]: 101: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,730 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {40548#true} {40854#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #50#return; {40854#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 11:06:30,731 INFO L290 TraceCheckUtils]: 103: Hoare triple {40854#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40876#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 11:06:30,731 INFO L290 TraceCheckUtils]: 104: Hoare triple {40876#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {40876#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 11:06:30,731 INFO L272 TraceCheckUtils]: 105: Hoare triple {40876#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,731 INFO L290 TraceCheckUtils]: 106: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,731 INFO L290 TraceCheckUtils]: 107: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,731 INFO L290 TraceCheckUtils]: 108: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,731 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {40548#true} {40876#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #50#return; {40876#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 11:06:30,732 INFO L290 TraceCheckUtils]: 110: Hoare triple {40876#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40898#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 11:06:30,732 INFO L290 TraceCheckUtils]: 111: Hoare triple {40898#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {40898#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 11:06:30,732 INFO L272 TraceCheckUtils]: 112: Hoare triple {40898#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,732 INFO L290 TraceCheckUtils]: 113: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,732 INFO L290 TraceCheckUtils]: 114: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,732 INFO L290 TraceCheckUtils]: 115: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,733 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {40548#true} {40898#(and (= main_~c~0 15) (= main_~y~0 15))} #50#return; {40898#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 11:06:30,733 INFO L290 TraceCheckUtils]: 117: Hoare triple {40898#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40920#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 11:06:30,733 INFO L290 TraceCheckUtils]: 118: Hoare triple {40920#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} assume !false; {40920#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 11:06:30,733 INFO L272 TraceCheckUtils]: 119: Hoare triple {40920#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,733 INFO L290 TraceCheckUtils]: 120: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,733 INFO L290 TraceCheckUtils]: 121: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,733 INFO L290 TraceCheckUtils]: 122: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,734 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {40548#true} {40920#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} #50#return; {40920#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 11:06:30,734 INFO L290 TraceCheckUtils]: 124: Hoare triple {40920#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40942#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:06:30,734 INFO L290 TraceCheckUtils]: 125: Hoare triple {40942#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} assume !false; {40942#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:06:30,734 INFO L272 TraceCheckUtils]: 126: Hoare triple {40942#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,734 INFO L290 TraceCheckUtils]: 127: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,734 INFO L290 TraceCheckUtils]: 128: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,734 INFO L290 TraceCheckUtils]: 129: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,735 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {40548#true} {40942#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} #50#return; {40942#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:06:30,735 INFO L290 TraceCheckUtils]: 131: Hoare triple {40942#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40964#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} is VALID [2022-04-08 11:06:30,735 INFO L290 TraceCheckUtils]: 132: Hoare triple {40964#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} assume !false; {40964#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} is VALID [2022-04-08 11:06:30,735 INFO L272 TraceCheckUtils]: 133: Hoare triple {40964#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,735 INFO L290 TraceCheckUtils]: 134: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,735 INFO L290 TraceCheckUtils]: 135: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,735 INFO L290 TraceCheckUtils]: 136: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,736 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {40548#true} {40964#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} #50#return; {40964#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} is VALID [2022-04-08 11:06:30,736 INFO L290 TraceCheckUtils]: 138: Hoare triple {40964#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40986#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 11:06:30,736 INFO L290 TraceCheckUtils]: 139: Hoare triple {40986#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !false; {40986#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 11:06:30,736 INFO L272 TraceCheckUtils]: 140: Hoare triple {40986#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,736 INFO L290 TraceCheckUtils]: 141: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,736 INFO L290 TraceCheckUtils]: 142: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,736 INFO L290 TraceCheckUtils]: 143: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,737 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {40548#true} {40986#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} #50#return; {40986#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 11:06:30,737 INFO L290 TraceCheckUtils]: 145: Hoare triple {40986#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41008#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 11:06:30,737 INFO L290 TraceCheckUtils]: 146: Hoare triple {41008#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {41008#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 11:06:30,737 INFO L272 TraceCheckUtils]: 147: Hoare triple {41008#(and (= main_~c~0 20) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,737 INFO L290 TraceCheckUtils]: 148: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,737 INFO L290 TraceCheckUtils]: 149: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,738 INFO L290 TraceCheckUtils]: 150: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,738 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {40548#true} {41008#(and (= main_~c~0 20) (= main_~y~0 20))} #50#return; {41008#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 11:06:30,738 INFO L290 TraceCheckUtils]: 152: Hoare triple {41008#(and (= main_~c~0 20) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41030#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-08 11:06:30,738 INFO L290 TraceCheckUtils]: 153: Hoare triple {41030#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} assume !false; {41030#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-08 11:06:30,738 INFO L272 TraceCheckUtils]: 154: Hoare triple {41030#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,738 INFO L290 TraceCheckUtils]: 155: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,738 INFO L290 TraceCheckUtils]: 156: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,739 INFO L290 TraceCheckUtils]: 157: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,739 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {40548#true} {41030#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} #50#return; {41030#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-08 11:06:30,739 INFO L290 TraceCheckUtils]: 159: Hoare triple {41030#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41052#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-08 11:06:30,739 INFO L290 TraceCheckUtils]: 160: Hoare triple {41052#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} assume !false; {41052#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-08 11:06:30,739 INFO L272 TraceCheckUtils]: 161: Hoare triple {41052#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,739 INFO L290 TraceCheckUtils]: 162: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,740 INFO L290 TraceCheckUtils]: 163: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,740 INFO L290 TraceCheckUtils]: 164: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,740 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {40548#true} {41052#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} #50#return; {41052#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-08 11:06:30,740 INFO L290 TraceCheckUtils]: 166: Hoare triple {41052#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41074#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 11:06:30,740 INFO L290 TraceCheckUtils]: 167: Hoare triple {41074#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !false; {41074#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 11:06:30,740 INFO L272 TraceCheckUtils]: 168: Hoare triple {41074#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,741 INFO L290 TraceCheckUtils]: 169: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,741 INFO L290 TraceCheckUtils]: 170: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,741 INFO L290 TraceCheckUtils]: 171: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,741 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {40548#true} {41074#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} #50#return; {41074#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 11:06:30,741 INFO L290 TraceCheckUtils]: 173: Hoare triple {41074#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41096#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} is VALID [2022-04-08 11:06:30,741 INFO L290 TraceCheckUtils]: 174: Hoare triple {41096#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} assume !false; {41096#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} is VALID [2022-04-08 11:06:30,741 INFO L272 TraceCheckUtils]: 175: Hoare triple {41096#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,742 INFO L290 TraceCheckUtils]: 176: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,742 INFO L290 TraceCheckUtils]: 177: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,742 INFO L290 TraceCheckUtils]: 178: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,742 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {40548#true} {41096#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} #50#return; {41096#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} is VALID [2022-04-08 11:06:30,742 INFO L290 TraceCheckUtils]: 180: Hoare triple {41096#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41118#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 11:06:30,742 INFO L290 TraceCheckUtils]: 181: Hoare triple {41118#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !false; {41118#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 11:06:30,743 INFO L272 TraceCheckUtils]: 182: Hoare triple {41118#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,743 INFO L290 TraceCheckUtils]: 183: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,743 INFO L290 TraceCheckUtils]: 184: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,743 INFO L290 TraceCheckUtils]: 185: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,743 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {40548#true} {41118#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} #50#return; {41118#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 11:06:30,743 INFO L290 TraceCheckUtils]: 187: Hoare triple {41118#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41140#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 11:06:30,744 INFO L290 TraceCheckUtils]: 188: Hoare triple {41140#(and (= main_~c~0 26) (= main_~y~0 26))} assume !false; {41140#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 11:06:30,744 INFO L272 TraceCheckUtils]: 189: Hoare triple {41140#(and (= main_~c~0 26) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,744 INFO L290 TraceCheckUtils]: 190: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,744 INFO L290 TraceCheckUtils]: 191: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,744 INFO L290 TraceCheckUtils]: 192: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,744 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {40548#true} {41140#(and (= main_~c~0 26) (= main_~y~0 26))} #50#return; {41140#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 11:06:30,744 INFO L290 TraceCheckUtils]: 194: Hoare triple {41140#(and (= main_~c~0 26) (= main_~y~0 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41162#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-08 11:06:30,745 INFO L290 TraceCheckUtils]: 195: Hoare triple {41162#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 1) main_~y~0) 26))} assume !false; {41162#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-08 11:06:30,745 INFO L272 TraceCheckUtils]: 196: Hoare triple {41162#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 1) main_~y~0) 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,745 INFO L290 TraceCheckUtils]: 197: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,745 INFO L290 TraceCheckUtils]: 198: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,745 INFO L290 TraceCheckUtils]: 199: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,745 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {40548#true} {41162#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 1) main_~y~0) 26))} #50#return; {41162#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-08 11:06:30,745 INFO L290 TraceCheckUtils]: 201: Hoare triple {41162#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 1) main_~y~0) 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41184#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} is VALID [2022-04-08 11:06:30,746 INFO L290 TraceCheckUtils]: 202: Hoare triple {41184#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} assume !false; {41184#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} is VALID [2022-04-08 11:06:30,746 INFO L272 TraceCheckUtils]: 203: Hoare triple {41184#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,746 INFO L290 TraceCheckUtils]: 204: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,746 INFO L290 TraceCheckUtils]: 205: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,746 INFO L290 TraceCheckUtils]: 206: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,746 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {40548#true} {41184#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} #50#return; {41184#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} is VALID [2022-04-08 11:06:30,746 INFO L290 TraceCheckUtils]: 208: Hoare triple {41184#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41206#(and (= 28 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 26))} is VALID [2022-04-08 11:06:30,747 INFO L290 TraceCheckUtils]: 209: Hoare triple {41206#(and (= 28 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 26))} assume !false; {41206#(and (= 28 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 26))} is VALID [2022-04-08 11:06:30,747 INFO L272 TraceCheckUtils]: 210: Hoare triple {41206#(and (= 28 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,747 INFO L290 TraceCheckUtils]: 211: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,747 INFO L290 TraceCheckUtils]: 212: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,747 INFO L290 TraceCheckUtils]: 213: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,747 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {40548#true} {41206#(and (= 28 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 26))} #50#return; {41206#(and (= 28 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 26))} is VALID [2022-04-08 11:06:30,748 INFO L290 TraceCheckUtils]: 215: Hoare triple {41206#(and (= 28 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41228#(and (= 26 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 28))} is VALID [2022-04-08 11:06:30,748 INFO L290 TraceCheckUtils]: 216: Hoare triple {41228#(and (= 26 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 28))} assume !false; {41228#(and (= 26 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 28))} is VALID [2022-04-08 11:06:30,748 INFO L272 TraceCheckUtils]: 217: Hoare triple {41228#(and (= 26 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,748 INFO L290 TraceCheckUtils]: 218: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,748 INFO L290 TraceCheckUtils]: 219: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,748 INFO L290 TraceCheckUtils]: 220: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,748 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {40548#true} {41228#(and (= 26 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 28))} #50#return; {41228#(and (= 26 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 28))} is VALID [2022-04-08 11:06:30,749 INFO L290 TraceCheckUtils]: 222: Hoare triple {41228#(and (= 26 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 28))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41250#(and (= main_~c~0 31) (= (+ main_~y~0 (- 3)) 28))} is VALID [2022-04-08 11:06:30,749 INFO L290 TraceCheckUtils]: 223: Hoare triple {41250#(and (= main_~c~0 31) (= (+ main_~y~0 (- 3)) 28))} assume !false; {41250#(and (= main_~c~0 31) (= (+ main_~y~0 (- 3)) 28))} is VALID [2022-04-08 11:06:30,749 INFO L272 TraceCheckUtils]: 224: Hoare triple {41250#(and (= main_~c~0 31) (= (+ main_~y~0 (- 3)) 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,749 INFO L290 TraceCheckUtils]: 225: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,749 INFO L290 TraceCheckUtils]: 226: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,749 INFO L290 TraceCheckUtils]: 227: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,749 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {40548#true} {41250#(and (= main_~c~0 31) (= (+ main_~y~0 (- 3)) 28))} #50#return; {41250#(and (= main_~c~0 31) (= (+ main_~y~0 (- 3)) 28))} is VALID [2022-04-08 11:06:30,750 INFO L290 TraceCheckUtils]: 229: Hoare triple {41250#(and (= main_~c~0 31) (= (+ main_~y~0 (- 3)) 28))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41272#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 11:06:30,750 INFO L290 TraceCheckUtils]: 230: Hoare triple {41272#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !false; {41272#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 11:06:30,750 INFO L272 TraceCheckUtils]: 231: Hoare triple {41272#(and (= 32 main_~y~0) (= 32 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,750 INFO L290 TraceCheckUtils]: 232: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,750 INFO L290 TraceCheckUtils]: 233: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,750 INFO L290 TraceCheckUtils]: 234: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,750 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {40548#true} {41272#(and (= 32 main_~y~0) (= 32 main_~c~0))} #50#return; {41272#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 11:06:30,751 INFO L290 TraceCheckUtils]: 236: Hoare triple {41272#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41294#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32))} is VALID [2022-04-08 11:06:30,751 INFO L290 TraceCheckUtils]: 237: Hoare triple {41294#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32))} assume !false; {41294#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32))} is VALID [2022-04-08 11:06:30,751 INFO L272 TraceCheckUtils]: 238: Hoare triple {41294#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,751 INFO L290 TraceCheckUtils]: 239: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,751 INFO L290 TraceCheckUtils]: 240: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,751 INFO L290 TraceCheckUtils]: 241: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,751 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {40548#true} {41294#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32))} #50#return; {41294#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32))} is VALID [2022-04-08 11:06:30,752 INFO L290 TraceCheckUtils]: 243: Hoare triple {41294#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41316#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} is VALID [2022-04-08 11:06:30,752 INFO L290 TraceCheckUtils]: 244: Hoare triple {41316#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} assume !false; {41316#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} is VALID [2022-04-08 11:06:30,752 INFO L272 TraceCheckUtils]: 245: Hoare triple {41316#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,752 INFO L290 TraceCheckUtils]: 246: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,752 INFO L290 TraceCheckUtils]: 247: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,752 INFO L290 TraceCheckUtils]: 248: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,753 INFO L284 TraceCheckUtils]: 249: Hoare quadruple {40548#true} {41316#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} #50#return; {41316#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} is VALID [2022-04-08 11:06:30,753 INFO L290 TraceCheckUtils]: 250: Hoare triple {41316#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41338#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0))} is VALID [2022-04-08 11:06:30,753 INFO L290 TraceCheckUtils]: 251: Hoare triple {41338#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0))} assume !false; {41338#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0))} is VALID [2022-04-08 11:06:30,753 INFO L272 TraceCheckUtils]: 252: Hoare triple {41338#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,753 INFO L290 TraceCheckUtils]: 253: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,753 INFO L290 TraceCheckUtils]: 254: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,753 INFO L290 TraceCheckUtils]: 255: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,754 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {40548#true} {41338#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0))} #50#return; {41338#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0))} is VALID [2022-04-08 11:06:30,754 INFO L290 TraceCheckUtils]: 257: Hoare triple {41338#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41360#(and (= 34 (+ (- 2) main_~c~0)) (= 35 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:06:30,754 INFO L290 TraceCheckUtils]: 258: Hoare triple {41360#(and (= 34 (+ (- 2) main_~c~0)) (= 35 (+ (- 1) main_~y~0)))} assume !false; {41360#(and (= 34 (+ (- 2) main_~c~0)) (= 35 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:06:30,754 INFO L272 TraceCheckUtils]: 259: Hoare triple {41360#(and (= 34 (+ (- 2) main_~c~0)) (= 35 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,754 INFO L290 TraceCheckUtils]: 260: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,754 INFO L290 TraceCheckUtils]: 261: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,754 INFO L290 TraceCheckUtils]: 262: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,755 INFO L284 TraceCheckUtils]: 263: Hoare quadruple {40548#true} {41360#(and (= 34 (+ (- 2) main_~c~0)) (= 35 (+ (- 1) main_~y~0)))} #50#return; {41360#(and (= 34 (+ (- 2) main_~c~0)) (= 35 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:06:30,755 INFO L290 TraceCheckUtils]: 264: Hoare triple {41360#(and (= 34 (+ (- 2) main_~c~0)) (= 35 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41382#(and (= main_~c~0 37) (= main_~y~0 37))} is VALID [2022-04-08 11:06:30,755 INFO L290 TraceCheckUtils]: 265: Hoare triple {41382#(and (= main_~c~0 37) (= main_~y~0 37))} assume !false; {41382#(and (= main_~c~0 37) (= main_~y~0 37))} is VALID [2022-04-08 11:06:30,755 INFO L272 TraceCheckUtils]: 266: Hoare triple {41382#(and (= main_~c~0 37) (= main_~y~0 37))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,755 INFO L290 TraceCheckUtils]: 267: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,755 INFO L290 TraceCheckUtils]: 268: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,755 INFO L290 TraceCheckUtils]: 269: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,756 INFO L284 TraceCheckUtils]: 270: Hoare quadruple {40548#true} {41382#(and (= main_~c~0 37) (= main_~y~0 37))} #50#return; {41382#(and (= main_~c~0 37) (= main_~y~0 37))} is VALID [2022-04-08 11:06:30,756 INFO L290 TraceCheckUtils]: 271: Hoare triple {41382#(and (= main_~c~0 37) (= main_~y~0 37))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41404#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~c~0 38))} is VALID [2022-04-08 11:06:30,756 INFO L290 TraceCheckUtils]: 272: Hoare triple {41404#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~c~0 38))} assume !false; {41404#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~c~0 38))} is VALID [2022-04-08 11:06:30,756 INFO L272 TraceCheckUtils]: 273: Hoare triple {41404#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~c~0 38))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 11:06:30,756 INFO L290 TraceCheckUtils]: 274: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 11:06:30,756 INFO L290 TraceCheckUtils]: 275: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 11:06:30,756 INFO L290 TraceCheckUtils]: 276: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 11:06:30,757 INFO L284 TraceCheckUtils]: 277: Hoare quadruple {40548#true} {41404#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~c~0 38))} #50#return; {41404#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~c~0 38))} is VALID [2022-04-08 11:06:30,763 INFO L290 TraceCheckUtils]: 278: Hoare triple {41404#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~c~0 38))} assume !(~c~0 < ~k~0); {41426#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~k~0 38))} is VALID [2022-04-08 11:06:30,763 INFO L272 TraceCheckUtils]: 279: Hoare triple {41426#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~k~0 38))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {41430#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:06:30,763 INFO L290 TraceCheckUtils]: 280: Hoare triple {41430#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {41434#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:06:30,764 INFO L290 TraceCheckUtils]: 281: Hoare triple {41434#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40549#false} is VALID [2022-04-08 11:06:30,764 INFO L290 TraceCheckUtils]: 282: Hoare triple {40549#false} assume !false; {40549#false} is VALID [2022-04-08 11:06:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5265 backedges. 78 proven. 2223 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2022-04-08 11:06:30,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:06:31,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:06:31,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272464761] [2022-04-08 11:06:31,133 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:06:31,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130453230] [2022-04-08 11:06:31,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130453230] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:06:31,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:06:31,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2022-04-08 11:06:31,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:06:31,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [210705528] [2022-04-08 11:06:31,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [210705528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:06:31,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:06:31,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-08 11:06:31,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197237826] [2022-04-08 11:06:31,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:06:31,134 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 41 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Word has length 283 [2022-04-08 11:06:31,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:06:31,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 41 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 11:06:32,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:06:32,229 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-08 11:06:32,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:06:32,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-08 11:06:32,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 11:06:32,230 INFO L87 Difference]: Start difference. First operand 136 states and 173 transitions. Second operand has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 41 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 11:07:32,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:07:32,281 INFO L93 Difference]: Finished difference Result 144 states and 182 transitions. [2022-04-08 11:07:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-08 11:07:32,281 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 41 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Word has length 283 [2022-04-08 11:07:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:07:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 41 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 11:07:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 178 transitions. [2022-04-08 11:07:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 41 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 11:07:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 178 transitions. [2022-04-08 11:07:32,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 178 transitions. [2022-04-08 11:07:33,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:07:33,598 INFO L225 Difference]: With dead ends: 144 [2022-04-08 11:07:33,598 INFO L226 Difference]: Without dead ends: 139 [2022-04-08 11:07:33,599 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=2207, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 11:07:33,599 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 2 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 4967 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 4967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.2s IncrementalHoareTripleChecker+Time [2022-04-08 11:07:33,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2267 Invalid, 4967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4967 Invalid, 0 Unknown, 0 Unchecked, 31.2s Time] [2022-04-08 11:07:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-08 11:07:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-04-08 11:07:33,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:07:33,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 43 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 11:07:33,783 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 43 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 11:07:33,783 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 43 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 11:07:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:07:33,786 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2022-04-08 11:07:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 177 transitions. [2022-04-08 11:07:33,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:07:33,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:07:33,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 43 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand 139 states. [2022-04-08 11:07:33,786 INFO L87 Difference]: Start difference. First operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 43 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand 139 states. [2022-04-08 11:07:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:07:33,789 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2022-04-08 11:07:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 177 transitions. [2022-04-08 11:07:33,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:07:33,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:07:33,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:07:33,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:07:33,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 43 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 11:07:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 177 transitions. [2022-04-08 11:07:33,792 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 177 transitions. Word has length 283 [2022-04-08 11:07:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:07:33,792 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 177 transitions. [2022-04-08 11:07:33,792 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 41 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 11:07:33,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 177 transitions. [2022-04-08 11:07:35,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:07:35,278 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 177 transitions. [2022-04-08 11:07:35,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2022-04-08 11:07:35,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:07:35,279 INFO L499 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:07:35,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-08 11:07:35,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-04-08 11:07:35,479 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:07:35,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:07:35,480 INFO L85 PathProgramCache]: Analyzing trace with hash 925296901, now seen corresponding path program 77 times [2022-04-08 11:07:35,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:07:35,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [618335736] [2022-04-08 11:07:35,569 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:07:35,569 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:07:35,569 INFO L85 PathProgramCache]: Analyzing trace with hash 925296901, now seen corresponding path program 78 times [2022-04-08 11:07:35,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:07:35,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589306406] [2022-04-08 11:07:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:07:35,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:07:35,588 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:07:35,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1983462720] [2022-04-08 11:07:35,588 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:07:35,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:07:35,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:07:35,589 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:07:35,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-08 11:07:49,297 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2022-04-08 11:07:49,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:07:49,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 176 conjunts are in the unsatisfiable core [2022-04-08 11:07:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:07:49,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:07:51,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {42330#true} call ULTIMATE.init(); {42330#true} is VALID [2022-04-08 11:07:51,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {42330#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(9, 2);call #Ultimate.allocInit(12, 3); {42330#true} is VALID [2022-04-08 11:07:51,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42330#true} {42330#true} #56#return; {42330#true} is VALID [2022-04-08 11:07:51,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {42330#true} call #t~ret5 := main(); {42330#true} is VALID [2022-04-08 11:07:51,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {42330#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {42350#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:07:51,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {42350#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {42350#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:07:51,171 INFO L272 TraceCheckUtils]: 7: Hoare triple {42350#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,171 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {42330#true} {42350#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {42350#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:07:51,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {42350#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42372#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 11:07:51,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {42372#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {42372#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 11:07:51,172 INFO L272 TraceCheckUtils]: 14: Hoare triple {42372#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,173 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {42330#true} {42372#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {42372#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 11:07:51,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {42372#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42394#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 11:07:51,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {42394#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {42394#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 11:07:51,174 INFO L272 TraceCheckUtils]: 21: Hoare triple {42394#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,174 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {42330#true} {42394#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #50#return; {42394#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 11:07:51,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {42394#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42416#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 11:07:51,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {42416#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {42416#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 11:07:51,175 INFO L272 TraceCheckUtils]: 28: Hoare triple {42416#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,176 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {42330#true} {42416#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {42416#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 11:07:51,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {42416#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42438#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 11:07:51,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {42438#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {42438#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 11:07:51,176 INFO L272 TraceCheckUtils]: 35: Hoare triple {42438#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,176 INFO L290 TraceCheckUtils]: 36: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,176 INFO L290 TraceCheckUtils]: 37: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,177 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {42330#true} {42438#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #50#return; {42438#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 11:07:51,177 INFO L290 TraceCheckUtils]: 40: Hoare triple {42438#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42460#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 11:07:51,178 INFO L290 TraceCheckUtils]: 41: Hoare triple {42460#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {42460#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 11:07:51,178 INFO L272 TraceCheckUtils]: 42: Hoare triple {42460#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,178 INFO L290 TraceCheckUtils]: 43: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,178 INFO L290 TraceCheckUtils]: 44: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,178 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {42330#true} {42460#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {42460#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 11:07:51,179 INFO L290 TraceCheckUtils]: 47: Hoare triple {42460#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42482#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:07:51,179 INFO L290 TraceCheckUtils]: 48: Hoare triple {42482#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {42482#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:07:51,179 INFO L272 TraceCheckUtils]: 49: Hoare triple {42482#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,179 INFO L290 TraceCheckUtils]: 50: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,179 INFO L290 TraceCheckUtils]: 51: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,179 INFO L290 TraceCheckUtils]: 52: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,180 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {42330#true} {42482#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #50#return; {42482#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:07:51,180 INFO L290 TraceCheckUtils]: 54: Hoare triple {42482#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42504#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 11:07:51,180 INFO L290 TraceCheckUtils]: 55: Hoare triple {42504#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {42504#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 11:07:51,180 INFO L272 TraceCheckUtils]: 56: Hoare triple {42504#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,180 INFO L290 TraceCheckUtils]: 57: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,181 INFO L290 TraceCheckUtils]: 58: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,181 INFO L290 TraceCheckUtils]: 59: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,181 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {42330#true} {42504#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {42504#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 11:07:51,181 INFO L290 TraceCheckUtils]: 61: Hoare triple {42504#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42526#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 11:07:51,182 INFO L290 TraceCheckUtils]: 62: Hoare triple {42526#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {42526#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 11:07:51,182 INFO L272 TraceCheckUtils]: 63: Hoare triple {42526#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,182 INFO L290 TraceCheckUtils]: 64: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,182 INFO L290 TraceCheckUtils]: 65: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,182 INFO L290 TraceCheckUtils]: 66: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,182 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {42330#true} {42526#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #50#return; {42526#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 11:07:51,183 INFO L290 TraceCheckUtils]: 68: Hoare triple {42526#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42548#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 11:07:51,183 INFO L290 TraceCheckUtils]: 69: Hoare triple {42548#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !false; {42548#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 11:07:51,183 INFO L272 TraceCheckUtils]: 70: Hoare triple {42548#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,183 INFO L290 TraceCheckUtils]: 71: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,183 INFO L290 TraceCheckUtils]: 72: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,183 INFO L290 TraceCheckUtils]: 73: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,184 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {42330#true} {42548#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #50#return; {42548#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 11:07:51,184 INFO L290 TraceCheckUtils]: 75: Hoare triple {42548#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42570#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 11:07:51,184 INFO L290 TraceCheckUtils]: 76: Hoare triple {42570#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !false; {42570#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 11:07:51,185 INFO L272 TraceCheckUtils]: 77: Hoare triple {42570#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,185 INFO L290 TraceCheckUtils]: 78: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,185 INFO L290 TraceCheckUtils]: 79: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,185 INFO L290 TraceCheckUtils]: 80: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,185 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {42330#true} {42570#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} #50#return; {42570#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 11:07:51,186 INFO L290 TraceCheckUtils]: 82: Hoare triple {42570#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42592#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 11:07:51,186 INFO L290 TraceCheckUtils]: 83: Hoare triple {42592#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {42592#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 11:07:51,186 INFO L272 TraceCheckUtils]: 84: Hoare triple {42592#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,186 INFO L290 TraceCheckUtils]: 85: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,186 INFO L290 TraceCheckUtils]: 86: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,186 INFO L290 TraceCheckUtils]: 87: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,187 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {42330#true} {42592#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {42592#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 11:07:51,187 INFO L290 TraceCheckUtils]: 89: Hoare triple {42592#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42614#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 11:07:51,187 INFO L290 TraceCheckUtils]: 90: Hoare triple {42614#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {42614#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 11:07:51,187 INFO L272 TraceCheckUtils]: 91: Hoare triple {42614#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,187 INFO L290 TraceCheckUtils]: 92: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,187 INFO L290 TraceCheckUtils]: 93: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,188 INFO L290 TraceCheckUtils]: 94: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,188 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {42330#true} {42614#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {42614#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 11:07:51,188 INFO L290 TraceCheckUtils]: 96: Hoare triple {42614#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42636#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 11:07:51,189 INFO L290 TraceCheckUtils]: 97: Hoare triple {42636#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {42636#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 11:07:51,189 INFO L272 TraceCheckUtils]: 98: Hoare triple {42636#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,189 INFO L290 TraceCheckUtils]: 99: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,189 INFO L290 TraceCheckUtils]: 100: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,189 INFO L290 TraceCheckUtils]: 101: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,189 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {42330#true} {42636#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #50#return; {42636#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 11:07:51,190 INFO L290 TraceCheckUtils]: 103: Hoare triple {42636#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42658#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 11:07:51,190 INFO L290 TraceCheckUtils]: 104: Hoare triple {42658#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} assume !false; {42658#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 11:07:51,190 INFO L272 TraceCheckUtils]: 105: Hoare triple {42658#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,190 INFO L290 TraceCheckUtils]: 106: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,190 INFO L290 TraceCheckUtils]: 107: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,190 INFO L290 TraceCheckUtils]: 108: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,191 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {42330#true} {42658#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} #50#return; {42658#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 11:07:51,191 INFO L290 TraceCheckUtils]: 110: Hoare triple {42658#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42680#(and (= main_~y~0 15) (= (+ main_~c~0 (- 3)) 12))} is VALID [2022-04-08 11:07:51,191 INFO L290 TraceCheckUtils]: 111: Hoare triple {42680#(and (= main_~y~0 15) (= (+ main_~c~0 (- 3)) 12))} assume !false; {42680#(and (= main_~y~0 15) (= (+ main_~c~0 (- 3)) 12))} is VALID [2022-04-08 11:07:51,192 INFO L272 TraceCheckUtils]: 112: Hoare triple {42680#(and (= main_~y~0 15) (= (+ main_~c~0 (- 3)) 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,192 INFO L290 TraceCheckUtils]: 113: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,192 INFO L290 TraceCheckUtils]: 114: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,192 INFO L290 TraceCheckUtils]: 115: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,192 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {42330#true} {42680#(and (= main_~y~0 15) (= (+ main_~c~0 (- 3)) 12))} #50#return; {42680#(and (= main_~y~0 15) (= (+ main_~c~0 (- 3)) 12))} is VALID [2022-04-08 11:07:51,192 INFO L290 TraceCheckUtils]: 117: Hoare triple {42680#(and (= main_~y~0 15) (= (+ main_~c~0 (- 3)) 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42702#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 11:07:51,193 INFO L290 TraceCheckUtils]: 118: Hoare triple {42702#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {42702#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 11:07:51,193 INFO L272 TraceCheckUtils]: 119: Hoare triple {42702#(and (= main_~c~0 16) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,193 INFO L290 TraceCheckUtils]: 120: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,193 INFO L290 TraceCheckUtils]: 121: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,193 INFO L290 TraceCheckUtils]: 122: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,193 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {42330#true} {42702#(and (= main_~c~0 16) (= main_~y~0 16))} #50#return; {42702#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 11:07:51,194 INFO L290 TraceCheckUtils]: 124: Hoare triple {42702#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42724#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:07:51,194 INFO L290 TraceCheckUtils]: 125: Hoare triple {42724#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {42724#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:07:51,194 INFO L272 TraceCheckUtils]: 126: Hoare triple {42724#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,194 INFO L290 TraceCheckUtils]: 127: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,194 INFO L290 TraceCheckUtils]: 128: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,194 INFO L290 TraceCheckUtils]: 129: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,195 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {42330#true} {42724#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #50#return; {42724#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:07:51,195 INFO L290 TraceCheckUtils]: 131: Hoare triple {42724#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42746#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 11:07:51,196 INFO L290 TraceCheckUtils]: 132: Hoare triple {42746#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !false; {42746#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 11:07:51,196 INFO L272 TraceCheckUtils]: 133: Hoare triple {42746#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,196 INFO L290 TraceCheckUtils]: 134: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,196 INFO L290 TraceCheckUtils]: 135: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,196 INFO L290 TraceCheckUtils]: 136: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,196 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {42330#true} {42746#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} #50#return; {42746#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 11:07:51,197 INFO L290 TraceCheckUtils]: 138: Hoare triple {42746#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42768#(and (= (+ main_~y~0 (- 3)) 16) (= 17 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:07:51,197 INFO L290 TraceCheckUtils]: 139: Hoare triple {42768#(and (= (+ main_~y~0 (- 3)) 16) (= 17 (+ (- 2) main_~c~0)))} assume !false; {42768#(and (= (+ main_~y~0 (- 3)) 16) (= 17 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:07:51,197 INFO L272 TraceCheckUtils]: 140: Hoare triple {42768#(and (= (+ main_~y~0 (- 3)) 16) (= 17 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,197 INFO L290 TraceCheckUtils]: 141: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,197 INFO L290 TraceCheckUtils]: 142: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,197 INFO L290 TraceCheckUtils]: 143: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,198 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {42330#true} {42768#(and (= (+ main_~y~0 (- 3)) 16) (= 17 (+ (- 2) main_~c~0)))} #50#return; {42768#(and (= (+ main_~y~0 (- 3)) 16) (= 17 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:07:51,198 INFO L290 TraceCheckUtils]: 145: Hoare triple {42768#(and (= (+ main_~y~0 (- 3)) 16) (= 17 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42790#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-08 11:07:51,198 INFO L290 TraceCheckUtils]: 146: Hoare triple {42790#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} assume !false; {42790#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-08 11:07:51,198 INFO L272 TraceCheckUtils]: 147: Hoare triple {42790#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,199 INFO L290 TraceCheckUtils]: 148: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,199 INFO L290 TraceCheckUtils]: 149: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,199 INFO L290 TraceCheckUtils]: 150: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,199 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {42330#true} {42790#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} #50#return; {42790#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-08 11:07:51,199 INFO L290 TraceCheckUtils]: 152: Hoare triple {42790#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42812#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 11:07:51,200 INFO L290 TraceCheckUtils]: 153: Hoare triple {42812#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} assume !false; {42812#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 11:07:51,200 INFO L272 TraceCheckUtils]: 154: Hoare triple {42812#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,200 INFO L290 TraceCheckUtils]: 155: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,200 INFO L290 TraceCheckUtils]: 156: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,200 INFO L290 TraceCheckUtils]: 157: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,200 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {42330#true} {42812#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} #50#return; {42812#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 11:07:51,201 INFO L290 TraceCheckUtils]: 159: Hoare triple {42812#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42834#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 11:07:51,201 INFO L290 TraceCheckUtils]: 160: Hoare triple {42834#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} assume !false; {42834#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 11:07:51,201 INFO L272 TraceCheckUtils]: 161: Hoare triple {42834#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,201 INFO L290 TraceCheckUtils]: 162: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,201 INFO L290 TraceCheckUtils]: 163: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,201 INFO L290 TraceCheckUtils]: 164: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,202 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {42330#true} {42834#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} #50#return; {42834#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 11:07:51,202 INFO L290 TraceCheckUtils]: 166: Hoare triple {42834#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42856#(and (= 16 (+ main_~y~0 (- 7))) (= 23 main_~c~0))} is VALID [2022-04-08 11:07:51,203 INFO L290 TraceCheckUtils]: 167: Hoare triple {42856#(and (= 16 (+ main_~y~0 (- 7))) (= 23 main_~c~0))} assume !false; {42856#(and (= 16 (+ main_~y~0 (- 7))) (= 23 main_~c~0))} is VALID [2022-04-08 11:07:51,203 INFO L272 TraceCheckUtils]: 168: Hoare triple {42856#(and (= 16 (+ main_~y~0 (- 7))) (= 23 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,203 INFO L290 TraceCheckUtils]: 169: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,203 INFO L290 TraceCheckUtils]: 170: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,203 INFO L290 TraceCheckUtils]: 171: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,203 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {42330#true} {42856#(and (= 16 (+ main_~y~0 (- 7))) (= 23 main_~c~0))} #50#return; {42856#(and (= 16 (+ main_~y~0 (- 7))) (= 23 main_~c~0))} is VALID [2022-04-08 11:07:51,204 INFO L290 TraceCheckUtils]: 173: Hoare triple {42856#(and (= 16 (+ main_~y~0 (- 7))) (= 23 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42878#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:07:51,204 INFO L290 TraceCheckUtils]: 174: Hoare triple {42878#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} assume !false; {42878#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:07:51,204 INFO L272 TraceCheckUtils]: 175: Hoare triple {42878#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,204 INFO L290 TraceCheckUtils]: 176: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,204 INFO L290 TraceCheckUtils]: 177: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,204 INFO L290 TraceCheckUtils]: 178: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,205 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {42330#true} {42878#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} #50#return; {42878#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:07:51,205 INFO L290 TraceCheckUtils]: 180: Hoare triple {42878#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42900#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 11:07:51,206 INFO L290 TraceCheckUtils]: 181: Hoare triple {42900#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} assume !false; {42900#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 11:07:51,206 INFO L272 TraceCheckUtils]: 182: Hoare triple {42900#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,206 INFO L290 TraceCheckUtils]: 183: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,206 INFO L290 TraceCheckUtils]: 184: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,206 INFO L290 TraceCheckUtils]: 185: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,206 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {42330#true} {42900#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} #50#return; {42900#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 11:07:51,207 INFO L290 TraceCheckUtils]: 187: Hoare triple {42900#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42922#(and (= (+ (- 2) main_~y~0) 24) (= 23 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 11:07:51,207 INFO L290 TraceCheckUtils]: 188: Hoare triple {42922#(and (= (+ (- 2) main_~y~0) 24) (= 23 (+ main_~c~0 (- 3))))} assume !false; {42922#(and (= (+ (- 2) main_~y~0) 24) (= 23 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 11:07:51,207 INFO L272 TraceCheckUtils]: 189: Hoare triple {42922#(and (= (+ (- 2) main_~y~0) 24) (= 23 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,207 INFO L290 TraceCheckUtils]: 190: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,207 INFO L290 TraceCheckUtils]: 191: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,207 INFO L290 TraceCheckUtils]: 192: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,208 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {42330#true} {42922#(and (= (+ (- 2) main_~y~0) 24) (= 23 (+ main_~c~0 (- 3))))} #50#return; {42922#(and (= (+ (- 2) main_~y~0) 24) (= 23 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 11:07:51,208 INFO L290 TraceCheckUtils]: 194: Hoare triple {42922#(and (= (+ (- 2) main_~y~0) 24) (= 23 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42944#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27))} is VALID [2022-04-08 11:07:51,209 INFO L290 TraceCheckUtils]: 195: Hoare triple {42944#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27))} assume !false; {42944#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27))} is VALID [2022-04-08 11:07:51,209 INFO L272 TraceCheckUtils]: 196: Hoare triple {42944#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,209 INFO L290 TraceCheckUtils]: 197: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,209 INFO L290 TraceCheckUtils]: 198: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,209 INFO L290 TraceCheckUtils]: 199: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,209 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {42330#true} {42944#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27))} #50#return; {42944#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27))} is VALID [2022-04-08 11:07:51,210 INFO L290 TraceCheckUtils]: 201: Hoare triple {42944#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42966#(and (= (+ main_~y~0 (- 4)) 24) (= main_~c~0 28))} is VALID [2022-04-08 11:07:51,210 INFO L290 TraceCheckUtils]: 202: Hoare triple {42966#(and (= (+ main_~y~0 (- 4)) 24) (= main_~c~0 28))} assume !false; {42966#(and (= (+ main_~y~0 (- 4)) 24) (= main_~c~0 28))} is VALID [2022-04-08 11:07:51,210 INFO L272 TraceCheckUtils]: 203: Hoare triple {42966#(and (= (+ main_~y~0 (- 4)) 24) (= main_~c~0 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,210 INFO L290 TraceCheckUtils]: 204: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,210 INFO L290 TraceCheckUtils]: 205: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,210 INFO L290 TraceCheckUtils]: 206: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,211 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {42330#true} {42966#(and (= (+ main_~y~0 (- 4)) 24) (= main_~c~0 28))} #50#return; {42966#(and (= (+ main_~y~0 (- 4)) 24) (= main_~c~0 28))} is VALID [2022-04-08 11:07:51,211 INFO L290 TraceCheckUtils]: 208: Hoare triple {42966#(and (= (+ main_~y~0 (- 4)) 24) (= main_~c~0 28))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42988#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 11:07:51,212 INFO L290 TraceCheckUtils]: 209: Hoare triple {42988#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} assume !false; {42988#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 11:07:51,212 INFO L272 TraceCheckUtils]: 210: Hoare triple {42988#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,212 INFO L290 TraceCheckUtils]: 211: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,212 INFO L290 TraceCheckUtils]: 212: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,212 INFO L290 TraceCheckUtils]: 213: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,212 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {42330#true} {42988#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} #50#return; {42988#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 11:07:51,213 INFO L290 TraceCheckUtils]: 215: Hoare triple {42988#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {43010#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:07:51,213 INFO L290 TraceCheckUtils]: 216: Hoare triple {43010#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} assume !false; {43010#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:07:51,213 INFO L272 TraceCheckUtils]: 217: Hoare triple {43010#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,213 INFO L290 TraceCheckUtils]: 218: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,213 INFO L290 TraceCheckUtils]: 219: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,213 INFO L290 TraceCheckUtils]: 220: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,214 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {42330#true} {43010#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} #50#return; {43010#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:07:51,214 INFO L290 TraceCheckUtils]: 222: Hoare triple {43010#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {43032#(and (= main_~y~0 31) (= (+ main_~c~0 (- 3)) 28))} is VALID [2022-04-08 11:07:51,215 INFO L290 TraceCheckUtils]: 223: Hoare triple {43032#(and (= main_~y~0 31) (= (+ main_~c~0 (- 3)) 28))} assume !false; {43032#(and (= main_~y~0 31) (= (+ main_~c~0 (- 3)) 28))} is VALID [2022-04-08 11:07:51,215 INFO L272 TraceCheckUtils]: 224: Hoare triple {43032#(and (= main_~y~0 31) (= (+ main_~c~0 (- 3)) 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,215 INFO L290 TraceCheckUtils]: 225: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,215 INFO L290 TraceCheckUtils]: 226: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,215 INFO L290 TraceCheckUtils]: 227: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,215 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {42330#true} {43032#(and (= main_~y~0 31) (= (+ main_~c~0 (- 3)) 28))} #50#return; {43032#(and (= main_~y~0 31) (= (+ main_~c~0 (- 3)) 28))} is VALID [2022-04-08 11:07:51,216 INFO L290 TraceCheckUtils]: 229: Hoare triple {43032#(and (= main_~y~0 31) (= (+ main_~c~0 (- 3)) 28))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {43054#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 11:07:51,216 INFO L290 TraceCheckUtils]: 230: Hoare triple {43054#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !false; {43054#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 11:07:51,216 INFO L272 TraceCheckUtils]: 231: Hoare triple {43054#(and (= 32 main_~y~0) (= 32 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,216 INFO L290 TraceCheckUtils]: 232: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,216 INFO L290 TraceCheckUtils]: 233: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,217 INFO L290 TraceCheckUtils]: 234: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,217 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {42330#true} {43054#(and (= 32 main_~y~0) (= 32 main_~c~0))} #50#return; {43054#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 11:07:51,217 INFO L290 TraceCheckUtils]: 236: Hoare triple {43054#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {43076#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} is VALID [2022-04-08 11:07:51,218 INFO L290 TraceCheckUtils]: 237: Hoare triple {43076#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} assume !false; {43076#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} is VALID [2022-04-08 11:07:51,218 INFO L272 TraceCheckUtils]: 238: Hoare triple {43076#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,218 INFO L290 TraceCheckUtils]: 239: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,218 INFO L290 TraceCheckUtils]: 240: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,218 INFO L290 TraceCheckUtils]: 241: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,218 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {42330#true} {43076#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} #50#return; {43076#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} is VALID [2022-04-08 11:07:51,219 INFO L290 TraceCheckUtils]: 243: Hoare triple {43076#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {43098#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} is VALID [2022-04-08 11:07:51,219 INFO L290 TraceCheckUtils]: 244: Hoare triple {43098#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} assume !false; {43098#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} is VALID [2022-04-08 11:07:51,219 INFO L272 TraceCheckUtils]: 245: Hoare triple {43098#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,219 INFO L290 TraceCheckUtils]: 246: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,219 INFO L290 TraceCheckUtils]: 247: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,219 INFO L290 TraceCheckUtils]: 248: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,220 INFO L284 TraceCheckUtils]: 249: Hoare quadruple {42330#true} {43098#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} #50#return; {43098#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} is VALID [2022-04-08 11:07:51,220 INFO L290 TraceCheckUtils]: 250: Hoare triple {43098#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {43120#(and (= (+ main_~y~0 (- 3)) 32) (= 35 main_~c~0))} is VALID [2022-04-08 11:07:51,220 INFO L290 TraceCheckUtils]: 251: Hoare triple {43120#(and (= (+ main_~y~0 (- 3)) 32) (= 35 main_~c~0))} assume !false; {43120#(and (= (+ main_~y~0 (- 3)) 32) (= 35 main_~c~0))} is VALID [2022-04-08 11:07:51,221 INFO L272 TraceCheckUtils]: 252: Hoare triple {43120#(and (= (+ main_~y~0 (- 3)) 32) (= 35 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,221 INFO L290 TraceCheckUtils]: 253: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,221 INFO L290 TraceCheckUtils]: 254: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,221 INFO L290 TraceCheckUtils]: 255: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,221 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {42330#true} {43120#(and (= (+ main_~y~0 (- 3)) 32) (= 35 main_~c~0))} #50#return; {43120#(and (= (+ main_~y~0 (- 3)) 32) (= 35 main_~c~0))} is VALID [2022-04-08 11:07:51,222 INFO L290 TraceCheckUtils]: 257: Hoare triple {43120#(and (= (+ main_~y~0 (- 3)) 32) (= 35 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {43142#(and (= (+ (- 1) main_~c~0) 35) (= 32 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 11:07:51,222 INFO L290 TraceCheckUtils]: 258: Hoare triple {43142#(and (= (+ (- 1) main_~c~0) 35) (= 32 (+ main_~y~0 (- 4))))} assume !false; {43142#(and (= (+ (- 1) main_~c~0) 35) (= 32 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 11:07:51,222 INFO L272 TraceCheckUtils]: 259: Hoare triple {43142#(and (= (+ (- 1) main_~c~0) 35) (= 32 (+ main_~y~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,222 INFO L290 TraceCheckUtils]: 260: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,222 INFO L290 TraceCheckUtils]: 261: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,222 INFO L290 TraceCheckUtils]: 262: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,223 INFO L284 TraceCheckUtils]: 263: Hoare quadruple {42330#true} {43142#(and (= (+ (- 1) main_~c~0) 35) (= 32 (+ main_~y~0 (- 4))))} #50#return; {43142#(and (= (+ (- 1) main_~c~0) 35) (= 32 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 11:07:51,223 INFO L290 TraceCheckUtils]: 264: Hoare triple {43142#(and (= (+ (- 1) main_~c~0) 35) (= 32 (+ main_~y~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {43164#(and (= 35 (+ (- 2) main_~c~0)) (= main_~y~0 37))} is VALID [2022-04-08 11:07:51,223 INFO L290 TraceCheckUtils]: 265: Hoare triple {43164#(and (= 35 (+ (- 2) main_~c~0)) (= main_~y~0 37))} assume !false; {43164#(and (= 35 (+ (- 2) main_~c~0)) (= main_~y~0 37))} is VALID [2022-04-08 11:07:51,223 INFO L272 TraceCheckUtils]: 266: Hoare triple {43164#(and (= 35 (+ (- 2) main_~c~0)) (= main_~y~0 37))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,224 INFO L290 TraceCheckUtils]: 267: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 11:07:51,224 INFO L290 TraceCheckUtils]: 268: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 11:07:51,224 INFO L290 TraceCheckUtils]: 269: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 11:07:51,224 INFO L284 TraceCheckUtils]: 270: Hoare quadruple {42330#true} {43164#(and (= 35 (+ (- 2) main_~c~0)) (= main_~y~0 37))} #50#return; {43164#(and (= 35 (+ (- 2) main_~c~0)) (= main_~y~0 37))} is VALID [2022-04-08 11:07:51,224 INFO L290 TraceCheckUtils]: 271: Hoare triple {43164#(and (= 35 (+ (- 2) main_~c~0)) (= main_~y~0 37))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {43186#(and (= main_~y~0 38) (= 35 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 11:07:51,225 INFO L290 TraceCheckUtils]: 272: Hoare triple {43186#(and (= main_~y~0 38) (= 35 (+ main_~c~0 (- 3))))} assume !false; {43186#(and (= main_~y~0 38) (= 35 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 11:07:51,225 INFO L272 TraceCheckUtils]: 273: Hoare triple {43186#(and (= main_~y~0 38) (= 35 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,225 INFO L290 TraceCheckUtils]: 274: Hoare triple {42330#true} ~cond := #in~cond; {43196#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:07:51,225 INFO L290 TraceCheckUtils]: 275: Hoare triple {43196#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {43200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:07:51,226 INFO L290 TraceCheckUtils]: 276: Hoare triple {43200#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {43200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:07:51,226 INFO L284 TraceCheckUtils]: 277: Hoare quadruple {43200#(not (= |__VERIFIER_assert_#in~cond| 0))} {43186#(and (= main_~y~0 38) (= 35 (+ main_~c~0 (- 3))))} #50#return; {43207#(and (= main_~y~0 38) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) (= 35 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 11:07:51,227 INFO L290 TraceCheckUtils]: 278: Hoare triple {43207#(and (= main_~y~0 38) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) (= 35 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {43211#(and (< 38 main_~k~0) (= (+ (* main_~x~0 4) (* (* (- 1) main_~y~0 main_~y~0 main_~y~0) 4)) 2196324) (= main_~y~0 39) (<= main_~c~0 39))} is VALID [2022-04-08 11:07:51,227 INFO L290 TraceCheckUtils]: 279: Hoare triple {43211#(and (< 38 main_~k~0) (= (+ (* main_~x~0 4) (* (* (- 1) main_~y~0 main_~y~0 main_~y~0) 4)) 2196324) (= main_~y~0 39) (<= main_~c~0 39))} assume !false; {43211#(and (< 38 main_~k~0) (= (+ (* main_~x~0 4) (* (* (- 1) main_~y~0 main_~y~0 main_~y~0) 4)) 2196324) (= main_~y~0 39) (<= main_~c~0 39))} is VALID [2022-04-08 11:07:51,227 INFO L272 TraceCheckUtils]: 280: Hoare triple {43211#(and (< 38 main_~k~0) (= (+ (* main_~x~0 4) (* (* (- 1) main_~y~0 main_~y~0 main_~y~0) 4)) 2196324) (= main_~y~0 39) (<= main_~c~0 39))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 11:07:51,228 INFO L290 TraceCheckUtils]: 281: Hoare triple {42330#true} ~cond := #in~cond; {43196#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:07:51,228 INFO L290 TraceCheckUtils]: 282: Hoare triple {43196#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {43200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:07:51,228 INFO L290 TraceCheckUtils]: 283: Hoare triple {43200#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {43200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:07:51,229 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {43200#(not (= |__VERIFIER_assert_#in~cond| 0))} {43211#(and (< 38 main_~k~0) (= (+ (* main_~x~0 4) (* (* (- 1) main_~y~0 main_~y~0 main_~y~0) 4)) 2196324) (= main_~y~0 39) (<= main_~c~0 39))} #50#return; {43230#(and (< 38 main_~k~0) (= main_~y~0 39) (<= main_~c~0 39))} is VALID [2022-04-08 11:07:51,236 INFO L290 TraceCheckUtils]: 285: Hoare triple {43230#(and (< 38 main_~k~0) (= main_~y~0 39) (<= main_~c~0 39))} assume !(~c~0 < ~k~0); {43234#(and (< 38 main_~k~0) (<= main_~k~0 39) (= main_~y~0 39))} is VALID [2022-04-08 11:07:51,236 INFO L272 TraceCheckUtils]: 286: Hoare triple {43234#(and (< 38 main_~k~0) (<= main_~k~0 39) (= main_~y~0 39))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {43238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:07:51,237 INFO L290 TraceCheckUtils]: 287: Hoare triple {43238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {43242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:07:51,237 INFO L290 TraceCheckUtils]: 288: Hoare triple {43242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {42331#false} is VALID [2022-04-08 11:07:51,237 INFO L290 TraceCheckUtils]: 289: Hoare triple {42331#false} assume !false; {42331#false} is VALID [2022-04-08 11:07:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5540 backedges. 306 proven. 2342 refuted. 0 times theorem prover too weak. 2892 trivial. 0 not checked. [2022-04-08 11:07:51,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:08:10,968 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= (mod (+ (* (- 1) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 1) c_main_~y~0 c_main_~y~0) (* (- 2) c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) is different from false [2022-04-08 11:08:10,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:08:10,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589306406] [2022-04-08 11:08:10,977 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:08:10,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983462720] [2022-04-08 11:08:10,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983462720] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:08:10,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:08:10,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2022-04-08 11:08:10,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:08:10,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [618335736] [2022-04-08 11:08:10,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [618335736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:08:10,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:08:10,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-08 11:08:10,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174045206] [2022-04-08 11:08:10,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:08:10,978 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 46 states have internal predecessors, (92), 42 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Word has length 290 [2022-04-08 11:08:10,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:08:10,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 46 states have internal predecessors, (92), 42 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 11:08:12,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:12,272 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-08 11:08:12,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:12,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-08 11:08:12,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2699, Unknown=1, NotChecked=104, Total=2970 [2022-04-08 11:08:12,273 INFO L87 Difference]: Start difference. First operand 139 states and 177 transitions. Second operand has 49 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 46 states have internal predecessors, (92), 42 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 11:09:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:09:24,282 INFO L93 Difference]: Finished difference Result 151 states and 189 transitions. [2022-04-08 11:09:24,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-08 11:09:24,283 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 46 states have internal predecessors, (92), 42 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Word has length 290 [2022-04-08 11:09:24,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:09:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 46 states have internal predecessors, (92), 42 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 11:09:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 184 transitions. [2022-04-08 11:09:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 46 states have internal predecessors, (92), 42 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 11:09:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 184 transitions. [2022-04-08 11:09:24,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 184 transitions. [2022-04-08 11:09:25,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:09:25,763 INFO L225 Difference]: With dead ends: 151 [2022-04-08 11:09:25,763 INFO L226 Difference]: Without dead ends: 146 [2022-04-08 11:09:25,764 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=187, Invalid=3008, Unknown=1, NotChecked=110, Total=3306 [2022-04-08 11:09:25,764 INFO L913 BasicCegarLoop]: 91 mSDtfsCounter, 13 mSDsluCounter, 2112 mSDsCounter, 0 mSdLazyCounter, 5629 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2203 SdHoareTripleChecker+Invalid, 5633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.7s IncrementalHoareTripleChecker+Time [2022-04-08 11:09:25,764 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 2203 Invalid, 5633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5629 Invalid, 0 Unknown, 0 Unchecked, 37.7s Time] [2022-04-08 11:09:25,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-08 11:09:25,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-08 11:09:25,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:09:25,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 146 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 97 states have internal predecessors, (98), 44 states have call successors, (44), 6 states have call predecessors, (44), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-08 11:09:25,965 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 146 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 97 states have internal predecessors, (98), 44 states have call successors, (44), 6 states have call predecessors, (44), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-08 11:09:25,965 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 146 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 97 states have internal predecessors, (98), 44 states have call successors, (44), 6 states have call predecessors, (44), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-08 11:09:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:09:25,969 INFO L93 Difference]: Finished difference Result 146 states and 184 transitions. [2022-04-08 11:09:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 184 transitions. [2022-04-08 11:09:25,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:09:25,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:09:25,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 97 states have internal predecessors, (98), 44 states have call successors, (44), 6 states have call predecessors, (44), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand 146 states. [2022-04-08 11:09:25,969 INFO L87 Difference]: Start difference. First operand has 146 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 97 states have internal predecessors, (98), 44 states have call successors, (44), 6 states have call predecessors, (44), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand 146 states. [2022-04-08 11:09:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:09:25,972 INFO L93 Difference]: Finished difference Result 146 states and 184 transitions. [2022-04-08 11:09:25,972 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 184 transitions. [2022-04-08 11:09:25,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:09:25,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:09:25,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:09:25,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:09:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 97 states have internal predecessors, (98), 44 states have call successors, (44), 6 states have call predecessors, (44), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-08 11:09:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 184 transitions. [2022-04-08 11:09:25,976 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 184 transitions. Word has length 290 [2022-04-08 11:09:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:09:25,976 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 184 transitions. [2022-04-08 11:09:25,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 46 states have internal predecessors, (92), 42 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 11:09:25,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 184 transitions. [2022-04-08 11:09:27,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:09:27,511 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 184 transitions. [2022-04-08 11:09:27,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-04-08 11:09:27,512 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:09:27,512 INFO L499 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:09:27,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-04-08 11:09:27,712 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:09:27,713 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:09:27,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:09:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash 972761714, now seen corresponding path program 79 times [2022-04-08 11:09:27,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:09:27,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1572714109] [2022-04-08 11:09:27,788 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:09:27,789 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:09:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash 972761714, now seen corresponding path program 80 times [2022-04-08 11:09:27,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:09:27,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294320118] [2022-04-08 11:09:27,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:09:27,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:09:27,806 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:09:27,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1525809078] [2022-04-08 11:09:27,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:09:27,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:09:27,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:09:27,807 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:09:27,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-08 11:09:29,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:09:29,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:09:29,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 168 conjunts are in the unsatisfiable core [2022-04-08 11:09:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:09:29,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:09:31,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {44185#true} call ULTIMATE.init(); {44185#true} is VALID [2022-04-08 11:09:31,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {44185#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(9, 2);call #Ultimate.allocInit(12, 3); {44185#true} is VALID [2022-04-08 11:09:31,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44185#true} {44185#true} #56#return; {44185#true} is VALID [2022-04-08 11:09:31,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {44185#true} call #t~ret5 := main(); {44185#true} is VALID [2022-04-08 11:09:31,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {44185#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {44205#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:09:31,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {44205#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {44205#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:09:31,295 INFO L272 TraceCheckUtils]: 7: Hoare triple {44205#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,295 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {44185#true} {44205#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {44205#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:09:31,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {44205#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44227#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 11:09:31,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {44227#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {44227#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 11:09:31,296 INFO L272 TraceCheckUtils]: 14: Hoare triple {44227#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,296 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {44185#true} {44227#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {44227#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 11:09:31,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {44227#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44249#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 11:09:31,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {44249#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {44249#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 11:09:31,297 INFO L272 TraceCheckUtils]: 21: Hoare triple {44249#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,297 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {44185#true} {44249#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {44249#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 11:09:31,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {44249#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44271#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 11:09:31,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {44271#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !false; {44271#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 11:09:31,298 INFO L272 TraceCheckUtils]: 28: Hoare triple {44271#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,298 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {44185#true} {44271#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #50#return; {44271#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 11:09:31,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {44271#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44293#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 11:09:31,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {44293#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {44293#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 11:09:31,299 INFO L272 TraceCheckUtils]: 35: Hoare triple {44293#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,300 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {44185#true} {44293#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {44293#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 11:09:31,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {44293#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44315#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 11:09:31,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {44315#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {44315#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 11:09:31,300 INFO L272 TraceCheckUtils]: 42: Hoare triple {44315#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,301 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {44185#true} {44315#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #50#return; {44315#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 11:09:31,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {44315#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44337#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 11:09:31,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {44337#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} assume !false; {44337#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 11:09:31,301 INFO L272 TraceCheckUtils]: 49: Hoare triple {44337#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,301 INFO L290 TraceCheckUtils]: 50: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,301 INFO L290 TraceCheckUtils]: 51: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,301 INFO L290 TraceCheckUtils]: 52: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,302 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {44185#true} {44337#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} #50#return; {44337#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 11:09:31,302 INFO L290 TraceCheckUtils]: 54: Hoare triple {44337#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44359#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 11:09:31,302 INFO L290 TraceCheckUtils]: 55: Hoare triple {44359#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {44359#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 11:09:31,302 INFO L272 TraceCheckUtils]: 56: Hoare triple {44359#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,302 INFO L290 TraceCheckUtils]: 57: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,302 INFO L290 TraceCheckUtils]: 58: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,302 INFO L290 TraceCheckUtils]: 59: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,303 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {44185#true} {44359#(and (= 7 main_~y~0) (= 7 main_~c~0))} #50#return; {44359#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 11:09:31,303 INFO L290 TraceCheckUtils]: 61: Hoare triple {44359#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44381#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 11:09:31,303 INFO L290 TraceCheckUtils]: 62: Hoare triple {44381#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {44381#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 11:09:31,303 INFO L272 TraceCheckUtils]: 63: Hoare triple {44381#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,303 INFO L290 TraceCheckUtils]: 64: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,303 INFO L290 TraceCheckUtils]: 65: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,303 INFO L290 TraceCheckUtils]: 66: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,304 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {44185#true} {44381#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #50#return; {44381#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 11:09:31,304 INFO L290 TraceCheckUtils]: 68: Hoare triple {44381#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44403#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 11:09:31,304 INFO L290 TraceCheckUtils]: 69: Hoare triple {44403#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !false; {44403#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 11:09:31,304 INFO L272 TraceCheckUtils]: 70: Hoare triple {44403#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,304 INFO L290 TraceCheckUtils]: 71: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,304 INFO L290 TraceCheckUtils]: 72: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,304 INFO L290 TraceCheckUtils]: 73: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,305 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {44185#true} {44403#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} #50#return; {44403#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 11:09:31,305 INFO L290 TraceCheckUtils]: 75: Hoare triple {44403#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44425#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 11:09:31,305 INFO L290 TraceCheckUtils]: 76: Hoare triple {44425#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {44425#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 11:09:31,305 INFO L272 TraceCheckUtils]: 77: Hoare triple {44425#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,305 INFO L290 TraceCheckUtils]: 78: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,305 INFO L290 TraceCheckUtils]: 79: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,306 INFO L290 TraceCheckUtils]: 80: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,306 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {44185#true} {44425#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {44425#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 11:09:31,306 INFO L290 TraceCheckUtils]: 82: Hoare triple {44425#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44447#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 11:09:31,306 INFO L290 TraceCheckUtils]: 83: Hoare triple {44447#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {44447#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 11:09:31,306 INFO L272 TraceCheckUtils]: 84: Hoare triple {44447#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,306 INFO L290 TraceCheckUtils]: 85: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,306 INFO L290 TraceCheckUtils]: 86: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,307 INFO L290 TraceCheckUtils]: 87: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,307 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {44185#true} {44447#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {44447#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 11:09:31,307 INFO L290 TraceCheckUtils]: 89: Hoare triple {44447#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44469#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 11:09:31,307 INFO L290 TraceCheckUtils]: 90: Hoare triple {44469#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {44469#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 11:09:31,307 INFO L272 TraceCheckUtils]: 91: Hoare triple {44469#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,307 INFO L290 TraceCheckUtils]: 92: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,308 INFO L290 TraceCheckUtils]: 93: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,308 INFO L290 TraceCheckUtils]: 94: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,308 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {44185#true} {44469#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {44469#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 11:09:31,308 INFO L290 TraceCheckUtils]: 96: Hoare triple {44469#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44491#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:09:31,308 INFO L290 TraceCheckUtils]: 97: Hoare triple {44491#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !false; {44491#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:09:31,308 INFO L272 TraceCheckUtils]: 98: Hoare triple {44491#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,309 INFO L290 TraceCheckUtils]: 99: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,309 INFO L290 TraceCheckUtils]: 100: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,309 INFO L290 TraceCheckUtils]: 101: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,309 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {44185#true} {44491#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} #50#return; {44491#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:09:31,309 INFO L290 TraceCheckUtils]: 103: Hoare triple {44491#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44513#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 11:09:31,309 INFO L290 TraceCheckUtils]: 104: Hoare triple {44513#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {44513#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 11:09:31,309 INFO L272 TraceCheckUtils]: 105: Hoare triple {44513#(and (= main_~y~0 14) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,310 INFO L290 TraceCheckUtils]: 106: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,310 INFO L290 TraceCheckUtils]: 107: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,310 INFO L290 TraceCheckUtils]: 108: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,310 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {44185#true} {44513#(and (= main_~y~0 14) (= main_~c~0 14))} #50#return; {44513#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 11:09:31,310 INFO L290 TraceCheckUtils]: 110: Hoare triple {44513#(and (= main_~y~0 14) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44535#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:09:31,310 INFO L290 TraceCheckUtils]: 111: Hoare triple {44535#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !false; {44535#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:09:31,316 INFO L272 TraceCheckUtils]: 112: Hoare triple {44535#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,316 INFO L290 TraceCheckUtils]: 113: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,316 INFO L290 TraceCheckUtils]: 114: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,316 INFO L290 TraceCheckUtils]: 115: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,317 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {44185#true} {44535#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} #50#return; {44535#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:09:31,317 INFO L290 TraceCheckUtils]: 117: Hoare triple {44535#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44557#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 11:09:31,317 INFO L290 TraceCheckUtils]: 118: Hoare triple {44557#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} assume !false; {44557#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 11:09:31,318 INFO L272 TraceCheckUtils]: 119: Hoare triple {44557#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,318 INFO L290 TraceCheckUtils]: 120: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,318 INFO L290 TraceCheckUtils]: 121: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,318 INFO L290 TraceCheckUtils]: 122: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,318 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {44185#true} {44557#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} #50#return; {44557#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 11:09:31,318 INFO L290 TraceCheckUtils]: 124: Hoare triple {44557#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44579#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} is VALID [2022-04-08 11:09:31,318 INFO L290 TraceCheckUtils]: 125: Hoare triple {44579#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} assume !false; {44579#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} is VALID [2022-04-08 11:09:31,319 INFO L272 TraceCheckUtils]: 126: Hoare triple {44579#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,319 INFO L290 TraceCheckUtils]: 127: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,319 INFO L290 TraceCheckUtils]: 128: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,319 INFO L290 TraceCheckUtils]: 129: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,319 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {44185#true} {44579#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} #50#return; {44579#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} is VALID [2022-04-08 11:09:31,319 INFO L290 TraceCheckUtils]: 131: Hoare triple {44579#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44601#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 11:09:31,320 INFO L290 TraceCheckUtils]: 132: Hoare triple {44601#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {44601#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 11:09:31,320 INFO L272 TraceCheckUtils]: 133: Hoare triple {44601#(and (= main_~c~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,320 INFO L290 TraceCheckUtils]: 134: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,320 INFO L290 TraceCheckUtils]: 135: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,320 INFO L290 TraceCheckUtils]: 136: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,320 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {44185#true} {44601#(and (= main_~c~0 18) (= main_~y~0 18))} #50#return; {44601#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 11:09:31,320 INFO L290 TraceCheckUtils]: 138: Hoare triple {44601#(and (= main_~c~0 18) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44623#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 11:09:31,321 INFO L290 TraceCheckUtils]: 139: Hoare triple {44623#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !false; {44623#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 11:09:31,321 INFO L272 TraceCheckUtils]: 140: Hoare triple {44623#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,321 INFO L290 TraceCheckUtils]: 141: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,321 INFO L290 TraceCheckUtils]: 142: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,321 INFO L290 TraceCheckUtils]: 143: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,321 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {44185#true} {44623#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} #50#return; {44623#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 11:09:31,321 INFO L290 TraceCheckUtils]: 145: Hoare triple {44623#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44645#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 11:09:31,322 INFO L290 TraceCheckUtils]: 146: Hoare triple {44645#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {44645#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 11:09:31,322 INFO L272 TraceCheckUtils]: 147: Hoare triple {44645#(and (= main_~c~0 20) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,322 INFO L290 TraceCheckUtils]: 148: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,322 INFO L290 TraceCheckUtils]: 149: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,322 INFO L290 TraceCheckUtils]: 150: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,322 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {44185#true} {44645#(and (= main_~c~0 20) (= main_~y~0 20))} #50#return; {44645#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 11:09:31,322 INFO L290 TraceCheckUtils]: 152: Hoare triple {44645#(and (= main_~c~0 20) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44667#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 11:09:31,323 INFO L290 TraceCheckUtils]: 153: Hoare triple {44667#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {44667#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 11:09:31,323 INFO L272 TraceCheckUtils]: 154: Hoare triple {44667#(and (= main_~c~0 21) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,323 INFO L290 TraceCheckUtils]: 155: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,323 INFO L290 TraceCheckUtils]: 156: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,323 INFO L290 TraceCheckUtils]: 157: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,323 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {44185#true} {44667#(and (= main_~c~0 21) (= main_~y~0 21))} #50#return; {44667#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 11:09:31,324 INFO L290 TraceCheckUtils]: 159: Hoare triple {44667#(and (= main_~c~0 21) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44689#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 11:09:31,324 INFO L290 TraceCheckUtils]: 160: Hoare triple {44689#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {44689#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 11:09:31,324 INFO L272 TraceCheckUtils]: 161: Hoare triple {44689#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,324 INFO L290 TraceCheckUtils]: 162: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,324 INFO L290 TraceCheckUtils]: 163: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,324 INFO L290 TraceCheckUtils]: 164: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,324 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {44185#true} {44689#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #50#return; {44689#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 11:09:31,325 INFO L290 TraceCheckUtils]: 166: Hoare triple {44689#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44711#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 11:09:31,325 INFO L290 TraceCheckUtils]: 167: Hoare triple {44711#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {44711#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 11:09:31,325 INFO L272 TraceCheckUtils]: 168: Hoare triple {44711#(and (= 23 main_~y~0) (= 23 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,325 INFO L290 TraceCheckUtils]: 169: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,325 INFO L290 TraceCheckUtils]: 170: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,325 INFO L290 TraceCheckUtils]: 171: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,325 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {44185#true} {44711#(and (= 23 main_~y~0) (= 23 main_~c~0))} #50#return; {44711#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 11:09:31,326 INFO L290 TraceCheckUtils]: 173: Hoare triple {44711#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44733#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:09:31,326 INFO L290 TraceCheckUtils]: 174: Hoare triple {44733#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} assume !false; {44733#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:09:31,326 INFO L272 TraceCheckUtils]: 175: Hoare triple {44733#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,326 INFO L290 TraceCheckUtils]: 176: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,326 INFO L290 TraceCheckUtils]: 177: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,326 INFO L290 TraceCheckUtils]: 178: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,326 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {44185#true} {44733#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} #50#return; {44733#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 11:09:31,327 INFO L290 TraceCheckUtils]: 180: Hoare triple {44733#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44755#(and (= 23 (+ (- 2) main_~c~0)) (= main_~y~0 25))} is VALID [2022-04-08 11:09:31,327 INFO L290 TraceCheckUtils]: 181: Hoare triple {44755#(and (= 23 (+ (- 2) main_~c~0)) (= main_~y~0 25))} assume !false; {44755#(and (= 23 (+ (- 2) main_~c~0)) (= main_~y~0 25))} is VALID [2022-04-08 11:09:31,327 INFO L272 TraceCheckUtils]: 182: Hoare triple {44755#(and (= 23 (+ (- 2) main_~c~0)) (= main_~y~0 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,327 INFO L290 TraceCheckUtils]: 183: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,327 INFO L290 TraceCheckUtils]: 184: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,327 INFO L290 TraceCheckUtils]: 185: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,328 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {44185#true} {44755#(and (= 23 (+ (- 2) main_~c~0)) (= main_~y~0 25))} #50#return; {44755#(and (= 23 (+ (- 2) main_~c~0)) (= main_~y~0 25))} is VALID [2022-04-08 11:09:31,328 INFO L290 TraceCheckUtils]: 187: Hoare triple {44755#(and (= 23 (+ (- 2) main_~c~0)) (= main_~y~0 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44777#(and (= 23 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 11:09:31,328 INFO L290 TraceCheckUtils]: 188: Hoare triple {44777#(and (= 23 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 25))} assume !false; {44777#(and (= 23 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 11:09:31,328 INFO L272 TraceCheckUtils]: 189: Hoare triple {44777#(and (= 23 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,328 INFO L290 TraceCheckUtils]: 190: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,328 INFO L290 TraceCheckUtils]: 191: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,328 INFO L290 TraceCheckUtils]: 192: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,329 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {44185#true} {44777#(and (= 23 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 25))} #50#return; {44777#(and (= 23 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 11:09:31,329 INFO L290 TraceCheckUtils]: 194: Hoare triple {44777#(and (= 23 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44799#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-08 11:09:31,329 INFO L290 TraceCheckUtils]: 195: Hoare triple {44799#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} assume !false; {44799#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-08 11:09:31,329 INFO L272 TraceCheckUtils]: 196: Hoare triple {44799#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,329 INFO L290 TraceCheckUtils]: 197: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,329 INFO L290 TraceCheckUtils]: 198: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,329 INFO L290 TraceCheckUtils]: 199: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,330 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {44185#true} {44799#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} #50#return; {44799#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-08 11:09:31,330 INFO L290 TraceCheckUtils]: 201: Hoare triple {44799#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44821#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-08 11:09:31,330 INFO L290 TraceCheckUtils]: 202: Hoare triple {44821#(and (= main_~c~0 28) (= main_~y~0 28))} assume !false; {44821#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-08 11:09:31,330 INFO L272 TraceCheckUtils]: 203: Hoare triple {44821#(and (= main_~c~0 28) (= main_~y~0 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,330 INFO L290 TraceCheckUtils]: 204: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,330 INFO L290 TraceCheckUtils]: 205: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,330 INFO L290 TraceCheckUtils]: 206: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,331 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {44185#true} {44821#(and (= main_~c~0 28) (= main_~y~0 28))} #50#return; {44821#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-08 11:09:31,331 INFO L290 TraceCheckUtils]: 208: Hoare triple {44821#(and (= main_~c~0 28) (= main_~y~0 28))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44843#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} is VALID [2022-04-08 11:09:31,331 INFO L290 TraceCheckUtils]: 209: Hoare triple {44843#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} assume !false; {44843#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} is VALID [2022-04-08 11:09:31,331 INFO L272 TraceCheckUtils]: 210: Hoare triple {44843#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,331 INFO L290 TraceCheckUtils]: 211: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,331 INFO L290 TraceCheckUtils]: 212: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,331 INFO L290 TraceCheckUtils]: 213: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,332 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {44185#true} {44843#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} #50#return; {44843#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} is VALID [2022-04-08 11:09:31,332 INFO L290 TraceCheckUtils]: 215: Hoare triple {44843#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44865#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} is VALID [2022-04-08 11:09:31,332 INFO L290 TraceCheckUtils]: 216: Hoare triple {44865#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} assume !false; {44865#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} is VALID [2022-04-08 11:09:31,332 INFO L272 TraceCheckUtils]: 217: Hoare triple {44865#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,332 INFO L290 TraceCheckUtils]: 218: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,332 INFO L290 TraceCheckUtils]: 219: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,333 INFO L290 TraceCheckUtils]: 220: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,333 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {44185#true} {44865#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} #50#return; {44865#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} is VALID [2022-04-08 11:09:31,333 INFO L290 TraceCheckUtils]: 222: Hoare triple {44865#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44887#(and (= 30 (+ (- 1) main_~y~0)) (= 29 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:09:31,333 INFO L290 TraceCheckUtils]: 223: Hoare triple {44887#(and (= 30 (+ (- 1) main_~y~0)) (= 29 (+ (- 2) main_~c~0)))} assume !false; {44887#(and (= 30 (+ (- 1) main_~y~0)) (= 29 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:09:31,333 INFO L272 TraceCheckUtils]: 224: Hoare triple {44887#(and (= 30 (+ (- 1) main_~y~0)) (= 29 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,333 INFO L290 TraceCheckUtils]: 225: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,334 INFO L290 TraceCheckUtils]: 226: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,334 INFO L290 TraceCheckUtils]: 227: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,334 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {44185#true} {44887#(and (= 30 (+ (- 1) main_~y~0)) (= 29 (+ (- 2) main_~c~0)))} #50#return; {44887#(and (= 30 (+ (- 1) main_~y~0)) (= 29 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 11:09:31,334 INFO L290 TraceCheckUtils]: 229: Hoare triple {44887#(and (= 30 (+ (- 1) main_~y~0)) (= 29 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44909#(and (= 29 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 30))} is VALID [2022-04-08 11:09:31,334 INFO L290 TraceCheckUtils]: 230: Hoare triple {44909#(and (= 29 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 30))} assume !false; {44909#(and (= 29 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 30))} is VALID [2022-04-08 11:09:31,334 INFO L272 TraceCheckUtils]: 231: Hoare triple {44909#(and (= 29 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 30))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,335 INFO L290 TraceCheckUtils]: 232: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,335 INFO L290 TraceCheckUtils]: 233: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,335 INFO L290 TraceCheckUtils]: 234: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,335 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {44185#true} {44909#(and (= 29 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 30))} #50#return; {44909#(and (= 29 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 30))} is VALID [2022-04-08 11:09:31,335 INFO L290 TraceCheckUtils]: 236: Hoare triple {44909#(and (= 29 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 30))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44931#(and (= main_~y~0 33) (= 29 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 11:09:31,335 INFO L290 TraceCheckUtils]: 237: Hoare triple {44931#(and (= main_~y~0 33) (= 29 (+ main_~c~0 (- 4))))} assume !false; {44931#(and (= main_~y~0 33) (= 29 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 11:09:31,336 INFO L272 TraceCheckUtils]: 238: Hoare triple {44931#(and (= main_~y~0 33) (= 29 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,336 INFO L290 TraceCheckUtils]: 239: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,336 INFO L290 TraceCheckUtils]: 240: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,336 INFO L290 TraceCheckUtils]: 241: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,336 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {44185#true} {44931#(and (= main_~y~0 33) (= 29 (+ main_~c~0 (- 4))))} #50#return; {44931#(and (= main_~y~0 33) (= 29 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 11:09:31,336 INFO L290 TraceCheckUtils]: 243: Hoare triple {44931#(and (= main_~y~0 33) (= 29 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44953#(and (= 29 (+ main_~c~0 (- 5))) (= main_~y~0 34))} is VALID [2022-04-08 11:09:31,337 INFO L290 TraceCheckUtils]: 244: Hoare triple {44953#(and (= 29 (+ main_~c~0 (- 5))) (= main_~y~0 34))} assume !false; {44953#(and (= 29 (+ main_~c~0 (- 5))) (= main_~y~0 34))} is VALID [2022-04-08 11:09:31,337 INFO L272 TraceCheckUtils]: 245: Hoare triple {44953#(and (= 29 (+ main_~c~0 (- 5))) (= main_~y~0 34))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,337 INFO L290 TraceCheckUtils]: 246: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,337 INFO L290 TraceCheckUtils]: 247: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,337 INFO L290 TraceCheckUtils]: 248: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,337 INFO L284 TraceCheckUtils]: 249: Hoare quadruple {44185#true} {44953#(and (= 29 (+ main_~c~0 (- 5))) (= main_~y~0 34))} #50#return; {44953#(and (= 29 (+ main_~c~0 (- 5))) (= main_~y~0 34))} is VALID [2022-04-08 11:09:31,337 INFO L290 TraceCheckUtils]: 250: Hoare triple {44953#(and (= 29 (+ main_~c~0 (- 5))) (= main_~y~0 34))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44975#(and (= 29 (+ main_~c~0 (- 6))) (= 34 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:09:31,338 INFO L290 TraceCheckUtils]: 251: Hoare triple {44975#(and (= 29 (+ main_~c~0 (- 6))) (= 34 (+ (- 1) main_~y~0)))} assume !false; {44975#(and (= 29 (+ main_~c~0 (- 6))) (= 34 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:09:31,338 INFO L272 TraceCheckUtils]: 252: Hoare triple {44975#(and (= 29 (+ main_~c~0 (- 6))) (= 34 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,338 INFO L290 TraceCheckUtils]: 253: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,338 INFO L290 TraceCheckUtils]: 254: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,338 INFO L290 TraceCheckUtils]: 255: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,338 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {44185#true} {44975#(and (= 29 (+ main_~c~0 (- 6))) (= 34 (+ (- 1) main_~y~0)))} #50#return; {44975#(and (= 29 (+ main_~c~0 (- 6))) (= 34 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:09:31,338 INFO L290 TraceCheckUtils]: 257: Hoare triple {44975#(and (= 29 (+ main_~c~0 (- 6))) (= 34 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {44997#(and (= (+ main_~c~0 (- 7)) 29) (= (+ (- 2) main_~y~0) 34))} is VALID [2022-04-08 11:09:31,339 INFO L290 TraceCheckUtils]: 258: Hoare triple {44997#(and (= (+ main_~c~0 (- 7)) 29) (= (+ (- 2) main_~y~0) 34))} assume !false; {44997#(and (= (+ main_~c~0 (- 7)) 29) (= (+ (- 2) main_~y~0) 34))} is VALID [2022-04-08 11:09:31,339 INFO L272 TraceCheckUtils]: 259: Hoare triple {44997#(and (= (+ main_~c~0 (- 7)) 29) (= (+ (- 2) main_~y~0) 34))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,339 INFO L290 TraceCheckUtils]: 260: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,339 INFO L290 TraceCheckUtils]: 261: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,339 INFO L290 TraceCheckUtils]: 262: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,339 INFO L284 TraceCheckUtils]: 263: Hoare quadruple {44185#true} {44997#(and (= (+ main_~c~0 (- 7)) 29) (= (+ (- 2) main_~y~0) 34))} #50#return; {44997#(and (= (+ main_~c~0 (- 7)) 29) (= (+ (- 2) main_~y~0) 34))} is VALID [2022-04-08 11:09:31,340 INFO L290 TraceCheckUtils]: 264: Hoare triple {44997#(and (= (+ main_~c~0 (- 7)) 29) (= (+ (- 2) main_~y~0) 34))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {45019#(and (= main_~c~0 37) (= (+ main_~y~0 (- 3)) 34))} is VALID [2022-04-08 11:09:31,340 INFO L290 TraceCheckUtils]: 265: Hoare triple {45019#(and (= main_~c~0 37) (= (+ main_~y~0 (- 3)) 34))} assume !false; {45019#(and (= main_~c~0 37) (= (+ main_~y~0 (- 3)) 34))} is VALID [2022-04-08 11:09:31,340 INFO L272 TraceCheckUtils]: 266: Hoare triple {45019#(and (= main_~c~0 37) (= (+ main_~y~0 (- 3)) 34))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,340 INFO L290 TraceCheckUtils]: 267: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,340 INFO L290 TraceCheckUtils]: 268: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,340 INFO L290 TraceCheckUtils]: 269: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,340 INFO L284 TraceCheckUtils]: 270: Hoare quadruple {44185#true} {45019#(and (= main_~c~0 37) (= (+ main_~y~0 (- 3)) 34))} #50#return; {45019#(and (= main_~c~0 37) (= (+ main_~y~0 (- 3)) 34))} is VALID [2022-04-08 11:09:31,341 INFO L290 TraceCheckUtils]: 271: Hoare triple {45019#(and (= main_~c~0 37) (= (+ main_~y~0 (- 3)) 34))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {45041#(and (= main_~y~0 38) (= main_~c~0 38))} is VALID [2022-04-08 11:09:31,341 INFO L290 TraceCheckUtils]: 272: Hoare triple {45041#(and (= main_~y~0 38) (= main_~c~0 38))} assume !false; {45041#(and (= main_~y~0 38) (= main_~c~0 38))} is VALID [2022-04-08 11:09:31,341 INFO L272 TraceCheckUtils]: 273: Hoare triple {45041#(and (= main_~y~0 38) (= main_~c~0 38))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,341 INFO L290 TraceCheckUtils]: 274: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,341 INFO L290 TraceCheckUtils]: 275: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,341 INFO L290 TraceCheckUtils]: 276: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,341 INFO L284 TraceCheckUtils]: 277: Hoare quadruple {44185#true} {45041#(and (= main_~y~0 38) (= main_~c~0 38))} #50#return; {45041#(and (= main_~y~0 38) (= main_~c~0 38))} is VALID [2022-04-08 11:09:31,342 INFO L290 TraceCheckUtils]: 278: Hoare triple {45041#(and (= main_~y~0 38) (= main_~c~0 38))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {45063#(and (= (+ (- 1) main_~c~0) 38) (= 38 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:09:31,342 INFO L290 TraceCheckUtils]: 279: Hoare triple {45063#(and (= (+ (- 1) main_~c~0) 38) (= 38 (+ (- 1) main_~y~0)))} assume !false; {45063#(and (= (+ (- 1) main_~c~0) 38) (= 38 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:09:31,342 INFO L272 TraceCheckUtils]: 280: Hoare triple {45063#(and (= (+ (- 1) main_~c~0) 38) (= 38 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,342 INFO L290 TraceCheckUtils]: 281: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,342 INFO L290 TraceCheckUtils]: 282: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,342 INFO L290 TraceCheckUtils]: 283: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,342 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {44185#true} {45063#(and (= (+ (- 1) main_~c~0) 38) (= 38 (+ (- 1) main_~y~0)))} #50#return; {45063#(and (= (+ (- 1) main_~c~0) 38) (= 38 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 11:09:31,343 INFO L290 TraceCheckUtils]: 285: Hoare triple {45063#(and (= (+ (- 1) main_~c~0) 38) (= 38 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {45085#(and (< 39 main_~k~0) (= 40 main_~y~0) (<= main_~c~0 40))} is VALID [2022-04-08 11:09:31,343 INFO L290 TraceCheckUtils]: 286: Hoare triple {45085#(and (< 39 main_~k~0) (= 40 main_~y~0) (<= main_~c~0 40))} assume !false; {45085#(and (< 39 main_~k~0) (= 40 main_~y~0) (<= main_~c~0 40))} is VALID [2022-04-08 11:09:31,343 INFO L272 TraceCheckUtils]: 287: Hoare triple {45085#(and (< 39 main_~k~0) (= 40 main_~y~0) (<= main_~c~0 40))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {44185#true} is VALID [2022-04-08 11:09:31,343 INFO L290 TraceCheckUtils]: 288: Hoare triple {44185#true} ~cond := #in~cond; {44185#true} is VALID [2022-04-08 11:09:31,343 INFO L290 TraceCheckUtils]: 289: Hoare triple {44185#true} assume !(0 == ~cond); {44185#true} is VALID [2022-04-08 11:09:31,343 INFO L290 TraceCheckUtils]: 290: Hoare triple {44185#true} assume true; {44185#true} is VALID [2022-04-08 11:09:31,344 INFO L284 TraceCheckUtils]: 291: Hoare quadruple {44185#true} {45085#(and (< 39 main_~k~0) (= 40 main_~y~0) (<= main_~c~0 40))} #50#return; {45085#(and (< 39 main_~k~0) (= 40 main_~y~0) (<= main_~c~0 40))} is VALID [2022-04-08 11:09:31,344 INFO L290 TraceCheckUtils]: 292: Hoare triple {45085#(and (< 39 main_~k~0) (= 40 main_~y~0) (<= main_~c~0 40))} assume !(~c~0 < ~k~0); {45107#(and (< 39 main_~k~0) (= 40 main_~y~0) (<= main_~k~0 40))} is VALID [2022-04-08 11:09:31,344 INFO L272 TraceCheckUtils]: 293: Hoare triple {45107#(and (< 39 main_~k~0) (= 40 main_~y~0) (<= main_~k~0 40))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {45111#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:09:31,345 INFO L290 TraceCheckUtils]: 294: Hoare triple {45111#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {45115#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:09:31,345 INFO L290 TraceCheckUtils]: 295: Hoare triple {45115#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44186#false} is VALID [2022-04-08 11:09:31,345 INFO L290 TraceCheckUtils]: 296: Hoare triple {44186#false} assume !false; {44186#false} is VALID [2022-04-08 11:09:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5822 backedges. 82 proven. 2460 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2022-04-08 11:09:31,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:09:31,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:09:31,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294320118] [2022-04-08 11:09:31,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:09:31,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525809078] [2022-04-08 11:09:31,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525809078] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:09:31,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:09:31,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2022-04-08 11:09:31,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:09:31,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1572714109] [2022-04-08 11:09:31,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1572714109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:09:31,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:09:31,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-08 11:09:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007239086] [2022-04-08 11:09:31,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:09:31,921 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.022222222222222) internal successors, (91), 45 states have internal predecessors, (91), 43 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Word has length 297 [2022-04-08 11:09:31,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:09:31,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 45 states have (on average 2.022222222222222) internal successors, (91), 45 states have internal predecessors, (91), 43 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-08 11:09:33,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:09:33,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-08 11:09:33,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:09:33,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-08 11:09:33,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 11:09:33,424 INFO L87 Difference]: Start difference. First operand 146 states and 184 transitions. Second operand has 46 states, 45 states have (on average 2.022222222222222) internal successors, (91), 45 states have internal predecessors, (91), 43 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42)