/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:43:09,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:43:09,282 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:43:09,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:43:09,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:43:09,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:43:09,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:43:09,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:43:09,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:43:09,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:43:09,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:43:09,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:43:09,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:43:09,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:43:09,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:43:09,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:43:09,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:43:09,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:43:09,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:43:09,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:43:09,351 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:43:09,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:43:09,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:43:09,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:43:09,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:43:09,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:43:09,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:43:09,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:43:09,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:43:09,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:43:09,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:43:09,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:43:09,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:43:09,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:43:09,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:43:09,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:43:09,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:43:09,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:43:09,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:43:09,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:43:09,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:43:09,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:43:09,375 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 07:43:09,385 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:43:09,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:43:09,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:43:09,386 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:43:09,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:43:09,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:43:09,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:43:09,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:43:09,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:43:09,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:43:09,388 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:43:09,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:43:09,388 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:43:09,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:43:09,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:43:09,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:43:09,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:43:09,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:43:09,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:43:09,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:43:09,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:43:09,389 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:43:09,389 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:43:09,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:43:09,389 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:43:09,389 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 07:43:09,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:43:09,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:43:09,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:43:09,636 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:43:09,636 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:43:09,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c [2022-04-28 07:43:09,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73eb468f/ed4f62e06a4c4d5d968de1bacae46d4e/FLAG4a8688a04 [2022-04-28 07:43:10,097 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:43:10,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c [2022-04-28 07:43:10,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73eb468f/ed4f62e06a4c4d5d968de1bacae46d4e/FLAG4a8688a04 [2022-04-28 07:43:10,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73eb468f/ed4f62e06a4c4d5d968de1bacae46d4e [2022-04-28 07:43:10,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:43:10,124 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:43:10,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:43:10,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:43:10,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:43:10,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:43:10" (1/1) ... [2022-04-28 07:43:10,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58089883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:10, skipping insertion in model container [2022-04-28 07:43:10,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:43:10" (1/1) ... [2022-04-28 07:43:10,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:43:10,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:43:10,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c[458,471] [2022-04-28 07:43:10,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:43:10,338 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:43:10,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c[458,471] [2022-04-28 07:43:10,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:43:10,379 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:43:10,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:10 WrapperNode [2022-04-28 07:43:10,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:43:10,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:43:10,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:43:10,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:43:10,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:10" (1/1) ... [2022-04-28 07:43:10,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:10" (1/1) ... [2022-04-28 07:43:10,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:10" (1/1) ... [2022-04-28 07:43:10,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:10" (1/1) ... [2022-04-28 07:43:10,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:10" (1/1) ... [2022-04-28 07:43:10,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:10" (1/1) ... [2022-04-28 07:43:10,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:10" (1/1) ... [2022-04-28 07:43:10,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:43:10,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:43:10,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:43:10,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:43:10,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:10" (1/1) ... [2022-04-28 07:43:10,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:43:10,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:10,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 07:43:10,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 07:43:10,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:43:10,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:43:10,495 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:43:10,495 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:43:10,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:43:10,495 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:43:10,495 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:43:10,495 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:43:10,495 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:43:10,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:43:10,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 07:43:10,496 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:43:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:43:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:43:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:43:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:43:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:43:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:43:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:43:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:43:10,550 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:43:10,551 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:43:10,685 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:43:10,690 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:43:10,690 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:43:10,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:43:10 BoogieIcfgContainer [2022-04-28 07:43:10,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:43:10,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:43:10,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:43:10,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:43:10,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:43:10" (1/3) ... [2022-04-28 07:43:10,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:43:10, skipping insertion in model container [2022-04-28 07:43:10,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:10" (2/3) ... [2022-04-28 07:43:10,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:43:10, skipping insertion in model container [2022-04-28 07:43:10,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:43:10" (3/3) ... [2022-04-28 07:43:10,705 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound50.c [2022-04-28 07:43:10,715 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:43:10,716 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:43:10,773 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:43:10,778 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a0f242a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5fe35633 [2022-04-28 07:43:10,778 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:43:10,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:43:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 07:43:10,791 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:10,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:10,791 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:10,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:10,795 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-28 07:43:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:10,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1589634742] [2022-04-28 07:43:10,815 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:43:10,816 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 2 times [2022-04-28 07:43:10,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:10,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367558068] [2022-04-28 07:43:10,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:10,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:10,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:43:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:11,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(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); {31#true} is VALID [2022-04-28 07:43:11,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 07:43:11,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-28 07:43:11,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:43:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:11,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-28 07:43:11,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-28 07:43:11,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-28 07:43:11,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-28 07:43:11,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 07:43:11,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(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); {31#true} is VALID [2022-04-28 07:43:11,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 07:43:11,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-28 07:43:11,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-28 07:43:11,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#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; {31#true} is VALID [2022-04-28 07:43:11,040 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {31#true} is VALID [2022-04-28 07:43:11,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-28 07:43:11,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-28 07:43:11,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-28 07:43:11,042 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-28 07:43:11,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-28 07:43:11,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-28 07:43:11,043 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {32#false} is VALID [2022-04-28 07:43:11,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-28 07:43:11,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-28 07:43:11,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-28 07:43:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:43:11,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:11,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367558068] [2022-04-28 07:43:11,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367558068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:11,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:11,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:43:11,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:11,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1589634742] [2022-04-28 07:43:11,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1589634742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:11,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:11,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:43:11,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528174558] [2022-04-28 07:43:11,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:11,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 07:43:11,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:11,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:43:11,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:11,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:43:11,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:11,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:43:11,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:43:11,117 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:43:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:11,256 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-28 07:43:11,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:43:11,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 07:43:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:11,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:43:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-28 07:43:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:43:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-28 07:43:11,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-28 07:43:11,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:11,341 INFO L225 Difference]: With dead ends: 47 [2022-04-28 07:43:11,341 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 07:43:11,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:43:11,347 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:11,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:43:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 07:43:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 07:43:11,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:11,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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-28 07:43:11,374 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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-28 07:43:11,375 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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-28 07:43:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:11,379 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 07:43:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 07:43:11,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:11,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:11,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 23 states. [2022-04-28 07:43:11,380 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 23 states. [2022-04-28 07:43:11,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:11,383 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 07:43:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 07:43:11,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:11,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:11,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:11,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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-28 07:43:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-28 07:43:11,388 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-28 07:43:11,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:11,388 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-28 07:43:11,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:43:11,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-28 07:43:11,417 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-28 07:43:11,417 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 07:43:11,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 07:43:11,418 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:11,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:11,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:43:11,419 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:11,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:11,419 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-28 07:43:11,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:11,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1687335742] [2022-04-28 07:43:11,420 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:43:11,420 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 2 times [2022-04-28 07:43:11,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:11,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164410349] [2022-04-28 07:43:11,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:11,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:11,439 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:11,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1381817382] [2022-04-28 07:43:11,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:43:11,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:11,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:11,442 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:11,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 07:43:11,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:43:11,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:11,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:43:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:11,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:11,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-28 07:43:11,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#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); {229#true} is VALID [2022-04-28 07:43:11,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-28 07:43:11,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #60#return; {229#true} is VALID [2022-04-28 07:43:11,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-28 07:43:11,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#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; {229#true} is VALID [2022-04-28 07:43:11,705 INFO L272 TraceCheckUtils]: 6: Hoare triple {229#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {229#true} is VALID [2022-04-28 07:43:11,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-28 07:43:11,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-28 07:43:11,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-28 07:43:11,706 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {229#true} {229#true} #52#return; {229#true} is VALID [2022-04-28 07:43:11,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:11,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:11,708 INFO L272 TraceCheckUtils]: 13: Hoare triple {267#(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)); {274#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:11,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {278#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:11,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-28 07:43:11,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-28 07:43:11,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:43:11,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:43:11,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:11,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164410349] [2022-04-28 07:43:11,711 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:11,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381817382] [2022-04-28 07:43:11,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381817382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:11,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:11,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:43:11,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:11,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1687335742] [2022-04-28 07:43:11,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1687335742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:11,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:11,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:43:11,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998010168] [2022-04-28 07:43:11,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:11,714 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), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 07:43:11,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:11,714 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:43:11,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:11,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:43:11,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:11,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:43:11,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:43:11,730 INFO L87 Difference]: Start difference. First operand 23 states and 25 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:43:11,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:11,864 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 07:43:11,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:43:11,864 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), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 07:43:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:11,866 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:43:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 07:43:11,878 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:43:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 07:43:11,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-28 07:43:11,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:11,920 INFO L225 Difference]: With dead ends: 34 [2022-04-28 07:43:11,920 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 07:43:11,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 07:43:11,923 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:11,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:43:11,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 07:43:11,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 07:43:11,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:11,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:43:11,940 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:43:11,941 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:43:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:11,943 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 07:43:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 07:43:11,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:11,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:11,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-28 07:43:11,944 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-28 07:43:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:11,946 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 07:43:11,947 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 07:43:11,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:11,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:11,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:11,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:43:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-28 07:43:11,950 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-28 07:43:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:11,950 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-28 07:43:11,950 INFO L496 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:43:11,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-28 07:43:11,990 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-28 07:43:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 07:43:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 07:43:11,994 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:11,994 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:12,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 07:43:12,199 WARN L477 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-28 07:43:12,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:12,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:12,200 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-28 07:43:12,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:12,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1200076043] [2022-04-28 07:43:12,445 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:12,446 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:12,446 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:12,446 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 2 times [2022-04-28 07:43:12,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:12,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843200055] [2022-04-28 07:43:12,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:12,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:12,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:12,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384037088] [2022-04-28 07:43:12,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:43:12,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:12,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:12,478 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:12,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 07:43:12,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:43:12,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:12,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:43:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:12,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:12,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-28 07:43:12,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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); {474#true} is VALID [2022-04-28 07:43:12,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:43:12,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-28 07:43:12,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-28 07:43:12,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#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; {474#true} is VALID [2022-04-28 07:43:12,669 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {474#true} is VALID [2022-04-28 07:43:12,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 07:43:12,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 07:43:12,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:43:12,670 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-28 07:43:12,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:12,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:12,671 INFO L272 TraceCheckUtils]: 13: Hoare triple {512#(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)); {474#true} is VALID [2022-04-28 07:43:12,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 07:43:12,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 07:43:12,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:43:12,672 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {512#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:12,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#(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; {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-28 07:43:12,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-28 07:43:12,674 INFO L272 TraceCheckUtils]: 20: Hoare triple {534#(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)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:12,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:12,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-28 07:43:12,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-28 07:43:12,676 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-28 07:43:12,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:12,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-28 07:43:12,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-28 07:43:12,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:12,952 INFO L272 TraceCheckUtils]: 20: Hoare triple {561#(= (+ (* 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)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:12,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {561#(= (+ (* 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; {561#(= (+ (* 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-28 07:43:13,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {561#(= (+ (* 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; {561#(= (+ (* 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-28 07:43:13,209 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {561#(= (+ (* 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))} #54#return; {561#(= (+ (* 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-28 07:43:13,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:43:13,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 07:43:13,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 07:43:13,210 INFO L272 TraceCheckUtils]: 13: Hoare triple {561#(= (+ (* 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)); {474#true} is VALID [2022-04-28 07:43:13,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {561#(= (+ (* 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; {561#(= (+ (* 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-28 07:43:13,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {561#(= (+ (* 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-28 07:43:13,211 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-28 07:43:13,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:43:13,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 07:43:13,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 07:43:13,212 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {474#true} is VALID [2022-04-28 07:43:13,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#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; {474#true} is VALID [2022-04-28 07:43:13,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-28 07:43:13,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-28 07:43:13,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:43:13,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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); {474#true} is VALID [2022-04-28 07:43:13,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-28 07:43:13,213 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-28 07:43:13,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:13,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843200055] [2022-04-28 07:43:13,213 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:13,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384037088] [2022-04-28 07:43:13,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384037088] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:13,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:13,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 07:43:13,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:13,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1200076043] [2022-04-28 07:43:13,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1200076043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:13,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:13,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:43:13,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452062520] [2022-04-28 07:43:13,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:13,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 07:43:13,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:13,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:43:13,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:13,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:43:13,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:13,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:43:13,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 07:43:13,683 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:43:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:13,807 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-28 07:43:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:43:13,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 07:43:13,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:43:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 07:43:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:43:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 07:43:13,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-28 07:43:14,295 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-28 07:43:14,296 INFO L225 Difference]: With dead ends: 36 [2022-04-28 07:43:14,297 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 07:43:14,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:43:14,298 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:14,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:43:14,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 07:43:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 07:43:14,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:14,313 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), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:43:14,314 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), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:43:14,314 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), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:43:14,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:14,315 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 07:43:14,315 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 07:43:14,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:14,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:14,316 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), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-28 07:43:14,316 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), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-28 07:43:14,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:14,318 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 07:43:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 07:43:14,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:14,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:14,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:14,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:14,319 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), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:43:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 07:43:14,321 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-28 07:43:14,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:14,321 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 07:43:14,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:43:14,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 07:43:14,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:14,802 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 07:43:14,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 07:43:14,803 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:14,803 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:14,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:15,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 07:43:15,008 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:15,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:15,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-28 07:43:15,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:15,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1183116476] [2022-04-28 07:43:15,141 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:15,141 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:15,141 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 2 times [2022-04-28 07:43:15,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:15,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829068277] [2022-04-28 07:43:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:15,162 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:15,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [692234458] [2022-04-28 07:43:15,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:43:15,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:15,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:15,164 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:15,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 07:43:15,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:43:15,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:15,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 07:43:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:15,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:15,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2022-04-28 07:43:15,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#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); {822#true} is VALID [2022-04-28 07:43:15,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 07:43:15,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #60#return; {822#true} is VALID [2022-04-28 07:43:15,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret5 := main(); {822#true} is VALID [2022-04-28 07:43:15,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#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; {822#true} is VALID [2022-04-28 07:43:15,524 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {822#true} is VALID [2022-04-28 07:43:15,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 07:43:15,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 07:43:15,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 07:43:15,524 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #52#return; {822#true} is VALID [2022-04-28 07:43:15,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:15,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:15,525 INFO L272 TraceCheckUtils]: 13: Hoare triple {860#(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)); {822#true} is VALID [2022-04-28 07:43:15,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 07:43:15,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 07:43:15,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 07:43:15,528 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {822#true} {860#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:15,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(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; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:43:15,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:43:15,530 INFO L272 TraceCheckUtils]: 20: Hoare triple {882#(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)); {822#true} is VALID [2022-04-28 07:43:15,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 07:43:15,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 07:43:15,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 07:43:15,531 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {822#true} {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:43:15,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:15,534 INFO L272 TraceCheckUtils]: 26: Hoare triple {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:15,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:15,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {823#false} is VALID [2022-04-28 07:43:15,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-28 07:43:15,540 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-28 07:43:15,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:15,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:15,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829068277] [2022-04-28 07:43:15,834 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:15,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692234458] [2022-04-28 07:43:15,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692234458] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:15,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:15,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 07:43:15,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:15,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1183116476] [2022-04-28 07:43:15,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1183116476] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:15,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:15,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:43:15,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057717210] [2022-04-28 07:43:15,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:15,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-28 07:43:15,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:15,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:43:15,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:15,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:43:15,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:15,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:43:15,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:43:15,862 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:43:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:16,067 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-28 07:43:16,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 07:43:16,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-28 07:43:16,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:16,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:43:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-28 07:43:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:43:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-28 07:43:16,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-28 07:43:16,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:16,102 INFO L225 Difference]: With dead ends: 39 [2022-04-28 07:43:16,102 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 07:43:16,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:43:16,103 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:16,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:43:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 07:43:16,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 07:43:16,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:16,125 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), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:43:16,126 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), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:43:16,129 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), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:43:16,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:16,133 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 07:43:16,133 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 07:43:16,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:16,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:16,134 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), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 07:43:16,134 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), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 07:43:16,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:16,136 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 07:43:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 07:43:16,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:16,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:16,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:16,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:16,137 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), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:43:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-28 07:43:16,138 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-28 07:43:16,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:16,139 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-28 07:43:16,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:43:16,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-28 07:43:16,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:16,632 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 07:43:16,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 07:43:16,633 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:16,633 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:16,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:16,839 WARN L477 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-28 07:43:16,840 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:16,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:16,840 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 3 times [2022-04-28 07:43:16,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:16,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1076240800] [2022-04-28 07:43:16,946 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:16,946 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:16,947 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:16,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 4 times [2022-04-28 07:43:16,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:16,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232792677] [2022-04-28 07:43:16,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:16,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:16,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:16,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140822357] [2022-04-28 07:43:16,959 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:43:16,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:16,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:16,960 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:16,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 07:43:17,002 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:43:17,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:17,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 07:43:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:17,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:17,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1178#true} is VALID [2022-04-28 07:43:17,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {1178#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); {1178#true} is VALID [2022-04-28 07:43:17,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 07:43:17,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #60#return; {1178#true} is VALID [2022-04-28 07:43:17,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret5 := main(); {1178#true} is VALID [2022-04-28 07:43:17,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {1178#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; {1178#true} is VALID [2022-04-28 07:43:17,311 INFO L272 TraceCheckUtils]: 6: Hoare triple {1178#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {1178#true} is VALID [2022-04-28 07:43:17,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 07:43:17,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 07:43:17,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 07:43:17,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1178#true} {1178#true} #52#return; {1178#true} is VALID [2022-04-28 07:43:17,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:17,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:17,313 INFO L272 TraceCheckUtils]: 13: Hoare triple {1216#(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)); {1178#true} is VALID [2022-04-28 07:43:17,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 07:43:17,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 07:43:17,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 07:43:17,314 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1178#true} {1216#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:17,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {1216#(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; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:17,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:17,315 INFO L272 TraceCheckUtils]: 20: Hoare triple {1238#(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)); {1178#true} is VALID [2022-04-28 07:43:17,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 07:43:17,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 07:43:17,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 07:43:17,316 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1178#true} {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:17,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {1238#(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; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 07:43:17,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !false; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 07:43:17,317 INFO L272 TraceCheckUtils]: 27: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 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)); {1178#true} is VALID [2022-04-28 07:43:17,317 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 07:43:17,317 INFO L290 TraceCheckUtils]: 29: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 07:43:17,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 07:43:17,318 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1178#true} {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #54#return; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 07:43:17,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1282#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-28 07:43:17,319 INFO L272 TraceCheckUtils]: 33: Hoare triple {1282#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1286#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:17,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {1286#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1290#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:17,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {1290#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1179#false} is VALID [2022-04-28 07:43:17,320 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-28 07:43:17,321 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-28 07:43:17,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:17,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:17,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232792677] [2022-04-28 07:43:17,641 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:17,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140822357] [2022-04-28 07:43:17,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140822357] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:17,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:17,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 07:43:17,641 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:17,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1076240800] [2022-04-28 07:43:17,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1076240800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:17,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:17,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:43:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832005075] [2022-04-28 07:43:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:17,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-28 07:43:17,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:17,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:43:17,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:17,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:43:17,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:17,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:43:17,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 07:43:17,668 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:43:17,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:17,940 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-28 07:43:17,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:43:17,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-28 07:43:17,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:17,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:43:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-28 07:43:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:43:17,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-28 07:43:17,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-28 07:43:17,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:17,982 INFO L225 Difference]: With dead ends: 42 [2022-04-28 07:43:17,982 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 07:43:17,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:43:17,983 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:17,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:43:17,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 07:43:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 07:43:18,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:18,003 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), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:43:18,003 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), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:43:18,004 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), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:43:18,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:18,005 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 07:43:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 07:43:18,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:18,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:18,006 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), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-28 07:43:18,006 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), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-28 07:43:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:18,008 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 07:43:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 07:43:18,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:18,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:18,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:18,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:18,009 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), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:43:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-28 07:43:18,010 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 37 [2022-04-28 07:43:18,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:18,011 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-28 07:43:18,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:43:18,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-28 07:43:18,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 07:43:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 07:43:18,501 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:18,501 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:18,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:18,703 WARN L477 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-28 07:43:18,703 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:18,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:18,704 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 5 times [2022-04-28 07:43:18,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:18,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [362807599] [2022-04-28 07:43:18,796 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:18,796 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:18,796 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:18,796 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 6 times [2022-04-28 07:43:18,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:18,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681096805] [2022-04-28 07:43:18,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:18,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:18,822 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:18,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [364850569] [2022-04-28 07:43:18,823 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:43:18,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:18,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:18,825 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:18,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 07:43:18,913 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 07:43:18,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:18,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 07:43:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:18,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:19,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1574#true} is VALID [2022-04-28 07:43:19,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#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); {1574#true} is VALID [2022-04-28 07:43:19,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:43:19,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #60#return; {1574#true} is VALID [2022-04-28 07:43:19,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret5 := main(); {1574#true} is VALID [2022-04-28 07:43:19,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {1574#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; {1574#true} is VALID [2022-04-28 07:43:19,280 INFO L272 TraceCheckUtils]: 6: Hoare triple {1574#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {1574#true} is VALID [2022-04-28 07:43:19,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 07:43:19,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 07:43:19,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:43:19,280 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1574#true} {1574#true} #52#return; {1574#true} is VALID [2022-04-28 07:43:19,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {1574#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:19,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {1612#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:19,282 INFO L272 TraceCheckUtils]: 13: Hoare triple {1612#(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)); {1574#true} is VALID [2022-04-28 07:43:19,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 07:43:19,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 07:43:19,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:43:19,284 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1574#true} {1612#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:19,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {1612#(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; {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:19,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:19,285 INFO L272 TraceCheckUtils]: 20: Hoare triple {1634#(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)); {1574#true} is VALID [2022-04-28 07:43:19,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 07:43:19,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 07:43:19,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:43:19,286 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1574#true} {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:19,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {1634#(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; {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:19,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:19,287 INFO L272 TraceCheckUtils]: 27: Hoare triple {1656#(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)); {1574#true} is VALID [2022-04-28 07:43:19,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 07:43:19,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 07:43:19,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:43:19,288 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1574#true} {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:19,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {1656#(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; {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:19,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:19,289 INFO L272 TraceCheckUtils]: 34: Hoare triple {1678#(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)); {1574#true} is VALID [2022-04-28 07:43:19,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 07:43:19,289 INFO L290 TraceCheckUtils]: 36: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 07:43:19,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:43:19,290 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1574#true} {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #54#return; {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:19,291 INFO L290 TraceCheckUtils]: 39: Hoare triple {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1700#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:19,291 INFO L272 TraceCheckUtils]: 40: Hoare triple {1700#(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)); {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:19,292 INFO L290 TraceCheckUtils]: 41: Hoare triple {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1708#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:19,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {1708#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1575#false} is VALID [2022-04-28 07:43:19,292 INFO L290 TraceCheckUtils]: 43: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-04-28 07:43:19,293 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-28 07:43:19,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:19,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:19,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681096805] [2022-04-28 07:43:19,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:19,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364850569] [2022-04-28 07:43:19,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364850569] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:19,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:19,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 07:43:19,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:19,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [362807599] [2022-04-28 07:43:19,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [362807599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:19,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:19,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:43:19,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608561455] [2022-04-28 07:43:19,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:19,574 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-28 07:43:19,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:19,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:43:19,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:19,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:43:19,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:19,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:43:19,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:43:19,604 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:43:19,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:19,952 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-28 07:43:19,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 07:43:19,952 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-28 07:43:19,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:43:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 07:43:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:43:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 07:43:19,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-28 07:43:19,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:19,997 INFO L225 Difference]: With dead ends: 45 [2022-04-28 07:43:19,997 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 07:43:19,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 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-28 07:43:19,998 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:19,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:43:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 07:43:20,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-28 07:43:20,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:20,021 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), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:43:20,022 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), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:43:20,022 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), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:43:20,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:20,024 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-28 07:43:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 07:43:20,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:20,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:20,024 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), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-28 07:43:20,024 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), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-28 07:43:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:20,026 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-28 07:43:20,026 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 07:43:20,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:20,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:20,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:20,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:20,027 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), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:43:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-28 07:43:20,029 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 44 [2022-04-28 07:43:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:20,029 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-28 07:43:20,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:43:20,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-28 07:43:20,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 07:43:20,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 07:43:20,545 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:20,545 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:20,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:20,745 WARN L477 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-28 07:43:20,745 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:20,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:20,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 7 times [2022-04-28 07:43:20,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:20,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1108739829] [2022-04-28 07:43:20,839 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:20,840 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:20,840 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:20,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 8 times [2022-04-28 07:43:20,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:20,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684502862] [2022-04-28 07:43:20,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:20,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:20,851 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:20,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1615659057] [2022-04-28 07:43:20,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:43:20,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:20,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:20,853 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:20,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 07:43:20,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:43:20,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:20,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 07:43:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:20,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:21,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {2010#true} call ULTIMATE.init(); {2010#true} is VALID [2022-04-28 07:43:21,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {2010#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); {2010#true} is VALID [2022-04-28 07:43:21,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:43:21,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2010#true} {2010#true} #60#return; {2010#true} is VALID [2022-04-28 07:43:21,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {2010#true} call #t~ret5 := main(); {2010#true} is VALID [2022-04-28 07:43:21,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {2010#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; {2010#true} is VALID [2022-04-28 07:43:21,335 INFO L272 TraceCheckUtils]: 6: Hoare triple {2010#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {2010#true} is VALID [2022-04-28 07:43:21,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:43:21,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:43:21,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:43:21,335 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2010#true} {2010#true} #52#return; {2010#true} is VALID [2022-04-28 07:43:21,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {2010#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:21,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {2048#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:21,336 INFO L272 TraceCheckUtils]: 13: Hoare triple {2048#(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)); {2010#true} is VALID [2022-04-28 07:43:21,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:43:21,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:43:21,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:43:21,337 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2010#true} {2048#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:21,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {2048#(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; {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:21,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:21,338 INFO L272 TraceCheckUtils]: 20: Hoare triple {2070#(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)); {2010#true} is VALID [2022-04-28 07:43:21,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:43:21,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:43:21,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:43:21,339 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2010#true} {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:21,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {2070#(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; {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:21,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:21,340 INFO L272 TraceCheckUtils]: 27: Hoare triple {2092#(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)); {2010#true} is VALID [2022-04-28 07:43:21,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:43:21,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:43:21,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:43:21,341 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2010#true} {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:21,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {2092#(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; {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:43:21,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:43:21,343 INFO L272 TraceCheckUtils]: 34: Hoare triple {2114#(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)); {2010#true} is VALID [2022-04-28 07:43:21,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:43:21,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:43:21,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:43:21,343 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2010#true} {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #54#return; {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:43:21,344 INFO L290 TraceCheckUtils]: 39: Hoare triple {2114#(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; {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:43:21,350 INFO L290 TraceCheckUtils]: 40: Hoare triple {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:43:21,350 INFO L272 TraceCheckUtils]: 41: Hoare triple {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~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)); {2010#true} is VALID [2022-04-28 07:43:21,351 INFO L290 TraceCheckUtils]: 42: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:43:21,351 INFO L290 TraceCheckUtils]: 43: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:43:21,351 INFO L290 TraceCheckUtils]: 44: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:43:21,352 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2010#true} {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #54#return; {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:43:21,353 INFO L290 TraceCheckUtils]: 46: Hoare triple {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2158#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 07:43:21,354 INFO L272 TraceCheckUtils]: 47: Hoare triple {2158#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:21,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2166#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:21,354 INFO L290 TraceCheckUtils]: 49: Hoare triple {2166#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2011#false} is VALID [2022-04-28 07:43:21,355 INFO L290 TraceCheckUtils]: 50: Hoare triple {2011#false} assume !false; {2011#false} is VALID [2022-04-28 07:43:21,355 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-28 07:43:21,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:21,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:21,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684502862] [2022-04-28 07:43:21,631 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:21,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615659057] [2022-04-28 07:43:21,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615659057] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:21,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:21,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 07:43:21,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:21,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1108739829] [2022-04-28 07:43:21,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1108739829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:21,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:21,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:43:21,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066388302] [2022-04-28 07:43:21,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:21,633 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-28 07:43:21,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:21,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:43:21,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:21,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:43:21,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:21,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:43:21,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:43:21,668 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:43:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:22,121 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-28 07:43:22,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:43:22,121 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-28 07:43:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:43:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-28 07:43:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:43:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-28 07:43:22,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-28 07:43:22,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:22,170 INFO L225 Difference]: With dead ends: 48 [2022-04-28 07:43:22,170 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 07:43:22,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 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-28 07:43:22,171 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:22,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:43:22,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 07:43:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 07:43:22,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:22,205 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), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:43:22,205 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), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:43:22,206 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), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:43:22,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:22,208 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-28 07:43:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 07:43:22,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:22,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:22,209 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), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 43 states. [2022-04-28 07:43:22,209 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), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 43 states. [2022-04-28 07:43:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:22,214 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-28 07:43:22,214 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 07:43:22,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:22,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:22,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:22,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:22,214 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), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:43:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-28 07:43:22,216 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 51 [2022-04-28 07:43:22,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:22,216 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-28 07:43:22,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:43:22,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-28 07:43:22,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 07:43:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 07:43:22,710 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:22,710 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:22,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:22,915 WARN L477 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-28 07:43:22,915 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:22,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 9 times [2022-04-28 07:43:22,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:22,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1912871654] [2022-04-28 07:43:23,028 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:23,028 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:23,028 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:23,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 10 times [2022-04-28 07:43:23,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:23,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774496978] [2022-04-28 07:43:23,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:23,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:23,039 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:23,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [280990632] [2022-04-28 07:43:23,040 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:43:23,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:23,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:23,041 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:23,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 07:43:23,169 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:43:23,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:23,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 07:43:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:23,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:23,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2022-04-28 07:43:23,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#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); {2486#true} is VALID [2022-04-28 07:43:23,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:43:23,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2486#true} {2486#true} #60#return; {2486#true} is VALID [2022-04-28 07:43:23,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {2486#true} call #t~ret5 := main(); {2486#true} is VALID [2022-04-28 07:43:23,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {2486#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; {2486#true} is VALID [2022-04-28 07:43:23,566 INFO L272 TraceCheckUtils]: 6: Hoare triple {2486#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {2486#true} is VALID [2022-04-28 07:43:23,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:43:23,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:43:23,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:43:23,567 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2486#true} {2486#true} #52#return; {2486#true} is VALID [2022-04-28 07:43:23,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {2486#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:23,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {2524#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:23,568 INFO L272 TraceCheckUtils]: 13: Hoare triple {2524#(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)); {2486#true} is VALID [2022-04-28 07:43:23,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:43:23,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:43:23,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:43:23,569 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2486#true} {2524#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:23,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {2524#(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; {2546#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:23,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {2546#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {2546#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:23,570 INFO L272 TraceCheckUtils]: 20: Hoare triple {2546#(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)); {2486#true} is VALID [2022-04-28 07:43:23,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:43:23,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:43:23,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:43:23,573 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2486#true} {2546#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {2546#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:23,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {2546#(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; {2568#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:23,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {2568#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {2568#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:23,574 INFO L272 TraceCheckUtils]: 27: Hoare triple {2568#(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)); {2486#true} is VALID [2022-04-28 07:43:23,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:43:23,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:43:23,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:43:23,575 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2486#true} {2568#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {2568#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:23,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {2568#(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; {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:43:23,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:43:23,576 INFO L272 TraceCheckUtils]: 34: Hoare triple {2590#(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)); {2486#true} is VALID [2022-04-28 07:43:23,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:43:23,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:43:23,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:43:23,577 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2486#true} {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:43:23,578 INFO L290 TraceCheckUtils]: 39: Hoare triple {2590#(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; {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:43:23,578 INFO L290 TraceCheckUtils]: 40: Hoare triple {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:43:23,578 INFO L272 TraceCheckUtils]: 41: Hoare triple {2612#(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)); {2486#true} is VALID [2022-04-28 07:43:23,578 INFO L290 TraceCheckUtils]: 42: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:43:23,578 INFO L290 TraceCheckUtils]: 43: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:43:23,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:43:23,580 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2486#true} {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:43:23,580 INFO L290 TraceCheckUtils]: 46: Hoare triple {2612#(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; {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 07:43:23,581 INFO L290 TraceCheckUtils]: 47: Hoare triple {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 07:43:23,581 INFO L272 TraceCheckUtils]: 48: Hoare triple {2634#(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)); {2486#true} is VALID [2022-04-28 07:43:23,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:43:23,581 INFO L290 TraceCheckUtils]: 50: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:43:23,581 INFO L290 TraceCheckUtils]: 51: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:43:23,582 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2486#true} {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #54#return; {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 07:43:23,583 INFO L290 TraceCheckUtils]: 53: Hoare triple {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2656#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 07:43:23,583 INFO L272 TraceCheckUtils]: 54: Hoare triple {2656#(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)); {2660#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:23,584 INFO L290 TraceCheckUtils]: 55: Hoare triple {2660#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2664#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:23,585 INFO L290 TraceCheckUtils]: 56: Hoare triple {2664#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2487#false} is VALID [2022-04-28 07:43:23,585 INFO L290 TraceCheckUtils]: 57: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-04-28 07:43:23,587 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-28 07:43:23,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:23,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:23,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774496978] [2022-04-28 07:43:23,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:23,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280990632] [2022-04-28 07:43:23,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280990632] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:23,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:23,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 07:43:23,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:23,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1912871654] [2022-04-28 07:43:23,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1912871654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:23,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:23,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:43:23,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187302926] [2022-04-28 07:43:23,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:23,856 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-28 07:43:23,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:23,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:43:23,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:23,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:43:23,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:23,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:43:23,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:43:23,892 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:43:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:24,423 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-28 07:43:24,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 07:43:24,423 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-28 07:43:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:43:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-28 07:43:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:43:24,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-28 07:43:24,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-28 07:43:24,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:24,472 INFO L225 Difference]: With dead ends: 51 [2022-04-28 07:43:24,472 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 07:43:24,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 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-28 07:43:24,473 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:24,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 239 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:43:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 07:43:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 07:43:24,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:24,504 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), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:43:24,511 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), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:43:24,513 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), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:43:24,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:24,514 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 07:43:24,514 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 07:43:24,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:24,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:24,515 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), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-04-28 07:43:24,515 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), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-04-28 07:43:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:24,517 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 07:43:24,520 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 07:43:24,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:24,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:24,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:24,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:24,521 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), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:43:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-28 07:43:24,524 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 58 [2022-04-28 07:43:24,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:24,524 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-28 07:43:24,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:43:24,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 51 transitions. [2022-04-28 07:43:25,030 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-28 07:43:25,031 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 07:43:25,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 07:43:25,031 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:25,031 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:25,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:25,232 WARN L477 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-28 07:43:25,232 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:25,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:25,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 11 times [2022-04-28 07:43:25,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:25,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2111615554] [2022-04-28 07:43:25,328 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:25,328 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:25,328 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:25,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 12 times [2022-04-28 07:43:25,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:25,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413036430] [2022-04-28 07:43:25,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:25,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:25,351 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:25,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [49256691] [2022-04-28 07:43:25,352 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:43:25,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:25,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:25,360 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:25,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 07:43:25,524 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 07:43:25,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:25,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 07:43:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:25,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:25,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {3002#true} call ULTIMATE.init(); {3002#true} is VALID [2022-04-28 07:43:25,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {3002#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); {3002#true} is VALID [2022-04-28 07:43:25,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:25,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3002#true} {3002#true} #60#return; {3002#true} is VALID [2022-04-28 07:43:25,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {3002#true} call #t~ret5 := main(); {3002#true} is VALID [2022-04-28 07:43:25,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {3002#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; {3002#true} is VALID [2022-04-28 07:43:25,997 INFO L272 TraceCheckUtils]: 6: Hoare triple {3002#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {3002#true} is VALID [2022-04-28 07:43:25,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:43:25,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:43:25,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:25,997 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3002#true} {3002#true} #52#return; {3002#true} is VALID [2022-04-28 07:43:25,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {3002#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:25,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {3040#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:25,999 INFO L272 TraceCheckUtils]: 13: Hoare triple {3040#(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)); {3002#true} is VALID [2022-04-28 07:43:25,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:43:25,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:43:25,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:26,000 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3002#true} {3040#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:26,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {3040#(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; {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:43:26,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:43:26,001 INFO L272 TraceCheckUtils]: 20: Hoare triple {3062#(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)); {3002#true} is VALID [2022-04-28 07:43:26,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:43:26,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:43:26,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:26,002 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3002#true} {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:43:26,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {3062#(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; {3084#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:26,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {3084#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {3084#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:26,003 INFO L272 TraceCheckUtils]: 27: Hoare triple {3084#(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)); {3002#true} is VALID [2022-04-28 07:43:26,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:43:26,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:43:26,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:26,004 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3002#true} {3084#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {3084#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:26,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {3084#(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; {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:26,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:26,006 INFO L272 TraceCheckUtils]: 34: Hoare triple {3106#(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)); {3002#true} is VALID [2022-04-28 07:43:26,006 INFO L290 TraceCheckUtils]: 35: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:43:26,006 INFO L290 TraceCheckUtils]: 36: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:43:26,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:26,006 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3002#true} {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #54#return; {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:26,007 INFO L290 TraceCheckUtils]: 39: Hoare triple {3106#(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; {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:43:26,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:43:26,008 INFO L272 TraceCheckUtils]: 41: Hoare triple {3128#(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)); {3002#true} is VALID [2022-04-28 07:43:26,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:43:26,009 INFO L290 TraceCheckUtils]: 43: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:43:26,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:26,009 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3002#true} {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:43:26,010 INFO L290 TraceCheckUtils]: 46: Hoare triple {3128#(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; {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:26,010 INFO L290 TraceCheckUtils]: 47: Hoare triple {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:26,010 INFO L272 TraceCheckUtils]: 48: Hoare triple {3150#(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)); {3002#true} is VALID [2022-04-28 07:43:26,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:43:26,011 INFO L290 TraceCheckUtils]: 50: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:43:26,011 INFO L290 TraceCheckUtils]: 51: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:26,011 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3002#true} {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:26,012 INFO L290 TraceCheckUtils]: 53: Hoare triple {3150#(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; {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:26,012 INFO L290 TraceCheckUtils]: 54: Hoare triple {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:26,012 INFO L272 TraceCheckUtils]: 55: Hoare triple {3172#(and (< 5 main_~k~0) (<= 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)); {3002#true} is VALID [2022-04-28 07:43:26,013 INFO L290 TraceCheckUtils]: 56: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:43:26,013 INFO L290 TraceCheckUtils]: 57: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:43:26,013 INFO L290 TraceCheckUtils]: 58: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:26,014 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3002#true} {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:26,015 INFO L290 TraceCheckUtils]: 60: Hoare triple {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !(~c~0 < ~k~0); {3194#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:26,016 INFO L272 TraceCheckUtils]: 61: Hoare triple {3194#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:26,020 INFO L290 TraceCheckUtils]: 62: Hoare triple {3198#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:26,021 INFO L290 TraceCheckUtils]: 63: Hoare triple {3202#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3003#false} is VALID [2022-04-28 07:43:26,022 INFO L290 TraceCheckUtils]: 64: Hoare triple {3003#false} assume !false; {3003#false} is VALID [2022-04-28 07:43:26,022 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-28 07:43:26,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:26,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:26,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413036430] [2022-04-28 07:43:26,307 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:26,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49256691] [2022-04-28 07:43:26,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49256691] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:26,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:26,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 07:43:26,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:26,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2111615554] [2022-04-28 07:43:26,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2111615554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:26,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:26,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:43:26,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084140755] [2022-04-28 07:43:26,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:26,309 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-28 07:43:26,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:26,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:43:26,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:26,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:43:26,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:26,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:43:26,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 07:43:26,352 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:43:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:26,963 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-28 07:43:26,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:43:26,963 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-28 07:43:26,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:43:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-28 07:43:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:43:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-28 07:43:26,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-28 07:43:27,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:27,013 INFO L225 Difference]: With dead ends: 54 [2022-04-28 07:43:27,013 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 07:43:27,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-28 07:43:27,014 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:27,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:43:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 07:43:27,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-28 07:43:27,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:27,047 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), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:43:27,047 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), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:43:27,047 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), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:43:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:27,050 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-28 07:43:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-28 07:43:27,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:27,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:27,050 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), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 49 states. [2022-04-28 07:43:27,051 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), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 49 states. [2022-04-28 07:43:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:27,052 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-28 07:43:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-28 07:43:27,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:27,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:27,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:27,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:27,053 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), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:43:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-04-28 07:43:27,054 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 65 [2022-04-28 07:43:27,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:27,054 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-04-28 07:43:27,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:43:27,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 55 transitions. [2022-04-28 07:43:27,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-28 07:43:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 07:43:27,564 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:27,564 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:27,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:27,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 07:43:27,765 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:27,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 13 times [2022-04-28 07:43:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:27,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1275929877] [2022-04-28 07:43:27,868 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:27,868 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:27,868 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:27,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 14 times [2022-04-28 07:43:27,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:27,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132147678] [2022-04-28 07:43:27,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:27,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:27,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:27,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646636150] [2022-04-28 07:43:27,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:43:27,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:27,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:27,900 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:27,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 07:43:28,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:43:28,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:28,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 07:43:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:28,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:28,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {3558#true} call ULTIMATE.init(); {3558#true} is VALID [2022-04-28 07:43:28,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {3558#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); {3558#true} is VALID [2022-04-28 07:43:28,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:28,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3558#true} {3558#true} #60#return; {3558#true} is VALID [2022-04-28 07:43:28,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {3558#true} call #t~ret5 := main(); {3558#true} is VALID [2022-04-28 07:43:28,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {3558#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; {3558#true} is VALID [2022-04-28 07:43:28,592 INFO L272 TraceCheckUtils]: 6: Hoare triple {3558#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {3558#true} is VALID [2022-04-28 07:43:28,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:28,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:28,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:28,592 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3558#true} {3558#true} #52#return; {3558#true} is VALID [2022-04-28 07:43:28,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {3558#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3596#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:28,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {3596#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3596#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:28,595 INFO L272 TraceCheckUtils]: 13: Hoare triple {3596#(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)); {3558#true} is VALID [2022-04-28 07:43:28,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:28,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:28,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:28,596 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3558#true} {3596#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3596#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:28,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {3596#(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; {3618#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:28,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {3618#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {3618#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:28,597 INFO L272 TraceCheckUtils]: 20: Hoare triple {3618#(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)); {3558#true} is VALID [2022-04-28 07:43:28,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:28,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:28,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:28,598 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3558#true} {3618#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {3618#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:28,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {3618#(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; {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:43:28,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:43:28,599 INFO L272 TraceCheckUtils]: 27: Hoare triple {3640#(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)); {3558#true} is VALID [2022-04-28 07:43:28,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:28,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:28,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:28,603 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3558#true} {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:43:28,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {3640#(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; {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:43:28,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:43:28,608 INFO L272 TraceCheckUtils]: 34: Hoare triple {3662#(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)); {3558#true} is VALID [2022-04-28 07:43:28,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:28,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:28,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:28,609 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3558#true} {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #54#return; {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:43:28,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {3662#(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; {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:43:28,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:43:28,610 INFO L272 TraceCheckUtils]: 41: Hoare triple {3684#(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)); {3558#true} is VALID [2022-04-28 07:43:28,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:28,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:28,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:28,612 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3558#true} {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:43:28,612 INFO L290 TraceCheckUtils]: 46: Hoare triple {3684#(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; {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:43:28,613 INFO L290 TraceCheckUtils]: 47: Hoare triple {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !false; {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:43:28,613 INFO L272 TraceCheckUtils]: 48: Hoare triple {3706#(and (= (+ (- 2) 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)); {3558#true} is VALID [2022-04-28 07:43:28,613 INFO L290 TraceCheckUtils]: 49: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:28,613 INFO L290 TraceCheckUtils]: 50: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:28,613 INFO L290 TraceCheckUtils]: 51: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:28,614 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3558#true} {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #54#return; {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:43:28,614 INFO L290 TraceCheckUtils]: 53: Hoare triple {3706#(and (= (+ (- 2) 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; {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:28,615 INFO L290 TraceCheckUtils]: 54: Hoare triple {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:28,615 INFO L272 TraceCheckUtils]: 55: Hoare triple {3728#(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)); {3558#true} is VALID [2022-04-28 07:43:28,615 INFO L290 TraceCheckUtils]: 56: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:28,615 INFO L290 TraceCheckUtils]: 57: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:28,616 INFO L290 TraceCheckUtils]: 58: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:28,616 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3558#true} {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:28,617 INFO L290 TraceCheckUtils]: 60: Hoare triple {3728#(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; {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:43:28,618 INFO L290 TraceCheckUtils]: 61: Hoare triple {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:43:28,618 INFO L272 TraceCheckUtils]: 62: Hoare triple {3750#(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)); {3558#true} is VALID [2022-04-28 07:43:28,618 INFO L290 TraceCheckUtils]: 63: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:28,618 INFO L290 TraceCheckUtils]: 64: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:28,618 INFO L290 TraceCheckUtils]: 65: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:28,619 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3558#true} {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #54#return; {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:43:28,619 INFO L290 TraceCheckUtils]: 67: Hoare triple {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3772#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:43:28,620 INFO L272 TraceCheckUtils]: 68: Hoare triple {3772#(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)); {3776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:28,620 INFO L290 TraceCheckUtils]: 69: Hoare triple {3776#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:28,621 INFO L290 TraceCheckUtils]: 70: Hoare triple {3780#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3559#false} is VALID [2022-04-28 07:43:28,621 INFO L290 TraceCheckUtils]: 71: Hoare triple {3559#false} assume !false; {3559#false} is VALID [2022-04-28 07:43:28,622 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-28 07:43:28,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:28,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:28,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132147678] [2022-04-28 07:43:28,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:28,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646636150] [2022-04-28 07:43:28,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646636150] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:28,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:28,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 07:43:28,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:28,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1275929877] [2022-04-28 07:43:28,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1275929877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:28,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:28,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:43:28,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724524324] [2022-04-28 07:43:28,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:28,922 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 72 [2022-04-28 07:43:28,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:28,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:43:28,964 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-28 07:43:28,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:43:28,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:28,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:43:28,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:43:28,965 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:43:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:29,646 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-28 07:43:29,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 07:43:29,646 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 72 [2022-04-28 07:43:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:43:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 07:43:29,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:43:29,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 07:43:29,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-28 07:43:29,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:29,712 INFO L225 Difference]: With dead ends: 57 [2022-04-28 07:43:29,712 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 07:43:29,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:43:29,713 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:29,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 313 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 07:43:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 07:43:29,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 07:43:29,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:29,769 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), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:43:29,769 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), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:43:29,769 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), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:43:29,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:29,771 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-28 07:43:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-28 07:43:29,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:29,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:29,771 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), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-28 07:43:29,772 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), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-28 07:43:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:29,773 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-28 07:43:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-28 07:43:29,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:29,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:29,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:29,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:29,774 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), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:43:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-28 07:43:29,775 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 72 [2022-04-28 07:43:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:29,776 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-28 07:43:29,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:43:29,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 59 transitions. [2022-04-28 07:43:30,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-28 07:43:30,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 07:43:30,291 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:30,291 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:30,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:30,496 WARN L477 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-28 07:43:30,496 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:30,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:30,497 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 15 times [2022-04-28 07:43:30,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:30,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2078268017] [2022-04-28 07:43:30,580 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:30,581 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:30,581 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 16 times [2022-04-28 07:43:30,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:30,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851462781] [2022-04-28 07:43:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:30,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:30,592 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:30,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1080622574] [2022-04-28 07:43:30,593 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:43:30,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:30,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:30,594 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:30,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 07:43:31,028 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:43:31,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:31,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 07:43:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:31,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:31,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {4154#true} call ULTIMATE.init(); {4154#true} is VALID [2022-04-28 07:43:31,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {4154#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); {4154#true} is VALID [2022-04-28 07:43:31,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:31,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4154#true} {4154#true} #60#return; {4154#true} is VALID [2022-04-28 07:43:31,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {4154#true} call #t~ret5 := main(); {4154#true} is VALID [2022-04-28 07:43:31,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {4154#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; {4154#true} is VALID [2022-04-28 07:43:31,508 INFO L272 TraceCheckUtils]: 6: Hoare triple {4154#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {4154#true} is VALID [2022-04-28 07:43:31,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:31,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:31,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:31,509 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4154#true} {4154#true} #52#return; {4154#true} is VALID [2022-04-28 07:43:31,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {4154#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4192#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:31,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {4192#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4192#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:31,510 INFO L272 TraceCheckUtils]: 13: Hoare triple {4192#(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)); {4154#true} is VALID [2022-04-28 07:43:31,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:31,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:31,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:31,511 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4154#true} {4192#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {4192#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:31,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {4192#(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; {4214#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:31,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {4214#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {4214#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:31,513 INFO L272 TraceCheckUtils]: 20: Hoare triple {4214#(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)); {4154#true} is VALID [2022-04-28 07:43:31,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:31,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:31,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:31,514 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4154#true} {4214#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {4214#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:31,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {4214#(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; {4236#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:31,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {4236#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {4236#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:31,515 INFO L272 TraceCheckUtils]: 27: Hoare triple {4236#(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)); {4154#true} is VALID [2022-04-28 07:43:31,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:31,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:31,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:31,516 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4154#true} {4236#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {4236#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:31,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {4236#(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; {4258#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:43:31,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {4258#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4258#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:43:31,517 INFO L272 TraceCheckUtils]: 34: Hoare triple {4258#(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)); {4154#true} is VALID [2022-04-28 07:43:31,517 INFO L290 TraceCheckUtils]: 35: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:31,517 INFO L290 TraceCheckUtils]: 36: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:31,517 INFO L290 TraceCheckUtils]: 37: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:31,518 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4154#true} {4258#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {4258#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:43:31,518 INFO L290 TraceCheckUtils]: 39: Hoare triple {4258#(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; {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:31,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:31,519 INFO L272 TraceCheckUtils]: 41: Hoare triple {4280#(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)); {4154#true} is VALID [2022-04-28 07:43:31,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:31,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:31,519 INFO L290 TraceCheckUtils]: 44: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:31,519 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4154#true} {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:31,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {4280#(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; {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-28 07:43:31,520 INFO L290 TraceCheckUtils]: 47: Hoare triple {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-28 07:43:31,520 INFO L272 TraceCheckUtils]: 48: Hoare triple {4302#(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)); {4154#true} is VALID [2022-04-28 07:43:31,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:31,521 INFO L290 TraceCheckUtils]: 50: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:31,521 INFO L290 TraceCheckUtils]: 51: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:31,524 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4154#true} {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #54#return; {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-28 07:43:31,524 INFO L290 TraceCheckUtils]: 53: Hoare triple {4302#(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; {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:43:31,525 INFO L290 TraceCheckUtils]: 54: Hoare triple {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:43:31,525 INFO L272 TraceCheckUtils]: 55: Hoare triple {4324#(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)); {4154#true} is VALID [2022-04-28 07:43:31,525 INFO L290 TraceCheckUtils]: 56: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:31,525 INFO L290 TraceCheckUtils]: 57: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:31,525 INFO L290 TraceCheckUtils]: 58: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:31,526 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4154#true} {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:43:31,526 INFO L290 TraceCheckUtils]: 60: Hoare triple {4324#(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; {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:31,527 INFO L290 TraceCheckUtils]: 61: Hoare triple {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !false; {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:31,527 INFO L272 TraceCheckUtils]: 62: Hoare triple {4346#(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)); {4154#true} is VALID [2022-04-28 07:43:31,527 INFO L290 TraceCheckUtils]: 63: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:31,527 INFO L290 TraceCheckUtils]: 64: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:31,527 INFO L290 TraceCheckUtils]: 65: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:31,528 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4154#true} {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} #54#return; {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:31,528 INFO L290 TraceCheckUtils]: 67: Hoare triple {4346#(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; {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:43:31,529 INFO L290 TraceCheckUtils]: 68: Hoare triple {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} assume !false; {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:43:31,529 INFO L272 TraceCheckUtils]: 69: Hoare triple {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 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)); {4154#true} is VALID [2022-04-28 07:43:31,529 INFO L290 TraceCheckUtils]: 70: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:31,529 INFO L290 TraceCheckUtils]: 71: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:31,529 INFO L290 TraceCheckUtils]: 72: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:31,530 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4154#true} {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} #54#return; {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:43:31,530 INFO L290 TraceCheckUtils]: 74: Hoare triple {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} assume !(~c~0 < ~k~0); {4390#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= main_~k~0 8))} is VALID [2022-04-28 07:43:31,531 INFO L272 TraceCheckUtils]: 75: Hoare triple {4390#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4394#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:31,531 INFO L290 TraceCheckUtils]: 76: Hoare triple {4394#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4398#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:31,532 INFO L290 TraceCheckUtils]: 77: Hoare triple {4398#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4155#false} is VALID [2022-04-28 07:43:31,532 INFO L290 TraceCheckUtils]: 78: Hoare triple {4155#false} assume !false; {4155#false} is VALID [2022-04-28 07:43:31,532 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-28 07:43:31,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:31,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:31,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851462781] [2022-04-28 07:43:31,893 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:31,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080622574] [2022-04-28 07:43:31,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080622574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:31,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:31,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 07:43:31,894 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:31,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2078268017] [2022-04-28 07:43:31,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2078268017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:31,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:31,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 07:43:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473853129] [2022-04-28 07:43:31,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:31,895 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 79 [2022-04-28 07:43:31,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:31,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:43:31,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:31,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 07:43:31,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:31,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 07:43:31,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 07:43:31,942 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:43:32,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:32,766 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-28 07:43:32,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:43:32,766 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 79 [2022-04-28 07:43:32,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:43:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-28 07:43:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:43:32,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-28 07:43:32,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-28 07:43:32,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:32,829 INFO L225 Difference]: With dead ends: 60 [2022-04-28 07:43:32,829 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 07:43:32,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:43:32,830 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:32,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 353 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 07:43:32,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 07:43:32,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 07:43:32,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:32,864 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), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:43:32,864 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), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:43:32,864 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), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:43:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:32,866 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-28 07:43:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-28 07:43:32,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:32,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:32,867 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), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-28 07:43:32,867 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), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-28 07:43:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:32,868 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-28 07:43:32,869 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-28 07:43:32,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:32,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:32,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:32,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:32,869 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), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:43:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-04-28 07:43:32,871 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 79 [2022-04-28 07:43:32,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:32,871 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-04-28 07:43:32,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:43:32,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 63 transitions. [2022-04-28 07:43:33,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:33,387 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-28 07:43:33,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 07:43:33,388 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:33,388 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:33,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:33,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 07:43:33,593 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:33,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:33,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 17 times [2022-04-28 07:43:33,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:33,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1742526895] [2022-04-28 07:43:33,684 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:33,684 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:33,684 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:33,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 18 times [2022-04-28 07:43:33,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:33,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24355289] [2022-04-28 07:43:33,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:33,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:33,696 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:33,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013827458] [2022-04-28 07:43:33,696 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:43:33,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:33,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:33,697 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:33,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 07:43:34,071 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 07:43:34,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:34,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 07:43:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:34,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:34,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {4790#true} call ULTIMATE.init(); {4790#true} is VALID [2022-04-28 07:43:34,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {4790#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); {4790#true} is VALID [2022-04-28 07:43:34,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:34,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4790#true} {4790#true} #60#return; {4790#true} is VALID [2022-04-28 07:43:34,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {4790#true} call #t~ret5 := main(); {4790#true} is VALID [2022-04-28 07:43:34,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {4790#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; {4790#true} is VALID [2022-04-28 07:43:34,628 INFO L272 TraceCheckUtils]: 6: Hoare triple {4790#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {4790#true} is VALID [2022-04-28 07:43:34,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:34,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:34,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:34,628 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4790#true} {4790#true} #52#return; {4790#true} is VALID [2022-04-28 07:43:34,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {4790#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:34,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {4828#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:34,629 INFO L272 TraceCheckUtils]: 13: Hoare triple {4828#(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)); {4790#true} is VALID [2022-04-28 07:43:34,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:34,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:34,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:34,630 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4790#true} {4828#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {4828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:34,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {4828#(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; {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:34,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:34,631 INFO L272 TraceCheckUtils]: 20: Hoare triple {4850#(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)); {4790#true} is VALID [2022-04-28 07:43:34,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:34,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:34,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:34,631 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4790#true} {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:34,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {4850#(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; {4872#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:34,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {4872#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {4872#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:34,632 INFO L272 TraceCheckUtils]: 27: Hoare triple {4872#(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)); {4790#true} is VALID [2022-04-28 07:43:34,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:34,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:34,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:34,633 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4790#true} {4872#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {4872#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:34,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {4872#(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; {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:34,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:34,634 INFO L272 TraceCheckUtils]: 34: Hoare triple {4894#(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)); {4790#true} is VALID [2022-04-28 07:43:34,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:34,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:34,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:34,634 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4790#true} {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #54#return; {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:34,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {4894#(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; {4916#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:43:34,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {4916#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {4916#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:43:34,635 INFO L272 TraceCheckUtils]: 41: Hoare triple {4916#(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)); {4790#true} is VALID [2022-04-28 07:43:34,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:34,635 INFO L290 TraceCheckUtils]: 43: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:34,635 INFO L290 TraceCheckUtils]: 44: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:34,636 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4790#true} {4916#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {4916#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:43:34,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {4916#(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; {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:34,637 INFO L290 TraceCheckUtils]: 47: Hoare triple {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:34,637 INFO L272 TraceCheckUtils]: 48: Hoare triple {4938#(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)); {4790#true} is VALID [2022-04-28 07:43:34,637 INFO L290 TraceCheckUtils]: 49: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:34,637 INFO L290 TraceCheckUtils]: 50: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:34,637 INFO L290 TraceCheckUtils]: 51: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:34,637 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4790#true} {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:34,638 INFO L290 TraceCheckUtils]: 53: Hoare triple {4938#(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; {4960#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:34,638 INFO L290 TraceCheckUtils]: 54: Hoare triple {4960#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !false; {4960#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:34,638 INFO L272 TraceCheckUtils]: 55: Hoare triple {4960#(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)); {4790#true} is VALID [2022-04-28 07:43:34,638 INFO L290 TraceCheckUtils]: 56: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:34,638 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:34,638 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:34,639 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4790#true} {4960#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #54#return; {4960#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:34,639 INFO L290 TraceCheckUtils]: 60: Hoare triple {4960#(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; {4982#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:43:34,640 INFO L290 TraceCheckUtils]: 61: Hoare triple {4982#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {4982#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:43:34,640 INFO L272 TraceCheckUtils]: 62: Hoare triple {4982#(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)); {4790#true} is VALID [2022-04-28 07:43:34,640 INFO L290 TraceCheckUtils]: 63: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:34,640 INFO L290 TraceCheckUtils]: 64: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:34,640 INFO L290 TraceCheckUtils]: 65: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:34,640 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4790#true} {4982#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {4982#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:43:34,641 INFO L290 TraceCheckUtils]: 67: Hoare triple {4982#(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; {5004#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:43:34,641 INFO L290 TraceCheckUtils]: 68: Hoare triple {5004#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {5004#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:43:34,641 INFO L272 TraceCheckUtils]: 69: Hoare triple {5004#(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)); {4790#true} is VALID [2022-04-28 07:43:34,641 INFO L290 TraceCheckUtils]: 70: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:34,641 INFO L290 TraceCheckUtils]: 71: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:34,641 INFO L290 TraceCheckUtils]: 72: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:34,642 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4790#true} {5004#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {5004#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:43:34,642 INFO L290 TraceCheckUtils]: 74: Hoare triple {5004#(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; {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:43:34,643 INFO L290 TraceCheckUtils]: 75: Hoare triple {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:43:34,643 INFO L272 TraceCheckUtils]: 76: Hoare triple {5026#(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)); {4790#true} is VALID [2022-04-28 07:43:34,643 INFO L290 TraceCheckUtils]: 77: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:34,643 INFO L290 TraceCheckUtils]: 78: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:34,643 INFO L290 TraceCheckUtils]: 79: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:34,643 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {4790#true} {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #54#return; {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:43:34,644 INFO L290 TraceCheckUtils]: 81: Hoare triple {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5048#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 07:43:34,644 INFO L272 TraceCheckUtils]: 82: Hoare triple {5048#(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)); {5052#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:34,645 INFO L290 TraceCheckUtils]: 83: Hoare triple {5052#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5056#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:34,645 INFO L290 TraceCheckUtils]: 84: Hoare triple {5056#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4791#false} is VALID [2022-04-28 07:43:34,645 INFO L290 TraceCheckUtils]: 85: Hoare triple {4791#false} assume !false; {4791#false} is VALID [2022-04-28 07:43:34,646 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-28 07:43:34,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:35,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:35,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24355289] [2022-04-28 07:43:35,008 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:35,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013827458] [2022-04-28 07:43:35,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013827458] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:35,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:35,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-28 07:43:35,009 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:35,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1742526895] [2022-04-28 07:43:35,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1742526895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:35,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:35,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 07:43:35,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397959996] [2022-04-28 07:43:35,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:35,010 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 86 [2022-04-28 07:43:35,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:35,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:43:35,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:35,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 07:43:35,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:35,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 07:43:35,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:43:35,054 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:43:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:35,998 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-28 07:43:35,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 07:43:35,999 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 86 [2022-04-28 07:43:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:43:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-28 07:43:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:43:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-28 07:43:36,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 68 transitions. [2022-04-28 07:43:36,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:36,057 INFO L225 Difference]: With dead ends: 63 [2022-04-28 07:43:36,057 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 07:43:36,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:43:36,058 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:36,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 395 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 07:43:36,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 07:43:36,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-28 07:43:36,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:36,113 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), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:43:36,113 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), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:43:36,114 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), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:43:36,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:36,115 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-28 07:43:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 07:43:36,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:36,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:36,116 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), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 58 states. [2022-04-28 07:43:36,116 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), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 58 states. [2022-04-28 07:43:36,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:36,118 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-28 07:43:36,118 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 07:43:36,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:36,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:36,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:36,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:36,118 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), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:43:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-28 07:43:36,120 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 86 [2022-04-28 07:43:36,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:36,120 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-28 07:43:36,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:43:36,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 67 transitions. [2022-04-28 07:43:36,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 07:43:36,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 07:43:36,658 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:36,658 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:36,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:36,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 07:43:36,859 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:36,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:36,859 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 19 times [2022-04-28 07:43:36,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:36,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1755393857] [2022-04-28 07:43:36,947 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:36,947 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:36,947 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:36,947 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 20 times [2022-04-28 07:43:36,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:36,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718403150] [2022-04-28 07:43:36,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:36,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:36,961 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:36,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [420667580] [2022-04-28 07:43:36,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:43:36,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:36,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:36,963 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:36,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 07:43:37,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:43:37,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:37,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 07:43:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:37,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:38,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {5466#true} call ULTIMATE.init(); {5466#true} is VALID [2022-04-28 07:43:38,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {5466#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); {5466#true} is VALID [2022-04-28 07:43:38,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-28 07:43:38,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5466#true} {5466#true} #60#return; {5466#true} is VALID [2022-04-28 07:43:38,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {5466#true} call #t~ret5 := main(); {5466#true} is VALID [2022-04-28 07:43:38,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {5466#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; {5466#true} is VALID [2022-04-28 07:43:38,160 INFO L272 TraceCheckUtils]: 6: Hoare triple {5466#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {5466#true} is VALID [2022-04-28 07:43:38,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-28 07:43:38,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-28 07:43:38,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-28 07:43:38,160 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5466#true} {5466#true} #52#return; {5466#true} is VALID [2022-04-28 07:43:38,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {5466#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5504#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:38,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {5504#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5504#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:38,161 INFO L272 TraceCheckUtils]: 13: Hoare triple {5504#(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)); {5466#true} is VALID [2022-04-28 07:43:38,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-28 07:43:38,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-28 07:43:38,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-28 07:43:38,162 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5466#true} {5504#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {5504#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:38,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {5504#(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; {5526#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:38,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {5526#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {5526#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:38,163 INFO L272 TraceCheckUtils]: 20: Hoare triple {5526#(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)); {5466#true} is VALID [2022-04-28 07:43:38,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-28 07:43:38,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-28 07:43:38,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-28 07:43:38,163 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5466#true} {5526#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {5526#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:38,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {5526#(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; {5548#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:38,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {5548#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {5548#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:38,164 INFO L272 TraceCheckUtils]: 27: Hoare triple {5548#(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)); {5466#true} is VALID [2022-04-28 07:43:38,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-28 07:43:38,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-28 07:43:38,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-28 07:43:38,165 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5466#true} {5548#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {5548#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:38,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {5548#(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; {5570#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:43:38,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {5570#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {5570#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:43:38,166 INFO L272 TraceCheckUtils]: 34: Hoare triple {5570#(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)); {5466#true} is VALID [2022-04-28 07:43:38,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-28 07:43:38,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-28 07:43:38,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-28 07:43:38,166 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5466#true} {5570#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #54#return; {5570#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:43:38,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {5570#(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; {5592#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:43:38,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {5592#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} assume !false; {5592#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:43:38,171 INFO L272 TraceCheckUtils]: 41: Hoare triple {5592#(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)); {5466#true} is VALID [2022-04-28 07:43:38,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-28 07:43:38,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-28 07:43:38,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-28 07:43:38,172 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5466#true} {5592#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} #54#return; {5592#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:43:38,172 INFO L290 TraceCheckUtils]: 46: Hoare triple {5592#(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; {5614#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:38,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {5614#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {5614#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:38,173 INFO L272 TraceCheckUtils]: 48: Hoare triple {5614#(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)); {5466#true} is VALID [2022-04-28 07:43:38,173 INFO L290 TraceCheckUtils]: 49: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-28 07:43:38,173 INFO L290 TraceCheckUtils]: 50: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-28 07:43:38,173 INFO L290 TraceCheckUtils]: 51: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-28 07:43:38,174 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5466#true} {5614#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {5614#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:38,174 INFO L290 TraceCheckUtils]: 53: Hoare triple {5614#(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; {5636#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:43:38,174 INFO L290 TraceCheckUtils]: 54: Hoare triple {5636#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {5636#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:43:38,174 INFO L272 TraceCheckUtils]: 55: Hoare triple {5636#(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)); {5466#true} is VALID [2022-04-28 07:43:38,175 INFO L290 TraceCheckUtils]: 56: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-28 07:43:38,175 INFO L290 TraceCheckUtils]: 57: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-28 07:43:38,175 INFO L290 TraceCheckUtils]: 58: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-28 07:43:38,175 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5466#true} {5636#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {5636#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:43:38,176 INFO L290 TraceCheckUtils]: 60: Hoare triple {5636#(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; {5658#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:43:38,176 INFO L290 TraceCheckUtils]: 61: Hoare triple {5658#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {5658#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:43:38,176 INFO L272 TraceCheckUtils]: 62: Hoare triple {5658#(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)); {5466#true} is VALID [2022-04-28 07:43:38,176 INFO L290 TraceCheckUtils]: 63: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-28 07:43:38,176 INFO L290 TraceCheckUtils]: 64: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-28 07:43:38,176 INFO L290 TraceCheckUtils]: 65: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-28 07:43:38,177 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5466#true} {5658#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {5658#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:43:38,178 INFO L290 TraceCheckUtils]: 67: Hoare triple {5658#(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; {5680#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:43:38,178 INFO L290 TraceCheckUtils]: 68: Hoare triple {5680#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {5680#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:43:38,178 INFO L272 TraceCheckUtils]: 69: Hoare triple {5680#(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)); {5466#true} is VALID [2022-04-28 07:43:38,178 INFO L290 TraceCheckUtils]: 70: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-28 07:43:38,178 INFO L290 TraceCheckUtils]: 71: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-28 07:43:38,178 INFO L290 TraceCheckUtils]: 72: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-28 07:43:38,179 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5466#true} {5680#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {5680#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:43:38,179 INFO L290 TraceCheckUtils]: 74: Hoare triple {5680#(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; {5702#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:43:38,180 INFO L290 TraceCheckUtils]: 75: Hoare triple {5702#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {5702#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:43:38,180 INFO L272 TraceCheckUtils]: 76: Hoare triple {5702#(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)); {5466#true} is VALID [2022-04-28 07:43:38,180 INFO L290 TraceCheckUtils]: 77: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-28 07:43:38,180 INFO L290 TraceCheckUtils]: 78: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-28 07:43:38,180 INFO L290 TraceCheckUtils]: 79: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-28 07:43:38,180 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5466#true} {5702#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #54#return; {5702#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:43:38,181 INFO L290 TraceCheckUtils]: 81: Hoare triple {5702#(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; {5724#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:43:38,181 INFO L290 TraceCheckUtils]: 82: Hoare triple {5724#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !false; {5724#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:43:38,181 INFO L272 TraceCheckUtils]: 83: Hoare triple {5724#(and (= main_~y~0 10) (<= main_~c~0 10) (< 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)); {5466#true} is VALID [2022-04-28 07:43:38,181 INFO L290 TraceCheckUtils]: 84: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-28 07:43:38,181 INFO L290 TraceCheckUtils]: 85: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-28 07:43:38,181 INFO L290 TraceCheckUtils]: 86: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-28 07:43:38,182 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {5466#true} {5724#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #54#return; {5724#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:43:38,183 INFO L290 TraceCheckUtils]: 88: Hoare triple {5724#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {5746#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:43:38,183 INFO L272 TraceCheckUtils]: 89: Hoare triple {5746#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5750#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:38,183 INFO L290 TraceCheckUtils]: 90: Hoare triple {5750#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5754#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:38,184 INFO L290 TraceCheckUtils]: 91: Hoare triple {5754#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5467#false} is VALID [2022-04-28 07:43:38,184 INFO L290 TraceCheckUtils]: 92: Hoare triple {5467#false} assume !false; {5467#false} is VALID [2022-04-28 07:43:38,184 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-28 07:43:38,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:38,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:38,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718403150] [2022-04-28 07:43:38,457 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:38,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420667580] [2022-04-28 07:43:38,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420667580] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:38,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:38,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 07:43:38,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:38,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1755393857] [2022-04-28 07:43:38,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1755393857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:38,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:38,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 07:43:38,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003211754] [2022-04-28 07:43:38,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:38,458 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-28 07:43:38,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:38,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 07:43:38,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:38,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 07:43:38,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:38,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 07:43:38,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:43:38,504 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 07:43:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:39,645 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-28 07:43:39,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 07:43:39,646 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-28 07:43:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 07:43:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-28 07:43:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 07:43:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-28 07:43:39,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 72 transitions. [2022-04-28 07:43:39,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:39,713 INFO L225 Difference]: With dead ends: 66 [2022-04-28 07:43:39,713 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 07:43:39,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-28 07:43:39,714 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:39,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 07:43:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 07:43:39,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 07:43:39,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:39,762 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), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:43:39,762 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), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:43:39,762 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), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:43:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:39,764 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-28 07:43:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-28 07:43:39,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:39,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:39,765 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), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 61 states. [2022-04-28 07:43:39,765 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), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 61 states. [2022-04-28 07:43:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:39,766 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-28 07:43:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-28 07:43:39,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:39,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:39,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:39,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:39,767 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), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:43:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-04-28 07:43:39,769 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 93 [2022-04-28 07:43:39,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:39,769 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-04-28 07:43:39,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 07:43:39,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 71 transitions. [2022-04-28 07:43:40,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-28 07:43:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 07:43:40,341 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:40,341 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:40,346 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-28 07:43:40,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 07:43:40,546 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:40,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:40,547 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 21 times [2022-04-28 07:43:40,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:40,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [114860772] [2022-04-28 07:43:40,628 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:40,628 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:40,628 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:40,628 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 22 times [2022-04-28 07:43:40,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:40,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409382999] [2022-04-28 07:43:40,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:40,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:40,641 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:40,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [334605668] [2022-04-28 07:43:40,641 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:43:40,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:40,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:40,660 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:40,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 07:43:41,718 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:43:41,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:41,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 07:43:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:41,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:42,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {6182#true} call ULTIMATE.init(); {6182#true} is VALID [2022-04-28 07:43:42,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {6182#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); {6182#true} is VALID [2022-04-28 07:43:42,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-28 07:43:42,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6182#true} {6182#true} #60#return; {6182#true} is VALID [2022-04-28 07:43:42,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {6182#true} call #t~ret5 := main(); {6182#true} is VALID [2022-04-28 07:43:42,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {6182#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; {6182#true} is VALID [2022-04-28 07:43:42,267 INFO L272 TraceCheckUtils]: 6: Hoare triple {6182#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {6182#true} is VALID [2022-04-28 07:43:42,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-28 07:43:42,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-28 07:43:42,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-28 07:43:42,268 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6182#true} {6182#true} #52#return; {6182#true} is VALID [2022-04-28 07:43:42,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {6182#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:42,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {6220#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:42,268 INFO L272 TraceCheckUtils]: 13: Hoare triple {6220#(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)); {6182#true} is VALID [2022-04-28 07:43:42,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-28 07:43:42,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-28 07:43:42,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-28 07:43:42,269 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6182#true} {6220#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:42,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {6220#(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; {6242#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:42,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {6242#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {6242#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:42,270 INFO L272 TraceCheckUtils]: 20: Hoare triple {6242#(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)); {6182#true} is VALID [2022-04-28 07:43:42,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-28 07:43:42,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-28 07:43:42,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-28 07:43:42,271 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6182#true} {6242#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {6242#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:42,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {6242#(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; {6264#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:43:42,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {6264#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {6264#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:43:42,271 INFO L272 TraceCheckUtils]: 27: Hoare triple {6264#(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)); {6182#true} is VALID [2022-04-28 07:43:42,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-28 07:43:42,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-28 07:43:42,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-28 07:43:42,272 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6182#true} {6264#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #54#return; {6264#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:43:42,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {6264#(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; {6286#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:42,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {6286#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {6286#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:42,273 INFO L272 TraceCheckUtils]: 34: Hoare triple {6286#(and (= main_~y~0 3) (= (+ (- 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)); {6182#true} is VALID [2022-04-28 07:43:42,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-28 07:43:42,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-28 07:43:42,273 INFO L290 TraceCheckUtils]: 37: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-28 07:43:42,274 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6182#true} {6286#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {6286#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:42,274 INFO L290 TraceCheckUtils]: 39: Hoare triple {6286#(and (= main_~y~0 3) (= (+ (- 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; {6308#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 07:43:42,274 INFO L290 TraceCheckUtils]: 40: Hoare triple {6308#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !false; {6308#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 07:43:42,275 INFO L272 TraceCheckUtils]: 41: Hoare triple {6308#(and (= 2 (+ (- 2) main_~c~0)) (= 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)); {6182#true} is VALID [2022-04-28 07:43:42,275 INFO L290 TraceCheckUtils]: 42: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-28 07:43:42,275 INFO L290 TraceCheckUtils]: 43: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-28 07:43:42,275 INFO L290 TraceCheckUtils]: 44: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-28 07:43:42,275 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6182#true} {6308#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #54#return; {6308#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 07:43:42,276 INFO L290 TraceCheckUtils]: 46: Hoare triple {6308#(and (= 2 (+ (- 2) main_~c~0)) (= 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; {6330#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:43:42,276 INFO L290 TraceCheckUtils]: 47: Hoare triple {6330#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} assume !false; {6330#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:43:42,276 INFO L272 TraceCheckUtils]: 48: Hoare triple {6330#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 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)); {6182#true} is VALID [2022-04-28 07:43:42,276 INFO L290 TraceCheckUtils]: 49: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-28 07:43:42,276 INFO L290 TraceCheckUtils]: 50: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-28 07:43:42,276 INFO L290 TraceCheckUtils]: 51: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-28 07:43:42,277 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6182#true} {6330#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} #54#return; {6330#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:43:42,277 INFO L290 TraceCheckUtils]: 53: Hoare triple {6330#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 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; {6352#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:43:42,277 INFO L290 TraceCheckUtils]: 54: Hoare triple {6352#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {6352#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:43:42,278 INFO L272 TraceCheckUtils]: 55: Hoare triple {6352#(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)); {6182#true} is VALID [2022-04-28 07:43:42,278 INFO L290 TraceCheckUtils]: 56: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-28 07:43:42,278 INFO L290 TraceCheckUtils]: 57: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-28 07:43:42,278 INFO L290 TraceCheckUtils]: 58: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-28 07:43:42,279 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6182#true} {6352#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {6352#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:43:42,280 INFO L290 TraceCheckUtils]: 60: Hoare triple {6352#(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; {6374#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:42,280 INFO L290 TraceCheckUtils]: 61: Hoare triple {6374#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {6374#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:42,280 INFO L272 TraceCheckUtils]: 62: Hoare triple {6374#(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)); {6182#true} is VALID [2022-04-28 07:43:42,281 INFO L290 TraceCheckUtils]: 63: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-28 07:43:42,281 INFO L290 TraceCheckUtils]: 64: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-28 07:43:42,281 INFO L290 TraceCheckUtils]: 65: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-28 07:43:42,281 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6182#true} {6374#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #54#return; {6374#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:42,282 INFO L290 TraceCheckUtils]: 67: Hoare triple {6374#(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; {6396#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:43:42,282 INFO L290 TraceCheckUtils]: 68: Hoare triple {6396#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {6396#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:43:42,283 INFO L272 TraceCheckUtils]: 69: Hoare triple {6396#(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)); {6182#true} is VALID [2022-04-28 07:43:42,283 INFO L290 TraceCheckUtils]: 70: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-28 07:43:42,283 INFO L290 TraceCheckUtils]: 71: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-28 07:43:42,283 INFO L290 TraceCheckUtils]: 72: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-28 07:43:42,283 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6182#true} {6396#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #54#return; {6396#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:43:42,284 INFO L290 TraceCheckUtils]: 74: Hoare triple {6396#(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; {6418#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:43:42,284 INFO L290 TraceCheckUtils]: 75: Hoare triple {6418#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {6418#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:43:42,284 INFO L272 TraceCheckUtils]: 76: Hoare triple {6418#(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)); {6182#true} is VALID [2022-04-28 07:43:42,285 INFO L290 TraceCheckUtils]: 77: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-28 07:43:42,285 INFO L290 TraceCheckUtils]: 78: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-28 07:43:42,285 INFO L290 TraceCheckUtils]: 79: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-28 07:43:42,285 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6182#true} {6418#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {6418#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:43:42,286 INFO L290 TraceCheckUtils]: 81: Hoare triple {6418#(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; {6440#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:43:42,286 INFO L290 TraceCheckUtils]: 82: Hoare triple {6440#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {6440#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:43:42,286 INFO L272 TraceCheckUtils]: 83: Hoare triple {6440#(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)); {6182#true} is VALID [2022-04-28 07:43:42,287 INFO L290 TraceCheckUtils]: 84: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-28 07:43:42,287 INFO L290 TraceCheckUtils]: 85: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-28 07:43:42,287 INFO L290 TraceCheckUtils]: 86: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-28 07:43:42,287 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {6182#true} {6440#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {6440#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:43:42,288 INFO L290 TraceCheckUtils]: 88: Hoare triple {6440#(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; {6462#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-28 07:43:42,288 INFO L290 TraceCheckUtils]: 89: Hoare triple {6462#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !false; {6462#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-28 07:43:42,288 INFO L272 TraceCheckUtils]: 90: Hoare triple {6462#(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)); {6182#true} is VALID [2022-04-28 07:43:42,289 INFO L290 TraceCheckUtils]: 91: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-28 07:43:42,289 INFO L290 TraceCheckUtils]: 92: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-28 07:43:42,289 INFO L290 TraceCheckUtils]: 93: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-28 07:43:42,289 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6182#true} {6462#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} #54#return; {6462#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-28 07:43:42,290 INFO L290 TraceCheckUtils]: 95: Hoare triple {6462#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !(~c~0 < ~k~0); {6484#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} is VALID [2022-04-28 07:43:42,291 INFO L272 TraceCheckUtils]: 96: Hoare triple {6484#(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)); {6488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:42,291 INFO L290 TraceCheckUtils]: 97: Hoare triple {6488#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:42,291 INFO L290 TraceCheckUtils]: 98: Hoare triple {6492#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6183#false} is VALID [2022-04-28 07:43:42,292 INFO L290 TraceCheckUtils]: 99: Hoare triple {6183#false} assume !false; {6183#false} is VALID [2022-04-28 07:43:42,292 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-28 07:43:42,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:42,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:42,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409382999] [2022-04-28 07:43:42,548 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:42,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334605668] [2022-04-28 07:43:42,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334605668] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:42,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:42,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-28 07:43:42,548 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:42,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [114860772] [2022-04-28 07:43:42,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [114860772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:42,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:42,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 07:43:42,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682925676] [2022-04-28 07:43:42,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:42,549 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-28 07:43:42,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:42,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 07:43:42,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:42,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 07:43:42,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:42,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 07:43:42,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:43:42,597 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 07:43:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:43,842 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-28 07:43:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 07:43:43,842 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-28 07:43:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 07:43:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-28 07:43:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 07:43:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-28 07:43:43,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 76 transitions. [2022-04-28 07:43:43,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:43,910 INFO L225 Difference]: With dead ends: 69 [2022-04-28 07:43:43,910 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 07:43:43,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 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-28 07:43:43,911 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:43,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 485 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 07:43:43,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 07:43:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-28 07:43:43,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:43,960 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), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:43:43,960 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), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:43:43,960 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), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:43:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:43,962 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-28 07:43:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-28 07:43:43,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:43,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:43,964 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), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 64 states. [2022-04-28 07:43:43,964 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), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 64 states. [2022-04-28 07:43:43,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:43,966 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-28 07:43:43,966 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-28 07:43:43,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:43,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:43,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:43,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:43,967 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), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:43:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-04-28 07:43:43,969 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 100 [2022-04-28 07:43:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:43,969 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-04-28 07:43:43,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 07:43:43,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 75 transitions. [2022-04-28 07:43:44,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-28 07:43:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 07:43:44,536 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:44,536 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:44,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:44,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 07:43:44,743 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:44,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:44,743 INFO L85 PathProgramCache]: Analyzing trace with hash 893158889, now seen corresponding path program 23 times [2022-04-28 07:43:44,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:44,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [825099340] [2022-04-28 07:43:44,818 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:44,818 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:44,818 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:44,818 INFO L85 PathProgramCache]: Analyzing trace with hash 893158889, now seen corresponding path program 24 times [2022-04-28 07:43:44,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:44,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755702277] [2022-04-28 07:43:44,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:44,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:44,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:44,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [500084092] [2022-04-28 07:43:44,840 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:43:44,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:44,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:44,841 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:44,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 07:43:45,081 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 07:43:45,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:45,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-28 07:43:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:45,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:46,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {6938#true} call ULTIMATE.init(); {6938#true} is VALID [2022-04-28 07:43:46,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {6938#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); {6938#true} is VALID [2022-04-28 07:43:46,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-28 07:43:46,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6938#true} {6938#true} #60#return; {6938#true} is VALID [2022-04-28 07:43:46,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {6938#true} call #t~ret5 := main(); {6938#true} is VALID [2022-04-28 07:43:46,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {6938#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; {6938#true} is VALID [2022-04-28 07:43:46,011 INFO L272 TraceCheckUtils]: 6: Hoare triple {6938#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {6938#true} is VALID [2022-04-28 07:43:46,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-28 07:43:46,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-28 07:43:46,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-28 07:43:46,012 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6938#true} {6938#true} #52#return; {6938#true} is VALID [2022-04-28 07:43:46,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {6938#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6976#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:46,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {6976#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6976#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:46,012 INFO L272 TraceCheckUtils]: 13: Hoare triple {6976#(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)); {6938#true} is VALID [2022-04-28 07:43:46,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-28 07:43:46,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-28 07:43:46,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-28 07:43:46,013 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6938#true} {6976#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {6976#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:46,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {6976#(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; {6998#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:46,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {6998#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {6998#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:46,014 INFO L272 TraceCheckUtils]: 20: Hoare triple {6998#(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)); {6938#true} is VALID [2022-04-28 07:43:46,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-28 07:43:46,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-28 07:43:46,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-28 07:43:46,014 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6938#true} {6998#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {6998#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:46,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {6998#(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; {7020#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:43:46,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {7020#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {7020#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:43:46,019 INFO L272 TraceCheckUtils]: 27: Hoare triple {7020#(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)); {6938#true} is VALID [2022-04-28 07:43:46,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-28 07:43:46,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-28 07:43:46,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-28 07:43:46,020 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6938#true} {7020#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #54#return; {7020#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:43:46,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {7020#(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; {7042#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:43:46,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {7042#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {7042#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:43:46,021 INFO L272 TraceCheckUtils]: 34: Hoare triple {7042#(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)); {6938#true} is VALID [2022-04-28 07:43:46,022 INFO L290 TraceCheckUtils]: 35: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-28 07:43:46,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-28 07:43:46,022 INFO L290 TraceCheckUtils]: 37: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-28 07:43:46,022 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6938#true} {7042#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {7042#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:43:46,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {7042#(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; {7064#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-28 07:43:46,023 INFO L290 TraceCheckUtils]: 40: Hoare triple {7064#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} assume !false; {7064#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-28 07:43:46,024 INFO L272 TraceCheckUtils]: 41: Hoare triple {7064#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 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)); {6938#true} is VALID [2022-04-28 07:43:46,024 INFO L290 TraceCheckUtils]: 42: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-28 07:43:46,024 INFO L290 TraceCheckUtils]: 43: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-28 07:43:46,024 INFO L290 TraceCheckUtils]: 44: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-28 07:43:46,025 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6938#true} {7064#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} #54#return; {7064#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-28 07:43:46,025 INFO L290 TraceCheckUtils]: 46: Hoare triple {7064#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 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; {7086#(and (= (+ main_~y~0 (- 4)) 1) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:46,026 INFO L290 TraceCheckUtils]: 47: Hoare triple {7086#(and (= (+ main_~y~0 (- 4)) 1) (= 3 (+ (- 2) main_~c~0)))} assume !false; {7086#(and (= (+ main_~y~0 (- 4)) 1) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:46,026 INFO L272 TraceCheckUtils]: 48: Hoare triple {7086#(and (= (+ main_~y~0 (- 4)) 1) (= 3 (+ (- 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)); {6938#true} is VALID [2022-04-28 07:43:46,026 INFO L290 TraceCheckUtils]: 49: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-28 07:43:46,026 INFO L290 TraceCheckUtils]: 50: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-28 07:43:46,026 INFO L290 TraceCheckUtils]: 51: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-28 07:43:46,027 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6938#true} {7086#(and (= (+ main_~y~0 (- 4)) 1) (= 3 (+ (- 2) main_~c~0)))} #54#return; {7086#(and (= (+ main_~y~0 (- 4)) 1) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:46,027 INFO L290 TraceCheckUtils]: 53: Hoare triple {7086#(and (= (+ main_~y~0 (- 4)) 1) (= 3 (+ (- 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; {7108#(and (= main_~c~0 6) (< 5 main_~k~0) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-28 07:43:46,028 INFO L290 TraceCheckUtils]: 54: Hoare triple {7108#(and (= main_~c~0 6) (< 5 main_~k~0) (= (+ main_~y~0 (- 5)) 1))} assume !false; {7108#(and (= main_~c~0 6) (< 5 main_~k~0) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-28 07:43:46,028 INFO L272 TraceCheckUtils]: 55: Hoare triple {7108#(and (= main_~c~0 6) (< 5 main_~k~0) (= (+ 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)); {6938#true} is VALID [2022-04-28 07:43:46,028 INFO L290 TraceCheckUtils]: 56: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-28 07:43:46,028 INFO L290 TraceCheckUtils]: 57: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-28 07:43:46,028 INFO L290 TraceCheckUtils]: 58: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-28 07:43:46,029 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6938#true} {7108#(and (= main_~c~0 6) (< 5 main_~k~0) (= (+ main_~y~0 (- 5)) 1))} #54#return; {7108#(and (= main_~c~0 6) (< 5 main_~k~0) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-28 07:43:46,030 INFO L290 TraceCheckUtils]: 60: Hoare triple {7108#(and (= main_~c~0 6) (< 5 main_~k~0) (= (+ 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; {7130#(and (= 7 main_~c~0) (< 5 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 07:43:46,030 INFO L290 TraceCheckUtils]: 61: Hoare triple {7130#(and (= 7 main_~c~0) (< 5 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} assume !false; {7130#(and (= 7 main_~c~0) (< 5 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 07:43:46,030 INFO L272 TraceCheckUtils]: 62: Hoare triple {7130#(and (= 7 main_~c~0) (< 5 main_~k~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)); {6938#true} is VALID [2022-04-28 07:43:46,030 INFO L290 TraceCheckUtils]: 63: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-28 07:43:46,030 INFO L290 TraceCheckUtils]: 64: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-28 07:43:46,030 INFO L290 TraceCheckUtils]: 65: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-28 07:43:46,031 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6938#true} {7130#(and (= 7 main_~c~0) (< 5 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} #54#return; {7130#(and (= 7 main_~c~0) (< 5 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 07:43:46,032 INFO L290 TraceCheckUtils]: 67: Hoare triple {7130#(and (= 7 main_~c~0) (< 5 main_~k~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; {7152#(and (= (+ main_~y~0 (- 7)) 1) (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0))} is VALID [2022-04-28 07:43:46,032 INFO L290 TraceCheckUtils]: 68: Hoare triple {7152#(and (= (+ main_~y~0 (- 7)) 1) (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0))} assume !false; {7152#(and (= (+ main_~y~0 (- 7)) 1) (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0))} is VALID [2022-04-28 07:43:46,032 INFO L272 TraceCheckUtils]: 69: Hoare triple {7152#(and (= (+ main_~y~0 (- 7)) 1) (= 7 (+ (- 1) main_~c~0)) (< 5 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)); {6938#true} is VALID [2022-04-28 07:43:46,032 INFO L290 TraceCheckUtils]: 70: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-28 07:43:46,032 INFO L290 TraceCheckUtils]: 71: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-28 07:43:46,033 INFO L290 TraceCheckUtils]: 72: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-28 07:43:46,033 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6938#true} {7152#(and (= (+ main_~y~0 (- 7)) 1) (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0))} #54#return; {7152#(and (= (+ main_~y~0 (- 7)) 1) (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0))} is VALID [2022-04-28 07:43:46,034 INFO L290 TraceCheckUtils]: 74: Hoare triple {7152#(and (= (+ main_~y~0 (- 7)) 1) (= 7 (+ (- 1) main_~c~0)) (< 5 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; {7174#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-28 07:43:46,034 INFO L290 TraceCheckUtils]: 75: Hoare triple {7174#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} assume !false; {7174#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-28 07:43:46,034 INFO L272 TraceCheckUtils]: 76: Hoare triple {7174#(and (= main_~y~0 9) (< 5 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)); {6938#true} is VALID [2022-04-28 07:43:46,034 INFO L290 TraceCheckUtils]: 77: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-28 07:43:46,034 INFO L290 TraceCheckUtils]: 78: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-28 07:43:46,035 INFO L290 TraceCheckUtils]: 79: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-28 07:43:46,035 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6938#true} {7174#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} #54#return; {7174#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-28 07:43:46,036 INFO L290 TraceCheckUtils]: 81: Hoare triple {7174#(and (= main_~y~0 9) (< 5 main_~k~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; {7196#(and (= main_~y~0 10) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:43:46,036 INFO L290 TraceCheckUtils]: 82: Hoare triple {7196#(and (= main_~y~0 10) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} assume !false; {7196#(and (= main_~y~0 10) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:43:46,036 INFO L272 TraceCheckUtils]: 83: Hoare triple {7196#(and (= main_~y~0 10) (< 5 main_~k~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)); {6938#true} is VALID [2022-04-28 07:43:46,036 INFO L290 TraceCheckUtils]: 84: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-28 07:43:46,037 INFO L290 TraceCheckUtils]: 85: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-28 07:43:46,037 INFO L290 TraceCheckUtils]: 86: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-28 07:43:46,037 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {6938#true} {7196#(and (= main_~y~0 10) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} #54#return; {7196#(and (= main_~y~0 10) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:43:46,038 INFO L290 TraceCheckUtils]: 88: Hoare triple {7196#(and (= main_~y~0 10) (< 5 main_~k~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; {7218#(and (< 5 main_~k~0) (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-28 07:43:46,038 INFO L290 TraceCheckUtils]: 89: Hoare triple {7218#(and (< 5 main_~k~0) (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {7218#(and (< 5 main_~k~0) (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-28 07:43:46,038 INFO L272 TraceCheckUtils]: 90: Hoare triple {7218#(and (< 5 main_~k~0) (= 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)); {6938#true} is VALID [2022-04-28 07:43:46,039 INFO L290 TraceCheckUtils]: 91: Hoare triple {6938#true} ~cond := #in~cond; {7228#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:46,039 INFO L290 TraceCheckUtils]: 92: Hoare triple {7228#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:43:46,040 INFO L290 TraceCheckUtils]: 93: Hoare triple {7232#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:43:46,041 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7232#(not (= |__VERIFIER_assert_#in~cond| 0))} {7218#(and (< 5 main_~k~0) (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #54#return; {7239#(and (< 5 main_~k~0) (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11) (= (+ (* 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-28 07:43:46,042 INFO L290 TraceCheckUtils]: 95: Hoare triple {7239#(and (< 5 main_~k~0) (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11) (= (+ (* 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; {7243#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 11 main_~k~0))} is VALID [2022-04-28 07:43:46,043 INFO L290 TraceCheckUtils]: 96: Hoare triple {7243#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 11 main_~k~0))} assume !false; {7243#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 11 main_~k~0))} is VALID [2022-04-28 07:43:46,043 INFO L272 TraceCheckUtils]: 97: Hoare triple {7243#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 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)); {6938#true} is VALID [2022-04-28 07:43:46,043 INFO L290 TraceCheckUtils]: 98: Hoare triple {6938#true} ~cond := #in~cond; {7228#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:46,044 INFO L290 TraceCheckUtils]: 99: Hoare triple {7228#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:43:46,044 INFO L290 TraceCheckUtils]: 100: Hoare triple {7232#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:43:46,045 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {7232#(not (= |__VERIFIER_assert_#in~cond| 0))} {7243#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 11 main_~k~0))} #54#return; {7262#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 07:43:46,045 INFO L290 TraceCheckUtils]: 102: Hoare triple {7262#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {7266#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-28 07:43:46,046 INFO L272 TraceCheckUtils]: 103: Hoare triple {7266#(and (= main_~y~0 12) (< 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)); {7270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:46,047 INFO L290 TraceCheckUtils]: 104: Hoare triple {7270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:46,047 INFO L290 TraceCheckUtils]: 105: Hoare triple {7274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6939#false} is VALID [2022-04-28 07:43:46,047 INFO L290 TraceCheckUtils]: 106: Hoare triple {6939#false} assume !false; {6939#false} is VALID [2022-04-28 07:43:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 90 proven. 236 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-04-28 07:43:46,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:45:10,382 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 c_main_~y~0))) (or (= (+ (* 2 c_main_~y~0) (* .cse0 .cse0) 5) (+ c_main_~k~0 (* .cse0 c_main_~k~0))) (<= c_main_~k~0 (+ 2 c_main_~c~0)) (not (= (mod (+ (* 6 .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 13)) 4) 0)) (< (+ 3 c_main_~c~0) c_main_~k~0))) is different from false [2022-04-28 07:45:18,481 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 c_main_~y~0))) (or (= (+ (* 2 c_main_~y~0) 7 (* .cse0 .cse0)) (+ (* .cse0 c_main_~k~0) c_main_~k~0)) (< (+ c_main_~c~0 4) c_main_~k~0) (not (= (mod (+ (* .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 13) (* .cse0 .cse0 .cse0 6)) 4) 0)) (<= c_main_~k~0 (+ 3 c_main_~c~0)))) is different from false [2022-04-28 07:46:11,813 WARN L833 $PredicateComparison]: unable to prove that (or (not (= (mod (let ((.cse0 (+ 6 c_main_~y~0))) (+ (* .cse0 .cse0 .cse0 6) (* .cse0 .cse0 13) (* .cse0 .cse0 .cse0 .cse0))) 4) 0)) (forall ((main_~k~0 Int)) (or (<= main_~k~0 (+ 6 c_main_~c~0)) (< (+ 7 c_main_~c~0) main_~k~0) (= (+ (* 7 main_~k~0) (* main_~k~0 c_main_~y~0)) (+ (* 14 c_main_~y~0) 49 (* c_main_~y~0 c_main_~y~0)))))) is different from false [2022-04-28 07:46:13,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:46:13,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755702277] [2022-04-28 07:46:13,901 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:46:13,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500084092] [2022-04-28 07:46:13,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500084092] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:46:13,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:46:13,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-28 07:46:13,901 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:46:13,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [825099340] [2022-04-28 07:46:13,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [825099340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:46:13,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:46:13,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 07:46:13,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950448198] [2022-04-28 07:46:13,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:46:13,902 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 107 [2022-04-28 07:46:13,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:46:13,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 07:46:13,977 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-28 07:46:13,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 07:46:13,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:13,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 07:46:13,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=782, Unknown=8, NotChecked=180, Total=1122 [2022-04-28 07:46:13,979 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 07:46:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:16,608 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-28 07:46:16,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 07:46:16,608 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 107 [2022-04-28 07:46:16,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:46:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 07:46:16,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-28 07:46:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 07:46:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-28 07:46:16,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 80 transitions. [2022-04-28 07:46:16,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:16,711 INFO L225 Difference]: With dead ends: 72 [2022-04-28 07:46:16,711 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 07:46:16,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 93.0s TimeCoverageRelationStatistics Valid=173, Invalid=953, Unknown=8, NotChecked=198, Total=1332 [2022-04-28 07:46:16,712 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 8 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:46:16,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 515 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 07:46:16,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 07:46:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 07:46:16,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:46:16,779 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), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:46:16,779 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), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:46:16,779 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), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:46:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:16,781 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-28 07:46:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-28 07:46:16,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:16,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:16,782 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), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-28 07:46:16,782 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), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-28 07:46:16,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:16,784 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-28 07:46:16,784 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-28 07:46:16,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:16,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:16,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:46:16,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:46:16,784 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), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:46:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-04-28 07:46:16,786 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 107 [2022-04-28 07:46:16,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:46:16,786 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-04-28 07:46:16,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 07:46:16,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 79 transitions. [2022-04-28 07:46:17,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-28 07:46:17,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-28 07:46:17,396 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:46:17,397 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:46:17,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 07:46:17,599 WARN L477 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-28 07:46:17,599 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:46:17,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:46:17,600 INFO L85 PathProgramCache]: Analyzing trace with hash 363946760, now seen corresponding path program 25 times [2022-04-28 07:46:17,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:17,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1533307999] [2022-04-28 07:46:17,708 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:46:17,708 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:46:17,708 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:46:17,708 INFO L85 PathProgramCache]: Analyzing trace with hash 363946760, now seen corresponding path program 26 times [2022-04-28 07:46:17,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:46:17,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099003735] [2022-04-28 07:46:17,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:46:17,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:46:17,721 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:46:17,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1545639196] [2022-04-28 07:46:17,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:46:17,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:46:17,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:46:17,725 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:46:17,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 07:46:18,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:46:18,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:46:18,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 07:46:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:46:18,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:46:19,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {7875#true} call ULTIMATE.init(); {7875#true} is VALID [2022-04-28 07:46:19,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {7875#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); {7875#true} is VALID [2022-04-28 07:46:19,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-28 07:46:19,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7875#true} {7875#true} #60#return; {7875#true} is VALID [2022-04-28 07:46:19,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {7875#true} call #t~ret5 := main(); {7875#true} is VALID [2022-04-28 07:46:19,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {7875#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; {7875#true} is VALID [2022-04-28 07:46:19,227 INFO L272 TraceCheckUtils]: 6: Hoare triple {7875#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {7875#true} is VALID [2022-04-28 07:46:19,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-28 07:46:19,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-28 07:46:19,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-28 07:46:19,227 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7875#true} {7875#true} #52#return; {7875#true} is VALID [2022-04-28 07:46:19,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {7875#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7913#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:19,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {7913#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7913#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:19,228 INFO L272 TraceCheckUtils]: 13: Hoare triple {7913#(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)); {7875#true} is VALID [2022-04-28 07:46:19,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-28 07:46:19,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-28 07:46:19,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-28 07:46:19,229 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7875#true} {7913#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {7913#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:19,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {7913#(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; {7935#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:46:19,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {7935#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7935#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:46:19,230 INFO L272 TraceCheckUtils]: 20: Hoare triple {7935#(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)); {7875#true} is VALID [2022-04-28 07:46:19,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-28 07:46:19,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-28 07:46:19,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-28 07:46:19,231 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7875#true} {7935#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {7935#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:46:19,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {7935#(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; {7957#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:46:19,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {7957#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {7957#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:46:19,232 INFO L272 TraceCheckUtils]: 27: Hoare triple {7957#(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)); {7875#true} is VALID [2022-04-28 07:46:19,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-28 07:46:19,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-28 07:46:19,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-28 07:46:19,233 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7875#true} {7957#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {7957#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:46:19,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {7957#(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; {7979#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:46:19,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {7979#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {7979#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:46:19,234 INFO L272 TraceCheckUtils]: 34: Hoare triple {7979#(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)); {7875#true} is VALID [2022-04-28 07:46:19,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-28 07:46:19,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-28 07:46:19,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-28 07:46:19,235 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7875#true} {7979#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {7979#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:46:19,235 INFO L290 TraceCheckUtils]: 39: Hoare triple {7979#(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; {8001#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:46:19,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {8001#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {8001#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:46:19,236 INFO L272 TraceCheckUtils]: 41: Hoare triple {8001#(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)); {7875#true} is VALID [2022-04-28 07:46:19,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-28 07:46:19,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-28 07:46:19,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-28 07:46:19,237 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7875#true} {8001#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {8001#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:46:19,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {8001#(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; {8023#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:46:19,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {8023#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {8023#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:46:19,238 INFO L272 TraceCheckUtils]: 48: Hoare triple {8023#(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)); {7875#true} is VALID [2022-04-28 07:46:19,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-28 07:46:19,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-28 07:46:19,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-28 07:46:19,239 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7875#true} {8023#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {8023#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:46:19,240 INFO L290 TraceCheckUtils]: 53: Hoare triple {8023#(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; {8045#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:19,240 INFO L290 TraceCheckUtils]: 54: Hoare triple {8045#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {8045#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:19,240 INFO L272 TraceCheckUtils]: 55: Hoare triple {8045#(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)); {7875#true} is VALID [2022-04-28 07:46:19,240 INFO L290 TraceCheckUtils]: 56: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-28 07:46:19,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-28 07:46:19,240 INFO L290 TraceCheckUtils]: 58: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-28 07:46:19,241 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7875#true} {8045#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #54#return; {8045#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:19,242 INFO L290 TraceCheckUtils]: 60: Hoare triple {8045#(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; {8067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:19,242 INFO L290 TraceCheckUtils]: 61: Hoare triple {8067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {8067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:19,242 INFO L272 TraceCheckUtils]: 62: Hoare triple {8067#(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)); {7875#true} is VALID [2022-04-28 07:46:19,242 INFO L290 TraceCheckUtils]: 63: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-28 07:46:19,242 INFO L290 TraceCheckUtils]: 64: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-28 07:46:19,243 INFO L290 TraceCheckUtils]: 65: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-28 07:46:19,243 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7875#true} {8067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #54#return; {8067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:19,244 INFO L290 TraceCheckUtils]: 67: Hoare triple {8067#(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; {8089#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:46:19,244 INFO L290 TraceCheckUtils]: 68: Hoare triple {8089#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {8089#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:46:19,244 INFO L272 TraceCheckUtils]: 69: Hoare triple {8089#(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)); {7875#true} is VALID [2022-04-28 07:46:19,244 INFO L290 TraceCheckUtils]: 70: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-28 07:46:19,244 INFO L290 TraceCheckUtils]: 71: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-28 07:46:19,244 INFO L290 TraceCheckUtils]: 72: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-28 07:46:19,245 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7875#true} {8089#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {8089#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:46:19,246 INFO L290 TraceCheckUtils]: 74: Hoare triple {8089#(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; {8111#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:46:19,246 INFO L290 TraceCheckUtils]: 75: Hoare triple {8111#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {8111#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:46:19,246 INFO L272 TraceCheckUtils]: 76: Hoare triple {8111#(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)); {7875#true} is VALID [2022-04-28 07:46:19,246 INFO L290 TraceCheckUtils]: 77: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-28 07:46:19,246 INFO L290 TraceCheckUtils]: 78: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-28 07:46:19,246 INFO L290 TraceCheckUtils]: 79: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-28 07:46:19,247 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7875#true} {8111#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #54#return; {8111#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:46:19,247 INFO L290 TraceCheckUtils]: 81: Hoare triple {8111#(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; {8133#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:46:19,248 INFO L290 TraceCheckUtils]: 82: Hoare triple {8133#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {8133#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:46:19,248 INFO L272 TraceCheckUtils]: 83: Hoare triple {8133#(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)); {7875#true} is VALID [2022-04-28 07:46:19,248 INFO L290 TraceCheckUtils]: 84: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-28 07:46:19,248 INFO L290 TraceCheckUtils]: 85: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-28 07:46:19,248 INFO L290 TraceCheckUtils]: 86: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-28 07:46:19,249 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {7875#true} {8133#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {8133#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:46:19,249 INFO L290 TraceCheckUtils]: 88: Hoare triple {8133#(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; {8155#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:46:19,250 INFO L290 TraceCheckUtils]: 89: Hoare triple {8155#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {8155#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:46:19,250 INFO L272 TraceCheckUtils]: 90: Hoare triple {8155#(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)); {7875#true} is VALID [2022-04-28 07:46:19,250 INFO L290 TraceCheckUtils]: 91: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-28 07:46:19,250 INFO L290 TraceCheckUtils]: 92: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-28 07:46:19,250 INFO L290 TraceCheckUtils]: 93: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-28 07:46:19,251 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7875#true} {8155#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {8155#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:46:19,251 INFO L290 TraceCheckUtils]: 95: Hoare triple {8155#(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; {8177#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:46:19,252 INFO L290 TraceCheckUtils]: 96: Hoare triple {8177#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !false; {8177#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:46:19,252 INFO L272 TraceCheckUtils]: 97: Hoare triple {8177#(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)); {7875#true} is VALID [2022-04-28 07:46:19,252 INFO L290 TraceCheckUtils]: 98: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-28 07:46:19,252 INFO L290 TraceCheckUtils]: 99: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-28 07:46:19,252 INFO L290 TraceCheckUtils]: 100: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-28 07:46:19,253 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {7875#true} {8177#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #54#return; {8177#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:46:19,253 INFO L290 TraceCheckUtils]: 102: Hoare triple {8177#(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; {8199#(and (< 12 main_~k~0) (<= main_~c~0 13) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-28 07:46:19,254 INFO L290 TraceCheckUtils]: 103: Hoare triple {8199#(and (< 12 main_~k~0) (<= main_~c~0 13) (= (+ (- 2) main_~y~0) 11))} assume !false; {8199#(and (< 12 main_~k~0) (<= main_~c~0 13) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-28 07:46:19,254 INFO L272 TraceCheckUtils]: 104: Hoare triple {8199#(and (< 12 main_~k~0) (<= main_~c~0 13) (= (+ (- 2) 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)); {7875#true} is VALID [2022-04-28 07:46:19,254 INFO L290 TraceCheckUtils]: 105: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-28 07:46:19,254 INFO L290 TraceCheckUtils]: 106: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-28 07:46:19,254 INFO L290 TraceCheckUtils]: 107: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-28 07:46:19,255 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {7875#true} {8199#(and (< 12 main_~k~0) (<= main_~c~0 13) (= (+ (- 2) main_~y~0) 11))} #54#return; {8199#(and (< 12 main_~k~0) (<= main_~c~0 13) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-28 07:46:19,255 INFO L290 TraceCheckUtils]: 109: Hoare triple {8199#(and (< 12 main_~k~0) (<= main_~c~0 13) (= (+ (- 2) main_~y~0) 11))} assume !(~c~0 < ~k~0); {8221#(and (< 12 main_~k~0) (<= main_~k~0 13) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-28 07:46:19,256 INFO L272 TraceCheckUtils]: 110: Hoare triple {8221#(and (< 12 main_~k~0) (<= main_~k~0 13) (= (+ (- 2) main_~y~0) 11))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8225#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:46:19,256 INFO L290 TraceCheckUtils]: 111: Hoare triple {8225#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8229#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:46:19,257 INFO L290 TraceCheckUtils]: 112: Hoare triple {8229#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7876#false} is VALID [2022-04-28 07:46:19,257 INFO L290 TraceCheckUtils]: 113: Hoare triple {7876#false} assume !false; {7876#false} is VALID [2022-04-28 07:46:19,257 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-28 07:46:19,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:46:19,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:46:19,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099003735] [2022-04-28 07:46:19,560 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:46:19,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545639196] [2022-04-28 07:46:19,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545639196] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:46:19,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:46:19,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-28 07:46:19,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:46:19,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1533307999] [2022-04-28 07:46:19,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1533307999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:46:19,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:46:19,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 07:46:19,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077610478] [2022-04-28 07:46:19,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:46:19,562 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 114 [2022-04-28 07:46:19,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:46:19,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 07:46:19,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:19,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 07:46:19,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:19,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 07:46:19,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-28 07:46:19,628 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 07:46:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:22,029 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-04-28 07:46:22,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 07:46:22,030 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 114 [2022-04-28 07:46:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:46:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 07:46:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 84 transitions. [2022-04-28 07:46:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 07:46:22,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 84 transitions. [2022-04-28 07:46:22,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 84 transitions. [2022-04-28 07:46:22,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:22,122 INFO L225 Difference]: With dead ends: 75 [2022-04-28 07:46:22,122 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 07:46:22,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 105 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-28 07:46:22,123 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:46:22,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 583 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 07:46:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 07:46:22,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 07:46:22,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:46:22,192 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), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:46:22,193 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), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:46:22,193 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), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:46:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:22,195 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-28 07:46:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 07:46:22,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:22,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:22,196 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), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 70 states. [2022-04-28 07:46:22,196 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), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 70 states. [2022-04-28 07:46:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:22,198 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-28 07:46:22,198 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 07:46:22,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:22,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:22,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:46:22,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:46:22,199 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), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:46:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-04-28 07:46:22,200 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 114 [2022-04-28 07:46:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:46:22,201 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-04-28 07:46:22,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 07:46:22,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 83 transitions. [2022-04-28 07:46:22,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 07:46:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 07:46:22,814 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:46:22,814 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:46:22,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 07:46:23,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 07:46:23,020 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:46:23,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:46:23,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2101455607, now seen corresponding path program 27 times [2022-04-28 07:46:23,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:23,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1654734623] [2022-04-28 07:46:23,103 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:46:23,104 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:46:23,104 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:46:23,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2101455607, now seen corresponding path program 28 times [2022-04-28 07:46:23,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:46:23,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107830817] [2022-04-28 07:46:23,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:46:23,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:46:23,125 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:46:23,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [636357994] [2022-04-28 07:46:23,125 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:46:23,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:46:23,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:46:23,126 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:46:23,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 07:46:24,066 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:46:24,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:46:24,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-28 07:46:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:46:24,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:46:24,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {8711#true} call ULTIMATE.init(); {8711#true} is VALID [2022-04-28 07:46:24,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {8711#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); {8711#true} is VALID [2022-04-28 07:46:24,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8711#true} {8711#true} #60#return; {8711#true} is VALID [2022-04-28 07:46:24,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {8711#true} call #t~ret5 := main(); {8711#true} is VALID [2022-04-28 07:46:24,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {8711#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; {8711#true} is VALID [2022-04-28 07:46:24,826 INFO L272 TraceCheckUtils]: 6: Hoare triple {8711#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {8711#true} is VALID [2022-04-28 07:46:24,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-28 07:46:24,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-28 07:46:24,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,826 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8711#true} {8711#true} #52#return; {8711#true} is VALID [2022-04-28 07:46:24,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {8711#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8749#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:24,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {8749#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {8749#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:24,827 INFO L272 TraceCheckUtils]: 13: Hoare triple {8749#(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)); {8711#true} is VALID [2022-04-28 07:46:24,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-28 07:46:24,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-28 07:46:24,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,828 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8711#true} {8749#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {8749#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:24,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {8749#(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; {8771#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:46:24,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {8771#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {8771#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:46:24,829 INFO L272 TraceCheckUtils]: 20: Hoare triple {8771#(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)); {8711#true} is VALID [2022-04-28 07:46:24,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-28 07:46:24,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-28 07:46:24,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,830 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8711#true} {8771#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {8771#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:46:24,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {8771#(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; {8793#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:46:24,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {8793#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {8793#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:46:24,831 INFO L272 TraceCheckUtils]: 27: Hoare triple {8793#(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)); {8711#true} is VALID [2022-04-28 07:46:24,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-28 07:46:24,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-28 07:46:24,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,832 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8711#true} {8793#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {8793#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:46:24,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {8793#(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; {8815#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:46:24,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {8815#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {8815#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:46:24,833 INFO L272 TraceCheckUtils]: 34: Hoare triple {8815#(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)); {8711#true} is VALID [2022-04-28 07:46:24,833 INFO L290 TraceCheckUtils]: 35: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-28 07:46:24,833 INFO L290 TraceCheckUtils]: 36: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-28 07:46:24,833 INFO L290 TraceCheckUtils]: 37: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,834 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8711#true} {8815#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {8815#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:46:24,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {8815#(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; {8837#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:46:24,835 INFO L290 TraceCheckUtils]: 40: Hoare triple {8837#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {8837#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:46:24,835 INFO L272 TraceCheckUtils]: 41: Hoare triple {8837#(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)); {8711#true} is VALID [2022-04-28 07:46:24,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-28 07:46:24,835 INFO L290 TraceCheckUtils]: 43: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-28 07:46:24,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,836 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8711#true} {8837#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {8837#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:46:24,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {8837#(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; {8859#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:46:24,836 INFO L290 TraceCheckUtils]: 47: Hoare triple {8859#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {8859#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:46:24,837 INFO L272 TraceCheckUtils]: 48: Hoare triple {8859#(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)); {8711#true} is VALID [2022-04-28 07:46:24,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-28 07:46:24,837 INFO L290 TraceCheckUtils]: 50: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-28 07:46:24,837 INFO L290 TraceCheckUtils]: 51: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,837 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8711#true} {8859#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {8859#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:46:24,838 INFO L290 TraceCheckUtils]: 53: Hoare triple {8859#(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; {8881#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:46:24,838 INFO L290 TraceCheckUtils]: 54: Hoare triple {8881#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {8881#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:46:24,838 INFO L272 TraceCheckUtils]: 55: Hoare triple {8881#(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)); {8711#true} is VALID [2022-04-28 07:46:24,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-28 07:46:24,839 INFO L290 TraceCheckUtils]: 57: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-28 07:46:24,839 INFO L290 TraceCheckUtils]: 58: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,839 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8711#true} {8881#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {8881#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:46:24,840 INFO L290 TraceCheckUtils]: 60: Hoare triple {8881#(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; {8903#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:24,840 INFO L290 TraceCheckUtils]: 61: Hoare triple {8903#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !false; {8903#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:24,840 INFO L272 TraceCheckUtils]: 62: Hoare triple {8903#(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)); {8711#true} is VALID [2022-04-28 07:46:24,840 INFO L290 TraceCheckUtils]: 63: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-28 07:46:24,841 INFO L290 TraceCheckUtils]: 64: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-28 07:46:24,841 INFO L290 TraceCheckUtils]: 65: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,841 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8711#true} {8903#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} #54#return; {8903#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:24,842 INFO L290 TraceCheckUtils]: 67: Hoare triple {8903#(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; {8925#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:46:24,842 INFO L290 TraceCheckUtils]: 68: Hoare triple {8925#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {8925#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:46:24,842 INFO L272 TraceCheckUtils]: 69: Hoare triple {8925#(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)); {8711#true} is VALID [2022-04-28 07:46:24,842 INFO L290 TraceCheckUtils]: 70: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-28 07:46:24,842 INFO L290 TraceCheckUtils]: 71: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-28 07:46:24,843 INFO L290 TraceCheckUtils]: 72: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,843 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8711#true} {8925#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #54#return; {8925#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:46:24,844 INFO L290 TraceCheckUtils]: 74: Hoare triple {8925#(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; {8947#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:46:24,844 INFO L290 TraceCheckUtils]: 75: Hoare triple {8947#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {8947#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:46:24,844 INFO L272 TraceCheckUtils]: 76: Hoare triple {8947#(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)); {8711#true} is VALID [2022-04-28 07:46:24,844 INFO L290 TraceCheckUtils]: 77: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-28 07:46:24,844 INFO L290 TraceCheckUtils]: 78: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-28 07:46:24,844 INFO L290 TraceCheckUtils]: 79: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,845 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {8711#true} {8947#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #54#return; {8947#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:46:24,846 INFO L290 TraceCheckUtils]: 81: Hoare triple {8947#(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; {8969#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:46:24,846 INFO L290 TraceCheckUtils]: 82: Hoare triple {8969#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {8969#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:46:24,846 INFO L272 TraceCheckUtils]: 83: Hoare triple {8969#(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)); {8711#true} is VALID [2022-04-28 07:46:24,846 INFO L290 TraceCheckUtils]: 84: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-28 07:46:24,846 INFO L290 TraceCheckUtils]: 85: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-28 07:46:24,846 INFO L290 TraceCheckUtils]: 86: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,847 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {8711#true} {8969#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {8969#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:46:24,847 INFO L290 TraceCheckUtils]: 88: Hoare triple {8969#(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; {8991#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:46:24,848 INFO L290 TraceCheckUtils]: 89: Hoare triple {8991#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {8991#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:46:24,848 INFO L272 TraceCheckUtils]: 90: Hoare triple {8991#(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)); {8711#true} is VALID [2022-04-28 07:46:24,848 INFO L290 TraceCheckUtils]: 91: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-28 07:46:24,848 INFO L290 TraceCheckUtils]: 92: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-28 07:46:24,848 INFO L290 TraceCheckUtils]: 93: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,849 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8711#true} {8991#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {8991#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:46:24,849 INFO L290 TraceCheckUtils]: 95: Hoare triple {8991#(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; {9013#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:46:24,850 INFO L290 TraceCheckUtils]: 96: Hoare triple {9013#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {9013#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:46:24,850 INFO L272 TraceCheckUtils]: 97: Hoare triple {9013#(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)); {8711#true} is VALID [2022-04-28 07:46:24,850 INFO L290 TraceCheckUtils]: 98: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-28 07:46:24,850 INFO L290 TraceCheckUtils]: 99: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-28 07:46:24,850 INFO L290 TraceCheckUtils]: 100: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,851 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {8711#true} {9013#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #54#return; {9013#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:46:24,851 INFO L290 TraceCheckUtils]: 102: Hoare triple {9013#(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; {9035#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-28 07:46:24,852 INFO L290 TraceCheckUtils]: 103: Hoare triple {9035#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} assume !false; {9035#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-28 07:46:24,852 INFO L272 TraceCheckUtils]: 104: Hoare triple {9035#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) 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)); {8711#true} is VALID [2022-04-28 07:46:24,852 INFO L290 TraceCheckUtils]: 105: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-28 07:46:24,852 INFO L290 TraceCheckUtils]: 106: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-28 07:46:24,852 INFO L290 TraceCheckUtils]: 107: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,853 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {8711#true} {9035#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} #54#return; {9035#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-28 07:46:24,853 INFO L290 TraceCheckUtils]: 109: Hoare triple {9035#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) 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; {9057#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-28 07:46:24,853 INFO L290 TraceCheckUtils]: 110: Hoare triple {9057#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !false; {9057#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-28 07:46:24,854 INFO L272 TraceCheckUtils]: 111: Hoare triple {9057#(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)); {8711#true} is VALID [2022-04-28 07:46:24,854 INFO L290 TraceCheckUtils]: 112: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-28 07:46:24,854 INFO L290 TraceCheckUtils]: 113: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-28 07:46:24,854 INFO L290 TraceCheckUtils]: 114: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-28 07:46:24,854 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {8711#true} {9057#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} #54#return; {9057#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-28 07:46:24,856 INFO L290 TraceCheckUtils]: 116: Hoare triple {9057#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {9079#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-28 07:46:24,856 INFO L272 TraceCheckUtils]: 117: Hoare triple {9079#(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)); {9083#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:46:24,857 INFO L290 TraceCheckUtils]: 118: Hoare triple {9083#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9087#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:46:24,857 INFO L290 TraceCheckUtils]: 119: Hoare triple {9087#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8712#false} is VALID [2022-04-28 07:46:24,857 INFO L290 TraceCheckUtils]: 120: Hoare triple {8712#false} assume !false; {8712#false} is VALID [2022-04-28 07:46:24,858 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-28 07:46:24,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:46:25,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:46:25,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107830817] [2022-04-28 07:46:25,144 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:46:25,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636357994] [2022-04-28 07:46:25,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636357994] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:46:25,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:46:25,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-28 07:46:25,145 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:46:25,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1654734623] [2022-04-28 07:46:25,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1654734623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:46:25,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:46:25,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 07:46:25,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810990915] [2022-04-28 07:46:25,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:46:25,146 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) Word has length 121 [2022-04-28 07:46:25,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:46:25,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 07:46:25,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:25,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 07:46:25,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:25,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 07:46:25,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-28 07:46:25,222 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 07:46:27,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:27,504 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2022-04-28 07:46:27,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 07:46:27,505 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) Word has length 121 [2022-04-28 07:46:27,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:46:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 07:46:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-28 07:46:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 07:46:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-28 07:46:27,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 88 transitions. [2022-04-28 07:46:27,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:27,594 INFO L225 Difference]: With dead ends: 78 [2022-04-28 07:46:27,595 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 07:46:27,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 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-28 07:46:27,595 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:46:27,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 635 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 07:46:27,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 07:46:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-28 07:46:27,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:46:27,656 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), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 07:46:27,656 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), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 07:46:27,656 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), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 07:46:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:27,658 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-28 07:46:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-28 07:46:27,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:27,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:27,659 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), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-28 07:46:27,659 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), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-28 07:46:27,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:27,661 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-28 07:46:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-28 07:46:27,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:27,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:27,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:46:27,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:46:27,662 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), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 07:46:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2022-04-28 07:46:27,664 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 121 [2022-04-28 07:46:27,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:46:27,664 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2022-04-28 07:46:27,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 07:46:27,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 87 transitions. [2022-04-28 07:46:28,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-28 07:46:28,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-28 07:46:28,346 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:46:28,346 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:46:28,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 07:46:28,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 07:46:28,547 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:46:28,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:46:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash -729919512, now seen corresponding path program 29 times [2022-04-28 07:46:28,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:28,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [539166239] [2022-04-28 07:46:28,646 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:46:28,647 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:46:28,647 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:46:28,647 INFO L85 PathProgramCache]: Analyzing trace with hash -729919512, now seen corresponding path program 30 times [2022-04-28 07:46:28,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:46:28,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493481579] [2022-04-28 07:46:28,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:46:28,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:46:28,660 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:46:28,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1475989367] [2022-04-28 07:46:28,660 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:46:28,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:46:28,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:46:28,663 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:46:28,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 07:46:28,991 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 07:46:28,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:46:28,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-28 07:46:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:46:29,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:46:29,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {9587#true} call ULTIMATE.init(); {9587#true} is VALID [2022-04-28 07:46:29,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {9587#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); {9587#true} is VALID [2022-04-28 07:46:29,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9587#true} {9587#true} #60#return; {9587#true} is VALID [2022-04-28 07:46:29,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {9587#true} call #t~ret5 := main(); {9587#true} is VALID [2022-04-28 07:46:29,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {9587#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; {9587#true} is VALID [2022-04-28 07:46:29,729 INFO L272 TraceCheckUtils]: 6: Hoare triple {9587#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {9587#true} is VALID [2022-04-28 07:46:29,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,730 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9587#true} {9587#true} #52#return; {9587#true} is VALID [2022-04-28 07:46:29,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {9587#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9625#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:29,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {9625#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {9625#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:29,730 INFO L272 TraceCheckUtils]: 13: Hoare triple {9625#(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)); {9587#true} is VALID [2022-04-28 07:46:29,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,731 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9587#true} {9625#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {9625#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:29,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {9625#(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; {9647#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:46:29,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {9647#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {9647#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:46:29,732 INFO L272 TraceCheckUtils]: 20: Hoare triple {9647#(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)); {9587#true} is VALID [2022-04-28 07:46:29,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,733 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9587#true} {9647#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {9647#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:46:29,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {9647#(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; {9669#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:29,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {9669#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {9669#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:29,734 INFO L272 TraceCheckUtils]: 27: Hoare triple {9669#(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)); {9587#true} is VALID [2022-04-28 07:46:29,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,734 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9587#true} {9669#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {9669#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:29,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {9669#(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; {9691#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:46:29,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {9691#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !false; {9691#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:46:29,735 INFO L272 TraceCheckUtils]: 34: Hoare triple {9691#(and (= 2 (+ (- 1) main_~y~0)) (= (+ 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)); {9587#true} is VALID [2022-04-28 07:46:29,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,736 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9587#true} {9691#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #54#return; {9691#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:46:29,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {9691#(and (= 2 (+ (- 1) main_~y~0)) (= (+ 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; {9713#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:46:29,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {9713#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {9713#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:46:29,737 INFO L272 TraceCheckUtils]: 41: Hoare triple {9713#(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)); {9587#true} is VALID [2022-04-28 07:46:29,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,737 INFO L290 TraceCheckUtils]: 44: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,737 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9587#true} {9713#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {9713#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:46:29,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {9713#(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; {9735#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:46:29,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {9735#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} assume !false; {9735#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:46:29,738 INFO L272 TraceCheckUtils]: 48: Hoare triple {9735#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 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)); {9587#true} is VALID [2022-04-28 07:46:29,738 INFO L290 TraceCheckUtils]: 49: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,738 INFO L290 TraceCheckUtils]: 50: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,738 INFO L290 TraceCheckUtils]: 51: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,743 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9587#true} {9735#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} #54#return; {9735#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:46:29,744 INFO L290 TraceCheckUtils]: 53: Hoare triple {9735#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 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; {9757#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:29,745 INFO L290 TraceCheckUtils]: 54: Hoare triple {9757#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} assume !false; {9757#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:29,745 INFO L272 TraceCheckUtils]: 55: Hoare triple {9757#(and (= (+ main_~y~0 (- 4)) 2) (= 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)); {9587#true} is VALID [2022-04-28 07:46:29,745 INFO L290 TraceCheckUtils]: 56: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,745 INFO L290 TraceCheckUtils]: 57: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,745 INFO L290 TraceCheckUtils]: 58: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,746 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9587#true} {9757#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} #54#return; {9757#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:29,746 INFO L290 TraceCheckUtils]: 60: Hoare triple {9757#(and (= (+ main_~y~0 (- 4)) 2) (= 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; {9779#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:46:29,747 INFO L290 TraceCheckUtils]: 61: Hoare triple {9779#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {9779#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:46:29,747 INFO L272 TraceCheckUtils]: 62: Hoare triple {9779#(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)); {9587#true} is VALID [2022-04-28 07:46:29,747 INFO L290 TraceCheckUtils]: 63: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,747 INFO L290 TraceCheckUtils]: 64: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,747 INFO L290 TraceCheckUtils]: 65: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,748 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9587#true} {9779#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {9779#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:46:29,748 INFO L290 TraceCheckUtils]: 67: Hoare triple {9779#(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; {9801#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:46:29,749 INFO L290 TraceCheckUtils]: 68: Hoare triple {9801#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {9801#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:46:29,749 INFO L272 TraceCheckUtils]: 69: Hoare triple {9801#(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)); {9587#true} is VALID [2022-04-28 07:46:29,749 INFO L290 TraceCheckUtils]: 70: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,749 INFO L290 TraceCheckUtils]: 71: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,749 INFO L290 TraceCheckUtils]: 72: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,750 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9587#true} {9801#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {9801#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:46:29,750 INFO L290 TraceCheckUtils]: 74: Hoare triple {9801#(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; {9823#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:46:29,751 INFO L290 TraceCheckUtils]: 75: Hoare triple {9823#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {9823#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:46:29,751 INFO L272 TraceCheckUtils]: 76: Hoare triple {9823#(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)); {9587#true} is VALID [2022-04-28 07:46:29,751 INFO L290 TraceCheckUtils]: 77: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,751 INFO L290 TraceCheckUtils]: 78: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,751 INFO L290 TraceCheckUtils]: 79: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,752 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9587#true} {9823#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {9823#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:46:29,752 INFO L290 TraceCheckUtils]: 81: Hoare triple {9823#(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; {9845#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:46:29,753 INFO L290 TraceCheckUtils]: 82: Hoare triple {9845#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {9845#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:46:29,753 INFO L272 TraceCheckUtils]: 83: Hoare triple {9845#(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)); {9587#true} is VALID [2022-04-28 07:46:29,753 INFO L290 TraceCheckUtils]: 84: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,753 INFO L290 TraceCheckUtils]: 85: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,753 INFO L290 TraceCheckUtils]: 86: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,753 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {9587#true} {9845#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #54#return; {9845#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:46:29,754 INFO L290 TraceCheckUtils]: 88: Hoare triple {9845#(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; {9867#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:46:29,754 INFO L290 TraceCheckUtils]: 89: Hoare triple {9867#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} assume !false; {9867#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:46:29,755 INFO L272 TraceCheckUtils]: 90: Hoare triple {9867#(and (= main_~c~0 11) (= (+ (- 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)); {9587#true} is VALID [2022-04-28 07:46:29,755 INFO L290 TraceCheckUtils]: 91: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,755 INFO L290 TraceCheckUtils]: 92: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,755 INFO L290 TraceCheckUtils]: 93: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,755 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {9587#true} {9867#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} #54#return; {9867#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:46:29,756 INFO L290 TraceCheckUtils]: 95: Hoare triple {9867#(and (= main_~c~0 11) (= (+ (- 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; {9889#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:46:29,756 INFO L290 TraceCheckUtils]: 96: Hoare triple {9889#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {9889#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:46:29,756 INFO L272 TraceCheckUtils]: 97: Hoare triple {9889#(and (= main_~y~0 12) (= (+ (- 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)); {9587#true} is VALID [2022-04-28 07:46:29,757 INFO L290 TraceCheckUtils]: 98: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,757 INFO L290 TraceCheckUtils]: 99: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,757 INFO L290 TraceCheckUtils]: 100: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,757 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9587#true} {9889#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {9889#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:46:29,758 INFO L290 TraceCheckUtils]: 102: Hoare triple {9889#(and (= main_~y~0 12) (= (+ (- 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; {9911#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:46:29,758 INFO L290 TraceCheckUtils]: 103: Hoare triple {9911#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {9911#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:46:29,758 INFO L272 TraceCheckUtils]: 104: Hoare triple {9911#(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)); {9587#true} is VALID [2022-04-28 07:46:29,758 INFO L290 TraceCheckUtils]: 105: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,758 INFO L290 TraceCheckUtils]: 106: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,758 INFO L290 TraceCheckUtils]: 107: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,759 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9587#true} {9911#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {9911#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:46:29,759 INFO L290 TraceCheckUtils]: 109: Hoare triple {9911#(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; {9933#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:46:29,760 INFO L290 TraceCheckUtils]: 110: Hoare triple {9933#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} assume !false; {9933#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:46:29,760 INFO L272 TraceCheckUtils]: 111: Hoare triple {9933#(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)); {9587#true} is VALID [2022-04-28 07:46:29,760 INFO L290 TraceCheckUtils]: 112: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,760 INFO L290 TraceCheckUtils]: 113: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,760 INFO L290 TraceCheckUtils]: 114: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,760 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {9587#true} {9933#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} #54#return; {9933#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:46:29,761 INFO L290 TraceCheckUtils]: 116: Hoare triple {9933#(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; {9955#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} is VALID [2022-04-28 07:46:29,761 INFO L290 TraceCheckUtils]: 117: Hoare triple {9955#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} assume !false; {9955#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} is VALID [2022-04-28 07:46:29,761 INFO L272 TraceCheckUtils]: 118: Hoare triple {9955#(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)); {9587#true} is VALID [2022-04-28 07:46:29,761 INFO L290 TraceCheckUtils]: 119: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-28 07:46:29,761 INFO L290 TraceCheckUtils]: 120: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-28 07:46:29,761 INFO L290 TraceCheckUtils]: 121: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-28 07:46:29,762 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9587#true} {9955#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} #54#return; {9955#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} is VALID [2022-04-28 07:46:29,763 INFO L290 TraceCheckUtils]: 123: Hoare triple {9955#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} assume !(~c~0 < ~k~0); {9977#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~k~0 15))} is VALID [2022-04-28 07:46:29,763 INFO L272 TraceCheckUtils]: 124: Hoare triple {9977#(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)); {9981#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:46:29,764 INFO L290 TraceCheckUtils]: 125: Hoare triple {9981#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9985#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:46:29,764 INFO L290 TraceCheckUtils]: 126: Hoare triple {9985#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9588#false} is VALID [2022-04-28 07:46:29,764 INFO L290 TraceCheckUtils]: 127: Hoare triple {9588#false} assume !false; {9588#false} is VALID [2022-04-28 07:46:29,765 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-28 07:46:29,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:46:30,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:46:30,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493481579] [2022-04-28 07:46:30,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:46:30,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475989367] [2022-04-28 07:46:30,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475989367] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:46:30,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:46:30,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-28 07:46:30,079 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:46:30,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [539166239] [2022-04-28 07:46:30,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [539166239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:46:30,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:46:30,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 07:46:30,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158125687] [2022-04-28 07:46:30,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:46:30,080 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) Word has length 128 [2022-04-28 07:46:30,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:46:30,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 07:46:30,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:30,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 07:46:30,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:30,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 07:46:30,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-04-28 07:46:30,154 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 07:46:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:32,860 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2022-04-28 07:46:32,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 07:46:32,860 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) Word has length 128 [2022-04-28 07:46:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:46:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 07:46:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-28 07:46:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 07:46:32,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-28 07:46:32,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 92 transitions. [2022-04-28 07:46:32,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:32,973 INFO L225 Difference]: With dead ends: 81 [2022-04-28 07:46:32,973 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 07:46:32,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2022-04-28 07:46:32,974 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:46:32,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 689 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 07:46:32,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 07:46:33,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 07:46:33,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:46:33,037 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), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 07:46:33,037 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), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 07:46:33,037 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), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 07:46:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:33,039 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-28 07:46:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-28 07:46:33,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:33,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:33,040 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), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 76 states. [2022-04-28 07:46:33,040 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), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 76 states. [2022-04-28 07:46:33,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:33,042 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-28 07:46:33,042 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-28 07:46:33,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:33,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:33,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:46:33,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:46:33,043 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), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 07:46:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2022-04-28 07:46:33,045 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 128 [2022-04-28 07:46:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:46:33,045 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2022-04-28 07:46:33,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 07:46:33,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 91 transitions. [2022-04-28 07:46:33,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-28 07:46:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 07:46:33,635 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:46:33,635 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:46:33,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 07:46:33,835 WARN L477 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-28 07:46:33,836 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:46:33,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:46:33,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843369, now seen corresponding path program 31 times [2022-04-28 07:46:33,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:33,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [213568905] [2022-04-28 07:46:33,912 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:46:33,912 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:46:33,912 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:46:33,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843369, now seen corresponding path program 32 times [2022-04-28 07:46:33,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:46:33,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067993384] [2022-04-28 07:46:33,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:46:33,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:46:33,925 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:46:33,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [813950654] [2022-04-28 07:46:33,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:46:33,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:46:33,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:46:33,926 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:46:33,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 07:46:34,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:46:34,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:46:34,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-28 07:46:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:46:34,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:46:35,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {10503#true} call ULTIMATE.init(); {10503#true} is VALID [2022-04-28 07:46:35,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {10503#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); {10503#true} is VALID [2022-04-28 07:46:35,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10503#true} {10503#true} #60#return; {10503#true} is VALID [2022-04-28 07:46:35,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {10503#true} call #t~ret5 := main(); {10503#true} is VALID [2022-04-28 07:46:35,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {10503#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; {10503#true} is VALID [2022-04-28 07:46:35,563 INFO L272 TraceCheckUtils]: 6: Hoare triple {10503#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {10503#true} is VALID [2022-04-28 07:46:35,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,563 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10503#true} {10503#true} #52#return; {10503#true} is VALID [2022-04-28 07:46:35,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {10503#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10541#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:35,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {10541#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {10541#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:35,564 INFO L272 TraceCheckUtils]: 13: Hoare triple {10541#(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)); {10503#true} is VALID [2022-04-28 07:46:35,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,565 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10503#true} {10541#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {10541#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:35,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {10541#(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; {10563#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:46:35,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {10563#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {10563#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:46:35,566 INFO L272 TraceCheckUtils]: 20: Hoare triple {10563#(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)); {10503#true} is VALID [2022-04-28 07:46:35,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,566 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10503#true} {10563#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #54#return; {10563#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:46:35,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {10563#(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; {10585#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {10585#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} assume !false; {10585#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,567 INFO L272 TraceCheckUtils]: 27: Hoare triple {10585#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 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)); {10503#true} is VALID [2022-04-28 07:46:35,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,568 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10503#true} {10585#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} #54#return; {10585#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {10585#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 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; {10607#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {10607#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} assume !false; {10607#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,569 INFO L272 TraceCheckUtils]: 34: Hoare triple {10607#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 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)); {10503#true} is VALID [2022-04-28 07:46:35,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,569 INFO L290 TraceCheckUtils]: 36: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,569 INFO L290 TraceCheckUtils]: 37: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,569 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10503#true} {10607#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} #54#return; {10607#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,570 INFO L290 TraceCheckUtils]: 39: Hoare triple {10607#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 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; {10629#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,570 INFO L290 TraceCheckUtils]: 40: Hoare triple {10629#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4) (< 0 main_~k~0))} assume !false; {10629#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,570 INFO L272 TraceCheckUtils]: 41: Hoare triple {10629#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4) (< 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)); {10503#true} is VALID [2022-04-28 07:46:35,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,570 INFO L290 TraceCheckUtils]: 43: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,571 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10503#true} {10629#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4) (< 0 main_~k~0))} #54#return; {10629#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,571 INFO L290 TraceCheckUtils]: 46: Hoare triple {10629#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4) (< 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; {10651#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,572 INFO L290 TraceCheckUtils]: 47: Hoare triple {10651#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {10651#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,572 INFO L272 TraceCheckUtils]: 48: Hoare triple {10651#(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)); {10503#true} is VALID [2022-04-28 07:46:35,572 INFO L290 TraceCheckUtils]: 49: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,572 INFO L290 TraceCheckUtils]: 50: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,572 INFO L290 TraceCheckUtils]: 51: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,572 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10503#true} {10651#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} #54#return; {10651#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,573 INFO L290 TraceCheckUtils]: 53: Hoare triple {10651#(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; {10673#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {10673#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !false; {10673#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,573 INFO L272 TraceCheckUtils]: 55: Hoare triple {10673#(and (= main_~y~0 6) (= (+ (- 1) main_~c~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)); {10503#true} is VALID [2022-04-28 07:46:35,573 INFO L290 TraceCheckUtils]: 56: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,573 INFO L290 TraceCheckUtils]: 57: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,574 INFO L290 TraceCheckUtils]: 58: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,574 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10503#true} {10673#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #54#return; {10673#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,574 INFO L290 TraceCheckUtils]: 60: Hoare triple {10673#(and (= main_~y~0 6) (= (+ (- 1) main_~c~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; {10695#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,575 INFO L290 TraceCheckUtils]: 61: Hoare triple {10695#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {10695#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,575 INFO L272 TraceCheckUtils]: 62: Hoare triple {10695#(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)); {10503#true} is VALID [2022-04-28 07:46:35,575 INFO L290 TraceCheckUtils]: 63: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,575 INFO L290 TraceCheckUtils]: 64: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,575 INFO L290 TraceCheckUtils]: 65: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,576 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10503#true} {10695#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {10695#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,576 INFO L290 TraceCheckUtils]: 67: Hoare triple {10695#(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; {10717#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,576 INFO L290 TraceCheckUtils]: 68: Hoare triple {10717#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} assume !false; {10717#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,576 INFO L272 TraceCheckUtils]: 69: Hoare triple {10717#(and (= 7 (+ (- 1) 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)); {10503#true} is VALID [2022-04-28 07:46:35,577 INFO L290 TraceCheckUtils]: 70: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,577 INFO L290 TraceCheckUtils]: 71: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,577 INFO L290 TraceCheckUtils]: 72: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,577 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10503#true} {10717#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} #54#return; {10717#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,578 INFO L290 TraceCheckUtils]: 74: Hoare triple {10717#(and (= 7 (+ (- 1) 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; {10739#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,578 INFO L290 TraceCheckUtils]: 75: Hoare triple {10739#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {10739#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,578 INFO L272 TraceCheckUtils]: 76: Hoare triple {10739#(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)); {10503#true} is VALID [2022-04-28 07:46:35,578 INFO L290 TraceCheckUtils]: 77: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,578 INFO L290 TraceCheckUtils]: 78: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,578 INFO L290 TraceCheckUtils]: 79: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,579 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10503#true} {10739#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} #54#return; {10739#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,579 INFO L290 TraceCheckUtils]: 81: Hoare triple {10739#(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; {10761#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,580 INFO L290 TraceCheckUtils]: 82: Hoare triple {10761#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} assume !false; {10761#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,580 INFO L272 TraceCheckUtils]: 83: Hoare triple {10761#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) 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)); {10503#true} is VALID [2022-04-28 07:46:35,580 INFO L290 TraceCheckUtils]: 84: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,580 INFO L290 TraceCheckUtils]: 85: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,580 INFO L290 TraceCheckUtils]: 86: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,580 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {10503#true} {10761#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} #54#return; {10761#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,581 INFO L290 TraceCheckUtils]: 88: Hoare triple {10761#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) 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; {10783#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,581 INFO L290 TraceCheckUtils]: 89: Hoare triple {10783#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !false; {10783#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,581 INFO L272 TraceCheckUtils]: 90: Hoare triple {10783#(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)); {10503#true} is VALID [2022-04-28 07:46:35,581 INFO L290 TraceCheckUtils]: 91: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,582 INFO L290 TraceCheckUtils]: 92: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,582 INFO L290 TraceCheckUtils]: 93: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,583 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {10503#true} {10783#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} #54#return; {10783#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,584 INFO L290 TraceCheckUtils]: 95: Hoare triple {10783#(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; {10805#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,585 INFO L290 TraceCheckUtils]: 96: Hoare triple {10805#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} assume !false; {10805#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,585 INFO L272 TraceCheckUtils]: 97: Hoare triple {10805#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 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)); {10503#true} is VALID [2022-04-28 07:46:35,585 INFO L290 TraceCheckUtils]: 98: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,585 INFO L290 TraceCheckUtils]: 99: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,585 INFO L290 TraceCheckUtils]: 100: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,586 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10503#true} {10805#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} #54#return; {10805#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,586 INFO L290 TraceCheckUtils]: 102: Hoare triple {10805#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 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; {10827#(and (= 11 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-28 07:46:35,587 INFO L290 TraceCheckUtils]: 103: Hoare triple {10827#(and (= 11 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {10827#(and (= 11 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-28 07:46:35,587 INFO L272 TraceCheckUtils]: 104: Hoare triple {10827#(and (= 11 (+ (- 2) main_~c~0)) (< 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)); {10503#true} is VALID [2022-04-28 07:46:35,587 INFO L290 TraceCheckUtils]: 105: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,587 INFO L290 TraceCheckUtils]: 106: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,587 INFO L290 TraceCheckUtils]: 107: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,588 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {10503#true} {10827#(and (= 11 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= main_~y~0 13))} #54#return; {10827#(and (= 11 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-28 07:46:35,588 INFO L290 TraceCheckUtils]: 109: Hoare triple {10827#(and (= 11 (+ (- 2) main_~c~0)) (< 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; {10849#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,589 INFO L290 TraceCheckUtils]: 110: Hoare triple {10849#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} assume !false; {10849#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,589 INFO L272 TraceCheckUtils]: 111: Hoare triple {10849#(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)); {10503#true} is VALID [2022-04-28 07:46:35,589 INFO L290 TraceCheckUtils]: 112: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,589 INFO L290 TraceCheckUtils]: 113: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,589 INFO L290 TraceCheckUtils]: 114: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,590 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {10503#true} {10849#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} #54#return; {10849#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,590 INFO L290 TraceCheckUtils]: 116: Hoare triple {10849#(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; {10871#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,591 INFO L290 TraceCheckUtils]: 117: Hoare triple {10871#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} assume !false; {10871#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,591 INFO L272 TraceCheckUtils]: 118: Hoare triple {10871#(and (= main_~y~0 15) (= (+ (- 1) 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)); {10503#true} is VALID [2022-04-28 07:46:35,591 INFO L290 TraceCheckUtils]: 119: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,591 INFO L290 TraceCheckUtils]: 120: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,591 INFO L290 TraceCheckUtils]: 121: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,592 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {10503#true} {10871#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} #54#return; {10871#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:35,592 INFO L290 TraceCheckUtils]: 123: Hoare triple {10871#(and (= main_~y~0 15) (= (+ (- 1) 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; {10893#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-28 07:46:35,593 INFO L290 TraceCheckUtils]: 124: Hoare triple {10893#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !false; {10893#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-28 07:46:35,593 INFO L272 TraceCheckUtils]: 125: Hoare triple {10893#(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)); {10503#true} is VALID [2022-04-28 07:46:35,593 INFO L290 TraceCheckUtils]: 126: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-28 07:46:35,593 INFO L290 TraceCheckUtils]: 127: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-28 07:46:35,593 INFO L290 TraceCheckUtils]: 128: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-28 07:46:35,594 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {10503#true} {10893#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} #54#return; {10893#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-28 07:46:35,595 INFO L290 TraceCheckUtils]: 130: Hoare triple {10893#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !(~c~0 < ~k~0); {10915#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} is VALID [2022-04-28 07:46:35,596 INFO L272 TraceCheckUtils]: 131: Hoare triple {10915#(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)); {10919#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:46:35,596 INFO L290 TraceCheckUtils]: 132: Hoare triple {10919#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10923#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:46:35,596 INFO L290 TraceCheckUtils]: 133: Hoare triple {10923#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10504#false} is VALID [2022-04-28 07:46:35,597 INFO L290 TraceCheckUtils]: 134: Hoare triple {10504#false} assume !false; {10504#false} is VALID [2022-04-28 07:46:35,597 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-28 07:46:35,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:46:37,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:46:37,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067993384] [2022-04-28 07:46:37,410 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:46:37,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813950654] [2022-04-28 07:46:37,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813950654] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:46:37,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:46:37,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-28 07:46:37,410 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:46:37,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [213568905] [2022-04-28 07:46:37,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [213568905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:46:37,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:46:37,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 07:46:37,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160617111] [2022-04-28 07:46:37,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:46:37,411 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) Word has length 135 [2022-04-28 07:46:37,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:46:37,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 07:46:37,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:37,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 07:46:37,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:37,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 07:46:37,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1220, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 07:46:37,493 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 07:46:40,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:40,639 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-04-28 07:46:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 07:46:40,639 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) Word has length 135 [2022-04-28 07:46:40,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:46:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 07:46:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2022-04-28 07:46:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 07:46:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2022-04-28 07:46:40,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 96 transitions. [2022-04-28 07:46:40,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:40,786 INFO L225 Difference]: With dead ends: 84 [2022-04-28 07:46:40,786 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 07:46:40,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=350, Invalid=1372, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 07:46:40,787 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:46:40,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 730 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 07:46:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 07:46:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-28 07:46:40,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:46:40,888 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), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 07:46:40,888 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), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 07:46:40,888 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), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 07:46:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:40,890 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-28 07:46:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-28 07:46:40,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:40,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:40,891 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), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 79 states. [2022-04-28 07:46:40,891 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), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 79 states. [2022-04-28 07:46:40,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:40,893 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-28 07:46:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-28 07:46:40,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:40,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:40,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:46:40,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:46:40,894 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), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 07:46:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-28 07:46:40,896 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 135 [2022-04-28 07:46:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:46:40,896 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-28 07:46:40,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 07:46:40,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 95 transitions. [2022-04-28 07:46:41,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:41,552 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-28 07:46:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-04-28 07:46:41,553 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:46:41,553 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:46:41,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 07:46:41,760 WARN L477 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-28 07:46:41,760 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:46:41,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:46:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1539623736, now seen corresponding path program 33 times [2022-04-28 07:46:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:41,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [542491537] [2022-04-28 07:46:41,845 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:46:41,845 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:46:41,845 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:46:41,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1539623736, now seen corresponding path program 34 times [2022-04-28 07:46:41,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:46:41,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54833245] [2022-04-28 07:46:41,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:46:41,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:46:41,859 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:46:41,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1870621194] [2022-04-28 07:46:41,859 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:46:41,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:46:41,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:46:41,868 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:46:41,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 07:46:42,414 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:46:42,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:46:42,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-28 07:46:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:46:42,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:46:43,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {11789#true} call ULTIMATE.init(); {11789#true} is VALID [2022-04-28 07:46:43,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {11789#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); {11789#true} is VALID [2022-04-28 07:46:43,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11789#true} {11789#true} #60#return; {11789#true} is VALID [2022-04-28 07:46:43,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {11789#true} call #t~ret5 := main(); {11789#true} is VALID [2022-04-28 07:46:43,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {11789#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; {11789#true} is VALID [2022-04-28 07:46:43,231 INFO L272 TraceCheckUtils]: 6: Hoare triple {11789#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {11789#true} is VALID [2022-04-28 07:46:43,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,232 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11789#true} {11789#true} #52#return; {11789#true} is VALID [2022-04-28 07:46:43,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {11789#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11827#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:43,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {11827#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {11827#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:43,232 INFO L272 TraceCheckUtils]: 13: Hoare triple {11827#(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)); {11789#true} is VALID [2022-04-28 07:46:43,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,233 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11789#true} {11827#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {11827#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:43,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {11827#(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; {11849#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:46:43,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {11849#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {11849#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:46:43,234 INFO L272 TraceCheckUtils]: 20: Hoare triple {11849#(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)); {11789#true} is VALID [2022-04-28 07:46:43,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,234 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11789#true} {11849#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {11849#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:46:43,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {11849#(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; {11871#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:46:43,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {11871#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !false; {11871#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:46:43,235 INFO L272 TraceCheckUtils]: 27: Hoare triple {11871#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) 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)); {11789#true} is VALID [2022-04-28 07:46:43,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,236 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11789#true} {11871#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #54#return; {11871#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:46:43,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {11871#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) 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; {11893#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:46:43,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {11893#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {11893#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:46:43,237 INFO L272 TraceCheckUtils]: 34: Hoare triple {11893#(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)); {11789#true} is VALID [2022-04-28 07:46:43,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,237 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11789#true} {11893#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {11893#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:46:43,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {11893#(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; {11915#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:46:43,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {11915#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {11915#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:46:43,238 INFO L272 TraceCheckUtils]: 41: Hoare triple {11915#(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)); {11789#true} is VALID [2022-04-28 07:46:43,238 INFO L290 TraceCheckUtils]: 42: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,239 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11789#true} {11915#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {11915#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:46:43,239 INFO L290 TraceCheckUtils]: 46: Hoare triple {11915#(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; {11937#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:46:43,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {11937#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {11937#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:46:43,240 INFO L272 TraceCheckUtils]: 48: Hoare triple {11937#(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)); {11789#true} is VALID [2022-04-28 07:46:43,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,240 INFO L290 TraceCheckUtils]: 50: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,240 INFO L290 TraceCheckUtils]: 51: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,240 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11789#true} {11937#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #54#return; {11937#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:46:43,241 INFO L290 TraceCheckUtils]: 53: Hoare triple {11937#(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; {11959#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:46:43,241 INFO L290 TraceCheckUtils]: 54: Hoare triple {11959#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {11959#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:46:43,241 INFO L272 TraceCheckUtils]: 55: Hoare triple {11959#(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)); {11789#true} is VALID [2022-04-28 07:46:43,241 INFO L290 TraceCheckUtils]: 56: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,241 INFO L290 TraceCheckUtils]: 57: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,241 INFO L290 TraceCheckUtils]: 58: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,242 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11789#true} {11959#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {11959#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:46:43,242 INFO L290 TraceCheckUtils]: 60: Hoare triple {11959#(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; {11981#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:43,242 INFO L290 TraceCheckUtils]: 61: Hoare triple {11981#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {11981#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:43,243 INFO L272 TraceCheckUtils]: 62: Hoare triple {11981#(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)); {11789#true} is VALID [2022-04-28 07:46:43,243 INFO L290 TraceCheckUtils]: 63: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,243 INFO L290 TraceCheckUtils]: 64: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,243 INFO L290 TraceCheckUtils]: 65: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,243 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11789#true} {11981#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {11981#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:43,244 INFO L290 TraceCheckUtils]: 67: Hoare triple {11981#(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; {12003#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:46:43,244 INFO L290 TraceCheckUtils]: 68: Hoare triple {12003#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {12003#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:46:43,244 INFO L272 TraceCheckUtils]: 69: Hoare triple {12003#(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)); {11789#true} is VALID [2022-04-28 07:46:43,244 INFO L290 TraceCheckUtils]: 70: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,244 INFO L290 TraceCheckUtils]: 71: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,244 INFO L290 TraceCheckUtils]: 72: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,245 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11789#true} {12003#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #54#return; {12003#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:46:43,245 INFO L290 TraceCheckUtils]: 74: Hoare triple {12003#(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; {12025#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:46:43,245 INFO L290 TraceCheckUtils]: 75: Hoare triple {12025#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {12025#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:46:43,246 INFO L272 TraceCheckUtils]: 76: Hoare triple {12025#(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)); {11789#true} is VALID [2022-04-28 07:46:43,246 INFO L290 TraceCheckUtils]: 77: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,246 INFO L290 TraceCheckUtils]: 78: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,246 INFO L290 TraceCheckUtils]: 79: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,247 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {11789#true} {12025#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {12025#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:46:43,248 INFO L290 TraceCheckUtils]: 81: Hoare triple {12025#(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; {12047#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:46:43,248 INFO L290 TraceCheckUtils]: 82: Hoare triple {12047#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {12047#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:46:43,248 INFO L272 TraceCheckUtils]: 83: Hoare triple {12047#(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)); {11789#true} is VALID [2022-04-28 07:46:43,248 INFO L290 TraceCheckUtils]: 84: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,249 INFO L290 TraceCheckUtils]: 85: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,249 INFO L290 TraceCheckUtils]: 86: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,249 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {11789#true} {12047#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {12047#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:46:43,250 INFO L290 TraceCheckUtils]: 88: Hoare triple {12047#(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; {12069#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:46:43,250 INFO L290 TraceCheckUtils]: 89: Hoare triple {12069#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {12069#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:46:43,250 INFO L272 TraceCheckUtils]: 90: Hoare triple {12069#(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)); {11789#true} is VALID [2022-04-28 07:46:43,250 INFO L290 TraceCheckUtils]: 91: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,251 INFO L290 TraceCheckUtils]: 92: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,251 INFO L290 TraceCheckUtils]: 93: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,251 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {11789#true} {12069#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {12069#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:46:43,251 INFO L290 TraceCheckUtils]: 95: Hoare triple {12069#(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; {12091#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:46:43,252 INFO L290 TraceCheckUtils]: 96: Hoare triple {12091#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {12091#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:46:43,252 INFO L272 TraceCheckUtils]: 97: Hoare triple {12091#(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)); {11789#true} is VALID [2022-04-28 07:46:43,252 INFO L290 TraceCheckUtils]: 98: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,252 INFO L290 TraceCheckUtils]: 99: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,252 INFO L290 TraceCheckUtils]: 100: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,253 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11789#true} {12091#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #54#return; {12091#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:46:43,253 INFO L290 TraceCheckUtils]: 102: Hoare triple {12091#(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; {12113#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 07:46:43,253 INFO L290 TraceCheckUtils]: 103: Hoare triple {12113#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !false; {12113#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 07:46:43,253 INFO L272 TraceCheckUtils]: 104: Hoare triple {12113#(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)); {11789#true} is VALID [2022-04-28 07:46:43,253 INFO L290 TraceCheckUtils]: 105: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,254 INFO L290 TraceCheckUtils]: 106: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,254 INFO L290 TraceCheckUtils]: 107: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,254 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {11789#true} {12113#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #54#return; {12113#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 07:46:43,254 INFO L290 TraceCheckUtils]: 109: Hoare triple {12113#(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; {12135#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:46:43,255 INFO L290 TraceCheckUtils]: 110: Hoare triple {12135#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} assume !false; {12135#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:46:43,255 INFO L272 TraceCheckUtils]: 111: Hoare triple {12135#(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)); {11789#true} is VALID [2022-04-28 07:46:43,255 INFO L290 TraceCheckUtils]: 112: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,255 INFO L290 TraceCheckUtils]: 113: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,255 INFO L290 TraceCheckUtils]: 114: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,255 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {11789#true} {12135#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} #54#return; {12135#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:46:43,256 INFO L290 TraceCheckUtils]: 116: Hoare triple {12135#(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; {12157#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:43,256 INFO L290 TraceCheckUtils]: 117: Hoare triple {12157#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !false; {12157#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:43,256 INFO L272 TraceCheckUtils]: 118: Hoare triple {12157#(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)); {11789#true} is VALID [2022-04-28 07:46:43,256 INFO L290 TraceCheckUtils]: 119: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,257 INFO L290 TraceCheckUtils]: 120: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,257 INFO L290 TraceCheckUtils]: 121: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,257 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {11789#true} {12157#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} #54#return; {12157#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:43,257 INFO L290 TraceCheckUtils]: 123: Hoare triple {12157#(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; {12179#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:46:43,258 INFO L290 TraceCheckUtils]: 124: Hoare triple {12179#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {12179#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:46:43,258 INFO L272 TraceCheckUtils]: 125: Hoare triple {12179#(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)); {11789#true} is VALID [2022-04-28 07:46:43,258 INFO L290 TraceCheckUtils]: 126: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,258 INFO L290 TraceCheckUtils]: 127: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,258 INFO L290 TraceCheckUtils]: 128: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,258 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {11789#true} {12179#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {12179#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:46:43,259 INFO L290 TraceCheckUtils]: 130: Hoare triple {12179#(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; {12201#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-28 07:46:43,259 INFO L290 TraceCheckUtils]: 131: Hoare triple {12201#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} assume !false; {12201#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-28 07:46:43,259 INFO L272 TraceCheckUtils]: 132: Hoare triple {12201#(and (<= main_~c~0 17) (< 16 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)); {11789#true} is VALID [2022-04-28 07:46:43,259 INFO L290 TraceCheckUtils]: 133: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-28 07:46:43,259 INFO L290 TraceCheckUtils]: 134: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-28 07:46:43,260 INFO L290 TraceCheckUtils]: 135: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-28 07:46:43,260 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {11789#true} {12201#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} #54#return; {12201#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-28 07:46:43,261 INFO L290 TraceCheckUtils]: 137: Hoare triple {12201#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} assume !(~c~0 < ~k~0); {12223#(and (<= main_~k~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-28 07:46:43,262 INFO L272 TraceCheckUtils]: 138: Hoare triple {12223#(and (<= main_~k~0 17) (< 16 main_~k~0) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12227#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:46:43,263 INFO L290 TraceCheckUtils]: 139: Hoare triple {12227#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12231#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:46:43,263 INFO L290 TraceCheckUtils]: 140: Hoare triple {12231#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11790#false} is VALID [2022-04-28 07:46:43,263 INFO L290 TraceCheckUtils]: 141: Hoare triple {11790#false} assume !false; {11790#false} is VALID [2022-04-28 07:46:43,264 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-28 07:46:43,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:46:43,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:46:43,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54833245] [2022-04-28 07:46:43,612 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:46:43,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870621194] [2022-04-28 07:46:43,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870621194] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:46:43,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:46:43,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-28 07:46:43,612 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:46:43,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [542491537] [2022-04-28 07:46:43,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [542491537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:46:43,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:46:43,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 07:46:43,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84194947] [2022-04-28 07:46:43,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:46:43,613 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 142 [2022-04-28 07:46:43,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:46:43,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 07:46:43,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:43,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 07:46:43,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:43,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 07:46:43,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-28 07:46:43,704 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 07:46:47,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:47,196 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-04-28 07:46:47,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 07:46:47,196 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 142 [2022-04-28 07:46:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:46:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 07:46:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-28 07:46:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 07:46:47,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-28 07:46:47,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 100 transitions. [2022-04-28 07:46:47,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:47,345 INFO L225 Difference]: With dead ends: 87 [2022-04-28 07:46:47,346 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 07:46:47,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2022-04-28 07:46:47,346 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 07:46:47,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 803 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 07:46:47,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 07:46:47,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-28 07:46:47,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:46:47,440 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), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 07:46:47,440 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), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 07:46:47,440 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), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 07:46:47,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:47,442 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-28 07:46:47,442 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-28 07:46:47,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:47,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:47,443 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), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-28 07:46:47,443 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), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-28 07:46:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:47,445 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-28 07:46:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-28 07:46:47,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:47,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:47,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:46:47,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:46:47,446 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), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 07:46:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-04-28 07:46:47,448 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 142 [2022-04-28 07:46:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:46:47,449 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-04-28 07:46:47,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 07:46:47,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 99 transitions. [2022-04-28 07:46:48,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:48,221 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-28 07:46:48,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-28 07:46:48,222 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:46:48,222 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:46:48,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-28 07:46:48,422 WARN L477 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-28 07:46:48,422 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:46:48,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:46:48,423 INFO L85 PathProgramCache]: Analyzing trace with hash -157742263, now seen corresponding path program 35 times [2022-04-28 07:46:48,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:48,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1674616739] [2022-04-28 07:46:48,501 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:46:48,501 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:46:48,501 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:46:48,501 INFO L85 PathProgramCache]: Analyzing trace with hash -157742263, now seen corresponding path program 36 times [2022-04-28 07:46:48,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:46:48,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108831866] [2022-04-28 07:46:48,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:46:48,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:46:48,524 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:46:48,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206788817] [2022-04-28 07:46:48,524 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:46:48,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:46:48,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:46:48,525 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:46:48,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 07:46:51,676 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 07:46:51,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:46:51,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 81 conjunts are in the unsatisfiable core [2022-04-28 07:46:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:46:51,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:46:52,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {12785#true} call ULTIMATE.init(); {12785#true} is VALID [2022-04-28 07:46:52,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {12785#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); {12785#true} is VALID [2022-04-28 07:46:52,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12785#true} {12785#true} #60#return; {12785#true} is VALID [2022-04-28 07:46:52,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {12785#true} call #t~ret5 := main(); {12785#true} is VALID [2022-04-28 07:46:52,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {12785#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; {12785#true} is VALID [2022-04-28 07:46:52,681 INFO L272 TraceCheckUtils]: 6: Hoare triple {12785#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {12785#true} is VALID [2022-04-28 07:46:52,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,682 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12785#true} {12785#true} #52#return; {12785#true} is VALID [2022-04-28 07:46:52,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {12785#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:52,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {12823#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {12823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:52,682 INFO L272 TraceCheckUtils]: 13: Hoare triple {12823#(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)); {12785#true} is VALID [2022-04-28 07:46:52,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,683 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12785#true} {12823#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {12823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:52,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {12823#(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; {12845#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:46:52,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {12845#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {12845#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:46:52,684 INFO L272 TraceCheckUtils]: 20: Hoare triple {12845#(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)); {12785#true} is VALID [2022-04-28 07:46:52,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,685 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {12785#true} {12845#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {12845#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:46:52,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {12845#(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; {12867#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:46:52,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {12867#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {12867#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:46:52,685 INFO L272 TraceCheckUtils]: 27: Hoare triple {12867#(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)); {12785#true} is VALID [2022-04-28 07:46:52,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,686 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12785#true} {12867#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {12867#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:46:52,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {12867#(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; {12889#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:46:52,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {12889#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {12889#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:46:52,687 INFO L272 TraceCheckUtils]: 34: Hoare triple {12889#(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)); {12785#true} is VALID [2022-04-28 07:46:52,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,687 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12785#true} {12889#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {12889#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:46:52,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {12889#(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; {12911#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:46:52,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {12911#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {12911#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:46:52,688 INFO L272 TraceCheckUtils]: 41: Hoare triple {12911#(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)); {12785#true} is VALID [2022-04-28 07:46:52,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,689 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12785#true} {12911#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {12911#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:46:52,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {12911#(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; {12933#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:46:52,690 INFO L290 TraceCheckUtils]: 47: Hoare triple {12933#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !false; {12933#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:46:52,690 INFO L272 TraceCheckUtils]: 48: Hoare triple {12933#(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)); {12785#true} is VALID [2022-04-28 07:46:52,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,690 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12785#true} {12933#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #54#return; {12933#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:46:52,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {12933#(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; {12955#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:46:52,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {12955#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {12955#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:46:52,691 INFO L272 TraceCheckUtils]: 55: Hoare triple {12955#(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)); {12785#true} is VALID [2022-04-28 07:46:52,691 INFO L290 TraceCheckUtils]: 56: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,692 INFO L290 TraceCheckUtils]: 58: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,692 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12785#true} {12955#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {12955#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:46:52,693 INFO L290 TraceCheckUtils]: 60: Hoare triple {12955#(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; {12977#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:52,693 INFO L290 TraceCheckUtils]: 61: Hoare triple {12977#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {12977#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:52,693 INFO L272 TraceCheckUtils]: 62: Hoare triple {12977#(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)); {12785#true} is VALID [2022-04-28 07:46:52,693 INFO L290 TraceCheckUtils]: 63: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,693 INFO L290 TraceCheckUtils]: 64: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,694 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12785#true} {12977#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #54#return; {12977#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:52,694 INFO L290 TraceCheckUtils]: 67: Hoare triple {12977#(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; {12999#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:46:52,695 INFO L290 TraceCheckUtils]: 68: Hoare triple {12999#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {12999#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:46:52,695 INFO L272 TraceCheckUtils]: 69: Hoare triple {12999#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 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)); {12785#true} is VALID [2022-04-28 07:46:52,695 INFO L290 TraceCheckUtils]: 70: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,695 INFO L290 TraceCheckUtils]: 71: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,695 INFO L290 TraceCheckUtils]: 72: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,695 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12785#true} {12999#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {12999#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:46:52,697 INFO L290 TraceCheckUtils]: 74: Hoare triple {12999#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 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; {13021#(and (< 7 main_~k~0) (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:46:52,697 INFO L290 TraceCheckUtils]: 75: Hoare triple {13021#(and (< 7 main_~k~0) (= main_~y~0 9) (= main_~c~0 9))} assume !false; {13021#(and (< 7 main_~k~0) (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:46:52,697 INFO L272 TraceCheckUtils]: 76: Hoare triple {13021#(and (< 7 main_~k~0) (= 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)); {12785#true} is VALID [2022-04-28 07:46:52,698 INFO L290 TraceCheckUtils]: 77: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,698 INFO L290 TraceCheckUtils]: 78: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,698 INFO L290 TraceCheckUtils]: 79: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,698 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12785#true} {13021#(and (< 7 main_~k~0) (= main_~y~0 9) (= main_~c~0 9))} #54#return; {13021#(and (< 7 main_~k~0) (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:46:52,699 INFO L290 TraceCheckUtils]: 81: Hoare triple {13021#(and (< 7 main_~k~0) (= 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; {13043#(and (< 7 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:46:52,699 INFO L290 TraceCheckUtils]: 82: Hoare triple {13043#(and (< 7 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} assume !false; {13043#(and (< 7 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:46:52,699 INFO L272 TraceCheckUtils]: 83: Hoare triple {13043#(and (< 7 main_~k~0) (= 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)); {12785#true} is VALID [2022-04-28 07:46:52,699 INFO L290 TraceCheckUtils]: 84: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,699 INFO L290 TraceCheckUtils]: 85: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,699 INFO L290 TraceCheckUtils]: 86: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,700 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {12785#true} {13043#(and (< 7 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} #54#return; {13043#(and (< 7 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:46:52,700 INFO L290 TraceCheckUtils]: 88: Hoare triple {13043#(and (< 7 main_~k~0) (= 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; {13065#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:46:52,701 INFO L290 TraceCheckUtils]: 89: Hoare triple {13065#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !false; {13065#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:46:52,701 INFO L272 TraceCheckUtils]: 90: Hoare triple {13065#(and (< 7 main_~k~0) (= (+ (- 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)); {12785#true} is VALID [2022-04-28 07:46:52,701 INFO L290 TraceCheckUtils]: 91: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,701 INFO L290 TraceCheckUtils]: 92: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,701 INFO L290 TraceCheckUtils]: 93: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,701 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {12785#true} {13065#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} #54#return; {13065#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:46:52,702 INFO L290 TraceCheckUtils]: 95: Hoare triple {13065#(and (< 7 main_~k~0) (= (+ (- 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; {13087#(and (< 7 main_~k~0) (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:46:52,702 INFO L290 TraceCheckUtils]: 96: Hoare triple {13087#(and (< 7 main_~k~0) (= main_~y~0 12) (= main_~c~0 12))} assume !false; {13087#(and (< 7 main_~k~0) (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:46:52,702 INFO L272 TraceCheckUtils]: 97: Hoare triple {13087#(and (< 7 main_~k~0) (= 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)); {12785#true} is VALID [2022-04-28 07:46:52,702 INFO L290 TraceCheckUtils]: 98: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,702 INFO L290 TraceCheckUtils]: 99: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,702 INFO L290 TraceCheckUtils]: 100: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,703 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {12785#true} {13087#(and (< 7 main_~k~0) (= main_~y~0 12) (= main_~c~0 12))} #54#return; {13087#(and (< 7 main_~k~0) (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:46:52,703 INFO L290 TraceCheckUtils]: 102: Hoare triple {13087#(and (< 7 main_~k~0) (= 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; {13109#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-28 07:46:52,704 INFO L290 TraceCheckUtils]: 103: Hoare triple {13109#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {13109#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-28 07:46:52,704 INFO L272 TraceCheckUtils]: 104: Hoare triple {13109#(and (< 7 main_~k~0) (= (+ (- 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)); {12785#true} is VALID [2022-04-28 07:46:52,704 INFO L290 TraceCheckUtils]: 105: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,704 INFO L290 TraceCheckUtils]: 106: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,704 INFO L290 TraceCheckUtils]: 107: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,704 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {12785#true} {13109#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #54#return; {13109#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-28 07:46:52,705 INFO L290 TraceCheckUtils]: 109: Hoare triple {13109#(and (< 7 main_~k~0) (= (+ (- 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; {13131#(and (< 7 main_~k~0) (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:52,705 INFO L290 TraceCheckUtils]: 110: Hoare triple {13131#(and (< 7 main_~k~0) (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} assume !false; {13131#(and (< 7 main_~k~0) (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:52,705 INFO L272 TraceCheckUtils]: 111: Hoare triple {13131#(and (< 7 main_~k~0) (= main_~y~0 14) (= 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)); {12785#true} is VALID [2022-04-28 07:46:52,705 INFO L290 TraceCheckUtils]: 112: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,705 INFO L290 TraceCheckUtils]: 113: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,706 INFO L290 TraceCheckUtils]: 114: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,706 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {12785#true} {13131#(and (< 7 main_~k~0) (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} #54#return; {13131#(and (< 7 main_~k~0) (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:52,706 INFO L290 TraceCheckUtils]: 116: Hoare triple {13131#(and (< 7 main_~k~0) (= main_~y~0 14) (= 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; {13153#(and (< 7 main_~k~0) (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:52,707 INFO L290 TraceCheckUtils]: 117: Hoare triple {13153#(and (< 7 main_~k~0) (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {13153#(and (< 7 main_~k~0) (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:52,707 INFO L272 TraceCheckUtils]: 118: Hoare triple {13153#(and (< 7 main_~k~0) (= 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)); {12785#true} is VALID [2022-04-28 07:46:52,707 INFO L290 TraceCheckUtils]: 119: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,707 INFO L290 TraceCheckUtils]: 120: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,707 INFO L290 TraceCheckUtils]: 121: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,708 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12785#true} {13153#(and (< 7 main_~k~0) (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {13153#(and (< 7 main_~k~0) (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:52,708 INFO L290 TraceCheckUtils]: 123: Hoare triple {13153#(and (< 7 main_~k~0) (= 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; {13175#(and (< 7 main_~k~0) (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 07:46:52,708 INFO L290 TraceCheckUtils]: 124: Hoare triple {13175#(and (< 7 main_~k~0) (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !false; {13175#(and (< 7 main_~k~0) (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 07:46:52,708 INFO L272 TraceCheckUtils]: 125: Hoare triple {13175#(and (< 7 main_~k~0) (= 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)); {12785#true} is VALID [2022-04-28 07:46:52,708 INFO L290 TraceCheckUtils]: 126: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,709 INFO L290 TraceCheckUtils]: 127: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,709 INFO L290 TraceCheckUtils]: 128: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,709 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {12785#true} {13175#(and (< 7 main_~k~0) (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} #54#return; {13175#(and (< 7 main_~k~0) (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 07:46:52,709 INFO L290 TraceCheckUtils]: 130: Hoare triple {13175#(and (< 7 main_~k~0) (= 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; {13197#(and (< 7 main_~k~0) (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:52,710 INFO L290 TraceCheckUtils]: 131: Hoare triple {13197#(and (< 7 main_~k~0) (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} assume !false; {13197#(and (< 7 main_~k~0) (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:52,710 INFO L272 TraceCheckUtils]: 132: Hoare triple {13197#(and (< 7 main_~k~0) (= 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)); {12785#true} is VALID [2022-04-28 07:46:52,710 INFO L290 TraceCheckUtils]: 133: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,710 INFO L290 TraceCheckUtils]: 134: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,710 INFO L290 TraceCheckUtils]: 135: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,711 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {12785#true} {13197#(and (< 7 main_~k~0) (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} #54#return; {13197#(and (< 7 main_~k~0) (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:52,711 INFO L290 TraceCheckUtils]: 137: Hoare triple {13197#(and (< 7 main_~k~0) (= 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; {13219#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:46:52,711 INFO L290 TraceCheckUtils]: 138: Hoare triple {13219#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !false; {13219#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:46:52,711 INFO L272 TraceCheckUtils]: 139: Hoare triple {13219#(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)); {12785#true} is VALID [2022-04-28 07:46:52,712 INFO L290 TraceCheckUtils]: 140: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-28 07:46:52,712 INFO L290 TraceCheckUtils]: 141: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-28 07:46:52,712 INFO L290 TraceCheckUtils]: 142: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-28 07:46:52,712 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {12785#true} {13219#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} #54#return; {13219#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:46:52,713 INFO L290 TraceCheckUtils]: 144: Hoare triple {13219#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !(~c~0 < ~k~0); {13241#(and (< 17 main_~k~0) (<= main_~k~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:46:52,714 INFO L272 TraceCheckUtils]: 145: Hoare triple {13241#(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)); {13245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:46:52,714 INFO L290 TraceCheckUtils]: 146: Hoare triple {13245#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:46:52,715 INFO L290 TraceCheckUtils]: 147: Hoare triple {13249#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12786#false} is VALID [2022-04-28 07:46:52,715 INFO L290 TraceCheckUtils]: 148: Hoare triple {12786#false} assume !false; {12786#false} is VALID [2022-04-28 07:46:52,716 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-28 07:46:52,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:46:54,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:46:54,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108831866] [2022-04-28 07:46:54,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:46:54,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206788817] [2022-04-28 07:46:54,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206788817] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:46:54,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:46:54,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2022-04-28 07:46:54,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:46:54,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1674616739] [2022-04-28 07:46:54,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1674616739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:46:54,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:46:54,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 07:46:54,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505762229] [2022-04-28 07:46:54,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:46:54,123 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) Word has length 149 [2022-04-28 07:46:54,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:46:54,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 07:46:54,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:54,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 07:46:54,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:54,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 07:46:54,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1056, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 07:46:54,242 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 07:46:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:58,479 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2022-04-28 07:46:58,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 07:46:58,479 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) Word has length 149 [2022-04-28 07:46:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:46:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 07:46:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-28 07:46:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 07:46:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-28 07:46:58,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 104 transitions. [2022-04-28 07:46:58,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:58,616 INFO L225 Difference]: With dead ends: 90 [2022-04-28 07:46:58,616 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 07:46:58,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 07:46:58,628 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 07:46:58,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 853 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 07:46:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 07:46:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-28 07:46:58,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:46:58,731 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), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 07:46:58,731 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), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 07:46:58,731 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), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 07:46:58,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:58,733 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-28 07:46:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-28 07:46:58,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:58,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:58,734 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), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 85 states. [2022-04-28 07:46:58,734 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), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 85 states. [2022-04-28 07:46:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:58,737 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-28 07:46:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-28 07:46:58,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:58,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:58,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:46:58,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:46:58,738 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), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 07:46:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-04-28 07:46:58,740 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 149 [2022-04-28 07:46:58,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:46:58,740 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-04-28 07:46:58,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 07:46:58,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 103 transitions. [2022-04-28 07:46:59,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:46:59,501 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-28 07:46:59,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-28 07:46:59,502 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:46:59,502 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:46:59,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 07:46:59,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 07:46:59,710 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:46:59,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:46:59,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1167462824, now seen corresponding path program 37 times [2022-04-28 07:46:59,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:59,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [355063627] [2022-04-28 07:46:59,790 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:46:59,790 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:46:59,790 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:46:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1167462824, now seen corresponding path program 38 times [2022-04-28 07:46:59,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:46:59,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914575206] [2022-04-28 07:46:59,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:46:59,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:46:59,804 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:46:59,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1091635868] [2022-04-28 07:46:59,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:46:59,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:46:59,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:46:59,806 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:46:59,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 07:47:00,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:47:00,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:47:00,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-28 07:47:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:47:00,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:47:01,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {14041#true} call ULTIMATE.init(); {14041#true} is VALID [2022-04-28 07:47:01,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {14041#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); {14041#true} is VALID [2022-04-28 07:47:01,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14041#true} {14041#true} #60#return; {14041#true} is VALID [2022-04-28 07:47:01,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {14041#true} call #t~ret5 := main(); {14041#true} is VALID [2022-04-28 07:47:01,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {14041#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; {14041#true} is VALID [2022-04-28 07:47:01,489 INFO L272 TraceCheckUtils]: 6: Hoare triple {14041#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {14041#true} is VALID [2022-04-28 07:47:01,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,490 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14041#true} {14041#true} #52#return; {14041#true} is VALID [2022-04-28 07:47:01,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {14041#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {14079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:01,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {14079#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {14079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:01,490 INFO L272 TraceCheckUtils]: 13: Hoare triple {14079#(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)); {14041#true} is VALID [2022-04-28 07:47:01,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,491 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14041#true} {14079#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {14079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:01,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {14079#(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; {14101#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:47:01,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {14101#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {14101#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:47:01,492 INFO L272 TraceCheckUtils]: 20: Hoare triple {14101#(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)); {14041#true} is VALID [2022-04-28 07:47:01,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,493 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {14041#true} {14101#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #54#return; {14101#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:47:01,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {14101#(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; {14123#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {14123#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !false; {14123#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,493 INFO L272 TraceCheckUtils]: 27: Hoare triple {14123#(and (= main_~y~0 2) (= main_~c~0 2) (< 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)); {14041#true} is VALID [2022-04-28 07:47:01,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,494 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14041#true} {14123#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} #54#return; {14123#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {14123#(and (= main_~y~0 2) (= main_~c~0 2) (< 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; {14145#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 07:47:01,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {14145#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {14145#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 07:47:01,495 INFO L272 TraceCheckUtils]: 34: Hoare triple {14145#(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)); {14041#true} is VALID [2022-04-28 07:47:01,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,496 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14041#true} {14145#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #54#return; {14145#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 07:47:01,496 INFO L290 TraceCheckUtils]: 39: Hoare triple {14145#(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; {14167#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,496 INFO L290 TraceCheckUtils]: 40: Hoare triple {14167#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {14167#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,496 INFO L272 TraceCheckUtils]: 41: Hoare triple {14167#(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)); {14041#true} is VALID [2022-04-28 07:47:01,497 INFO L290 TraceCheckUtils]: 42: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,497 INFO L290 TraceCheckUtils]: 43: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,497 INFO L290 TraceCheckUtils]: 44: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,500 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14041#true} {14167#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {14167#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,501 INFO L290 TraceCheckUtils]: 46: Hoare triple {14167#(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; {14189#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,501 INFO L290 TraceCheckUtils]: 47: Hoare triple {14189#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {14189#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,501 INFO L272 TraceCheckUtils]: 48: Hoare triple {14189#(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)); {14041#true} is VALID [2022-04-28 07:47:01,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,501 INFO L290 TraceCheckUtils]: 50: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,501 INFO L290 TraceCheckUtils]: 51: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,503 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14041#true} {14189#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} #54#return; {14189#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,504 INFO L290 TraceCheckUtils]: 53: Hoare triple {14189#(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; {14211#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {14211#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !false; {14211#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,505 INFO L272 TraceCheckUtils]: 55: Hoare triple {14211#(and (= main_~y~0 6) (= (+ (- 1) main_~c~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)); {14041#true} is VALID [2022-04-28 07:47:01,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,505 INFO L290 TraceCheckUtils]: 58: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,505 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14041#true} {14211#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #54#return; {14211#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,506 INFO L290 TraceCheckUtils]: 60: Hoare triple {14211#(and (= main_~y~0 6) (= (+ (- 1) main_~c~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; {14233#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,506 INFO L290 TraceCheckUtils]: 61: Hoare triple {14233#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {14233#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,507 INFO L272 TraceCheckUtils]: 62: Hoare triple {14233#(and (= 5 (+ (- 2) 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)); {14041#true} is VALID [2022-04-28 07:47:01,507 INFO L290 TraceCheckUtils]: 63: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,507 INFO L290 TraceCheckUtils]: 64: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,507 INFO L290 TraceCheckUtils]: 65: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,507 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14041#true} {14233#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {14233#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,508 INFO L290 TraceCheckUtils]: 67: Hoare triple {14233#(and (= 5 (+ (- 2) 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; {14255#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,509 INFO L290 TraceCheckUtils]: 68: Hoare triple {14255#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {14255#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,509 INFO L272 TraceCheckUtils]: 69: Hoare triple {14255#(and (= (+ (- 2) main_~y~0) 6) (= 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)); {14041#true} is VALID [2022-04-28 07:47:01,509 INFO L290 TraceCheckUtils]: 70: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,509 INFO L290 TraceCheckUtils]: 71: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,509 INFO L290 TraceCheckUtils]: 72: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,510 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {14041#true} {14255#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} #54#return; {14255#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,510 INFO L290 TraceCheckUtils]: 74: Hoare triple {14255#(and (= (+ (- 2) main_~y~0) 6) (= 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; {14277#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,510 INFO L290 TraceCheckUtils]: 75: Hoare triple {14277#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} assume !false; {14277#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,510 INFO L272 TraceCheckUtils]: 76: Hoare triple {14277#(and (= main_~y~0 9) (= (+ (- 1) 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)); {14041#true} is VALID [2022-04-28 07:47:01,511 INFO L290 TraceCheckUtils]: 77: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,511 INFO L290 TraceCheckUtils]: 78: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,511 INFO L290 TraceCheckUtils]: 79: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,511 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {14041#true} {14277#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} #54#return; {14277#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,512 INFO L290 TraceCheckUtils]: 81: Hoare triple {14277#(and (= main_~y~0 9) (= (+ (- 1) 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; {14299#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,512 INFO L290 TraceCheckUtils]: 82: Hoare triple {14299#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {14299#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,512 INFO L272 TraceCheckUtils]: 83: Hoare triple {14299#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 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)); {14041#true} is VALID [2022-04-28 07:47:01,512 INFO L290 TraceCheckUtils]: 84: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,512 INFO L290 TraceCheckUtils]: 85: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,512 INFO L290 TraceCheckUtils]: 86: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,513 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14041#true} {14299#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #54#return; {14299#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,513 INFO L290 TraceCheckUtils]: 88: Hoare triple {14299#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 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; {14321#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,513 INFO L290 TraceCheckUtils]: 89: Hoare triple {14321#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9) (< 0 main_~k~0))} assume !false; {14321#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,514 INFO L272 TraceCheckUtils]: 90: Hoare triple {14321#(and (= main_~c~0 11) (= (+ (- 2) main_~y~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)); {14041#true} is VALID [2022-04-28 07:47:01,514 INFO L290 TraceCheckUtils]: 91: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,514 INFO L290 TraceCheckUtils]: 92: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,514 INFO L290 TraceCheckUtils]: 93: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,514 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {14041#true} {14321#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9) (< 0 main_~k~0))} #54#return; {14321#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,515 INFO L290 TraceCheckUtils]: 95: Hoare triple {14321#(and (= main_~c~0 11) (= (+ (- 2) main_~y~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; {14343#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,515 INFO L290 TraceCheckUtils]: 96: Hoare triple {14343#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9) (< 0 main_~k~0))} assume !false; {14343#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,515 INFO L272 TraceCheckUtils]: 97: Hoare triple {14343#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 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)); {14041#true} is VALID [2022-04-28 07:47:01,515 INFO L290 TraceCheckUtils]: 98: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,515 INFO L290 TraceCheckUtils]: 99: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,515 INFO L290 TraceCheckUtils]: 100: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,516 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {14041#true} {14343#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9) (< 0 main_~k~0))} #54#return; {14343#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,516 INFO L290 TraceCheckUtils]: 102: Hoare triple {14343#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 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; {14365#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,517 INFO L290 TraceCheckUtils]: 103: Hoare triple {14365#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 9) (< 0 main_~k~0))} assume !false; {14365#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,517 INFO L272 TraceCheckUtils]: 104: Hoare triple {14365#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 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)); {14041#true} is VALID [2022-04-28 07:47:01,517 INFO L290 TraceCheckUtils]: 105: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,517 INFO L290 TraceCheckUtils]: 106: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,517 INFO L290 TraceCheckUtils]: 107: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,517 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {14041#true} {14365#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 9) (< 0 main_~k~0))} #54#return; {14365#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,518 INFO L290 TraceCheckUtils]: 109: Hoare triple {14365#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 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; {14387#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,518 INFO L290 TraceCheckUtils]: 110: Hoare triple {14387#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14) (< 0 main_~k~0))} assume !false; {14387#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,518 INFO L272 TraceCheckUtils]: 111: Hoare triple {14387#(and (= 9 (+ main_~y~0 (- 5))) (= 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)); {14041#true} is VALID [2022-04-28 07:47:01,518 INFO L290 TraceCheckUtils]: 112: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,518 INFO L290 TraceCheckUtils]: 113: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,518 INFO L290 TraceCheckUtils]: 114: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,519 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {14041#true} {14387#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14) (< 0 main_~k~0))} #54#return; {14387#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,519 INFO L290 TraceCheckUtils]: 116: Hoare triple {14387#(and (= 9 (+ main_~y~0 (- 5))) (= 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; {14409#(and (= (+ main_~y~0 (- 6)) 9) (= main_~c~0 15) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,520 INFO L290 TraceCheckUtils]: 117: Hoare triple {14409#(and (= (+ main_~y~0 (- 6)) 9) (= main_~c~0 15) (< 0 main_~k~0))} assume !false; {14409#(and (= (+ main_~y~0 (- 6)) 9) (= main_~c~0 15) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,520 INFO L272 TraceCheckUtils]: 118: Hoare triple {14409#(and (= (+ main_~y~0 (- 6)) 9) (= 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)); {14041#true} is VALID [2022-04-28 07:47:01,520 INFO L290 TraceCheckUtils]: 119: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,520 INFO L290 TraceCheckUtils]: 120: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,520 INFO L290 TraceCheckUtils]: 121: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,520 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {14041#true} {14409#(and (= (+ main_~y~0 (- 6)) 9) (= main_~c~0 15) (< 0 main_~k~0))} #54#return; {14409#(and (= (+ main_~y~0 (- 6)) 9) (= main_~c~0 15) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,521 INFO L290 TraceCheckUtils]: 123: Hoare triple {14409#(and (= (+ main_~y~0 (- 6)) 9) (= 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; {14431#(and (= (+ (- 1) main_~c~0) 15) (= 9 (+ main_~y~0 (- 7))) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,521 INFO L290 TraceCheckUtils]: 124: Hoare triple {14431#(and (= (+ (- 1) main_~c~0) 15) (= 9 (+ main_~y~0 (- 7))) (< 0 main_~k~0))} assume !false; {14431#(and (= (+ (- 1) main_~c~0) 15) (= 9 (+ main_~y~0 (- 7))) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,521 INFO L272 TraceCheckUtils]: 125: Hoare triple {14431#(and (= (+ (- 1) main_~c~0) 15) (= 9 (+ main_~y~0 (- 7))) (< 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)); {14041#true} is VALID [2022-04-28 07:47:01,521 INFO L290 TraceCheckUtils]: 126: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,522 INFO L290 TraceCheckUtils]: 127: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,522 INFO L290 TraceCheckUtils]: 128: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,522 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {14041#true} {14431#(and (= (+ (- 1) main_~c~0) 15) (= 9 (+ main_~y~0 (- 7))) (< 0 main_~k~0))} #54#return; {14431#(and (= (+ (- 1) main_~c~0) 15) (= 9 (+ main_~y~0 (- 7))) (< 0 main_~k~0))} is VALID [2022-04-28 07:47:01,523 INFO L290 TraceCheckUtils]: 130: Hoare triple {14431#(and (= (+ (- 1) main_~c~0) 15) (= 9 (+ main_~y~0 (- 7))) (< 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; {14453#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-28 07:47:01,524 INFO L290 TraceCheckUtils]: 131: Hoare triple {14453#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !false; {14453#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-28 07:47:01,524 INFO L272 TraceCheckUtils]: 132: Hoare triple {14453#(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)); {14041#true} is VALID [2022-04-28 07:47:01,524 INFO L290 TraceCheckUtils]: 133: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,524 INFO L290 TraceCheckUtils]: 134: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,524 INFO L290 TraceCheckUtils]: 135: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,524 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {14041#true} {14453#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} #54#return; {14453#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-28 07:47:01,525 INFO L290 TraceCheckUtils]: 137: Hoare triple {14453#(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; {14475#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-28 07:47:01,525 INFO L290 TraceCheckUtils]: 138: Hoare triple {14475#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !false; {14475#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-28 07:47:01,525 INFO L272 TraceCheckUtils]: 139: Hoare triple {14475#(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)); {14041#true} is VALID [2022-04-28 07:47:01,525 INFO L290 TraceCheckUtils]: 140: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,525 INFO L290 TraceCheckUtils]: 141: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,525 INFO L290 TraceCheckUtils]: 142: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,526 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {14041#true} {14475#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} #54#return; {14475#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-28 07:47:01,526 INFO L290 TraceCheckUtils]: 144: Hoare triple {14475#(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; {14497#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-28 07:47:01,527 INFO L290 TraceCheckUtils]: 145: Hoare triple {14497#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} assume !false; {14497#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-28 07:47:01,527 INFO L272 TraceCheckUtils]: 146: Hoare triple {14497#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 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)); {14041#true} is VALID [2022-04-28 07:47:01,527 INFO L290 TraceCheckUtils]: 147: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-28 07:47:01,527 INFO L290 TraceCheckUtils]: 148: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-28 07:47:01,527 INFO L290 TraceCheckUtils]: 149: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-28 07:47:01,529 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {14041#true} {14497#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} #54#return; {14497#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-28 07:47:01,530 INFO L290 TraceCheckUtils]: 151: Hoare triple {14497#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} assume !(~c~0 < ~k~0); {14519#(and (< 18 main_~k~0) (<= main_~k~0 19) (= 19 main_~y~0))} is VALID [2022-04-28 07:47:01,531 INFO L272 TraceCheckUtils]: 152: Hoare triple {14519#(and (< 18 main_~k~0) (<= main_~k~0 19) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14523#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:47:01,531 INFO L290 TraceCheckUtils]: 153: Hoare triple {14523#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14527#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:47:01,532 INFO L290 TraceCheckUtils]: 154: Hoare triple {14527#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14042#false} is VALID [2022-04-28 07:47:01,532 INFO L290 TraceCheckUtils]: 155: Hoare triple {14042#false} assume !false; {14042#false} is VALID [2022-04-28 07:47:01,532 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-28 07:47:01,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:47:04,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:47:04,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914575206] [2022-04-28 07:47:04,004 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:47:04,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091635868] [2022-04-28 07:47:04,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091635868] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:47:04,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:47:04,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-04-28 07:47:04,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:47:04,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [355063627] [2022-04-28 07:47:04,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [355063627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:47:04,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:47:04,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 07:47:04,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365411257] [2022-04-28 07:47:04,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:47:04,005 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) Word has length 156 [2022-04-28 07:47:04,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:47:04,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 07:47:04,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:47:04,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 07:47:04,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:47:04,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 07:47:04,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1613, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 07:47:04,138 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 07:47:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:09,253 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-04-28 07:47:09,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 07:47:09,254 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) Word has length 156 [2022-04-28 07:47:09,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:47:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 07:47:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-28 07:47:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 07:47:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-28 07:47:09,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 108 transitions. [2022-04-28 07:47:09,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:47:09,480 INFO L225 Difference]: With dead ends: 93 [2022-04-28 07:47:09,480 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 07:47:09,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=467, Invalid=1789, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 07:47:09,481 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:47:09,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 907 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 07:47:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 07:47:09,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-28 07:47:09,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:47:09,623 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), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 07:47:09,623 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), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 07:47:09,623 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), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 07:47:09,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:09,625 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-28 07:47:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-28 07:47:09,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:47:09,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:47:09,626 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), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 88 states. [2022-04-28 07:47:09,626 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), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 88 states. [2022-04-28 07:47:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:09,628 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-28 07:47:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-28 07:47:09,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:47:09,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:47:09,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:47:09,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:47:09,629 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), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 07:47:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-04-28 07:47:09,631 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 156 [2022-04-28 07:47:09,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:47:09,631 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-04-28 07:47:09,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 07:47:09,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 107 transitions. [2022-04-28 07:47:10,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:47:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-28 07:47:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-28 07:47:10,322 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:47:10,322 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:47:10,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 07:47:10,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 07:47:10,523 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:47:10,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:47:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1670771305, now seen corresponding path program 39 times [2022-04-28 07:47:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:47:10,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1303073886] [2022-04-28 07:47:10,602 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:47:10,602 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:47:10,602 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:47:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1670771305, now seen corresponding path program 40 times [2022-04-28 07:47:10,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:47:10,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183721502] [2022-04-28 07:47:10,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:47:10,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:47:10,624 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:47:10,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1512789838] [2022-04-28 07:47:10,624 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:47:10,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:47:10,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:47:10,625 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:47:10,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 07:47:11,164 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:47:11,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:47:11,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-28 07:47:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:47:11,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:47:12,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {15513#true} call ULTIMATE.init(); {15513#true} is VALID [2022-04-28 07:47:12,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {15513#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); {15513#true} is VALID [2022-04-28 07:47:12,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15513#true} {15513#true} #60#return; {15513#true} is VALID [2022-04-28 07:47:12,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {15513#true} call #t~ret5 := main(); {15513#true} is VALID [2022-04-28 07:47:12,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {15513#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; {15513#true} is VALID [2022-04-28 07:47:12,147 INFO L272 TraceCheckUtils]: 6: Hoare triple {15513#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {15513#true} is VALID [2022-04-28 07:47:12,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,147 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15513#true} {15513#true} #52#return; {15513#true} is VALID [2022-04-28 07:47:12,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {15513#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15551#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:12,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {15551#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {15551#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:12,148 INFO L272 TraceCheckUtils]: 13: Hoare triple {15551#(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)); {15513#true} is VALID [2022-04-28 07:47:12,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,149 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15513#true} {15551#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {15551#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:12,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {15551#(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; {15573#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:47:12,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {15573#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {15573#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:47:12,150 INFO L272 TraceCheckUtils]: 20: Hoare triple {15573#(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)); {15513#true} is VALID [2022-04-28 07:47:12,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,150 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {15513#true} {15573#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {15573#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:47:12,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {15573#(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; {15595#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:12,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {15595#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {15595#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:12,151 INFO L272 TraceCheckUtils]: 27: Hoare triple {15595#(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)); {15513#true} is VALID [2022-04-28 07:47:12,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,155 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15513#true} {15595#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {15595#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:12,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {15595#(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; {15617#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:47:12,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {15617#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !false; {15617#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:47:12,157 INFO L272 TraceCheckUtils]: 34: Hoare triple {15617#(and (= 2 (+ (- 1) main_~y~0)) (= (+ 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)); {15513#true} is VALID [2022-04-28 07:47:12,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,158 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15513#true} {15617#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #54#return; {15617#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:47:12,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {15617#(and (= 2 (+ (- 1) main_~y~0)) (= (+ 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; {15639#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:47:12,159 INFO L290 TraceCheckUtils]: 40: Hoare triple {15639#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !false; {15639#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:47:12,159 INFO L272 TraceCheckUtils]: 41: Hoare triple {15639#(and (= main_~y~0 4) (= (+ 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)); {15513#true} is VALID [2022-04-28 07:47:12,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,159 INFO L290 TraceCheckUtils]: 43: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,160 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15513#true} {15639#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #54#return; {15639#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:47:12,160 INFO L290 TraceCheckUtils]: 46: Hoare triple {15639#(and (= main_~y~0 4) (= (+ 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; {15661#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:47:12,161 INFO L290 TraceCheckUtils]: 47: Hoare triple {15661#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} assume !false; {15661#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:47:12,161 INFO L272 TraceCheckUtils]: 48: Hoare triple {15661#(and (= (+ main_~c~0 (- 5)) 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)); {15513#true} is VALID [2022-04-28 07:47:12,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,161 INFO L290 TraceCheckUtils]: 50: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,161 INFO L290 TraceCheckUtils]: 51: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,162 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15513#true} {15661#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} #54#return; {15661#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:47:12,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {15661#(and (= (+ main_~c~0 (- 5)) 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; {15683#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:47:12,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {15683#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {15683#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:47:12,163 INFO L272 TraceCheckUtils]: 55: Hoare triple {15683#(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)); {15513#true} is VALID [2022-04-28 07:47:12,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,163 INFO L290 TraceCheckUtils]: 58: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,164 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15513#true} {15683#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {15683#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:47:12,165 INFO L290 TraceCheckUtils]: 60: Hoare triple {15683#(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; {15705#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:12,165 INFO L290 TraceCheckUtils]: 61: Hoare triple {15705#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {15705#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:12,165 INFO L272 TraceCheckUtils]: 62: Hoare triple {15705#(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)); {15513#true} is VALID [2022-04-28 07:47:12,165 INFO L290 TraceCheckUtils]: 63: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,165 INFO L290 TraceCheckUtils]: 64: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,165 INFO L290 TraceCheckUtils]: 65: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,166 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15513#true} {15705#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {15705#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:12,167 INFO L290 TraceCheckUtils]: 67: Hoare triple {15705#(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; {15727#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:47:12,167 INFO L290 TraceCheckUtils]: 68: Hoare triple {15727#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {15727#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:47:12,167 INFO L272 TraceCheckUtils]: 69: Hoare triple {15727#(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)); {15513#true} is VALID [2022-04-28 07:47:12,167 INFO L290 TraceCheckUtils]: 70: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,167 INFO L290 TraceCheckUtils]: 71: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,167 INFO L290 TraceCheckUtils]: 72: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,168 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15513#true} {15727#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #54#return; {15727#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:47:12,168 INFO L290 TraceCheckUtils]: 74: Hoare triple {15727#(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; {15749#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:47:12,169 INFO L290 TraceCheckUtils]: 75: Hoare triple {15749#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {15749#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:47:12,169 INFO L272 TraceCheckUtils]: 76: Hoare triple {15749#(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)); {15513#true} is VALID [2022-04-28 07:47:12,169 INFO L290 TraceCheckUtils]: 77: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,169 INFO L290 TraceCheckUtils]: 78: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,169 INFO L290 TraceCheckUtils]: 79: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,170 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15513#true} {15749#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {15749#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:47:12,170 INFO L290 TraceCheckUtils]: 81: Hoare triple {15749#(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; {15771#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:47:12,171 INFO L290 TraceCheckUtils]: 82: Hoare triple {15771#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {15771#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:47:12,171 INFO L272 TraceCheckUtils]: 83: Hoare triple {15771#(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)); {15513#true} is VALID [2022-04-28 07:47:12,171 INFO L290 TraceCheckUtils]: 84: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,171 INFO L290 TraceCheckUtils]: 85: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,171 INFO L290 TraceCheckUtils]: 86: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,172 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {15513#true} {15771#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {15771#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:47:12,172 INFO L290 TraceCheckUtils]: 88: Hoare triple {15771#(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; {15793#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:47:12,173 INFO L290 TraceCheckUtils]: 89: Hoare triple {15793#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {15793#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:47:12,173 INFO L272 TraceCheckUtils]: 90: Hoare triple {15793#(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)); {15513#true} is VALID [2022-04-28 07:47:12,173 INFO L290 TraceCheckUtils]: 91: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,173 INFO L290 TraceCheckUtils]: 92: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,173 INFO L290 TraceCheckUtils]: 93: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,174 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {15513#true} {15793#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {15793#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:47:12,174 INFO L290 TraceCheckUtils]: 95: Hoare triple {15793#(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; {15815#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:47:12,175 INFO L290 TraceCheckUtils]: 96: Hoare triple {15815#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {15815#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:47:12,175 INFO L272 TraceCheckUtils]: 97: Hoare triple {15815#(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)); {15513#true} is VALID [2022-04-28 07:47:12,175 INFO L290 TraceCheckUtils]: 98: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,175 INFO L290 TraceCheckUtils]: 99: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,175 INFO L290 TraceCheckUtils]: 100: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,175 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15513#true} {15815#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {15815#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:47:12,176 INFO L290 TraceCheckUtils]: 102: Hoare triple {15815#(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; {15837#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:47:12,176 INFO L290 TraceCheckUtils]: 103: Hoare triple {15837#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {15837#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:47:12,177 INFO L272 TraceCheckUtils]: 104: Hoare triple {15837#(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)); {15513#true} is VALID [2022-04-28 07:47:12,177 INFO L290 TraceCheckUtils]: 105: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,177 INFO L290 TraceCheckUtils]: 106: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,177 INFO L290 TraceCheckUtils]: 107: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,177 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15513#true} {15837#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {15837#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:47:12,178 INFO L290 TraceCheckUtils]: 109: Hoare triple {15837#(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; {15859#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:47:12,178 INFO L290 TraceCheckUtils]: 110: Hoare triple {15859#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {15859#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:47:12,179 INFO L272 TraceCheckUtils]: 111: Hoare triple {15859#(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)); {15513#true} is VALID [2022-04-28 07:47:12,179 INFO L290 TraceCheckUtils]: 112: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,179 INFO L290 TraceCheckUtils]: 113: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,179 INFO L290 TraceCheckUtils]: 114: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,179 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {15513#true} {15859#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {15859#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:47:12,180 INFO L290 TraceCheckUtils]: 116: Hoare triple {15859#(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; {15881#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:12,180 INFO L290 TraceCheckUtils]: 117: Hoare triple {15881#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {15881#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:12,180 INFO L272 TraceCheckUtils]: 118: Hoare triple {15881#(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)); {15513#true} is VALID [2022-04-28 07:47:12,180 INFO L290 TraceCheckUtils]: 119: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,180 INFO L290 TraceCheckUtils]: 120: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,181 INFO L290 TraceCheckUtils]: 121: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,181 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {15513#true} {15881#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {15881#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:12,181 INFO L290 TraceCheckUtils]: 123: Hoare triple {15881#(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; {15903#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:47:12,182 INFO L290 TraceCheckUtils]: 124: Hoare triple {15903#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {15903#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:47:12,182 INFO L272 TraceCheckUtils]: 125: Hoare triple {15903#(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)); {15513#true} is VALID [2022-04-28 07:47:12,182 INFO L290 TraceCheckUtils]: 126: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,182 INFO L290 TraceCheckUtils]: 127: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,182 INFO L290 TraceCheckUtils]: 128: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,182 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {15513#true} {15903#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {15903#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:47:12,183 INFO L290 TraceCheckUtils]: 130: Hoare triple {15903#(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; {15925#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:47:12,183 INFO L290 TraceCheckUtils]: 131: Hoare triple {15925#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {15925#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:47:12,183 INFO L272 TraceCheckUtils]: 132: Hoare triple {15925#(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)); {15513#true} is VALID [2022-04-28 07:47:12,183 INFO L290 TraceCheckUtils]: 133: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,183 INFO L290 TraceCheckUtils]: 134: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,183 INFO L290 TraceCheckUtils]: 135: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,184 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {15513#true} {15925#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #54#return; {15925#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:47:12,184 INFO L290 TraceCheckUtils]: 137: Hoare triple {15925#(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; {15947#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:47:12,185 INFO L290 TraceCheckUtils]: 138: Hoare triple {15947#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {15947#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:47:12,185 INFO L272 TraceCheckUtils]: 139: Hoare triple {15947#(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)); {15513#true} is VALID [2022-04-28 07:47:12,185 INFO L290 TraceCheckUtils]: 140: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,185 INFO L290 TraceCheckUtils]: 141: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,185 INFO L290 TraceCheckUtils]: 142: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,185 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {15513#true} {15947#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #54#return; {15947#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:47:12,186 INFO L290 TraceCheckUtils]: 144: Hoare triple {15947#(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; {15969#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:47:12,186 INFO L290 TraceCheckUtils]: 145: Hoare triple {15969#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {15969#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:47:12,186 INFO L272 TraceCheckUtils]: 146: Hoare triple {15969#(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)); {15513#true} is VALID [2022-04-28 07:47:12,186 INFO L290 TraceCheckUtils]: 147: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,186 INFO L290 TraceCheckUtils]: 148: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,186 INFO L290 TraceCheckUtils]: 149: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,187 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {15513#true} {15969#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {15969#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:47:12,187 INFO L290 TraceCheckUtils]: 151: Hoare triple {15969#(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; {15991#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} is VALID [2022-04-28 07:47:12,188 INFO L290 TraceCheckUtils]: 152: Hoare triple {15991#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} assume !false; {15991#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} is VALID [2022-04-28 07:47:12,188 INFO L272 TraceCheckUtils]: 153: Hoare triple {15991#(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)); {15513#true} is VALID [2022-04-28 07:47:12,188 INFO L290 TraceCheckUtils]: 154: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-28 07:47:12,188 INFO L290 TraceCheckUtils]: 155: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-28 07:47:12,188 INFO L290 TraceCheckUtils]: 156: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-28 07:47:12,188 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {15513#true} {15991#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} #54#return; {15991#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} is VALID [2022-04-28 07:47:12,189 INFO L290 TraceCheckUtils]: 158: Hoare triple {15991#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} assume !(~c~0 < ~k~0); {16013#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~k~0 20) (< 19 main_~k~0))} is VALID [2022-04-28 07:47:12,190 INFO L272 TraceCheckUtils]: 159: Hoare triple {16013#(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)); {16017#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:47:12,190 INFO L290 TraceCheckUtils]: 160: Hoare triple {16017#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16021#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:47:12,190 INFO L290 TraceCheckUtils]: 161: Hoare triple {16021#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15514#false} is VALID [2022-04-28 07:47:12,190 INFO L290 TraceCheckUtils]: 162: Hoare triple {15514#false} assume !false; {15514#false} is VALID [2022-04-28 07:47:12,191 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-28 07:47:12,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:47:12,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:47:12,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183721502] [2022-04-28 07:47:12,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:47:12,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512789838] [2022-04-28 07:47:12,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512789838] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:47:12,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:47:12,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-04-28 07:47:12,504 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:47:12,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1303073886] [2022-04-28 07:47:12,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1303073886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:47:12,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:47:12,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 07:47:12,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798393059] [2022-04-28 07:47:12,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:47:12,505 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) Word has length 163 [2022-04-28 07:47:12,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:47:12,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-28 07:47:12,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:47:12,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 07:47:12,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:47:12,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 07:47:12,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-28 07:47:12,652 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-28 07:47:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:18,404 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-04-28 07:47:18,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 07:47:18,404 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) Word has length 163 [2022-04-28 07:47:18,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:47:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-28 07:47:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-28 07:47:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-28 07:47:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-28 07:47:18,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 112 transitions. [2022-04-28 07:47:18,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:47:18,597 INFO L225 Difference]: With dead ends: 96 [2022-04-28 07:47:18,597 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 07:47:18,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2022-04-28 07:47:18,598 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 07:47:18,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 989 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 07:47:18,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 07:47:18,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-28 07:47:18,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:47:18,708 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), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 07:47:18,709 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), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 07:47:18,709 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), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 07:47:18,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:18,711 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-28 07:47:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 07:47:18,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:47:18,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:47:18,712 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), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 91 states. [2022-04-28 07:47:18,712 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), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 91 states. [2022-04-28 07:47:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:18,714 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-28 07:47:18,714 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 07:47:18,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:47:18,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:47:18,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:47:18,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:47:18,715 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), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 07:47:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-04-28 07:47:18,718 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 163 [2022-04-28 07:47:18,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:47:18,718 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-04-28 07:47:18,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-28 07:47:18,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 111 transitions. [2022-04-28 07:47:19,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:47:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 07:47:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-04-28 07:47:19,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:47:19,438 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:47:19,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 07:47:19,638 WARN L477 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-28 07:47:19,639 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:47:19,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:47:19,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1329797496, now seen corresponding path program 41 times [2022-04-28 07:47:19,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:47:19,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2010282592] [2022-04-28 07:47:19,718 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:47:19,718 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:47:19,718 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:47:19,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1329797496, now seen corresponding path program 42 times [2022-04-28 07:47:19,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:47:19,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927961553] [2022-04-28 07:47:19,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:47:19,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:47:19,734 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:47:19,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807993984] [2022-04-28 07:47:19,734 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:47:19,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:47:19,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:47:19,735 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:47:19,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 07:47:21,737 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-28 07:47:21,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:47:21,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-28 07:47:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:47:21,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:47:22,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {16629#true} call ULTIMATE.init(); {16629#true} is VALID [2022-04-28 07:47:22,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {16629#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); {16629#true} is VALID [2022-04-28 07:47:22,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16629#true} {16629#true} #60#return; {16629#true} is VALID [2022-04-28 07:47:22,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {16629#true} call #t~ret5 := main(); {16629#true} is VALID [2022-04-28 07:47:22,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {16629#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; {16629#true} is VALID [2022-04-28 07:47:22,852 INFO L272 TraceCheckUtils]: 6: Hoare triple {16629#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {16629#true} is VALID [2022-04-28 07:47:22,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,852 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16629#true} {16629#true} #52#return; {16629#true} is VALID [2022-04-28 07:47:22,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {16629#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {16667#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:22,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {16667#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {16667#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:22,853 INFO L272 TraceCheckUtils]: 13: Hoare triple {16667#(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)); {16629#true} is VALID [2022-04-28 07:47:22,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,854 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16629#true} {16667#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {16667#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:22,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {16667#(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; {16689#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:47:22,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {16689#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {16689#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:47:22,855 INFO L272 TraceCheckUtils]: 20: Hoare triple {16689#(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)); {16629#true} is VALID [2022-04-28 07:47:22,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,856 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {16629#true} {16689#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {16689#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:47:22,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {16689#(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; {16711#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:47:22,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {16711#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {16711#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:47:22,857 INFO L272 TraceCheckUtils]: 27: Hoare triple {16711#(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)); {16629#true} is VALID [2022-04-28 07:47:22,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,858 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16629#true} {16711#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {16711#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:47:22,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {16711#(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; {16733#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:47:22,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {16733#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {16733#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:47:22,859 INFO L272 TraceCheckUtils]: 34: Hoare triple {16733#(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)); {16629#true} is VALID [2022-04-28 07:47:22,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,859 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16629#true} {16733#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {16733#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:47:22,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {16733#(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; {16755#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:22,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {16755#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {16755#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:22,861 INFO L272 TraceCheckUtils]: 41: Hoare triple {16755#(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)); {16629#true} is VALID [2022-04-28 07:47:22,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,861 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16629#true} {16755#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {16755#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:22,862 INFO L290 TraceCheckUtils]: 46: Hoare triple {16755#(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; {16777#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:47:22,862 INFO L290 TraceCheckUtils]: 47: Hoare triple {16777#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {16777#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:47:22,862 INFO L272 TraceCheckUtils]: 48: Hoare triple {16777#(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)); {16629#true} is VALID [2022-04-28 07:47:22,862 INFO L290 TraceCheckUtils]: 49: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,863 INFO L290 TraceCheckUtils]: 50: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,863 INFO L290 TraceCheckUtils]: 51: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,863 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16629#true} {16777#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {16777#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:47:22,864 INFO L290 TraceCheckUtils]: 53: Hoare triple {16777#(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; {16799#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:47:22,864 INFO L290 TraceCheckUtils]: 54: Hoare triple {16799#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {16799#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:47:22,864 INFO L272 TraceCheckUtils]: 55: Hoare triple {16799#(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)); {16629#true} is VALID [2022-04-28 07:47:22,864 INFO L290 TraceCheckUtils]: 56: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,864 INFO L290 TraceCheckUtils]: 57: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,864 INFO L290 TraceCheckUtils]: 58: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,865 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16629#true} {16799#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {16799#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:47:22,866 INFO L290 TraceCheckUtils]: 60: Hoare triple {16799#(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; {16821#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:47:22,866 INFO L290 TraceCheckUtils]: 61: Hoare triple {16821#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {16821#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:47:22,866 INFO L272 TraceCheckUtils]: 62: Hoare triple {16821#(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)); {16629#true} is VALID [2022-04-28 07:47:22,866 INFO L290 TraceCheckUtils]: 63: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,866 INFO L290 TraceCheckUtils]: 64: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,866 INFO L290 TraceCheckUtils]: 65: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,867 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16629#true} {16821#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {16821#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:47:22,867 INFO L290 TraceCheckUtils]: 67: Hoare triple {16821#(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; {16843#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:22,868 INFO L290 TraceCheckUtils]: 68: Hoare triple {16843#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !false; {16843#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:22,868 INFO L272 TraceCheckUtils]: 69: Hoare triple {16843#(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)); {16629#true} is VALID [2022-04-28 07:47:22,868 INFO L290 TraceCheckUtils]: 70: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,868 INFO L290 TraceCheckUtils]: 71: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,868 INFO L290 TraceCheckUtils]: 72: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,869 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16629#true} {16843#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #54#return; {16843#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:22,869 INFO L290 TraceCheckUtils]: 74: Hoare triple {16843#(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; {16865#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:47:22,870 INFO L290 TraceCheckUtils]: 75: Hoare triple {16865#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} assume !false; {16865#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:47:22,870 INFO L272 TraceCheckUtils]: 76: Hoare triple {16865#(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)); {16629#true} is VALID [2022-04-28 07:47:22,870 INFO L290 TraceCheckUtils]: 77: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,870 INFO L290 TraceCheckUtils]: 78: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,870 INFO L290 TraceCheckUtils]: 79: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,871 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16629#true} {16865#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} #54#return; {16865#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:47:22,871 INFO L290 TraceCheckUtils]: 81: Hoare triple {16865#(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; {16887#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-28 07:47:22,872 INFO L290 TraceCheckUtils]: 82: Hoare triple {16887#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !false; {16887#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-28 07:47:22,872 INFO L272 TraceCheckUtils]: 83: Hoare triple {16887#(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)); {16629#true} is VALID [2022-04-28 07:47:22,872 INFO L290 TraceCheckUtils]: 84: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,872 INFO L290 TraceCheckUtils]: 85: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,872 INFO L290 TraceCheckUtils]: 86: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,873 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {16629#true} {16887#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} #54#return; {16887#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-28 07:47:22,873 INFO L290 TraceCheckUtils]: 88: Hoare triple {16887#(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; {16909#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-28 07:47:22,874 INFO L290 TraceCheckUtils]: 89: Hoare triple {16909#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} assume !false; {16909#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-28 07:47:22,874 INFO L272 TraceCheckUtils]: 90: Hoare triple {16909#(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)); {16629#true} is VALID [2022-04-28 07:47:22,874 INFO L290 TraceCheckUtils]: 91: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,874 INFO L290 TraceCheckUtils]: 92: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,874 INFO L290 TraceCheckUtils]: 93: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,874 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {16629#true} {16909#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} #54#return; {16909#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-28 07:47:22,875 INFO L290 TraceCheckUtils]: 95: Hoare triple {16909#(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; {16931#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:47:22,875 INFO L290 TraceCheckUtils]: 96: Hoare triple {16931#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {16931#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:47:22,876 INFO L272 TraceCheckUtils]: 97: Hoare triple {16931#(and (= main_~y~0 12) (= (+ (- 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)); {16629#true} is VALID [2022-04-28 07:47:22,876 INFO L290 TraceCheckUtils]: 98: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,876 INFO L290 TraceCheckUtils]: 99: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,876 INFO L290 TraceCheckUtils]: 100: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,876 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {16629#true} {16931#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {16931#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:47:22,877 INFO L290 TraceCheckUtils]: 102: Hoare triple {16931#(and (= main_~y~0 12) (= (+ (- 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; {16953#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:22,877 INFO L290 TraceCheckUtils]: 103: Hoare triple {16953#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} assume !false; {16953#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:22,877 INFO L272 TraceCheckUtils]: 104: Hoare triple {16953#(and (= 11 (+ (- 2) main_~c~0)) (= 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)); {16629#true} is VALID [2022-04-28 07:47:22,877 INFO L290 TraceCheckUtils]: 105: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,878 INFO L290 TraceCheckUtils]: 106: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,878 INFO L290 TraceCheckUtils]: 107: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,878 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16629#true} {16953#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} #54#return; {16953#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:22,879 INFO L290 TraceCheckUtils]: 109: Hoare triple {16953#(and (= 11 (+ (- 2) main_~c~0)) (= 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; {16975#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-28 07:47:22,879 INFO L290 TraceCheckUtils]: 110: Hoare triple {16975#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} assume !false; {16975#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-28 07:47:22,879 INFO L272 TraceCheckUtils]: 111: Hoare triple {16975#(and (= (+ (- 2) main_~y~0) 12) (= (+ 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)); {16629#true} is VALID [2022-04-28 07:47:22,879 INFO L290 TraceCheckUtils]: 112: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,879 INFO L290 TraceCheckUtils]: 113: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,880 INFO L290 TraceCheckUtils]: 114: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,880 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {16629#true} {16975#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} #54#return; {16975#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-28 07:47:22,881 INFO L290 TraceCheckUtils]: 116: Hoare triple {16975#(and (= (+ (- 2) main_~y~0) 12) (= (+ 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; {16997#(and (= 11 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-28 07:47:22,881 INFO L290 TraceCheckUtils]: 117: Hoare triple {16997#(and (= 11 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 12))} assume !false; {16997#(and (= 11 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-28 07:47:22,881 INFO L272 TraceCheckUtils]: 118: Hoare triple {16997#(and (= 11 (+ main_~c~0 (- 4))) (= (+ 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)); {16629#true} is VALID [2022-04-28 07:47:22,881 INFO L290 TraceCheckUtils]: 119: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,881 INFO L290 TraceCheckUtils]: 120: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,881 INFO L290 TraceCheckUtils]: 121: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,882 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {16629#true} {16997#(and (= 11 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 12))} #54#return; {16997#(and (= 11 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-28 07:47:22,882 INFO L290 TraceCheckUtils]: 123: Hoare triple {16997#(and (= 11 (+ main_~c~0 (- 4))) (= (+ 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; {17019#(and (= main_~y~0 16) (= (+ main_~c~0 (- 5)) 11))} is VALID [2022-04-28 07:47:22,883 INFO L290 TraceCheckUtils]: 124: Hoare triple {17019#(and (= main_~y~0 16) (= (+ main_~c~0 (- 5)) 11))} assume !false; {17019#(and (= main_~y~0 16) (= (+ main_~c~0 (- 5)) 11))} is VALID [2022-04-28 07:47:22,883 INFO L272 TraceCheckUtils]: 125: Hoare triple {17019#(and (= main_~y~0 16) (= (+ main_~c~0 (- 5)) 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)); {16629#true} is VALID [2022-04-28 07:47:22,883 INFO L290 TraceCheckUtils]: 126: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,883 INFO L290 TraceCheckUtils]: 127: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,883 INFO L290 TraceCheckUtils]: 128: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,884 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {16629#true} {17019#(and (= main_~y~0 16) (= (+ main_~c~0 (- 5)) 11))} #54#return; {17019#(and (= main_~y~0 16) (= (+ main_~c~0 (- 5)) 11))} is VALID [2022-04-28 07:47:22,884 INFO L290 TraceCheckUtils]: 130: Hoare triple {17019#(and (= main_~y~0 16) (= (+ main_~c~0 (- 5)) 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; {17041#(and (= (+ main_~c~0 (- 6)) 11) (= main_~y~0 17))} is VALID [2022-04-28 07:47:22,885 INFO L290 TraceCheckUtils]: 131: Hoare triple {17041#(and (= (+ main_~c~0 (- 6)) 11) (= main_~y~0 17))} assume !false; {17041#(and (= (+ main_~c~0 (- 6)) 11) (= main_~y~0 17))} is VALID [2022-04-28 07:47:22,885 INFO L272 TraceCheckUtils]: 132: Hoare triple {17041#(and (= (+ main_~c~0 (- 6)) 11) (= 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)); {16629#true} is VALID [2022-04-28 07:47:22,885 INFO L290 TraceCheckUtils]: 133: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,885 INFO L290 TraceCheckUtils]: 134: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,885 INFO L290 TraceCheckUtils]: 135: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,886 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {16629#true} {17041#(and (= (+ main_~c~0 (- 6)) 11) (= main_~y~0 17))} #54#return; {17041#(and (= (+ main_~c~0 (- 6)) 11) (= main_~y~0 17))} is VALID [2022-04-28 07:47:22,886 INFO L290 TraceCheckUtils]: 137: Hoare triple {17041#(and (= (+ main_~c~0 (- 6)) 11) (= 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; {17063#(and (= (+ main_~c~0 (- 7)) 11) (= main_~y~0 18))} is VALID [2022-04-28 07:47:22,887 INFO L290 TraceCheckUtils]: 138: Hoare triple {17063#(and (= (+ main_~c~0 (- 7)) 11) (= main_~y~0 18))} assume !false; {17063#(and (= (+ main_~c~0 (- 7)) 11) (= main_~y~0 18))} is VALID [2022-04-28 07:47:22,887 INFO L272 TraceCheckUtils]: 139: Hoare triple {17063#(and (= (+ main_~c~0 (- 7)) 11) (= 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)); {16629#true} is VALID [2022-04-28 07:47:22,887 INFO L290 TraceCheckUtils]: 140: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,887 INFO L290 TraceCheckUtils]: 141: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,887 INFO L290 TraceCheckUtils]: 142: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,888 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {16629#true} {17063#(and (= (+ main_~c~0 (- 7)) 11) (= main_~y~0 18))} #54#return; {17063#(and (= (+ main_~c~0 (- 7)) 11) (= main_~y~0 18))} is VALID [2022-04-28 07:47:22,888 INFO L290 TraceCheckUtils]: 144: Hoare triple {17063#(and (= (+ main_~c~0 (- 7)) 11) (= 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; {17085#(and (= 18 (+ (- 1) main_~y~0)) (= 11 (+ main_~c~0 (- 8))))} is VALID [2022-04-28 07:47:22,889 INFO L290 TraceCheckUtils]: 145: Hoare triple {17085#(and (= 18 (+ (- 1) main_~y~0)) (= 11 (+ main_~c~0 (- 8))))} assume !false; {17085#(and (= 18 (+ (- 1) main_~y~0)) (= 11 (+ main_~c~0 (- 8))))} is VALID [2022-04-28 07:47:22,889 INFO L272 TraceCheckUtils]: 146: Hoare triple {17085#(and (= 18 (+ (- 1) main_~y~0)) (= 11 (+ 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)); {16629#true} is VALID [2022-04-28 07:47:22,889 INFO L290 TraceCheckUtils]: 147: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,889 INFO L290 TraceCheckUtils]: 148: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,889 INFO L290 TraceCheckUtils]: 149: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,890 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {16629#true} {17085#(and (= 18 (+ (- 1) main_~y~0)) (= 11 (+ main_~c~0 (- 8))))} #54#return; {17085#(and (= 18 (+ (- 1) main_~y~0)) (= 11 (+ main_~c~0 (- 8))))} is VALID [2022-04-28 07:47:22,890 INFO L290 TraceCheckUtils]: 151: Hoare triple {17085#(and (= 18 (+ (- 1) main_~y~0)) (= 11 (+ 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; {17107#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-28 07:47:22,890 INFO L290 TraceCheckUtils]: 152: Hoare triple {17107#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} assume !false; {17107#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-28 07:47:22,891 INFO L272 TraceCheckUtils]: 153: Hoare triple {17107#(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)); {16629#true} is VALID [2022-04-28 07:47:22,891 INFO L290 TraceCheckUtils]: 154: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,891 INFO L290 TraceCheckUtils]: 155: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,891 INFO L290 TraceCheckUtils]: 156: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,891 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {16629#true} {17107#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} #54#return; {17107#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-28 07:47:22,892 INFO L290 TraceCheckUtils]: 158: Hoare triple {17107#(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; {17129#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-28 07:47:22,892 INFO L290 TraceCheckUtils]: 159: Hoare triple {17129#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} assume !false; {17129#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-28 07:47:22,892 INFO L272 TraceCheckUtils]: 160: Hoare triple {17129#(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)); {16629#true} is VALID [2022-04-28 07:47:22,892 INFO L290 TraceCheckUtils]: 161: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-28 07:47:22,892 INFO L290 TraceCheckUtils]: 162: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-28 07:47:22,893 INFO L290 TraceCheckUtils]: 163: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-28 07:47:22,893 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {16629#true} {17129#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} #54#return; {17129#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-28 07:47:22,895 INFO L290 TraceCheckUtils]: 165: Hoare triple {17129#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} assume !(~c~0 < ~k~0); {17151#(and (< 20 main_~k~0) (= main_~y~0 21) (<= main_~k~0 21))} is VALID [2022-04-28 07:47:22,896 INFO L272 TraceCheckUtils]: 166: Hoare triple {17151#(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)); {17155#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:47:22,896 INFO L290 TraceCheckUtils]: 167: Hoare triple {17155#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17159#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:47:22,897 INFO L290 TraceCheckUtils]: 168: Hoare triple {17159#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16630#false} is VALID [2022-04-28 07:47:22,897 INFO L290 TraceCheckUtils]: 169: Hoare triple {16630#false} assume !false; {16630#false} is VALID [2022-04-28 07:47:22,898 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-28 07:47:22,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:47:23,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:47:23,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927961553] [2022-04-28 07:47:23,417 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:47:23,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807993984] [2022-04-28 07:47:23,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807993984] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:47:23,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:47:23,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-04-28 07:47:23,417 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:47:23,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2010282592] [2022-04-28 07:47:23,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2010282592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:47:23,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:47:23,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 07:47:23,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667051178] [2022-04-28 07:47:23,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:47:23,418 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Word has length 170 [2022-04-28 07:47:23,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:47:23,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-28 07:47:23,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:47:23,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 07:47:23,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:47:23,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 07:47:23,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2022-04-28 07:47:23,598 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-28 07:47:30,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:30,714 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2022-04-28 07:47:30,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 07:47:30,715 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Word has length 170 [2022-04-28 07:47:30,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:47:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-28 07:47:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 116 transitions. [2022-04-28 07:47:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-28 07:47:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 116 transitions. [2022-04-28 07:47:30,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 116 transitions. [2022-04-28 07:47:30,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:47:30,943 INFO L225 Difference]: With dead ends: 99 [2022-04-28 07:47:30,943 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 07:47:30,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2022-04-28 07:47:30,945 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 2 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-28 07:47:30,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1055 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-28 07:47:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 07:47:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-28 07:47:31,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:47:31,066 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), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 07:47:31,066 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), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 07:47:31,066 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), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 07:47:31,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:31,068 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-28 07:47:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-28 07:47:31,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:47:31,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:47:31,069 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), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 94 states. [2022-04-28 07:47:31,069 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), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 94 states. [2022-04-28 07:47:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:31,071 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-28 07:47:31,071 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-28 07:47:31,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:47:31,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:47:31,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:47:31,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:47:31,072 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), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 07:47:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2022-04-28 07:47:31,074 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 170 [2022-04-28 07:47:31,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:47:31,075 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2022-04-28 07:47:31,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-28 07:47:31,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 115 transitions. [2022-04-28 07:47:31,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:47:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-28 07:47:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-04-28 07:47:31,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:47:31,909 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:47:31,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-28 07:47:32,109 WARN L477 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-28 07:47:32,109 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:47:32,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:47:32,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1612717687, now seen corresponding path program 43 times [2022-04-28 07:47:32,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:47:32,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1252834489] [2022-04-28 07:47:32,192 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:47:32,192 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:47:32,192 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:47:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1612717687, now seen corresponding path program 44 times [2022-04-28 07:47:32,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:47:32,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831112494] [2022-04-28 07:47:32,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:47:32,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:47:32,213 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:47:32,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [523369593] [2022-04-28 07:47:32,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:47:32,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:47:32,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:47:32,214 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:47:32,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 07:47:32,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:47:32,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:47:32,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-28 07:47:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:47:32,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:47:33,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {17785#true} call ULTIMATE.init(); {17785#true} is VALID [2022-04-28 07:47:33,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {17785#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); {17785#true} is VALID [2022-04-28 07:47:33,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17785#true} {17785#true} #60#return; {17785#true} is VALID [2022-04-28 07:47:33,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {17785#true} call #t~ret5 := main(); {17785#true} is VALID [2022-04-28 07:47:33,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {17785#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; {17785#true} is VALID [2022-04-28 07:47:33,761 INFO L272 TraceCheckUtils]: 6: Hoare triple {17785#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {17785#true} is VALID [2022-04-28 07:47:33,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,761 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17785#true} {17785#true} #52#return; {17785#true} is VALID [2022-04-28 07:47:33,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {17785#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {17823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:33,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {17823#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {17823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:33,762 INFO L272 TraceCheckUtils]: 13: Hoare triple {17823#(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)); {17785#true} is VALID [2022-04-28 07:47:33,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,762 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17785#true} {17823#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {17823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:33,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {17823#(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; {17845#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:47:33,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {17845#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {17845#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:47:33,763 INFO L272 TraceCheckUtils]: 20: Hoare triple {17845#(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)); {17785#true} is VALID [2022-04-28 07:47:33,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,764 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {17785#true} {17845#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {17845#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:47:33,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {17845#(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; {17867#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:47:33,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {17867#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {17867#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:47:33,765 INFO L272 TraceCheckUtils]: 27: Hoare triple {17867#(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)); {17785#true} is VALID [2022-04-28 07:47:33,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,765 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17785#true} {17867#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {17867#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:47:33,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {17867#(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; {17889#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:47:33,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {17889#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {17889#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:47:33,766 INFO L272 TraceCheckUtils]: 34: Hoare triple {17889#(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)); {17785#true} is VALID [2022-04-28 07:47:33,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,766 INFO L290 TraceCheckUtils]: 37: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,767 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17785#true} {17889#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #54#return; {17889#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:47:33,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {17889#(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; {17911#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-28 07:47:33,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {17911#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !false; {17911#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-28 07:47:33,768 INFO L272 TraceCheckUtils]: 41: Hoare triple {17911#(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)); {17785#true} is VALID [2022-04-28 07:47:33,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,768 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17785#true} {17911#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} #54#return; {17911#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-28 07:47:33,769 INFO L290 TraceCheckUtils]: 46: Hoare triple {17911#(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; {17933#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:47:33,769 INFO L290 TraceCheckUtils]: 47: Hoare triple {17933#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {17933#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:47:33,769 INFO L272 TraceCheckUtils]: 48: Hoare triple {17933#(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)); {17785#true} is VALID [2022-04-28 07:47:33,769 INFO L290 TraceCheckUtils]: 49: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,769 INFO L290 TraceCheckUtils]: 50: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,769 INFO L290 TraceCheckUtils]: 51: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,770 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17785#true} {17933#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {17933#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:47:33,770 INFO L290 TraceCheckUtils]: 53: Hoare triple {17933#(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; {17955#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:33,770 INFO L290 TraceCheckUtils]: 54: Hoare triple {17955#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !false; {17955#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:33,771 INFO L272 TraceCheckUtils]: 55: Hoare triple {17955#(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)); {17785#true} is VALID [2022-04-28 07:47:33,771 INFO L290 TraceCheckUtils]: 56: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,771 INFO L290 TraceCheckUtils]: 57: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,771 INFO L290 TraceCheckUtils]: 58: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,771 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17785#true} {17955#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #54#return; {17955#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:33,772 INFO L290 TraceCheckUtils]: 60: Hoare triple {17955#(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; {17977#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-28 07:47:33,772 INFO L290 TraceCheckUtils]: 61: Hoare triple {17977#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {17977#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-28 07:47:33,772 INFO L272 TraceCheckUtils]: 62: Hoare triple {17977#(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)); {17785#true} is VALID [2022-04-28 07:47:33,772 INFO L290 TraceCheckUtils]: 63: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,772 INFO L290 TraceCheckUtils]: 64: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,772 INFO L290 TraceCheckUtils]: 65: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,773 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17785#true} {17977#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #54#return; {17977#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-28 07:47:33,773 INFO L290 TraceCheckUtils]: 67: Hoare triple {17977#(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; {17999#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:47:33,773 INFO L290 TraceCheckUtils]: 68: Hoare triple {17999#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {17999#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:47:33,773 INFO L272 TraceCheckUtils]: 69: Hoare triple {17999#(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)); {17785#true} is VALID [2022-04-28 07:47:33,774 INFO L290 TraceCheckUtils]: 70: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,774 INFO L290 TraceCheckUtils]: 71: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,774 INFO L290 TraceCheckUtils]: 72: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,774 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17785#true} {17999#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {17999#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:47:33,774 INFO L290 TraceCheckUtils]: 74: Hoare triple {17999#(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; {18021#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:47:33,775 INFO L290 TraceCheckUtils]: 75: Hoare triple {18021#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {18021#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:47:33,775 INFO L272 TraceCheckUtils]: 76: Hoare triple {18021#(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)); {17785#true} is VALID [2022-04-28 07:47:33,775 INFO L290 TraceCheckUtils]: 77: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,775 INFO L290 TraceCheckUtils]: 78: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,775 INFO L290 TraceCheckUtils]: 79: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,776 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {17785#true} {18021#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #54#return; {18021#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:47:33,776 INFO L290 TraceCheckUtils]: 81: Hoare triple {18021#(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; {18043#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:33,776 INFO L290 TraceCheckUtils]: 82: Hoare triple {18043#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} assume !false; {18043#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:33,776 INFO L272 TraceCheckUtils]: 83: Hoare triple {18043#(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)); {17785#true} is VALID [2022-04-28 07:47:33,776 INFO L290 TraceCheckUtils]: 84: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,777 INFO L290 TraceCheckUtils]: 85: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,777 INFO L290 TraceCheckUtils]: 86: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,777 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {17785#true} {18043#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} #54#return; {18043#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:33,777 INFO L290 TraceCheckUtils]: 88: Hoare triple {18043#(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; {18065#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:47:33,778 INFO L290 TraceCheckUtils]: 89: Hoare triple {18065#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {18065#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:47:33,778 INFO L272 TraceCheckUtils]: 90: Hoare triple {18065#(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)); {17785#true} is VALID [2022-04-28 07:47:33,778 INFO L290 TraceCheckUtils]: 91: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,778 INFO L290 TraceCheckUtils]: 92: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,778 INFO L290 TraceCheckUtils]: 93: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,779 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {17785#true} {18065#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #54#return; {18065#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:47:33,779 INFO L290 TraceCheckUtils]: 95: Hoare triple {18065#(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; {18087#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:47:33,780 INFO L290 TraceCheckUtils]: 96: Hoare triple {18087#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {18087#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:47:33,780 INFO L272 TraceCheckUtils]: 97: Hoare triple {18087#(and (= main_~y~0 12) (= (+ (- 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)); {17785#true} is VALID [2022-04-28 07:47:33,780 INFO L290 TraceCheckUtils]: 98: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,780 INFO L290 TraceCheckUtils]: 99: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,780 INFO L290 TraceCheckUtils]: 100: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,780 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {17785#true} {18087#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {18087#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:47:33,781 INFO L290 TraceCheckUtils]: 102: Hoare triple {18087#(and (= main_~y~0 12) (= (+ (- 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; {18109#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:33,781 INFO L290 TraceCheckUtils]: 103: Hoare triple {18109#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {18109#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:33,781 INFO L272 TraceCheckUtils]: 104: Hoare triple {18109#(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)); {17785#true} is VALID [2022-04-28 07:47:33,781 INFO L290 TraceCheckUtils]: 105: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,781 INFO L290 TraceCheckUtils]: 106: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,781 INFO L290 TraceCheckUtils]: 107: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,782 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17785#true} {18109#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {18109#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:33,782 INFO L290 TraceCheckUtils]: 109: Hoare triple {18109#(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; {18131#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:47:33,783 INFO L290 TraceCheckUtils]: 110: Hoare triple {18131#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {18131#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:47:33,783 INFO L272 TraceCheckUtils]: 111: Hoare triple {18131#(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)); {17785#true} is VALID [2022-04-28 07:47:33,783 INFO L290 TraceCheckUtils]: 112: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,783 INFO L290 TraceCheckUtils]: 113: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,783 INFO L290 TraceCheckUtils]: 114: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,783 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {17785#true} {18131#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {18131#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:47:33,784 INFO L290 TraceCheckUtils]: 116: Hoare triple {18131#(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; {18153#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:33,784 INFO L290 TraceCheckUtils]: 117: Hoare triple {18153#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !false; {18153#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:33,784 INFO L272 TraceCheckUtils]: 118: Hoare triple {18153#(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)); {17785#true} is VALID [2022-04-28 07:47:33,784 INFO L290 TraceCheckUtils]: 119: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,784 INFO L290 TraceCheckUtils]: 120: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,784 INFO L290 TraceCheckUtils]: 121: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,785 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {17785#true} {18153#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} #54#return; {18153#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:33,785 INFO L290 TraceCheckUtils]: 123: Hoare triple {18153#(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; {18175#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-28 07:47:33,786 INFO L290 TraceCheckUtils]: 124: Hoare triple {18175#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} assume !false; {18175#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-28 07:47:33,786 INFO L272 TraceCheckUtils]: 125: Hoare triple {18175#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 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)); {17785#true} is VALID [2022-04-28 07:47:33,786 INFO L290 TraceCheckUtils]: 126: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,786 INFO L290 TraceCheckUtils]: 127: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,786 INFO L290 TraceCheckUtils]: 128: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,786 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17785#true} {18175#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} #54#return; {18175#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-28 07:47:33,787 INFO L290 TraceCheckUtils]: 130: Hoare triple {18175#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 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; {18197#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:47:33,787 INFO L290 TraceCheckUtils]: 131: Hoare triple {18197#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {18197#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:47:33,787 INFO L272 TraceCheckUtils]: 132: Hoare triple {18197#(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)); {17785#true} is VALID [2022-04-28 07:47:33,787 INFO L290 TraceCheckUtils]: 133: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,787 INFO L290 TraceCheckUtils]: 134: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,787 INFO L290 TraceCheckUtils]: 135: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,788 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {17785#true} {18197#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {18197#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:47:33,788 INFO L290 TraceCheckUtils]: 137: Hoare triple {18197#(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; {18219#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:47:33,788 INFO L290 TraceCheckUtils]: 138: Hoare triple {18219#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !false; {18219#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:47:33,789 INFO L272 TraceCheckUtils]: 139: Hoare triple {18219#(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)); {17785#true} is VALID [2022-04-28 07:47:33,789 INFO L290 TraceCheckUtils]: 140: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,789 INFO L290 TraceCheckUtils]: 141: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,789 INFO L290 TraceCheckUtils]: 142: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,789 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {17785#true} {18219#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} #54#return; {18219#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:47:33,790 INFO L290 TraceCheckUtils]: 144: Hoare triple {18219#(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; {18241#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:47:33,790 INFO L290 TraceCheckUtils]: 145: Hoare triple {18241#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {18241#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:47:33,790 INFO L272 TraceCheckUtils]: 146: Hoare triple {18241#(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)); {17785#true} is VALID [2022-04-28 07:47:33,790 INFO L290 TraceCheckUtils]: 147: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,790 INFO L290 TraceCheckUtils]: 148: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,790 INFO L290 TraceCheckUtils]: 149: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,791 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {17785#true} {18241#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {18241#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:47:33,791 INFO L290 TraceCheckUtils]: 151: Hoare triple {18241#(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; {18263#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:47:33,791 INFO L290 TraceCheckUtils]: 152: Hoare triple {18263#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {18263#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:47:33,791 INFO L272 TraceCheckUtils]: 153: Hoare triple {18263#(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)); {17785#true} is VALID [2022-04-28 07:47:33,792 INFO L290 TraceCheckUtils]: 154: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,792 INFO L290 TraceCheckUtils]: 155: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,792 INFO L290 TraceCheckUtils]: 156: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,792 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {17785#true} {18263#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #54#return; {18263#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:47:33,793 INFO L290 TraceCheckUtils]: 158: Hoare triple {18263#(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; {18285#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:47:33,793 INFO L290 TraceCheckUtils]: 159: Hoare triple {18285#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !false; {18285#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:47:33,793 INFO L272 TraceCheckUtils]: 160: Hoare triple {18285#(and (= main_~c~0 21) (= 19 (+ (- 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)); {17785#true} is VALID [2022-04-28 07:47:33,793 INFO L290 TraceCheckUtils]: 161: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,793 INFO L290 TraceCheckUtils]: 162: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,793 INFO L290 TraceCheckUtils]: 163: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,794 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {17785#true} {18285#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} #54#return; {18285#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:47:33,794 INFO L290 TraceCheckUtils]: 165: Hoare triple {18285#(and (= main_~c~0 21) (= 19 (+ (- 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; {18307#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~c~0 22) (< 21 main_~k~0))} is VALID [2022-04-28 07:47:33,794 INFO L290 TraceCheckUtils]: 166: Hoare triple {18307#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~c~0 22) (< 21 main_~k~0))} assume !false; {18307#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~c~0 22) (< 21 main_~k~0))} is VALID [2022-04-28 07:47:33,794 INFO L272 TraceCheckUtils]: 167: Hoare triple {18307#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~c~0 22) (< 21 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)); {17785#true} is VALID [2022-04-28 07:47:33,795 INFO L290 TraceCheckUtils]: 168: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-28 07:47:33,795 INFO L290 TraceCheckUtils]: 169: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-28 07:47:33,795 INFO L290 TraceCheckUtils]: 170: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-28 07:47:33,795 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {17785#true} {18307#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~c~0 22) (< 21 main_~k~0))} #54#return; {18307#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~c~0 22) (< 21 main_~k~0))} is VALID [2022-04-28 07:47:33,796 INFO L290 TraceCheckUtils]: 172: Hoare triple {18307#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~c~0 22) (< 21 main_~k~0))} assume !(~c~0 < ~k~0); {18329#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~k~0 22) (< 21 main_~k~0))} is VALID [2022-04-28 07:47:33,797 INFO L272 TraceCheckUtils]: 173: Hoare triple {18329#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~k~0 22) (< 21 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18333#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:47:33,797 INFO L290 TraceCheckUtils]: 174: Hoare triple {18333#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18337#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:47:33,797 INFO L290 TraceCheckUtils]: 175: Hoare triple {18337#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17786#false} is VALID [2022-04-28 07:47:33,798 INFO L290 TraceCheckUtils]: 176: Hoare triple {17786#false} assume !false; {17786#false} is VALID [2022-04-28 07:47:33,798 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-28 07:47:33,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:47:34,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:47:34,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831112494] [2022-04-28 07:47:34,166 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:47:34,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523369593] [2022-04-28 07:47:34,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523369593] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:47:34,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:47:34,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-04-28 07:47:34,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:47:34,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1252834489] [2022-04-28 07:47:34,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1252834489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:47:34,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:47:34,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 07:47:34,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217179688] [2022-04-28 07:47:34,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:47:34,167 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) Word has length 177 [2022-04-28 07:47:34,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:47:34,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-28 07:47:34,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:47:34,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 07:47:34,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:47:34,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 07:47:34,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-04-28 07:47:34,376 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-28 07:47:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:42,909 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-04-28 07:47:42,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 07:47:42,910 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) Word has length 177 [2022-04-28 07:47:42,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:47:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-28 07:47:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-28 07:47:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-28 07:47:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-28 07:47:42,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 120 transitions. [2022-04-28 07:47:43,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:47:43,151 INFO L225 Difference]: With dead ends: 102 [2022-04-28 07:47:43,151 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 07:47:43,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 159 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-28 07:47:43,152 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:47:43,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1123 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 07:47:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 07:47:43,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-04-28 07:47:43,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:47:43,261 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), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 07:47:43,261 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), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 07:47:43,261 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), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 07:47:43,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:43,263 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-04-28 07:47:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-28 07:47:43,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:47:43,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:47:43,264 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), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 97 states. [2022-04-28 07:47:43,264 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), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 97 states. [2022-04-28 07:47:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:43,267 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-04-28 07:47:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-28 07:47:43,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:47:43,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:47:43,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:47:43,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:47:43,268 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), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 07:47:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2022-04-28 07:47:43,271 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 177 [2022-04-28 07:47:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:47:43,271 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2022-04-28 07:47:43,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-28 07:47:43,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 119 transitions. [2022-04-28 07:47:44,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:47:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-28 07:47:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-04-28 07:47:44,277 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:47:44,277 INFO L195 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:47:44,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 07:47:44,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 07:47:44,478 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:47:44,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:47:44,478 INFO L85 PathProgramCache]: Analyzing trace with hash -178408600, now seen corresponding path program 45 times [2022-04-28 07:47:44,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:47:44,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [730156090] [2022-04-28 07:47:44,574 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:47:44,574 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:47:44,574 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:47:44,574 INFO L85 PathProgramCache]: Analyzing trace with hash -178408600, now seen corresponding path program 46 times [2022-04-28 07:47:44,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:47:44,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644054067] [2022-04-28 07:47:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:47:44,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:47:44,594 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:47:44,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [574344297] [2022-04-28 07:47:44,594 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:47:44,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:47:44,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:47:44,595 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-28 07:47:44,597 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-28 07:47:45,149 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:47:45,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:47:45,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-28 07:47:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:47:45,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:47:46,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {18981#true} call ULTIMATE.init(); {18981#true} is VALID [2022-04-28 07:47:46,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {18981#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); {18981#true} is VALID [2022-04-28 07:47:46,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18981#true} {18981#true} #60#return; {18981#true} is VALID [2022-04-28 07:47:46,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {18981#true} call #t~ret5 := main(); {18981#true} is VALID [2022-04-28 07:47:46,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {18981#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; {18981#true} is VALID [2022-04-28 07:47:46,205 INFO L272 TraceCheckUtils]: 6: Hoare triple {18981#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {18981#true} is VALID [2022-04-28 07:47:46,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,205 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18981#true} {18981#true} #52#return; {18981#true} is VALID [2022-04-28 07:47:46,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {18981#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {19019#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:46,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {19019#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {19019#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:46,206 INFO L272 TraceCheckUtils]: 13: Hoare triple {19019#(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)); {18981#true} is VALID [2022-04-28 07:47:46,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,207 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18981#true} {19019#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {19019#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:46,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {19019#(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; {19041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:47:46,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {19041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:47:46,208 INFO L272 TraceCheckUtils]: 20: Hoare triple {19041#(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)); {18981#true} is VALID [2022-04-28 07:47:46,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,208 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {18981#true} {19041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {19041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:47:46,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {19041#(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; {19063#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:46,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {19063#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {19063#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:46,209 INFO L272 TraceCheckUtils]: 27: Hoare triple {19063#(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)); {18981#true} is VALID [2022-04-28 07:47:46,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,210 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18981#true} {19063#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {19063#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:46,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {19063#(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; {19085#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:47:46,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {19085#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !false; {19085#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:47:46,211 INFO L272 TraceCheckUtils]: 34: Hoare triple {19085#(and (= 2 (+ (- 1) main_~y~0)) (= (+ 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)); {18981#true} is VALID [2022-04-28 07:47:46,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,211 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {18981#true} {19085#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #54#return; {19085#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:47:46,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {19085#(and (= 2 (+ (- 1) main_~y~0)) (= (+ 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; {19107#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:47:46,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {19107#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !false; {19107#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:47:46,212 INFO L272 TraceCheckUtils]: 41: Hoare triple {19107#(and (= main_~y~0 4) (= (+ 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)); {18981#true} is VALID [2022-04-28 07:47:46,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,213 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {18981#true} {19107#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #54#return; {19107#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:47:46,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {19107#(and (= main_~y~0 4) (= (+ 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; {19129#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:47:46,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {19129#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} assume !false; {19129#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:47:46,214 INFO L272 TraceCheckUtils]: 48: Hoare triple {19129#(and (= (+ main_~c~0 (- 5)) 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)); {18981#true} is VALID [2022-04-28 07:47:46,214 INFO L290 TraceCheckUtils]: 49: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,214 INFO L290 TraceCheckUtils]: 50: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,214 INFO L290 TraceCheckUtils]: 51: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,214 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18981#true} {19129#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} #54#return; {19129#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:47:46,215 INFO L290 TraceCheckUtils]: 53: Hoare triple {19129#(and (= (+ main_~c~0 (- 5)) 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; {19151#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:47:46,215 INFO L290 TraceCheckUtils]: 54: Hoare triple {19151#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {19151#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:47:46,215 INFO L272 TraceCheckUtils]: 55: Hoare triple {19151#(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)); {18981#true} is VALID [2022-04-28 07:47:46,215 INFO L290 TraceCheckUtils]: 56: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,215 INFO L290 TraceCheckUtils]: 57: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,216 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18981#true} {19151#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {19151#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:47:46,216 INFO L290 TraceCheckUtils]: 60: Hoare triple {19151#(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; {19173#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:46,216 INFO L290 TraceCheckUtils]: 61: Hoare triple {19173#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {19173#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:46,217 INFO L272 TraceCheckUtils]: 62: Hoare triple {19173#(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)); {18981#true} is VALID [2022-04-28 07:47:46,217 INFO L290 TraceCheckUtils]: 63: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,217 INFO L290 TraceCheckUtils]: 64: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,217 INFO L290 TraceCheckUtils]: 65: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,217 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18981#true} {19173#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {19173#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:46,218 INFO L290 TraceCheckUtils]: 67: Hoare triple {19173#(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; {19195#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:47:46,218 INFO L290 TraceCheckUtils]: 68: Hoare triple {19195#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {19195#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:47:46,218 INFO L272 TraceCheckUtils]: 69: Hoare triple {19195#(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)); {18981#true} is VALID [2022-04-28 07:47:46,218 INFO L290 TraceCheckUtils]: 70: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,218 INFO L290 TraceCheckUtils]: 71: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,218 INFO L290 TraceCheckUtils]: 72: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,219 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {18981#true} {19195#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #54#return; {19195#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:47:46,219 INFO L290 TraceCheckUtils]: 74: Hoare triple {19195#(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; {19217#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:47:46,219 INFO L290 TraceCheckUtils]: 75: Hoare triple {19217#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {19217#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:47:46,219 INFO L272 TraceCheckUtils]: 76: Hoare triple {19217#(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)); {18981#true} is VALID [2022-04-28 07:47:46,220 INFO L290 TraceCheckUtils]: 77: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,220 INFO L290 TraceCheckUtils]: 78: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,220 INFO L290 TraceCheckUtils]: 79: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,222 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18981#true} {19217#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {19217#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:47:46,222 INFO L290 TraceCheckUtils]: 81: Hoare triple {19217#(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; {19239#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:47:46,223 INFO L290 TraceCheckUtils]: 82: Hoare triple {19239#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {19239#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:47:46,223 INFO L272 TraceCheckUtils]: 83: Hoare triple {19239#(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)); {18981#true} is VALID [2022-04-28 07:47:46,223 INFO L290 TraceCheckUtils]: 84: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,223 INFO L290 TraceCheckUtils]: 85: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,223 INFO L290 TraceCheckUtils]: 86: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,223 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {18981#true} {19239#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {19239#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:47:46,224 INFO L290 TraceCheckUtils]: 88: Hoare triple {19239#(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; {19261#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:47:46,224 INFO L290 TraceCheckUtils]: 89: Hoare triple {19261#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} assume !false; {19261#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:47:46,224 INFO L272 TraceCheckUtils]: 90: Hoare triple {19261#(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)); {18981#true} is VALID [2022-04-28 07:47:46,224 INFO L290 TraceCheckUtils]: 91: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,225 INFO L290 TraceCheckUtils]: 92: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,225 INFO L290 TraceCheckUtils]: 93: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,225 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {18981#true} {19261#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} #54#return; {19261#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:47:46,225 INFO L290 TraceCheckUtils]: 95: Hoare triple {19261#(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; {19283#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-28 07:47:46,226 INFO L290 TraceCheckUtils]: 96: Hoare triple {19283#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} assume !false; {19283#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-28 07:47:46,226 INFO L272 TraceCheckUtils]: 97: Hoare triple {19283#(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)); {18981#true} is VALID [2022-04-28 07:47:46,226 INFO L290 TraceCheckUtils]: 98: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,226 INFO L290 TraceCheckUtils]: 99: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,226 INFO L290 TraceCheckUtils]: 100: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,226 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {18981#true} {19283#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} #54#return; {19283#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-28 07:47:46,227 INFO L290 TraceCheckUtils]: 102: Hoare triple {19283#(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; {19305#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-28 07:47:46,227 INFO L290 TraceCheckUtils]: 103: Hoare triple {19305#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} assume !false; {19305#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-28 07:47:46,227 INFO L272 TraceCheckUtils]: 104: Hoare triple {19305#(and (= (+ main_~c~0 (- 3)) 10) (= 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)); {18981#true} is VALID [2022-04-28 07:47:46,227 INFO L290 TraceCheckUtils]: 105: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,227 INFO L290 TraceCheckUtils]: 106: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,228 INFO L290 TraceCheckUtils]: 107: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,228 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18981#true} {19305#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} #54#return; {19305#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-28 07:47:46,228 INFO L290 TraceCheckUtils]: 109: Hoare triple {19305#(and (= (+ main_~c~0 (- 3)) 10) (= 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; {19327#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:47:46,229 INFO L290 TraceCheckUtils]: 110: Hoare triple {19327#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} assume !false; {19327#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:47:46,229 INFO L272 TraceCheckUtils]: 111: Hoare triple {19327#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 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)); {18981#true} is VALID [2022-04-28 07:47:46,229 INFO L290 TraceCheckUtils]: 112: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,229 INFO L290 TraceCheckUtils]: 113: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,229 INFO L290 TraceCheckUtils]: 114: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,229 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {18981#true} {19327#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} #54#return; {19327#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:47:46,230 INFO L290 TraceCheckUtils]: 116: Hoare triple {19327#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 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; {19349#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:47:46,230 INFO L290 TraceCheckUtils]: 117: Hoare triple {19349#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {19349#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:47:46,230 INFO L272 TraceCheckUtils]: 118: Hoare triple {19349#(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)); {18981#true} is VALID [2022-04-28 07:47:46,230 INFO L290 TraceCheckUtils]: 119: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,230 INFO L290 TraceCheckUtils]: 120: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,231 INFO L290 TraceCheckUtils]: 121: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,231 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {18981#true} {19349#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {19349#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:47:46,231 INFO L290 TraceCheckUtils]: 123: Hoare triple {19349#(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; {19371#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:47:46,232 INFO L290 TraceCheckUtils]: 124: Hoare triple {19371#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {19371#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:47:46,232 INFO L272 TraceCheckUtils]: 125: Hoare triple {19371#(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)); {18981#true} is VALID [2022-04-28 07:47:46,232 INFO L290 TraceCheckUtils]: 126: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,232 INFO L290 TraceCheckUtils]: 127: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,232 INFO L290 TraceCheckUtils]: 128: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,232 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {18981#true} {19371#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {19371#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:47:46,233 INFO L290 TraceCheckUtils]: 130: Hoare triple {19371#(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; {19393#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:47:46,233 INFO L290 TraceCheckUtils]: 131: Hoare triple {19393#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {19393#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:47:46,233 INFO L272 TraceCheckUtils]: 132: Hoare triple {19393#(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)); {18981#true} is VALID [2022-04-28 07:47:46,233 INFO L290 TraceCheckUtils]: 133: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,233 INFO L290 TraceCheckUtils]: 134: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,233 INFO L290 TraceCheckUtils]: 135: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,234 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {18981#true} {19393#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {19393#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:47:46,234 INFO L290 TraceCheckUtils]: 137: Hoare triple {19393#(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; {19415#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:47:46,235 INFO L290 TraceCheckUtils]: 138: Hoare triple {19415#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !false; {19415#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:47:46,235 INFO L272 TraceCheckUtils]: 139: Hoare triple {19415#(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)); {18981#true} is VALID [2022-04-28 07:47:46,235 INFO L290 TraceCheckUtils]: 140: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,235 INFO L290 TraceCheckUtils]: 141: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,235 INFO L290 TraceCheckUtils]: 142: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,235 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {18981#true} {19415#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} #54#return; {19415#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:47:46,236 INFO L290 TraceCheckUtils]: 144: Hoare triple {19415#(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; {19437#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:46,236 INFO L290 TraceCheckUtils]: 145: Hoare triple {19437#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} assume !false; {19437#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:46,236 INFO L272 TraceCheckUtils]: 146: Hoare triple {19437#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 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)); {18981#true} is VALID [2022-04-28 07:47:46,236 INFO L290 TraceCheckUtils]: 147: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,236 INFO L290 TraceCheckUtils]: 148: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,237 INFO L290 TraceCheckUtils]: 149: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,239 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {18981#true} {19437#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} #54#return; {19437#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:46,240 INFO L290 TraceCheckUtils]: 151: Hoare triple {19437#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 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; {19459#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-28 07:47:46,241 INFO L290 TraceCheckUtils]: 152: Hoare triple {19459#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} assume !false; {19459#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-28 07:47:46,241 INFO L272 TraceCheckUtils]: 153: Hoare triple {19459#(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)); {18981#true} is VALID [2022-04-28 07:47:46,241 INFO L290 TraceCheckUtils]: 154: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,241 INFO L290 TraceCheckUtils]: 155: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,241 INFO L290 TraceCheckUtils]: 156: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,242 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {18981#true} {19459#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} #54#return; {19459#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-28 07:47:46,242 INFO L290 TraceCheckUtils]: 158: Hoare triple {19459#(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; {19481#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:46,243 INFO L290 TraceCheckUtils]: 159: Hoare triple {19481#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} assume !false; {19481#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:46,243 INFO L272 TraceCheckUtils]: 160: Hoare triple {19481#(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)); {18981#true} is VALID [2022-04-28 07:47:46,243 INFO L290 TraceCheckUtils]: 161: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,243 INFO L290 TraceCheckUtils]: 162: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,243 INFO L290 TraceCheckUtils]: 163: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,244 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {18981#true} {19481#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} #54#return; {19481#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:46,245 INFO L290 TraceCheckUtils]: 165: Hoare triple {19481#(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; {19503#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-28 07:47:46,245 INFO L290 TraceCheckUtils]: 166: Hoare triple {19503#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} assume !false; {19503#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-28 07:47:46,245 INFO L272 TraceCheckUtils]: 167: Hoare triple {19503#(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)); {18981#true} is VALID [2022-04-28 07:47:46,245 INFO L290 TraceCheckUtils]: 168: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,245 INFO L290 TraceCheckUtils]: 169: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,245 INFO L290 TraceCheckUtils]: 170: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,246 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {18981#true} {19503#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} #54#return; {19503#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-28 07:47:46,247 INFO L290 TraceCheckUtils]: 172: Hoare triple {19503#(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; {19525#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} is VALID [2022-04-28 07:47:46,247 INFO L290 TraceCheckUtils]: 173: Hoare triple {19525#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} assume !false; {19525#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} is VALID [2022-04-28 07:47:46,247 INFO L272 TraceCheckUtils]: 174: Hoare triple {19525#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 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)); {18981#true} is VALID [2022-04-28 07:47:46,247 INFO L290 TraceCheckUtils]: 175: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-28 07:47:46,247 INFO L290 TraceCheckUtils]: 176: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-28 07:47:46,248 INFO L290 TraceCheckUtils]: 177: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-28 07:47:46,248 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {18981#true} {19525#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} #54#return; {19525#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} is VALID [2022-04-28 07:47:46,251 INFO L290 TraceCheckUtils]: 179: Hoare triple {19525#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} assume !(~c~0 < ~k~0); {19547#(and (< 22 main_~k~0) (<= main_~k~0 23) (= (+ main_~y~0 (- 3)) 20))} is VALID [2022-04-28 07:47:46,252 INFO L272 TraceCheckUtils]: 180: Hoare triple {19547#(and (< 22 main_~k~0) (<= main_~k~0 23) (= (+ main_~y~0 (- 3)) 20))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19551#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:47:46,252 INFO L290 TraceCheckUtils]: 181: Hoare triple {19551#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19555#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:47:46,253 INFO L290 TraceCheckUtils]: 182: Hoare triple {19555#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18982#false} is VALID [2022-04-28 07:47:46,253 INFO L290 TraceCheckUtils]: 183: Hoare triple {18982#false} assume !false; {18982#false} is VALID [2022-04-28 07:47:46,254 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-28 07:47:46,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:47:46,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:47:46,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644054067] [2022-04-28 07:47:46,650 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:47:46,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574344297] [2022-04-28 07:47:46,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574344297] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:47:46,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:47:46,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2022-04-28 07:47:46,651 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:47:46,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [730156090] [2022-04-28 07:47:46,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [730156090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:47:46,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:47:46,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 07:47:46,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997934073] [2022-04-28 07:47:46,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:47:46,652 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) Word has length 184 [2022-04-28 07:47:46,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:47:46,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-28 07:47:46,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:47:46,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 07:47:46,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:47:46,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 07:47:46,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2022-04-28 07:47:46,887 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-28 07:47:56,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:56,904 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2022-04-28 07:47:56,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 07:47:56,904 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) Word has length 184 [2022-04-28 07:47:56,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:47:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-28 07:47:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2022-04-28 07:47:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-28 07:47:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2022-04-28 07:47:56,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 124 transitions. [2022-04-28 07:47:57,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:47:57,201 INFO L225 Difference]: With dead ends: 105 [2022-04-28 07:47:57,201 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 07:47:57,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 07:47:57,202 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 07:47:57,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1193 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 07:47:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 07:47:57,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-28 07:47:57,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:47:57,333 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), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 07:47:57,333 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), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 07:47:57,333 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), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 07:47:57,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:57,335 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-28 07:47:57,335 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-28 07:47:57,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:47:57,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:47:57,336 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), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 100 states. [2022-04-28 07:47:57,336 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), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 100 states. [2022-04-28 07:47:57,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:57,338 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-28 07:47:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-28 07:47:57,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:47:57,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:47:57,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:47:57,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:47:57,339 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), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 07:47:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2022-04-28 07:47:57,342 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 184 [2022-04-28 07:47:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:47:57,342 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2022-04-28 07:47:57,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-28 07:47:57,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 123 transitions. [2022-04-28 07:47:58,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:47:58,180 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-28 07:47:58,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-04-28 07:47:58,181 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:47:58,181 INFO L195 NwaCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:47:58,188 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-28 07:47:58,381 WARN L477 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-28 07:47:58,381 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:47:58,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:47:58,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1007212713, now seen corresponding path program 47 times [2022-04-28 07:47:58,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:47:58,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [882716417] [2022-04-28 07:47:58,460 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:47:58,460 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:47:58,460 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:47:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1007212713, now seen corresponding path program 48 times [2022-04-28 07:47:58,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:47:58,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130733922] [2022-04-28 07:47:58,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:47:58,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:47:58,476 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:47:58,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [98687607] [2022-04-28 07:47:58,476 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:47:58,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:47:58,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:47:58,477 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-28 07:47:58,478 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-28 07:47:59,343 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-28 07:47:59,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:47:59,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-28 07:47:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:47:59,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:48:00,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {20217#true} call ULTIMATE.init(); {20217#true} is VALID [2022-04-28 07:48:00,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {20217#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); {20217#true} is VALID [2022-04-28 07:48:00,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20217#true} {20217#true} #60#return; {20217#true} is VALID [2022-04-28 07:48:00,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {20217#true} call #t~ret5 := main(); {20217#true} is VALID [2022-04-28 07:48:00,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {20217#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; {20217#true} is VALID [2022-04-28 07:48:00,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {20217#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {20217#true} is VALID [2022-04-28 07:48:00,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,446 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20217#true} {20217#true} #52#return; {20217#true} is VALID [2022-04-28 07:48:00,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {20217#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {20255#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:48:00,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {20255#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {20255#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:48:00,446 INFO L272 TraceCheckUtils]: 13: Hoare triple {20255#(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)); {20217#true} is VALID [2022-04-28 07:48:00,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,447 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20217#true} {20255#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {20255#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:48:00,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {20255#(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; {20277#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:48:00,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {20277#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {20277#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:48:00,448 INFO L272 TraceCheckUtils]: 20: Hoare triple {20277#(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)); {20217#true} is VALID [2022-04-28 07:48:00,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,449 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {20217#true} {20277#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {20277#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:48:00,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {20277#(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; {20299#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:48:00,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {20299#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {20299#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:48:00,450 INFO L272 TraceCheckUtils]: 27: Hoare triple {20299#(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)); {20217#true} is VALID [2022-04-28 07:48:00,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,450 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20217#true} {20299#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {20299#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:48:00,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {20299#(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; {20321#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:48:00,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {20321#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !false; {20321#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:48:00,451 INFO L272 TraceCheckUtils]: 34: Hoare triple {20321#(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)); {20217#true} is VALID [2022-04-28 07:48:00,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,452 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20217#true} {20321#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #54#return; {20321#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:48:00,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {20321#(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; {20343#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:48:00,452 INFO L290 TraceCheckUtils]: 40: Hoare triple {20343#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !false; {20343#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:48:00,453 INFO L272 TraceCheckUtils]: 41: Hoare triple {20343#(and (= (+ main_~c~0 (- 3)) 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)); {20217#true} is VALID [2022-04-28 07:48:00,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,453 INFO L290 TraceCheckUtils]: 43: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,453 INFO L290 TraceCheckUtils]: 44: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,453 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20217#true} {20343#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #54#return; {20343#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:48:00,454 INFO L290 TraceCheckUtils]: 46: Hoare triple {20343#(and (= (+ main_~c~0 (- 3)) 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; {20365#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:48:00,454 INFO L290 TraceCheckUtils]: 47: Hoare triple {20365#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {20365#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:48:00,454 INFO L272 TraceCheckUtils]: 48: Hoare triple {20365#(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)); {20217#true} is VALID [2022-04-28 07:48:00,454 INFO L290 TraceCheckUtils]: 49: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,454 INFO L290 TraceCheckUtils]: 50: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,454 INFO L290 TraceCheckUtils]: 51: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,455 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20217#true} {20365#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {20365#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:48:00,456 INFO L290 TraceCheckUtils]: 53: Hoare triple {20365#(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; {20387#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:48:00,456 INFO L290 TraceCheckUtils]: 54: Hoare triple {20387#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {20387#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:48:00,456 INFO L272 TraceCheckUtils]: 55: Hoare triple {20387#(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)); {20217#true} is VALID [2022-04-28 07:48:00,457 INFO L290 TraceCheckUtils]: 56: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,457 INFO L290 TraceCheckUtils]: 57: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,457 INFO L290 TraceCheckUtils]: 58: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,457 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20217#true} {20387#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {20387#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:48:00,458 INFO L290 TraceCheckUtils]: 60: Hoare triple {20387#(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; {20409#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:48:00,458 INFO L290 TraceCheckUtils]: 61: Hoare triple {20409#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {20409#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:48:00,458 INFO L272 TraceCheckUtils]: 62: Hoare triple {20409#(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)); {20217#true} is VALID [2022-04-28 07:48:00,459 INFO L290 TraceCheckUtils]: 63: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,459 INFO L290 TraceCheckUtils]: 64: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,459 INFO L290 TraceCheckUtils]: 65: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,459 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20217#true} {20409#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {20409#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:48:00,460 INFO L290 TraceCheckUtils]: 67: Hoare triple {20409#(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; {20431#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:48:00,460 INFO L290 TraceCheckUtils]: 68: Hoare triple {20431#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {20431#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:48:00,461 INFO L272 TraceCheckUtils]: 69: Hoare triple {20431#(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)); {20217#true} is VALID [2022-04-28 07:48:00,461 INFO L290 TraceCheckUtils]: 70: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,461 INFO L290 TraceCheckUtils]: 71: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,461 INFO L290 TraceCheckUtils]: 72: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,461 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20217#true} {20431#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #54#return; {20431#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:48:00,462 INFO L290 TraceCheckUtils]: 74: Hoare triple {20431#(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; {20453#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:48:00,462 INFO L290 TraceCheckUtils]: 75: Hoare triple {20453#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {20453#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:48:00,463 INFO L272 TraceCheckUtils]: 76: Hoare triple {20453#(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)); {20217#true} is VALID [2022-04-28 07:48:00,463 INFO L290 TraceCheckUtils]: 77: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,463 INFO L290 TraceCheckUtils]: 78: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,463 INFO L290 TraceCheckUtils]: 79: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,463 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {20217#true} {20453#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {20453#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:48:00,464 INFO L290 TraceCheckUtils]: 81: Hoare triple {20453#(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; {20475#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:48:00,464 INFO L290 TraceCheckUtils]: 82: Hoare triple {20475#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {20475#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:48:00,465 INFO L272 TraceCheckUtils]: 83: Hoare triple {20475#(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)); {20217#true} is VALID [2022-04-28 07:48:00,465 INFO L290 TraceCheckUtils]: 84: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,465 INFO L290 TraceCheckUtils]: 85: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,465 INFO L290 TraceCheckUtils]: 86: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,465 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {20217#true} {20475#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {20475#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:48:00,466 INFO L290 TraceCheckUtils]: 88: Hoare triple {20475#(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; {20497#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:48:00,466 INFO L290 TraceCheckUtils]: 89: Hoare triple {20497#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {20497#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:48:00,466 INFO L272 TraceCheckUtils]: 90: Hoare triple {20497#(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)); {20217#true} is VALID [2022-04-28 07:48:00,466 INFO L290 TraceCheckUtils]: 91: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,466 INFO L290 TraceCheckUtils]: 92: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,466 INFO L290 TraceCheckUtils]: 93: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,467 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {20217#true} {20497#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #54#return; {20497#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:48:00,467 INFO L290 TraceCheckUtils]: 95: Hoare triple {20497#(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; {20519#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:48:00,467 INFO L290 TraceCheckUtils]: 96: Hoare triple {20519#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {20519#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:48:00,468 INFO L272 TraceCheckUtils]: 97: Hoare triple {20519#(and (= main_~y~0 12) (= (+ (- 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)); {20217#true} is VALID [2022-04-28 07:48:00,468 INFO L290 TraceCheckUtils]: 98: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,468 INFO L290 TraceCheckUtils]: 99: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,468 INFO L290 TraceCheckUtils]: 100: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,468 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {20217#true} {20519#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {20519#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:48:00,469 INFO L290 TraceCheckUtils]: 102: Hoare triple {20519#(and (= main_~y~0 12) (= (+ (- 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; {20541#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:00,469 INFO L290 TraceCheckUtils]: 103: Hoare triple {20541#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} assume !false; {20541#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:00,469 INFO L272 TraceCheckUtils]: 104: Hoare triple {20541#(and (= 11 (+ (- 2) main_~c~0)) (= 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)); {20217#true} is VALID [2022-04-28 07:48:00,469 INFO L290 TraceCheckUtils]: 105: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,469 INFO L290 TraceCheckUtils]: 106: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,469 INFO L290 TraceCheckUtils]: 107: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,470 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {20217#true} {20541#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} #54#return; {20541#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:00,470 INFO L290 TraceCheckUtils]: 109: Hoare triple {20541#(and (= 11 (+ (- 2) main_~c~0)) (= 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; {20563#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-28 07:48:00,470 INFO L290 TraceCheckUtils]: 110: Hoare triple {20563#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} assume !false; {20563#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-28 07:48:00,470 INFO L272 TraceCheckUtils]: 111: Hoare triple {20563#(and (= (+ (- 2) main_~y~0) 12) (= (+ 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)); {20217#true} is VALID [2022-04-28 07:48:00,471 INFO L290 TraceCheckUtils]: 112: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,471 INFO L290 TraceCheckUtils]: 113: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,471 INFO L290 TraceCheckUtils]: 114: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,471 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {20217#true} {20563#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} #54#return; {20563#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-28 07:48:00,472 INFO L290 TraceCheckUtils]: 116: Hoare triple {20563#(and (= (+ (- 2) main_~y~0) 12) (= (+ 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; {20585#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:48:00,472 INFO L290 TraceCheckUtils]: 117: Hoare triple {20585#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {20585#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:48:00,472 INFO L272 TraceCheckUtils]: 118: Hoare triple {20585#(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)); {20217#true} is VALID [2022-04-28 07:48:00,472 INFO L290 TraceCheckUtils]: 119: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,472 INFO L290 TraceCheckUtils]: 120: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,472 INFO L290 TraceCheckUtils]: 121: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,473 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {20217#true} {20585#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {20585#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:48:00,473 INFO L290 TraceCheckUtils]: 123: Hoare triple {20585#(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; {20607#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:00,474 INFO L290 TraceCheckUtils]: 124: Hoare triple {20607#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {20607#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:00,474 INFO L272 TraceCheckUtils]: 125: Hoare triple {20607#(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)); {20217#true} is VALID [2022-04-28 07:48:00,474 INFO L290 TraceCheckUtils]: 126: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,474 INFO L290 TraceCheckUtils]: 127: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,474 INFO L290 TraceCheckUtils]: 128: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,475 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {20217#true} {20607#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #54#return; {20607#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:00,475 INFO L290 TraceCheckUtils]: 130: Hoare triple {20607#(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; {20629#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:48:00,476 INFO L290 TraceCheckUtils]: 131: Hoare triple {20629#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {20629#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:48:00,476 INFO L272 TraceCheckUtils]: 132: Hoare triple {20629#(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)); {20217#true} is VALID [2022-04-28 07:48:00,476 INFO L290 TraceCheckUtils]: 133: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,476 INFO L290 TraceCheckUtils]: 134: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,476 INFO L290 TraceCheckUtils]: 135: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,476 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {20217#true} {20629#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {20629#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:48:00,477 INFO L290 TraceCheckUtils]: 137: Hoare triple {20629#(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; {20651#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:48:00,477 INFO L290 TraceCheckUtils]: 138: Hoare triple {20651#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} assume !false; {20651#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:48:00,478 INFO L272 TraceCheckUtils]: 139: Hoare triple {20651#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 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)); {20217#true} is VALID [2022-04-28 07:48:00,478 INFO L290 TraceCheckUtils]: 140: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,478 INFO L290 TraceCheckUtils]: 141: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,478 INFO L290 TraceCheckUtils]: 142: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,478 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {20217#true} {20651#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} #54#return; {20651#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:48:00,479 INFO L290 TraceCheckUtils]: 144: Hoare triple {20651#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 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; {20673#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:48:00,479 INFO L290 TraceCheckUtils]: 145: Hoare triple {20673#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {20673#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:48:00,479 INFO L272 TraceCheckUtils]: 146: Hoare triple {20673#(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)); {20217#true} is VALID [2022-04-28 07:48:00,480 INFO L290 TraceCheckUtils]: 147: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,480 INFO L290 TraceCheckUtils]: 148: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,480 INFO L290 TraceCheckUtils]: 149: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,480 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {20217#true} {20673#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {20673#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:48:00,481 INFO L290 TraceCheckUtils]: 151: Hoare triple {20673#(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; {20695#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-28 07:48:00,481 INFO L290 TraceCheckUtils]: 152: Hoare triple {20695#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} assume !false; {20695#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-28 07:48:00,481 INFO L272 TraceCheckUtils]: 153: Hoare triple {20695#(and (= 19 (+ (- 1) main_~y~0)) (= 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)); {20217#true} is VALID [2022-04-28 07:48:00,481 INFO L290 TraceCheckUtils]: 154: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,481 INFO L290 TraceCheckUtils]: 155: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,481 INFO L290 TraceCheckUtils]: 156: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,482 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {20217#true} {20695#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} #54#return; {20695#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-28 07:48:00,482 INFO L290 TraceCheckUtils]: 158: Hoare triple {20695#(and (= 19 (+ (- 1) main_~y~0)) (= 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; {20717#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-28 07:48:00,483 INFO L290 TraceCheckUtils]: 159: Hoare triple {20717#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} assume !false; {20717#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-28 07:48:00,483 INFO L272 TraceCheckUtils]: 160: Hoare triple {20717#(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)); {20217#true} is VALID [2022-04-28 07:48:00,483 INFO L290 TraceCheckUtils]: 161: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,483 INFO L290 TraceCheckUtils]: 162: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,483 INFO L290 TraceCheckUtils]: 163: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,483 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {20217#true} {20717#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} #54#return; {20717#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-28 07:48:00,484 INFO L290 TraceCheckUtils]: 165: Hoare triple {20717#(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; {20739#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:48:00,484 INFO L290 TraceCheckUtils]: 166: Hoare triple {20739#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} assume !false; {20739#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:48:00,484 INFO L272 TraceCheckUtils]: 167: Hoare triple {20739#(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)); {20217#true} is VALID [2022-04-28 07:48:00,484 INFO L290 TraceCheckUtils]: 168: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,484 INFO L290 TraceCheckUtils]: 169: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,485 INFO L290 TraceCheckUtils]: 170: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,485 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {20217#true} {20739#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} #54#return; {20739#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:48:00,485 INFO L290 TraceCheckUtils]: 172: Hoare triple {20739#(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; {20761#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:00,486 INFO L290 TraceCheckUtils]: 173: Hoare triple {20761#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} assume !false; {20761#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:00,486 INFO L272 TraceCheckUtils]: 174: Hoare triple {20761#(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)); {20217#true} is VALID [2022-04-28 07:48:00,486 INFO L290 TraceCheckUtils]: 175: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,486 INFO L290 TraceCheckUtils]: 176: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,486 INFO L290 TraceCheckUtils]: 177: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,487 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {20217#true} {20761#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} #54#return; {20761#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:00,487 INFO L290 TraceCheckUtils]: 179: Hoare triple {20761#(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; {20783#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-28 07:48:00,487 INFO L290 TraceCheckUtils]: 180: Hoare triple {20783#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} assume !false; {20783#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-28 07:48:00,488 INFO L272 TraceCheckUtils]: 181: Hoare triple {20783#(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)); {20217#true} is VALID [2022-04-28 07:48:00,488 INFO L290 TraceCheckUtils]: 182: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-28 07:48:00,488 INFO L290 TraceCheckUtils]: 183: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-28 07:48:00,488 INFO L290 TraceCheckUtils]: 184: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-28 07:48:00,488 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {20217#true} {20783#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} #54#return; {20783#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-28 07:48:00,490 INFO L290 TraceCheckUtils]: 186: Hoare triple {20783#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} assume !(~c~0 < ~k~0); {20805#(and (<= main_~k~0 24) (< 23 main_~k~0) (= main_~y~0 24))} is VALID [2022-04-28 07:48:00,490 INFO L272 TraceCheckUtils]: 187: Hoare triple {20805#(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)); {20809#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:48:00,491 INFO L290 TraceCheckUtils]: 188: Hoare triple {20809#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20813#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:48:00,491 INFO L290 TraceCheckUtils]: 189: Hoare triple {20813#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20218#false} is VALID [2022-04-28 07:48:00,491 INFO L290 TraceCheckUtils]: 190: Hoare triple {20218#false} assume !false; {20218#false} is VALID [2022-04-28 07:48:00,492 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-28 07:48:00,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:48:00,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:48:00,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130733922] [2022-04-28 07:48:00,930 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:48:00,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98687607] [2022-04-28 07:48:00,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98687607] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:48:00,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:48:00,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2022-04-28 07:48:00,931 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:48:00,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [882716417] [2022-04-28 07:48:00,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [882716417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:48:00,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:48:00,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 07:48:00,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94383436] [2022-04-28 07:48:00,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:48:00,932 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) Word has length 191 [2022-04-28 07:48:00,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:48:00,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-28 07:48:01,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:48:01,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 07:48:01,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:48:01,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 07:48:01,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 07:48:01,232 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-28 07:48:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:48:13,045 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2022-04-28 07:48:13,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 07:48:13,046 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) Word has length 191 [2022-04-28 07:48:13,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:48:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-28 07:48:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 128 transitions. [2022-04-28 07:48:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-28 07:48:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 128 transitions. [2022-04-28 07:48:13,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 128 transitions. [2022-04-28 07:48:13,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:48:13,367 INFO L225 Difference]: With dead ends: 108 [2022-04-28 07:48:13,367 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 07:48:13,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 07:48:13,368 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 2167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-28 07:48:13,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1265 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2167 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-04-28 07:48:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 07:48:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-28 07:48:13,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:48:13,498 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), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 07:48:13,498 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), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 07:48:13,499 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), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 07:48:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:48:13,501 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-28 07:48:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-28 07:48:13,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:48:13,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:48:13,502 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), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 103 states. [2022-04-28 07:48:13,502 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), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 103 states. [2022-04-28 07:48:13,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:48:13,504 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-28 07:48:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-28 07:48:13,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:48:13,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:48:13,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:48:13,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:48:13,505 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), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 07:48:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2022-04-28 07:48:13,508 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 191 [2022-04-28 07:48:13,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:48:13,508 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2022-04-28 07:48:13,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-28 07:48:13,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 127 transitions. [2022-04-28 07:48:14,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:48:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-28 07:48:14,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-04-28 07:48:14,456 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:48:14,456 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:48:14,467 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-28 07:48:14,664 WARN L477 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-28 07:48:14,664 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:48:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:48:14,664 INFO L85 PathProgramCache]: Analyzing trace with hash 447117384, now seen corresponding path program 49 times [2022-04-28 07:48:14,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:48:14,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1615623563] [2022-04-28 07:48:14,759 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:48:14,759 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:48:14,760 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:48:14,760 INFO L85 PathProgramCache]: Analyzing trace with hash 447117384, now seen corresponding path program 50 times [2022-04-28 07:48:14,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:48:14,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869156209] [2022-04-28 07:48:14,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:48:14,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:48:14,782 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:48:14,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1251187161] [2022-04-28 07:48:14,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:48:14,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:48:14,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:48:14,784 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-28 07:48:14,786 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-28 07:48:16,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:48:16,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:48:16,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-28 07:48:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:48:16,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:48:17,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {21493#true} call ULTIMATE.init(); {21493#true} is VALID [2022-04-28 07:48:17,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {21493#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); {21493#true} is VALID [2022-04-28 07:48:17,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21493#true} {21493#true} #60#return; {21493#true} is VALID [2022-04-28 07:48:17,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {21493#true} call #t~ret5 := main(); {21493#true} is VALID [2022-04-28 07:48:17,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {21493#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; {21493#true} is VALID [2022-04-28 07:48:17,218 INFO L272 TraceCheckUtils]: 6: Hoare triple {21493#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {21493#true} is VALID [2022-04-28 07:48:17,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,218 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21493#true} {21493#true} #52#return; {21493#true} is VALID [2022-04-28 07:48:17,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {21493#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {21531#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:48:17,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {21531#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {21531#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:48:17,219 INFO L272 TraceCheckUtils]: 13: Hoare triple {21531#(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)); {21493#true} is VALID [2022-04-28 07:48:17,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,227 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21493#true} {21531#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {21531#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:48:17,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {21531#(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; {21553#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:48:17,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {21553#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {21553#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:48:17,229 INFO L272 TraceCheckUtils]: 20: Hoare triple {21553#(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)); {21493#true} is VALID [2022-04-28 07:48:17,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,230 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {21493#true} {21553#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {21553#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:48:17,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {21553#(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; {21575#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:48:17,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {21575#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {21575#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:48:17,231 INFO L272 TraceCheckUtils]: 27: Hoare triple {21575#(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)); {21493#true} is VALID [2022-04-28 07:48:17,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,232 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21493#true} {21575#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {21575#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:48:17,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {21575#(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; {21597#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:48:17,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {21597#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {21597#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:48:17,233 INFO L272 TraceCheckUtils]: 34: Hoare triple {21597#(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)); {21493#true} is VALID [2022-04-28 07:48:17,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,234 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21493#true} {21597#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {21597#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:48:17,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {21597#(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; {21619#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:17,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {21619#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {21619#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:17,235 INFO L272 TraceCheckUtils]: 41: Hoare triple {21619#(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)); {21493#true} is VALID [2022-04-28 07:48:17,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,236 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {21493#true} {21619#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {21619#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:17,236 INFO L290 TraceCheckUtils]: 46: Hoare triple {21619#(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; {21641#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:48:17,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {21641#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} assume !false; {21641#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:48:17,237 INFO L272 TraceCheckUtils]: 48: Hoare triple {21641#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 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)); {21493#true} is VALID [2022-04-28 07:48:17,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,237 INFO L290 TraceCheckUtils]: 50: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,237 INFO L290 TraceCheckUtils]: 51: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,237 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21493#true} {21641#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} #54#return; {21641#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:48:17,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {21641#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 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; {21663#(and (= (+ main_~c~0 (- 3)) 3) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-28 07:48:17,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {21663#(and (= (+ main_~c~0 (- 3)) 3) (= (+ main_~y~0 (- 3)) 3))} assume !false; {21663#(and (= (+ main_~c~0 (- 3)) 3) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-28 07:48:17,238 INFO L272 TraceCheckUtils]: 55: Hoare triple {21663#(and (= (+ main_~c~0 (- 3)) 3) (= (+ main_~y~0 (- 3)) 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)); {21493#true} is VALID [2022-04-28 07:48:17,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,239 INFO L290 TraceCheckUtils]: 57: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,239 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21493#true} {21663#(and (= (+ main_~c~0 (- 3)) 3) (= (+ main_~y~0 (- 3)) 3))} #54#return; {21663#(and (= (+ main_~c~0 (- 3)) 3) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-28 07:48:17,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {21663#(and (= (+ main_~c~0 (- 3)) 3) (= (+ main_~y~0 (- 3)) 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; {21685#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-28 07:48:17,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {21685#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} assume !false; {21685#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-28 07:48:17,240 INFO L272 TraceCheckUtils]: 62: Hoare triple {21685#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 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)); {21493#true} is VALID [2022-04-28 07:48:17,240 INFO L290 TraceCheckUtils]: 63: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,241 INFO L290 TraceCheckUtils]: 64: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,241 INFO L290 TraceCheckUtils]: 65: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,241 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {21493#true} {21685#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} #54#return; {21685#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-28 07:48:17,242 INFO L290 TraceCheckUtils]: 67: Hoare triple {21685#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 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; {21707#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:48:17,242 INFO L290 TraceCheckUtils]: 68: Hoare triple {21707#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {21707#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:48:17,242 INFO L272 TraceCheckUtils]: 69: Hoare triple {21707#(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)); {21493#true} is VALID [2022-04-28 07:48:17,242 INFO L290 TraceCheckUtils]: 70: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,242 INFO L290 TraceCheckUtils]: 71: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,243 INFO L290 TraceCheckUtils]: 72: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,243 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {21493#true} {21707#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {21707#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:48:17,244 INFO L290 TraceCheckUtils]: 74: Hoare triple {21707#(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; {21729#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:48:17,244 INFO L290 TraceCheckUtils]: 75: Hoare triple {21729#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {21729#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:48:17,244 INFO L272 TraceCheckUtils]: 76: Hoare triple {21729#(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)); {21493#true} is VALID [2022-04-28 07:48:17,244 INFO L290 TraceCheckUtils]: 77: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,244 INFO L290 TraceCheckUtils]: 78: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,244 INFO L290 TraceCheckUtils]: 79: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,245 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {21493#true} {21729#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {21729#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:48:17,245 INFO L290 TraceCheckUtils]: 81: Hoare triple {21729#(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; {21751#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:48:17,246 INFO L290 TraceCheckUtils]: 82: Hoare triple {21751#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {21751#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:48:17,246 INFO L272 TraceCheckUtils]: 83: Hoare triple {21751#(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)); {21493#true} is VALID [2022-04-28 07:48:17,246 INFO L290 TraceCheckUtils]: 84: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,246 INFO L290 TraceCheckUtils]: 85: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,246 INFO L290 TraceCheckUtils]: 86: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,247 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {21493#true} {21751#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #54#return; {21751#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:48:17,247 INFO L290 TraceCheckUtils]: 88: Hoare triple {21751#(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; {21773#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:48:17,248 INFO L290 TraceCheckUtils]: 89: Hoare triple {21773#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {21773#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:48:17,248 INFO L272 TraceCheckUtils]: 90: Hoare triple {21773#(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)); {21493#true} is VALID [2022-04-28 07:48:17,248 INFO L290 TraceCheckUtils]: 91: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,248 INFO L290 TraceCheckUtils]: 92: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,248 INFO L290 TraceCheckUtils]: 93: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,249 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21493#true} {21773#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {21773#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:48:17,249 INFO L290 TraceCheckUtils]: 95: Hoare triple {21773#(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; {21795#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:48:17,249 INFO L290 TraceCheckUtils]: 96: Hoare triple {21795#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {21795#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:48:17,250 INFO L272 TraceCheckUtils]: 97: Hoare triple {21795#(and (= main_~y~0 12) (= (+ (- 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)); {21493#true} is VALID [2022-04-28 07:48:17,250 INFO L290 TraceCheckUtils]: 98: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,250 INFO L290 TraceCheckUtils]: 99: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,250 INFO L290 TraceCheckUtils]: 100: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,250 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {21493#true} {21795#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {21795#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:48:17,251 INFO L290 TraceCheckUtils]: 102: Hoare triple {21795#(and (= main_~y~0 12) (= (+ (- 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; {21817#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:48:17,251 INFO L290 TraceCheckUtils]: 103: Hoare triple {21817#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {21817#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:48:17,251 INFO L272 TraceCheckUtils]: 104: Hoare triple {21817#(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)); {21493#true} is VALID [2022-04-28 07:48:17,251 INFO L290 TraceCheckUtils]: 105: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,251 INFO L290 TraceCheckUtils]: 106: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,251 INFO L290 TraceCheckUtils]: 107: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,252 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {21493#true} {21817#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {21817#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:48:17,252 INFO L290 TraceCheckUtils]: 109: Hoare triple {21817#(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; {21839#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:48:17,252 INFO L290 TraceCheckUtils]: 110: Hoare triple {21839#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {21839#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:48:17,252 INFO L272 TraceCheckUtils]: 111: Hoare triple {21839#(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)); {21493#true} is VALID [2022-04-28 07:48:17,253 INFO L290 TraceCheckUtils]: 112: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,253 INFO L290 TraceCheckUtils]: 113: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,253 INFO L290 TraceCheckUtils]: 114: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,253 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {21493#true} {21839#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #54#return; {21839#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:48:17,254 INFO L290 TraceCheckUtils]: 116: Hoare triple {21839#(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; {21861#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:48:17,254 INFO L290 TraceCheckUtils]: 117: Hoare triple {21861#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} assume !false; {21861#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:48:17,254 INFO L272 TraceCheckUtils]: 118: Hoare triple {21861#(and (= 14 (+ (- 1) main_~y~0)) (= 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)); {21493#true} is VALID [2022-04-28 07:48:17,254 INFO L290 TraceCheckUtils]: 119: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,254 INFO L290 TraceCheckUtils]: 120: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,254 INFO L290 TraceCheckUtils]: 121: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,255 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {21493#true} {21861#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} #54#return; {21861#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:48:17,255 INFO L290 TraceCheckUtils]: 123: Hoare triple {21861#(and (= 14 (+ (- 1) main_~y~0)) (= 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; {21883#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-28 07:48:17,255 INFO L290 TraceCheckUtils]: 124: Hoare triple {21883#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} assume !false; {21883#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-28 07:48:17,255 INFO L272 TraceCheckUtils]: 125: Hoare triple {21883#(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)); {21493#true} is VALID [2022-04-28 07:48:17,255 INFO L290 TraceCheckUtils]: 126: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,256 INFO L290 TraceCheckUtils]: 127: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,256 INFO L290 TraceCheckUtils]: 128: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,256 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {21493#true} {21883#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} #54#return; {21883#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-28 07:48:17,256 INFO L290 TraceCheckUtils]: 130: Hoare triple {21883#(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; {21905#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:48:17,257 INFO L290 TraceCheckUtils]: 131: Hoare triple {21905#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {21905#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:48:17,257 INFO L272 TraceCheckUtils]: 132: Hoare triple {21905#(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)); {21493#true} is VALID [2022-04-28 07:48:17,257 INFO L290 TraceCheckUtils]: 133: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,257 INFO L290 TraceCheckUtils]: 134: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,257 INFO L290 TraceCheckUtils]: 135: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,257 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {21493#true} {21905#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {21905#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:48:17,258 INFO L290 TraceCheckUtils]: 137: Hoare triple {21905#(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; {21927#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:48:17,258 INFO L290 TraceCheckUtils]: 138: Hoare triple {21927#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {21927#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:48:17,258 INFO L272 TraceCheckUtils]: 139: Hoare triple {21927#(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)); {21493#true} is VALID [2022-04-28 07:48:17,258 INFO L290 TraceCheckUtils]: 140: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,258 INFO L290 TraceCheckUtils]: 141: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,259 INFO L290 TraceCheckUtils]: 142: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,259 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {21493#true} {21927#(and (= main_~c~0 18) (= main_~y~0 18))} #54#return; {21927#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:48:17,259 INFO L290 TraceCheckUtils]: 144: Hoare triple {21927#(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; {21949#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-28 07:48:17,260 INFO L290 TraceCheckUtils]: 145: Hoare triple {21949#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !false; {21949#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-28 07:48:17,260 INFO L272 TraceCheckUtils]: 146: Hoare triple {21949#(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)); {21493#true} is VALID [2022-04-28 07:48:17,260 INFO L290 TraceCheckUtils]: 147: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,260 INFO L290 TraceCheckUtils]: 148: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,260 INFO L290 TraceCheckUtils]: 149: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,260 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {21493#true} {21949#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} #54#return; {21949#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-28 07:48:17,261 INFO L290 TraceCheckUtils]: 151: Hoare triple {21949#(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; {21971#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} is VALID [2022-04-28 07:48:17,261 INFO L290 TraceCheckUtils]: 152: Hoare triple {21971#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} assume !false; {21971#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} is VALID [2022-04-28 07:48:17,261 INFO L272 TraceCheckUtils]: 153: Hoare triple {21971#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) 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)); {21493#true} is VALID [2022-04-28 07:48:17,261 INFO L290 TraceCheckUtils]: 154: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,261 INFO L290 TraceCheckUtils]: 155: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,261 INFO L290 TraceCheckUtils]: 156: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,262 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {21493#true} {21971#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} #54#return; {21971#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} is VALID [2022-04-28 07:48:17,262 INFO L290 TraceCheckUtils]: 158: Hoare triple {21971#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) 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; {21993#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-28 07:48:17,263 INFO L290 TraceCheckUtils]: 159: Hoare triple {21993#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {21993#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-28 07:48:17,263 INFO L272 TraceCheckUtils]: 160: Hoare triple {21993#(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)); {21493#true} is VALID [2022-04-28 07:48:17,263 INFO L290 TraceCheckUtils]: 161: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,263 INFO L290 TraceCheckUtils]: 162: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,263 INFO L290 TraceCheckUtils]: 163: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,263 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {21493#true} {21993#(and (= main_~c~0 21) (= main_~y~0 21))} #54#return; {21993#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-28 07:48:17,264 INFO L290 TraceCheckUtils]: 165: Hoare triple {21993#(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; {22015#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:48:17,264 INFO L290 TraceCheckUtils]: 166: Hoare triple {22015#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} assume !false; {22015#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:48:17,264 INFO L272 TraceCheckUtils]: 167: Hoare triple {22015#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 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)); {21493#true} is VALID [2022-04-28 07:48:17,264 INFO L290 TraceCheckUtils]: 168: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,264 INFO L290 TraceCheckUtils]: 169: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,264 INFO L290 TraceCheckUtils]: 170: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,265 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {21493#true} {22015#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} #54#return; {22015#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:48:17,265 INFO L290 TraceCheckUtils]: 172: Hoare triple {22015#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 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; {22037#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:48:17,266 INFO L290 TraceCheckUtils]: 173: Hoare triple {22037#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {22037#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:48:17,266 INFO L272 TraceCheckUtils]: 174: Hoare triple {22037#(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)); {21493#true} is VALID [2022-04-28 07:48:17,266 INFO L290 TraceCheckUtils]: 175: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,266 INFO L290 TraceCheckUtils]: 176: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,266 INFO L290 TraceCheckUtils]: 177: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,266 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {21493#true} {22037#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {22037#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:48:17,267 INFO L290 TraceCheckUtils]: 179: Hoare triple {22037#(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; {22059#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:48:17,267 INFO L290 TraceCheckUtils]: 180: Hoare triple {22059#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} assume !false; {22059#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:48:17,267 INFO L272 TraceCheckUtils]: 181: Hoare triple {22059#(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)); {21493#true} is VALID [2022-04-28 07:48:17,267 INFO L290 TraceCheckUtils]: 182: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,267 INFO L290 TraceCheckUtils]: 183: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,267 INFO L290 TraceCheckUtils]: 184: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,268 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {21493#true} {22059#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} #54#return; {22059#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:48:17,268 INFO L290 TraceCheckUtils]: 186: Hoare triple {22059#(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; {22081#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} is VALID [2022-04-28 07:48:17,268 INFO L290 TraceCheckUtils]: 187: Hoare triple {22081#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} assume !false; {22081#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} is VALID [2022-04-28 07:48:17,269 INFO L272 TraceCheckUtils]: 188: Hoare triple {22081#(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)); {21493#true} is VALID [2022-04-28 07:48:17,269 INFO L290 TraceCheckUtils]: 189: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-28 07:48:17,269 INFO L290 TraceCheckUtils]: 190: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-28 07:48:17,269 INFO L290 TraceCheckUtils]: 191: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-28 07:48:17,269 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {21493#true} {22081#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} #54#return; {22081#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} is VALID [2022-04-28 07:48:17,272 INFO L290 TraceCheckUtils]: 193: Hoare triple {22081#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} assume !(~c~0 < ~k~0); {22103#(and (<= main_~k~0 25) (< 24 main_~k~0) (= main_~y~0 25))} is VALID [2022-04-28 07:48:17,272 INFO L272 TraceCheckUtils]: 194: Hoare triple {22103#(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)); {22107#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:48:17,273 INFO L290 TraceCheckUtils]: 195: Hoare triple {22107#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22111#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:48:17,273 INFO L290 TraceCheckUtils]: 196: Hoare triple {22111#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21494#false} is VALID [2022-04-28 07:48:17,273 INFO L290 TraceCheckUtils]: 197: Hoare triple {21494#false} assume !false; {21494#false} is VALID [2022-04-28 07:48:17,274 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-28 07:48:17,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:48:17,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:48:17,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869156209] [2022-04-28 07:48:17,668 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:48:17,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251187161] [2022-04-28 07:48:17,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251187161] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:48:17,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:48:17,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2022-04-28 07:48:17,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:48:17,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1615623563] [2022-04-28 07:48:17,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1615623563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:48:17,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:48:17,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 07:48:17,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70008986] [2022-04-28 07:48:17,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:48:17,669 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) Word has length 198 [2022-04-28 07:48:17,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:48:17,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-28 07:48:17,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:48:17,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 07:48:17,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:48:17,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 07:48:17,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 07:48:17,982 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-28 07:48:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:48:31,888 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-04-28 07:48:31,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 07:48:31,888 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) Word has length 198 [2022-04-28 07:48:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:48:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-28 07:48:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 132 transitions. [2022-04-28 07:48:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-28 07:48:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 132 transitions. [2022-04-28 07:48:31,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 132 transitions. [2022-04-28 07:48:32,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:48:32,312 INFO L225 Difference]: With dead ends: 111 [2022-04-28 07:48:32,312 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 07:48:32,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 177 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-28 07:48:32,313 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-28 07:48:32,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1339 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-04-28 07:48:32,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 07:48:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-04-28 07:48:32,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:48:32,431 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), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 07:48:32,431 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), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 07:48:32,431 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), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 07:48:32,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:48:32,433 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-04-28 07:48:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-28 07:48:32,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:48:32,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:48:32,435 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), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 106 states. [2022-04-28 07:48:32,435 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), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 106 states. [2022-04-28 07:48:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:48:32,437 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-04-28 07:48:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-28 07:48:32,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:48:32,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:48:32,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:48:32,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:48:32,438 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), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 07:48:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2022-04-28 07:48:32,441 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 198 [2022-04-28 07:48:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:48:32,441 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2022-04-28 07:48:32,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-28 07:48:32,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 131 transitions. [2022-04-28 07:48:33,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:48:33,328 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-28 07:48:33,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-04-28 07:48:33,329 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:48:33,329 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:48:33,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-28 07:48:33,529 WARN L477 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-28 07:48:33,530 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:48:33,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:48:33,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1629673417, now seen corresponding path program 51 times [2022-04-28 07:48:33,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:48:33,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1802769750] [2022-04-28 07:48:33,624 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:48:33,625 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:48:33,625 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:48:33,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1629673417, now seen corresponding path program 52 times [2022-04-28 07:48:33,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:48:33,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870805872] [2022-04-28 07:48:33,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:48:33,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:48:33,641 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:48:33,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913846019] [2022-04-28 07:48:33,641 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:48:33,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:48:33,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:48:33,643 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-28 07:48:33,644 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-28 07:48:34,298 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:48:34,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:48:34,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-28 07:48:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:48:34,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:48:35,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {22809#true} call ULTIMATE.init(); {22809#true} is VALID [2022-04-28 07:48:35,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {22809#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); {22809#true} is VALID [2022-04-28 07:48:35,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22809#true} {22809#true} #60#return; {22809#true} is VALID [2022-04-28 07:48:35,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {22809#true} call #t~ret5 := main(); {22809#true} is VALID [2022-04-28 07:48:35,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {22809#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; {22809#true} is VALID [2022-04-28 07:48:35,510 INFO L272 TraceCheckUtils]: 6: Hoare triple {22809#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {22809#true} is VALID [2022-04-28 07:48:35,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,511 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22809#true} {22809#true} #52#return; {22809#true} is VALID [2022-04-28 07:48:35,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {22809#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {22847#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:48:35,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {22847#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {22847#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:48:35,511 INFO L272 TraceCheckUtils]: 13: Hoare triple {22847#(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)); {22809#true} is VALID [2022-04-28 07:48:35,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,512 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22809#true} {22847#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {22847#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:48:35,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {22847#(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; {22869#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:48:35,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {22869#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {22869#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:48:35,513 INFO L272 TraceCheckUtils]: 20: Hoare triple {22869#(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)); {22809#true} is VALID [2022-04-28 07:48:35,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,513 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {22809#true} {22869#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {22869#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:48:35,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {22869#(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; {22891#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:48:35,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {22891#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {22891#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:48:35,514 INFO L272 TraceCheckUtils]: 27: Hoare triple {22891#(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)); {22809#true} is VALID [2022-04-28 07:48:35,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,514 INFO L290 TraceCheckUtils]: 30: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,515 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22809#true} {22891#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #54#return; {22891#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:48:35,515 INFO L290 TraceCheckUtils]: 32: Hoare triple {22891#(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; {22913#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:48:35,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {22913#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {22913#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:48:35,516 INFO L272 TraceCheckUtils]: 34: Hoare triple {22913#(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)); {22809#true} is VALID [2022-04-28 07:48:35,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,516 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22809#true} {22913#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {22913#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:48:35,517 INFO L290 TraceCheckUtils]: 39: Hoare triple {22913#(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; {22935#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-28 07:48:35,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {22935#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} assume !false; {22935#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-28 07:48:35,517 INFO L272 TraceCheckUtils]: 41: Hoare triple {22935#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 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)); {22809#true} is VALID [2022-04-28 07:48:35,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,518 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {22809#true} {22935#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} #54#return; {22935#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-28 07:48:35,518 INFO L290 TraceCheckUtils]: 46: Hoare triple {22935#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 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; {22957#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:48:35,518 INFO L290 TraceCheckUtils]: 47: Hoare triple {22957#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {22957#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:48:35,519 INFO L272 TraceCheckUtils]: 48: Hoare triple {22957#(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)); {22809#true} is VALID [2022-04-28 07:48:35,519 INFO L290 TraceCheckUtils]: 49: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,519 INFO L290 TraceCheckUtils]: 50: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,519 INFO L290 TraceCheckUtils]: 51: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,519 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22809#true} {22957#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {22957#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:48:35,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {22957#(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; {22979#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:48:35,520 INFO L290 TraceCheckUtils]: 54: Hoare triple {22979#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {22979#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:48:35,520 INFO L272 TraceCheckUtils]: 55: Hoare triple {22979#(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)); {22809#true} is VALID [2022-04-28 07:48:35,520 INFO L290 TraceCheckUtils]: 56: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,520 INFO L290 TraceCheckUtils]: 57: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,520 INFO L290 TraceCheckUtils]: 58: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,521 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22809#true} {22979#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {22979#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:48:35,521 INFO L290 TraceCheckUtils]: 60: Hoare triple {22979#(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; {23001#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:48:35,521 INFO L290 TraceCheckUtils]: 61: Hoare triple {23001#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {23001#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:48:35,521 INFO L272 TraceCheckUtils]: 62: Hoare triple {23001#(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)); {22809#true} is VALID [2022-04-28 07:48:35,522 INFO L290 TraceCheckUtils]: 63: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,522 INFO L290 TraceCheckUtils]: 64: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,522 INFO L290 TraceCheckUtils]: 65: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,522 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {22809#true} {23001#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {23001#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:48:35,523 INFO L290 TraceCheckUtils]: 67: Hoare triple {23001#(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; {23023#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:48:35,523 INFO L290 TraceCheckUtils]: 68: Hoare triple {23023#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {23023#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:48:35,523 INFO L272 TraceCheckUtils]: 69: Hoare triple {23023#(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)); {22809#true} is VALID [2022-04-28 07:48:35,523 INFO L290 TraceCheckUtils]: 70: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,523 INFO L290 TraceCheckUtils]: 71: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,523 INFO L290 TraceCheckUtils]: 72: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,524 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {22809#true} {23023#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #54#return; {23023#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:48:35,524 INFO L290 TraceCheckUtils]: 74: Hoare triple {23023#(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; {23045#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:35,524 INFO L290 TraceCheckUtils]: 75: Hoare triple {23045#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} assume !false; {23045#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:35,524 INFO L272 TraceCheckUtils]: 76: Hoare triple {23045#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 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)); {22809#true} is VALID [2022-04-28 07:48:35,524 INFO L290 TraceCheckUtils]: 77: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,525 INFO L290 TraceCheckUtils]: 78: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,525 INFO L290 TraceCheckUtils]: 79: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,525 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22809#true} {23045#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} #54#return; {23045#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:35,525 INFO L290 TraceCheckUtils]: 81: Hoare triple {23045#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 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; {23067#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-28 07:48:35,526 INFO L290 TraceCheckUtils]: 82: Hoare triple {23067#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} assume !false; {23067#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-28 07:48:35,526 INFO L272 TraceCheckUtils]: 83: Hoare triple {23067#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) 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)); {22809#true} is VALID [2022-04-28 07:48:35,526 INFO L290 TraceCheckUtils]: 84: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,526 INFO L290 TraceCheckUtils]: 85: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,526 INFO L290 TraceCheckUtils]: 86: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,526 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {22809#true} {23067#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} #54#return; {23067#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-28 07:48:35,527 INFO L290 TraceCheckUtils]: 88: Hoare triple {23067#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) 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; {23089#(and (= (+ main_~y~0 (- 3)) 8) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-28 07:48:35,527 INFO L290 TraceCheckUtils]: 89: Hoare triple {23089#(and (= (+ main_~y~0 (- 3)) 8) (= 6 (+ main_~c~0 (- 5))))} assume !false; {23089#(and (= (+ main_~y~0 (- 3)) 8) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-28 07:48:35,527 INFO L272 TraceCheckUtils]: 90: Hoare triple {23089#(and (= (+ main_~y~0 (- 3)) 8) (= 6 (+ 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)); {22809#true} is VALID [2022-04-28 07:48:35,527 INFO L290 TraceCheckUtils]: 91: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,527 INFO L290 TraceCheckUtils]: 92: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,528 INFO L290 TraceCheckUtils]: 93: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,528 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22809#true} {23089#(and (= (+ main_~y~0 (- 3)) 8) (= 6 (+ main_~c~0 (- 5))))} #54#return; {23089#(and (= (+ main_~y~0 (- 3)) 8) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-28 07:48:35,528 INFO L290 TraceCheckUtils]: 95: Hoare triple {23089#(and (= (+ main_~y~0 (- 3)) 8) (= 6 (+ 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; {23111#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} is VALID [2022-04-28 07:48:35,529 INFO L290 TraceCheckUtils]: 96: Hoare triple {23111#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} assume !false; {23111#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} is VALID [2022-04-28 07:48:35,529 INFO L272 TraceCheckUtils]: 97: Hoare triple {23111#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 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)); {22809#true} is VALID [2022-04-28 07:48:35,529 INFO L290 TraceCheckUtils]: 98: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,529 INFO L290 TraceCheckUtils]: 99: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,529 INFO L290 TraceCheckUtils]: 100: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,529 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {22809#true} {23111#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} #54#return; {23111#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} is VALID [2022-04-28 07:48:35,530 INFO L290 TraceCheckUtils]: 102: Hoare triple {23111#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 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; {23133#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:48:35,530 INFO L290 TraceCheckUtils]: 103: Hoare triple {23133#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {23133#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:48:35,530 INFO L272 TraceCheckUtils]: 104: Hoare triple {23133#(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)); {22809#true} is VALID [2022-04-28 07:48:35,530 INFO L290 TraceCheckUtils]: 105: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,530 INFO L290 TraceCheckUtils]: 106: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,530 INFO L290 TraceCheckUtils]: 107: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,531 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {22809#true} {23133#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {23133#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:48:35,531 INFO L290 TraceCheckUtils]: 109: Hoare triple {23133#(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; {23155#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:48:35,532 INFO L290 TraceCheckUtils]: 110: Hoare triple {23155#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {23155#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:48:35,532 INFO L272 TraceCheckUtils]: 111: Hoare triple {23155#(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)); {22809#true} is VALID [2022-04-28 07:48:35,532 INFO L290 TraceCheckUtils]: 112: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,532 INFO L290 TraceCheckUtils]: 113: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,532 INFO L290 TraceCheckUtils]: 114: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,532 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {22809#true} {23155#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #54#return; {23155#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:48:35,533 INFO L290 TraceCheckUtils]: 116: Hoare triple {23155#(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; {23177#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:48:35,533 INFO L290 TraceCheckUtils]: 117: Hoare triple {23177#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} assume !false; {23177#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:48:35,533 INFO L272 TraceCheckUtils]: 118: Hoare triple {23177#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 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)); {22809#true} is VALID [2022-04-28 07:48:35,533 INFO L290 TraceCheckUtils]: 119: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,533 INFO L290 TraceCheckUtils]: 120: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,533 INFO L290 TraceCheckUtils]: 121: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,534 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {22809#true} {23177#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} #54#return; {23177#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:48:35,534 INFO L290 TraceCheckUtils]: 123: Hoare triple {23177#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 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; {23199#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-28 07:48:35,534 INFO L290 TraceCheckUtils]: 124: Hoare triple {23199#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} assume !false; {23199#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-28 07:48:35,535 INFO L272 TraceCheckUtils]: 125: Hoare triple {23199#(and (= 14 (+ (- 2) main_~c~0)) (= (+ 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)); {22809#true} is VALID [2022-04-28 07:48:35,535 INFO L290 TraceCheckUtils]: 126: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,535 INFO L290 TraceCheckUtils]: 127: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,535 INFO L290 TraceCheckUtils]: 128: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,535 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {22809#true} {23199#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} #54#return; {23199#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-28 07:48:35,536 INFO L290 TraceCheckUtils]: 130: Hoare triple {23199#(and (= 14 (+ (- 2) main_~c~0)) (= (+ 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; {23221#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-28 07:48:35,536 INFO L290 TraceCheckUtils]: 131: Hoare triple {23221#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} assume !false; {23221#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-28 07:48:35,536 INFO L272 TraceCheckUtils]: 132: Hoare triple {23221#(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)); {22809#true} is VALID [2022-04-28 07:48:35,536 INFO L290 TraceCheckUtils]: 133: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,536 INFO L290 TraceCheckUtils]: 134: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,536 INFO L290 TraceCheckUtils]: 135: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,537 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {22809#true} {23221#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} #54#return; {23221#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-28 07:48:35,537 INFO L290 TraceCheckUtils]: 137: Hoare triple {23221#(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; {23243#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:48:35,538 INFO L290 TraceCheckUtils]: 138: Hoare triple {23243#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {23243#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:48:35,538 INFO L272 TraceCheckUtils]: 139: Hoare triple {23243#(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)); {22809#true} is VALID [2022-04-28 07:48:35,538 INFO L290 TraceCheckUtils]: 140: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,538 INFO L290 TraceCheckUtils]: 141: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,538 INFO L290 TraceCheckUtils]: 142: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,538 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {22809#true} {23243#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #54#return; {23243#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:48:35,539 INFO L290 TraceCheckUtils]: 144: Hoare triple {23243#(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; {23265#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:48:35,539 INFO L290 TraceCheckUtils]: 145: Hoare triple {23265#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {23265#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:48:35,539 INFO L272 TraceCheckUtils]: 146: Hoare triple {23265#(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)); {22809#true} is VALID [2022-04-28 07:48:35,539 INFO L290 TraceCheckUtils]: 147: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,539 INFO L290 TraceCheckUtils]: 148: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,539 INFO L290 TraceCheckUtils]: 149: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,540 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {22809#true} {23265#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {23265#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:48:35,540 INFO L290 TraceCheckUtils]: 151: Hoare triple {23265#(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; {23287#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:48:35,540 INFO L290 TraceCheckUtils]: 152: Hoare triple {23287#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {23287#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:48:35,541 INFO L272 TraceCheckUtils]: 153: Hoare triple {23287#(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)); {22809#true} is VALID [2022-04-28 07:48:35,541 INFO L290 TraceCheckUtils]: 154: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,541 INFO L290 TraceCheckUtils]: 155: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,541 INFO L290 TraceCheckUtils]: 156: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,541 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {22809#true} {23287#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #54#return; {23287#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:48:35,542 INFO L290 TraceCheckUtils]: 158: Hoare triple {23287#(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; {23309#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:48:35,542 INFO L290 TraceCheckUtils]: 159: Hoare triple {23309#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} assume !false; {23309#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:48:35,542 INFO L272 TraceCheckUtils]: 160: Hoare triple {23309#(and (= main_~y~0 21) (= 19 (+ (- 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)); {22809#true} is VALID [2022-04-28 07:48:35,542 INFO L290 TraceCheckUtils]: 161: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,542 INFO L290 TraceCheckUtils]: 162: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,542 INFO L290 TraceCheckUtils]: 163: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,543 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {22809#true} {23309#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} #54#return; {23309#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:48:35,543 INFO L290 TraceCheckUtils]: 165: Hoare triple {23309#(and (= main_~y~0 21) (= 19 (+ (- 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; {23331#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:35,543 INFO L290 TraceCheckUtils]: 166: Hoare triple {23331#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} assume !false; {23331#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:35,543 INFO L272 TraceCheckUtils]: 167: Hoare triple {23331#(and (= 19 (+ main_~c~0 (- 3))) (= 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)); {22809#true} is VALID [2022-04-28 07:48:35,544 INFO L290 TraceCheckUtils]: 168: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,544 INFO L290 TraceCheckUtils]: 169: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,544 INFO L290 TraceCheckUtils]: 170: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,544 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {22809#true} {23331#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} #54#return; {23331#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:48:35,544 INFO L290 TraceCheckUtils]: 172: Hoare triple {23331#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 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; {23353#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:48:35,545 INFO L290 TraceCheckUtils]: 173: Hoare triple {23353#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {23353#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:48:35,545 INFO L272 TraceCheckUtils]: 174: Hoare triple {23353#(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)); {22809#true} is VALID [2022-04-28 07:48:35,545 INFO L290 TraceCheckUtils]: 175: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,545 INFO L290 TraceCheckUtils]: 176: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,545 INFO L290 TraceCheckUtils]: 177: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,545 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {22809#true} {23353#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {23353#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:48:35,546 INFO L290 TraceCheckUtils]: 179: Hoare triple {23353#(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; {23375#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-28 07:48:35,546 INFO L290 TraceCheckUtils]: 180: Hoare triple {23375#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} assume !false; {23375#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-28 07:48:35,546 INFO L272 TraceCheckUtils]: 181: Hoare triple {23375#(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)); {22809#true} is VALID [2022-04-28 07:48:35,546 INFO L290 TraceCheckUtils]: 182: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,546 INFO L290 TraceCheckUtils]: 183: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,547 INFO L290 TraceCheckUtils]: 184: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,547 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {22809#true} {23375#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} #54#return; {23375#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-28 07:48:35,547 INFO L290 TraceCheckUtils]: 186: Hoare triple {23375#(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; {23397#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-28 07:48:35,548 INFO L290 TraceCheckUtils]: 187: Hoare triple {23397#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} assume !false; {23397#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-28 07:48:35,548 INFO L272 TraceCheckUtils]: 188: Hoare triple {23397#(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)); {22809#true} is VALID [2022-04-28 07:48:35,548 INFO L290 TraceCheckUtils]: 189: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,548 INFO L290 TraceCheckUtils]: 190: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,548 INFO L290 TraceCheckUtils]: 191: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,548 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {22809#true} {23397#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} #54#return; {23397#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-28 07:48:35,549 INFO L290 TraceCheckUtils]: 193: Hoare triple {23397#(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; {23419#(and (<= main_~c~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:48:35,549 INFO L290 TraceCheckUtils]: 194: Hoare triple {23419#(and (<= main_~c~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} assume !false; {23419#(and (<= main_~c~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:48:35,549 INFO L272 TraceCheckUtils]: 195: Hoare triple {23419#(and (<= main_~c~0 26) (< 25 main_~k~0) (= (+ (- 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)); {22809#true} is VALID [2022-04-28 07:48:35,549 INFO L290 TraceCheckUtils]: 196: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-28 07:48:35,549 INFO L290 TraceCheckUtils]: 197: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-28 07:48:35,549 INFO L290 TraceCheckUtils]: 198: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-28 07:48:35,550 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {22809#true} {23419#(and (<= main_~c~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} #54#return; {23419#(and (<= main_~c~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:48:35,551 INFO L290 TraceCheckUtils]: 200: Hoare triple {23419#(and (<= main_~c~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} assume !(~c~0 < ~k~0); {23441#(and (<= main_~k~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:48:35,552 INFO L272 TraceCheckUtils]: 201: Hoare triple {23441#(and (<= main_~k~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23445#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:48:35,552 INFO L290 TraceCheckUtils]: 202: Hoare triple {23445#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23449#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:48:35,552 INFO L290 TraceCheckUtils]: 203: Hoare triple {23449#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22810#false} is VALID [2022-04-28 07:48:35,553 INFO L290 TraceCheckUtils]: 204: Hoare triple {22810#false} assume !false; {22810#false} is VALID [2022-04-28 07:48:35,554 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-28 07:48:35,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:48:35,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:48:35,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870805872] [2022-04-28 07:48:35,916 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:48:35,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913846019] [2022-04-28 07:48:35,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913846019] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:48:35,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:48:35,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2022-04-28 07:48:35,916 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:48:35,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1802769750] [2022-04-28 07:48:35,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1802769750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:48:35,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:48:35,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 07:48:35,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63139934] [2022-04-28 07:48:35,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:48:35,931 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) Word has length 205 [2022-04-28 07:48:35,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:48:35,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-28 07:48:36,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:48:36,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 07:48:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:48:36,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 07:48:36,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 07:48:36,293 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-28 07:48:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:48:52,273 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-28 07:48:52,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 07:48:52,273 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) Word has length 205 [2022-04-28 07:48:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:48:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-28 07:48:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 136 transitions. [2022-04-28 07:48:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-28 07:48:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 136 transitions. [2022-04-28 07:48:52,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 136 transitions. [2022-04-28 07:48:52,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:48:52,704 INFO L225 Difference]: With dead ends: 114 [2022-04-28 07:48:52,705 INFO L226 Difference]: Without dead ends: 109 [2022-04-28 07:48:52,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 183 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-28 07:48:52,706 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-28 07:48:52,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1415 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-04-28 07:48:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-28 07:48:52,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-28 07:48:52,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:48:52,831 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), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 07:48:52,831 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), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 07:48:52,831 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), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 07:48:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:48:52,833 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-28 07:48:52,833 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-28 07:48:52,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:48:52,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:48:52,834 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), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 109 states. [2022-04-28 07:48:52,834 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), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 109 states. [2022-04-28 07:48:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:48:52,837 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-28 07:48:52,837 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-28 07:48:52,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:48:52,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:48:52,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:48:52,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:48:52,838 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), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 07:48:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-28 07:48:52,840 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 205 [2022-04-28 07:48:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:48:52,841 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-28 07:48:52,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-28 07:48:52,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 135 transitions. [2022-04-28 07:48:53,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:48:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-28 07:48:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-04-28 07:48:53,917 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:48:53,917 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:48:53,923 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-28 07:48:54,117 WARN L477 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-28 07:48:54,118 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:48:54,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:48:54,118 INFO L85 PathProgramCache]: Analyzing trace with hash -12241624, now seen corresponding path program 53 times [2022-04-28 07:48:54,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:48:54,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1285697991] [2022-04-28 07:48:54,201 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:48:54,202 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:48:54,202 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:48:54,202 INFO L85 PathProgramCache]: Analyzing trace with hash -12241624, now seen corresponding path program 54 times [2022-04-28 07:48:54,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:48:54,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987178116] [2022-04-28 07:48:54,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:48:54,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:48:54,220 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:48:54,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [806754830] [2022-04-28 07:48:54,220 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:48:54,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:48:54,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:48:54,221 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-28 07:48:54,223 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-28 07:49:08,374 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-28 07:49:08,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:49:08,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 116 conjunts are in the unsatisfiable core [2022-04-28 07:49:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:49:08,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:49:09,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {24165#true} call ULTIMATE.init(); {24165#true} is VALID [2022-04-28 07:49:09,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {24165#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); {24165#true} is VALID [2022-04-28 07:49:09,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24165#true} {24165#true} #60#return; {24165#true} is VALID [2022-04-28 07:49:09,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {24165#true} call #t~ret5 := main(); {24165#true} is VALID [2022-04-28 07:49:09,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {24165#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; {24165#true} is VALID [2022-04-28 07:49:09,594 INFO L272 TraceCheckUtils]: 6: Hoare triple {24165#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {24165#true} is VALID [2022-04-28 07:49:09,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,594 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24165#true} {24165#true} #52#return; {24165#true} is VALID [2022-04-28 07:49:09,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {24165#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {24203#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:49:09,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {24203#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {24203#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:49:09,595 INFO L272 TraceCheckUtils]: 13: Hoare triple {24203#(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)); {24165#true} is VALID [2022-04-28 07:49:09,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,603 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24165#true} {24203#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {24203#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:49:09,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {24203#(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; {24225#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:49:09,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {24225#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {24225#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:49:09,604 INFO L272 TraceCheckUtils]: 20: Hoare triple {24225#(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)); {24165#true} is VALID [2022-04-28 07:49:09,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,604 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {24165#true} {24225#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {24225#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:49:09,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {24225#(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; {24247#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:49:09,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {24247#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {24247#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:49:09,605 INFO L272 TraceCheckUtils]: 27: Hoare triple {24247#(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)); {24165#true} is VALID [2022-04-28 07:49:09,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,606 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {24165#true} {24247#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {24247#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:49:09,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {24247#(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; {24269#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 07:49:09,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {24269#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !false; {24269#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 07:49:09,607 INFO L272 TraceCheckUtils]: 34: Hoare triple {24269#(and (= (+ main_~c~0 (- 3)) 0) (= (+ 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)); {24165#true} is VALID [2022-04-28 07:49:09,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,607 INFO L290 TraceCheckUtils]: 36: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,607 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {24165#true} {24269#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} #54#return; {24269#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 07:49:09,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {24269#(and (= (+ main_~c~0 (- 3)) 0) (= (+ 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; {24291#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:49:09,608 INFO L290 TraceCheckUtils]: 40: Hoare triple {24291#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {24291#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:49:09,608 INFO L272 TraceCheckUtils]: 41: Hoare triple {24291#(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)); {24165#true} is VALID [2022-04-28 07:49:09,608 INFO L290 TraceCheckUtils]: 42: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,608 INFO L290 TraceCheckUtils]: 43: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,609 INFO L290 TraceCheckUtils]: 44: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,610 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {24165#true} {24291#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {24291#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:49:09,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {24291#(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; {24313#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:49:09,611 INFO L290 TraceCheckUtils]: 47: Hoare triple {24313#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {24313#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:49:09,611 INFO L272 TraceCheckUtils]: 48: Hoare triple {24313#(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)); {24165#true} is VALID [2022-04-28 07:49:09,611 INFO L290 TraceCheckUtils]: 49: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,612 INFO L290 TraceCheckUtils]: 50: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,612 INFO L290 TraceCheckUtils]: 51: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,612 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {24165#true} {24313#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {24313#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:49:09,613 INFO L290 TraceCheckUtils]: 53: Hoare triple {24313#(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; {24335#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:09,613 INFO L290 TraceCheckUtils]: 54: Hoare triple {24335#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {24335#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:09,613 INFO L272 TraceCheckUtils]: 55: Hoare triple {24335#(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)); {24165#true} is VALID [2022-04-28 07:49:09,613 INFO L290 TraceCheckUtils]: 56: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,613 INFO L290 TraceCheckUtils]: 57: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,613 INFO L290 TraceCheckUtils]: 58: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,614 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24165#true} {24335#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {24335#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:09,614 INFO L290 TraceCheckUtils]: 60: Hoare triple {24335#(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; {24357#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:49:09,614 INFO L290 TraceCheckUtils]: 61: Hoare triple {24357#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !false; {24357#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:49:09,615 INFO L272 TraceCheckUtils]: 62: Hoare triple {24357#(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)); {24165#true} is VALID [2022-04-28 07:49:09,615 INFO L290 TraceCheckUtils]: 63: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,615 INFO L290 TraceCheckUtils]: 64: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,615 INFO L290 TraceCheckUtils]: 65: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,615 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24165#true} {24357#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #54#return; {24357#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:49:09,616 INFO L290 TraceCheckUtils]: 67: Hoare triple {24357#(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; {24379#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:49:09,616 INFO L290 TraceCheckUtils]: 68: Hoare triple {24379#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {24379#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:49:09,616 INFO L272 TraceCheckUtils]: 69: Hoare triple {24379#(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)); {24165#true} is VALID [2022-04-28 07:49:09,616 INFO L290 TraceCheckUtils]: 70: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,616 INFO L290 TraceCheckUtils]: 71: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,616 INFO L290 TraceCheckUtils]: 72: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,617 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {24165#true} {24379#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #54#return; {24379#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:49:09,617 INFO L290 TraceCheckUtils]: 74: Hoare triple {24379#(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; {24401#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:49:09,617 INFO L290 TraceCheckUtils]: 75: Hoare triple {24401#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {24401#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:49:09,617 INFO L272 TraceCheckUtils]: 76: Hoare triple {24401#(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)); {24165#true} is VALID [2022-04-28 07:49:09,617 INFO L290 TraceCheckUtils]: 77: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,618 INFO L290 TraceCheckUtils]: 78: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,618 INFO L290 TraceCheckUtils]: 79: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,618 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24165#true} {24401#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {24401#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:49:09,618 INFO L290 TraceCheckUtils]: 81: Hoare triple {24401#(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; {24423#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:49:09,619 INFO L290 TraceCheckUtils]: 82: Hoare triple {24423#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {24423#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:49:09,619 INFO L272 TraceCheckUtils]: 83: Hoare triple {24423#(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)); {24165#true} is VALID [2022-04-28 07:49:09,619 INFO L290 TraceCheckUtils]: 84: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,619 INFO L290 TraceCheckUtils]: 85: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,619 INFO L290 TraceCheckUtils]: 86: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,619 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {24165#true} {24423#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {24423#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:49:09,620 INFO L290 TraceCheckUtils]: 88: Hoare triple {24423#(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; {24445#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:49:09,620 INFO L290 TraceCheckUtils]: 89: Hoare triple {24445#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {24445#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:49:09,620 INFO L272 TraceCheckUtils]: 90: Hoare triple {24445#(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)); {24165#true} is VALID [2022-04-28 07:49:09,620 INFO L290 TraceCheckUtils]: 91: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,620 INFO L290 TraceCheckUtils]: 92: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,620 INFO L290 TraceCheckUtils]: 93: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,621 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {24165#true} {24445#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {24445#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:49:09,621 INFO L290 TraceCheckUtils]: 95: Hoare triple {24445#(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; {24467#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:49:09,622 INFO L290 TraceCheckUtils]: 96: Hoare triple {24467#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {24467#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:49:09,622 INFO L272 TraceCheckUtils]: 97: Hoare triple {24467#(and (= main_~y~0 12) (= (+ (- 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)); {24165#true} is VALID [2022-04-28 07:49:09,622 INFO L290 TraceCheckUtils]: 98: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,622 INFO L290 TraceCheckUtils]: 99: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,622 INFO L290 TraceCheckUtils]: 100: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,622 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {24165#true} {24467#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {24467#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:49:09,623 INFO L290 TraceCheckUtils]: 102: Hoare triple {24467#(and (= main_~y~0 12) (= (+ (- 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; {24489#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:09,623 INFO L290 TraceCheckUtils]: 103: Hoare triple {24489#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {24489#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:09,623 INFO L272 TraceCheckUtils]: 104: Hoare triple {24489#(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)); {24165#true} is VALID [2022-04-28 07:49:09,623 INFO L290 TraceCheckUtils]: 105: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,623 INFO L290 TraceCheckUtils]: 106: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,623 INFO L290 TraceCheckUtils]: 107: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,624 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {24165#true} {24489#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {24489#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:09,624 INFO L290 TraceCheckUtils]: 109: Hoare triple {24489#(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; {24511#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:49:09,624 INFO L290 TraceCheckUtils]: 110: Hoare triple {24511#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {24511#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:49:09,625 INFO L272 TraceCheckUtils]: 111: Hoare triple {24511#(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)); {24165#true} is VALID [2022-04-28 07:49:09,625 INFO L290 TraceCheckUtils]: 112: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,625 INFO L290 TraceCheckUtils]: 113: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,625 INFO L290 TraceCheckUtils]: 114: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,625 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {24165#true} {24511#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {24511#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:49:09,627 INFO L290 TraceCheckUtils]: 116: Hoare triple {24511#(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; {24533#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:49:09,627 INFO L290 TraceCheckUtils]: 117: Hoare triple {24533#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {24533#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:49:09,627 INFO L272 TraceCheckUtils]: 118: Hoare triple {24533#(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)); {24165#true} is VALID [2022-04-28 07:49:09,627 INFO L290 TraceCheckUtils]: 119: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,627 INFO L290 TraceCheckUtils]: 120: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,627 INFO L290 TraceCheckUtils]: 121: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,628 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {24165#true} {24533#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {24533#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:49:09,628 INFO L290 TraceCheckUtils]: 123: Hoare triple {24533#(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; {24555#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 07:49:09,631 INFO L290 TraceCheckUtils]: 124: Hoare triple {24555#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} assume !false; {24555#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 07:49:09,632 INFO L272 TraceCheckUtils]: 125: Hoare triple {24555#(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)); {24165#true} is VALID [2022-04-28 07:49:09,632 INFO L290 TraceCheckUtils]: 126: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,632 INFO L290 TraceCheckUtils]: 127: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,632 INFO L290 TraceCheckUtils]: 128: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,633 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {24165#true} {24555#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} #54#return; {24555#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 07:49:09,633 INFO L290 TraceCheckUtils]: 130: Hoare triple {24555#(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; {24577#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-28 07:49:09,634 INFO L290 TraceCheckUtils]: 131: Hoare triple {24577#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !false; {24577#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-28 07:49:09,634 INFO L272 TraceCheckUtils]: 132: Hoare triple {24577#(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)); {24165#true} is VALID [2022-04-28 07:49:09,634 INFO L290 TraceCheckUtils]: 133: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,634 INFO L290 TraceCheckUtils]: 134: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,634 INFO L290 TraceCheckUtils]: 135: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,635 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {24165#true} {24577#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} #54#return; {24577#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-28 07:49:09,635 INFO L290 TraceCheckUtils]: 137: Hoare triple {24577#(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; {24599#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:49:09,636 INFO L290 TraceCheckUtils]: 138: Hoare triple {24599#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !false; {24599#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:49:09,636 INFO L272 TraceCheckUtils]: 139: Hoare triple {24599#(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)); {24165#true} is VALID [2022-04-28 07:49:09,636 INFO L290 TraceCheckUtils]: 140: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,636 INFO L290 TraceCheckUtils]: 141: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,636 INFO L290 TraceCheckUtils]: 142: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,637 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {24165#true} {24599#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} #54#return; {24599#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:49:09,637 INFO L290 TraceCheckUtils]: 144: Hoare triple {24599#(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; {24621#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:49:09,638 INFO L290 TraceCheckUtils]: 145: Hoare triple {24621#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {24621#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:49:09,638 INFO L272 TraceCheckUtils]: 146: Hoare triple {24621#(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)); {24165#true} is VALID [2022-04-28 07:49:09,638 INFO L290 TraceCheckUtils]: 147: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,638 INFO L290 TraceCheckUtils]: 148: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,638 INFO L290 TraceCheckUtils]: 149: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,639 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {24165#true} {24621#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {24621#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:49:09,639 INFO L290 TraceCheckUtils]: 151: Hoare triple {24621#(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; {24643#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:49:09,640 INFO L290 TraceCheckUtils]: 152: Hoare triple {24643#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {24643#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:49:09,640 INFO L272 TraceCheckUtils]: 153: Hoare triple {24643#(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)); {24165#true} is VALID [2022-04-28 07:49:09,640 INFO L290 TraceCheckUtils]: 154: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,640 INFO L290 TraceCheckUtils]: 155: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,640 INFO L290 TraceCheckUtils]: 156: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,641 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {24165#true} {24643#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #54#return; {24643#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:49:09,641 INFO L290 TraceCheckUtils]: 158: Hoare triple {24643#(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; {24665#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:49:09,642 INFO L290 TraceCheckUtils]: 159: Hoare triple {24665#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !false; {24665#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:49:09,642 INFO L272 TraceCheckUtils]: 160: Hoare triple {24665#(and (= main_~c~0 21) (= 19 (+ (- 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)); {24165#true} is VALID [2022-04-28 07:49:09,642 INFO L290 TraceCheckUtils]: 161: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,642 INFO L290 TraceCheckUtils]: 162: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,642 INFO L290 TraceCheckUtils]: 163: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,643 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {24165#true} {24665#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} #54#return; {24665#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:49:09,643 INFO L290 TraceCheckUtils]: 165: Hoare triple {24665#(and (= main_~c~0 21) (= 19 (+ (- 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; {24687#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-28 07:49:09,644 INFO L290 TraceCheckUtils]: 166: Hoare triple {24687#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} assume !false; {24687#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-28 07:49:09,644 INFO L272 TraceCheckUtils]: 167: Hoare triple {24687#(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)); {24165#true} is VALID [2022-04-28 07:49:09,644 INFO L290 TraceCheckUtils]: 168: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,644 INFO L290 TraceCheckUtils]: 169: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,644 INFO L290 TraceCheckUtils]: 170: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,644 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {24165#true} {24687#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} #54#return; {24687#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-28 07:49:09,645 INFO L290 TraceCheckUtils]: 172: Hoare triple {24687#(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; {24709#(and (= 19 (+ main_~y~0 (- 4))) (= 23 main_~c~0))} is VALID [2022-04-28 07:49:09,645 INFO L290 TraceCheckUtils]: 173: Hoare triple {24709#(and (= 19 (+ main_~y~0 (- 4))) (= 23 main_~c~0))} assume !false; {24709#(and (= 19 (+ main_~y~0 (- 4))) (= 23 main_~c~0))} is VALID [2022-04-28 07:49:09,645 INFO L272 TraceCheckUtils]: 174: Hoare triple {24709#(and (= 19 (+ main_~y~0 (- 4))) (= 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)); {24165#true} is VALID [2022-04-28 07:49:09,646 INFO L290 TraceCheckUtils]: 175: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,646 INFO L290 TraceCheckUtils]: 176: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,646 INFO L290 TraceCheckUtils]: 177: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,646 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {24165#true} {24709#(and (= 19 (+ main_~y~0 (- 4))) (= 23 main_~c~0))} #54#return; {24709#(and (= 19 (+ main_~y~0 (- 4))) (= 23 main_~c~0))} is VALID [2022-04-28 07:49:09,647 INFO L290 TraceCheckUtils]: 179: Hoare triple {24709#(and (= 19 (+ main_~y~0 (- 4))) (= 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; {24731#(and (= 19 (+ main_~y~0 (- 5))) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:49:09,647 INFO L290 TraceCheckUtils]: 180: Hoare triple {24731#(and (= 19 (+ main_~y~0 (- 5))) (= 23 (+ (- 1) main_~c~0)))} assume !false; {24731#(and (= 19 (+ main_~y~0 (- 5))) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:49:09,647 INFO L272 TraceCheckUtils]: 181: Hoare triple {24731#(and (= 19 (+ main_~y~0 (- 5))) (= 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)); {24165#true} is VALID [2022-04-28 07:49:09,648 INFO L290 TraceCheckUtils]: 182: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,648 INFO L290 TraceCheckUtils]: 183: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,648 INFO L290 TraceCheckUtils]: 184: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,648 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {24165#true} {24731#(and (= 19 (+ main_~y~0 (- 5))) (= 23 (+ (- 1) main_~c~0)))} #54#return; {24731#(and (= 19 (+ main_~y~0 (- 5))) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:49:09,649 INFO L290 TraceCheckUtils]: 186: Hoare triple {24731#(and (= 19 (+ main_~y~0 (- 5))) (= 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; {24753#(and (= main_~c~0 25) (= (+ main_~y~0 (- 6)) 19))} is VALID [2022-04-28 07:49:09,649 INFO L290 TraceCheckUtils]: 187: Hoare triple {24753#(and (= main_~c~0 25) (= (+ main_~y~0 (- 6)) 19))} assume !false; {24753#(and (= main_~c~0 25) (= (+ main_~y~0 (- 6)) 19))} is VALID [2022-04-28 07:49:09,649 INFO L272 TraceCheckUtils]: 188: Hoare triple {24753#(and (= main_~c~0 25) (= (+ main_~y~0 (- 6)) 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)); {24165#true} is VALID [2022-04-28 07:49:09,649 INFO L290 TraceCheckUtils]: 189: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,650 INFO L290 TraceCheckUtils]: 190: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,650 INFO L290 TraceCheckUtils]: 191: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,650 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {24165#true} {24753#(and (= main_~c~0 25) (= (+ main_~y~0 (- 6)) 19))} #54#return; {24753#(and (= main_~c~0 25) (= (+ main_~y~0 (- 6)) 19))} is VALID [2022-04-28 07:49:09,651 INFO L290 TraceCheckUtils]: 193: Hoare triple {24753#(and (= main_~c~0 25) (= (+ main_~y~0 (- 6)) 19))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24775#(and (= 19 (+ main_~y~0 (- 7))) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-28 07:49:09,651 INFO L290 TraceCheckUtils]: 194: Hoare triple {24775#(and (= 19 (+ main_~y~0 (- 7))) (= (+ (- 1) main_~c~0) 25))} assume !false; {24775#(and (= 19 (+ main_~y~0 (- 7))) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-28 07:49:09,651 INFO L272 TraceCheckUtils]: 195: Hoare triple {24775#(and (= 19 (+ main_~y~0 (- 7))) (= (+ (- 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)); {24165#true} is VALID [2022-04-28 07:49:09,651 INFO L290 TraceCheckUtils]: 196: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,652 INFO L290 TraceCheckUtils]: 197: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,652 INFO L290 TraceCheckUtils]: 198: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,652 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {24165#true} {24775#(and (= 19 (+ main_~y~0 (- 7))) (= (+ (- 1) main_~c~0) 25))} #54#return; {24775#(and (= 19 (+ main_~y~0 (- 7))) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-28 07:49:09,653 INFO L290 TraceCheckUtils]: 200: Hoare triple {24775#(and (= 19 (+ main_~y~0 (- 7))) (= (+ (- 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; {24797#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} is VALID [2022-04-28 07:49:09,653 INFO L290 TraceCheckUtils]: 201: Hoare triple {24797#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} assume !false; {24797#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} is VALID [2022-04-28 07:49:09,653 INFO L272 TraceCheckUtils]: 202: Hoare triple {24797#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 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)); {24165#true} is VALID [2022-04-28 07:49:09,653 INFO L290 TraceCheckUtils]: 203: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-28 07:49:09,653 INFO L290 TraceCheckUtils]: 204: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-28 07:49:09,654 INFO L290 TraceCheckUtils]: 205: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-28 07:49:09,654 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {24165#true} {24797#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} #54#return; {24797#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} is VALID [2022-04-28 07:49:09,655 INFO L290 TraceCheckUtils]: 207: Hoare triple {24797#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} assume !(~c~0 < ~k~0); {24819#(and (= main_~y~0 27) (< 26 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-28 07:49:09,656 INFO L272 TraceCheckUtils]: 208: Hoare triple {24819#(and (= main_~y~0 27) (< 26 main_~k~0) (<= main_~k~0 27))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:49:09,656 INFO L290 TraceCheckUtils]: 209: Hoare triple {24823#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:49:09,656 INFO L290 TraceCheckUtils]: 210: Hoare triple {24827#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24166#false} is VALID [2022-04-28 07:49:09,656 INFO L290 TraceCheckUtils]: 211: Hoare triple {24166#false} assume !false; {24166#false} is VALID [2022-04-28 07:49:09,658 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-28 07:49:09,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:49:10,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:49:10,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987178116] [2022-04-28 07:49:10,142 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:49:10,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806754830] [2022-04-28 07:49:10,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806754830] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:49:10,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:49:10,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2022-04-28 07:49:10,142 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:49:10,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1285697991] [2022-04-28 07:49:10,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1285697991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:49:10,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:49:10,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 07:49:10,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118230037] [2022-04-28 07:49:10,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:49:10,143 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) Word has length 212 [2022-04-28 07:49:10,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:49:10,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-28 07:49:10,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:49:10,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 07:49:10,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:49:10,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 07:49:10,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 07:49:10,554 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-28 07:49:29,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:49:29,111 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2022-04-28 07:49:29,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 07:49:29,112 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) Word has length 212 [2022-04-28 07:49:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:49:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-28 07:49:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 140 transitions. [2022-04-28 07:49:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-28 07:49:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 140 transitions. [2022-04-28 07:49:29,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 140 transitions. [2022-04-28 07:49:29,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:49:29,606 INFO L225 Difference]: With dead ends: 117 [2022-04-28 07:49:29,606 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 07:49:29,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=1294, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 07:49:29,608 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 2677 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 2677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:49:29,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1493 Invalid, 2677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2677 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-04-28 07:49:29,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 07:49:29,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-04-28 07:49:29,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:49:29,745 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), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 07:49:29,745 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), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 07:49:29,746 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), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 07:49:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:49:29,747 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2022-04-28 07:49:29,747 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-04-28 07:49:29,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:49:29,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:49:29,748 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), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 112 states. [2022-04-28 07:49:29,748 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), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 112 states. [2022-04-28 07:49:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:49:29,751 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2022-04-28 07:49:29,751 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-04-28 07:49:29,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:49:29,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:49:29,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:49:29,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:49:29,752 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), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 07:49:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2022-04-28 07:49:29,754 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 212 [2022-04-28 07:49:29,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:49:29,754 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2022-04-28 07:49:29,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-28 07:49:29,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 139 transitions. [2022-04-28 07:49:30,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:49:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-04-28 07:49:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-04-28 07:49:30,698 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:49:30,698 INFO L195 NwaCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:49:30,708 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-28 07:49:30,899 WARN L477 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-28 07:49:30,899 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:49:30,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:49:30,899 INFO L85 PathProgramCache]: Analyzing trace with hash -255861015, now seen corresponding path program 55 times [2022-04-28 07:49:30,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:49:30,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1708083744] [2022-04-28 07:49:30,998 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:49:30,999 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:49:30,999 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:49:30,999 INFO L85 PathProgramCache]: Analyzing trace with hash -255861015, now seen corresponding path program 56 times [2022-04-28 07:49:30,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:49:30,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154259890] [2022-04-28 07:49:30,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:49:30,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:49:31,020 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:49:31,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645779800] [2022-04-28 07:49:31,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:49:31,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:49:31,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:49:31,024 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-28 07:49:31,025 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-28 07:49:32,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:49:32,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:49:32,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 139 conjunts are in the unsatisfiable core [2022-04-28 07:49:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:49:32,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:49:33,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {25561#true} call ULTIMATE.init(); {25561#true} is VALID [2022-04-28 07:49:33,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {25561#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); {25561#true} is VALID [2022-04-28 07:49:33,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25561#true} {25561#true} #60#return; {25561#true} is VALID [2022-04-28 07:49:33,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {25561#true} call #t~ret5 := main(); {25561#true} is VALID [2022-04-28 07:49:33,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {25561#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; {25561#true} is VALID [2022-04-28 07:49:33,775 INFO L272 TraceCheckUtils]: 6: Hoare triple {25561#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {25561#true} is VALID [2022-04-28 07:49:33,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,775 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25561#true} {25561#true} #52#return; {25561#true} is VALID [2022-04-28 07:49:33,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {25561#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {25599#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:49:33,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {25599#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {25599#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:49:33,776 INFO L272 TraceCheckUtils]: 13: Hoare triple {25599#(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)); {25561#true} is VALID [2022-04-28 07:49:33,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,778 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25561#true} {25599#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {25599#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:49:33,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {25599#(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; {25621#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:49:33,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {25621#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {25621#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:49:33,779 INFO L272 TraceCheckUtils]: 20: Hoare triple {25621#(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)); {25561#true} is VALID [2022-04-28 07:49:33,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,780 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {25561#true} {25621#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {25621#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:49:33,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {25621#(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; {25643#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:49:33,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {25643#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {25643#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:49:33,781 INFO L272 TraceCheckUtils]: 27: Hoare triple {25643#(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)); {25561#true} is VALID [2022-04-28 07:49:33,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,781 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {25561#true} {25643#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {25643#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:49:33,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {25643#(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; {25665#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:49:33,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {25665#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {25665#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:49:33,782 INFO L272 TraceCheckUtils]: 34: Hoare triple {25665#(and (= main_~y~0 3) (= (+ (- 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)); {25561#true} is VALID [2022-04-28 07:49:33,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,783 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {25561#true} {25665#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {25665#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:49:33,783 INFO L290 TraceCheckUtils]: 39: Hoare triple {25665#(and (= main_~y~0 3) (= (+ (- 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; {25687#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 07:49:33,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {25687#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !false; {25687#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 07:49:33,784 INFO L272 TraceCheckUtils]: 41: Hoare triple {25687#(and (= 2 (+ (- 2) main_~c~0)) (= 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)); {25561#true} is VALID [2022-04-28 07:49:33,784 INFO L290 TraceCheckUtils]: 42: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,784 INFO L290 TraceCheckUtils]: 43: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,784 INFO L290 TraceCheckUtils]: 44: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,785 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25561#true} {25687#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #54#return; {25687#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 07:49:33,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {25687#(and (= 2 (+ (- 2) main_~c~0)) (= 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; {25709#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:49:33,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {25709#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} assume !false; {25709#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:49:33,786 INFO L272 TraceCheckUtils]: 48: Hoare triple {25709#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 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)); {25561#true} is VALID [2022-04-28 07:49:33,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,786 INFO L290 TraceCheckUtils]: 50: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,786 INFO L290 TraceCheckUtils]: 51: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,786 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {25561#true} {25709#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} #54#return; {25709#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:49:33,787 INFO L290 TraceCheckUtils]: 53: Hoare triple {25709#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 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; {25731#(and (= 2 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:49:33,787 INFO L290 TraceCheckUtils]: 54: Hoare triple {25731#(and (= 2 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 4))} assume !false; {25731#(and (= 2 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:49:33,787 INFO L272 TraceCheckUtils]: 55: Hoare triple {25731#(and (= 2 (+ main_~c~0 (- 4))) (= (+ (- 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)); {25561#true} is VALID [2022-04-28 07:49:33,787 INFO L290 TraceCheckUtils]: 56: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,787 INFO L290 TraceCheckUtils]: 57: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,787 INFO L290 TraceCheckUtils]: 58: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,788 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25561#true} {25731#(and (= 2 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 4))} #54#return; {25731#(and (= 2 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:49:33,788 INFO L290 TraceCheckUtils]: 60: Hoare triple {25731#(and (= 2 (+ main_~c~0 (- 4))) (= (+ (- 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; {25753#(and (= 7 main_~y~0) (= 2 (+ main_~c~0 (- 5))))} is VALID [2022-04-28 07:49:33,788 INFO L290 TraceCheckUtils]: 61: Hoare triple {25753#(and (= 7 main_~y~0) (= 2 (+ main_~c~0 (- 5))))} assume !false; {25753#(and (= 7 main_~y~0) (= 2 (+ main_~c~0 (- 5))))} is VALID [2022-04-28 07:49:33,789 INFO L272 TraceCheckUtils]: 62: Hoare triple {25753#(and (= 7 main_~y~0) (= 2 (+ 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)); {25561#true} is VALID [2022-04-28 07:49:33,789 INFO L290 TraceCheckUtils]: 63: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,789 INFO L290 TraceCheckUtils]: 64: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,789 INFO L290 TraceCheckUtils]: 65: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,789 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {25561#true} {25753#(and (= 7 main_~y~0) (= 2 (+ main_~c~0 (- 5))))} #54#return; {25753#(and (= 7 main_~y~0) (= 2 (+ main_~c~0 (- 5))))} is VALID [2022-04-28 07:49:33,790 INFO L290 TraceCheckUtils]: 67: Hoare triple {25753#(and (= 7 main_~y~0) (= 2 (+ 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; {25775#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))))} is VALID [2022-04-28 07:49:33,790 INFO L290 TraceCheckUtils]: 68: Hoare triple {25775#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))))} assume !false; {25775#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))))} is VALID [2022-04-28 07:49:33,790 INFO L272 TraceCheckUtils]: 69: Hoare triple {25775#(and (= main_~y~0 8) (= 2 (+ 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)); {25561#true} is VALID [2022-04-28 07:49:33,790 INFO L290 TraceCheckUtils]: 70: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,790 INFO L290 TraceCheckUtils]: 71: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,790 INFO L290 TraceCheckUtils]: 72: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,791 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {25561#true} {25775#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))))} #54#return; {25775#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))))} is VALID [2022-04-28 07:49:33,791 INFO L290 TraceCheckUtils]: 74: Hoare triple {25775#(and (= main_~y~0 8) (= 2 (+ 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; {25797#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:49:33,791 INFO L290 TraceCheckUtils]: 75: Hoare triple {25797#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {25797#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:49:33,791 INFO L272 TraceCheckUtils]: 76: Hoare triple {25797#(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)); {25561#true} is VALID [2022-04-28 07:49:33,791 INFO L290 TraceCheckUtils]: 77: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,792 INFO L290 TraceCheckUtils]: 78: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,792 INFO L290 TraceCheckUtils]: 79: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,792 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {25561#true} {25797#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #54#return; {25797#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:49:33,792 INFO L290 TraceCheckUtils]: 81: Hoare triple {25797#(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; {25819#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:49:33,793 INFO L290 TraceCheckUtils]: 82: Hoare triple {25819#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {25819#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:49:33,793 INFO L272 TraceCheckUtils]: 83: Hoare triple {25819#(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)); {25561#true} is VALID [2022-04-28 07:49:33,793 INFO L290 TraceCheckUtils]: 84: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,793 INFO L290 TraceCheckUtils]: 85: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,793 INFO L290 TraceCheckUtils]: 86: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,793 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {25561#true} {25819#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {25819#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:49:33,794 INFO L290 TraceCheckUtils]: 88: Hoare triple {25819#(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; {25841#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:49:33,794 INFO L290 TraceCheckUtils]: 89: Hoare triple {25841#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !false; {25841#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:49:33,794 INFO L272 TraceCheckUtils]: 90: Hoare triple {25841#(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)); {25561#true} is VALID [2022-04-28 07:49:33,794 INFO L290 TraceCheckUtils]: 91: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,794 INFO L290 TraceCheckUtils]: 92: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,794 INFO L290 TraceCheckUtils]: 93: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,795 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25561#true} {25841#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} #54#return; {25841#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:49:33,795 INFO L290 TraceCheckUtils]: 95: Hoare triple {25841#(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; {25863#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:49:33,796 INFO L290 TraceCheckUtils]: 96: Hoare triple {25863#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {25863#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:49:33,796 INFO L272 TraceCheckUtils]: 97: Hoare triple {25863#(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)); {25561#true} is VALID [2022-04-28 07:49:33,796 INFO L290 TraceCheckUtils]: 98: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,796 INFO L290 TraceCheckUtils]: 99: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,796 INFO L290 TraceCheckUtils]: 100: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,796 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {25561#true} {25863#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {25863#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:49:33,797 INFO L290 TraceCheckUtils]: 102: Hoare triple {25863#(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; {25885#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:33,797 INFO L290 TraceCheckUtils]: 103: Hoare triple {25885#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !false; {25885#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:33,797 INFO L272 TraceCheckUtils]: 104: Hoare triple {25885#(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)); {25561#true} is VALID [2022-04-28 07:49:33,797 INFO L290 TraceCheckUtils]: 105: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,797 INFO L290 TraceCheckUtils]: 106: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,797 INFO L290 TraceCheckUtils]: 107: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,798 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {25561#true} {25885#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} #54#return; {25885#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:33,798 INFO L290 TraceCheckUtils]: 109: Hoare triple {25885#(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; {25907#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:49:33,799 INFO L290 TraceCheckUtils]: 110: Hoare triple {25907#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} assume !false; {25907#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:49:33,799 INFO L272 TraceCheckUtils]: 111: Hoare triple {25907#(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)); {25561#true} is VALID [2022-04-28 07:49:33,799 INFO L290 TraceCheckUtils]: 112: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,799 INFO L290 TraceCheckUtils]: 113: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,799 INFO L290 TraceCheckUtils]: 114: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,799 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {25561#true} {25907#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} #54#return; {25907#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:49:33,800 INFO L290 TraceCheckUtils]: 116: Hoare triple {25907#(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; {25929#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-28 07:49:33,800 INFO L290 TraceCheckUtils]: 117: Hoare triple {25929#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} assume !false; {25929#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-28 07:49:33,800 INFO L272 TraceCheckUtils]: 118: Hoare triple {25929#(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)); {25561#true} is VALID [2022-04-28 07:49:33,800 INFO L290 TraceCheckUtils]: 119: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,800 INFO L290 TraceCheckUtils]: 120: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,800 INFO L290 TraceCheckUtils]: 121: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,801 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {25561#true} {25929#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} #54#return; {25929#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-28 07:49:33,801 INFO L290 TraceCheckUtils]: 123: Hoare triple {25929#(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; {25951#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:49:33,801 INFO L290 TraceCheckUtils]: 124: Hoare triple {25951#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {25951#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:49:33,802 INFO L272 TraceCheckUtils]: 125: Hoare triple {25951#(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)); {25561#true} is VALID [2022-04-28 07:49:33,802 INFO L290 TraceCheckUtils]: 126: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,802 INFO L290 TraceCheckUtils]: 127: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,802 INFO L290 TraceCheckUtils]: 128: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,802 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {25561#true} {25951#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {25951#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:49:33,803 INFO L290 TraceCheckUtils]: 130: Hoare triple {25951#(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; {25973#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:49:33,803 INFO L290 TraceCheckUtils]: 131: Hoare triple {25973#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {25973#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:49:33,803 INFO L272 TraceCheckUtils]: 132: Hoare triple {25973#(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)); {25561#true} is VALID [2022-04-28 07:49:33,803 INFO L290 TraceCheckUtils]: 133: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,803 INFO L290 TraceCheckUtils]: 134: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,803 INFO L290 TraceCheckUtils]: 135: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,804 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {25561#true} {25973#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {25973#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:49:33,804 INFO L290 TraceCheckUtils]: 137: Hoare triple {25973#(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; {25995#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:49:33,804 INFO L290 TraceCheckUtils]: 138: Hoare triple {25995#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {25995#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:49:33,804 INFO L272 TraceCheckUtils]: 139: Hoare triple {25995#(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)); {25561#true} is VALID [2022-04-28 07:49:33,805 INFO L290 TraceCheckUtils]: 140: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,805 INFO L290 TraceCheckUtils]: 141: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,805 INFO L290 TraceCheckUtils]: 142: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,805 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {25561#true} {25995#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #54#return; {25995#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:49:33,805 INFO L290 TraceCheckUtils]: 144: Hoare triple {25995#(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; {26017#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:49:33,806 INFO L290 TraceCheckUtils]: 145: Hoare triple {26017#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {26017#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:49:33,806 INFO L272 TraceCheckUtils]: 146: Hoare triple {26017#(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)); {25561#true} is VALID [2022-04-28 07:49:33,806 INFO L290 TraceCheckUtils]: 147: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,806 INFO L290 TraceCheckUtils]: 148: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,806 INFO L290 TraceCheckUtils]: 149: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,806 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {25561#true} {26017#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #54#return; {26017#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:49:33,807 INFO L290 TraceCheckUtils]: 151: Hoare triple {26017#(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; {26039#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:49:33,807 INFO L290 TraceCheckUtils]: 152: Hoare triple {26039#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} assume !false; {26039#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:49:33,807 INFO L272 TraceCheckUtils]: 153: Hoare triple {26039#(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)); {25561#true} is VALID [2022-04-28 07:49:33,807 INFO L290 TraceCheckUtils]: 154: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,808 INFO L290 TraceCheckUtils]: 155: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,808 INFO L290 TraceCheckUtils]: 156: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,808 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25561#true} {26039#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} #54#return; {26039#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:49:33,808 INFO L290 TraceCheckUtils]: 158: Hoare triple {26039#(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; {26061#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-28 07:49:33,809 INFO L290 TraceCheckUtils]: 159: Hoare triple {26061#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} assume !false; {26061#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-28 07:49:33,809 INFO L272 TraceCheckUtils]: 160: Hoare triple {26061#(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)); {25561#true} is VALID [2022-04-28 07:49:33,809 INFO L290 TraceCheckUtils]: 161: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,809 INFO L290 TraceCheckUtils]: 162: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,809 INFO L290 TraceCheckUtils]: 163: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,809 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {25561#true} {26061#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} #54#return; {26061#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-28 07:49:33,810 INFO L290 TraceCheckUtils]: 165: Hoare triple {26061#(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; {26083#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-28 07:49:33,810 INFO L290 TraceCheckUtils]: 166: Hoare triple {26083#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {26083#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-28 07:49:33,810 INFO L272 TraceCheckUtils]: 167: Hoare triple {26083#(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)); {25561#true} is VALID [2022-04-28 07:49:33,810 INFO L290 TraceCheckUtils]: 168: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,810 INFO L290 TraceCheckUtils]: 169: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,810 INFO L290 TraceCheckUtils]: 170: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,811 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {25561#true} {26083#(and (= main_~y~0 22) (= main_~c~0 22))} #54#return; {26083#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-28 07:49:33,811 INFO L290 TraceCheckUtils]: 172: Hoare triple {26083#(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; {26105#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:49:33,812 INFO L290 TraceCheckUtils]: 173: Hoare triple {26105#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {26105#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:49:33,812 INFO L272 TraceCheckUtils]: 174: Hoare triple {26105#(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)); {25561#true} is VALID [2022-04-28 07:49:33,812 INFO L290 TraceCheckUtils]: 175: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,812 INFO L290 TraceCheckUtils]: 176: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,812 INFO L290 TraceCheckUtils]: 177: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,812 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {25561#true} {26105#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {26105#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:49:33,813 INFO L290 TraceCheckUtils]: 179: Hoare triple {26105#(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; {26127#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:49:33,813 INFO L290 TraceCheckUtils]: 180: Hoare triple {26127#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} assume !false; {26127#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:49:33,813 INFO L272 TraceCheckUtils]: 181: Hoare triple {26127#(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)); {25561#true} is VALID [2022-04-28 07:49:33,813 INFO L290 TraceCheckUtils]: 182: Hoare triple {25561#true} ~cond := #in~cond; {26137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:49:33,814 INFO L290 TraceCheckUtils]: 183: Hoare triple {26137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:33,814 INFO L290 TraceCheckUtils]: 184: Hoare triple {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:33,815 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} {26127#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} #54#return; {26148#(and (= main_~y~0 24) (= (+ (* 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)) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:49:33,816 INFO L290 TraceCheckUtils]: 186: Hoare triple {26148#(and (= main_~y~0 24) (= (+ (* 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)) (= 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; {26152#(and (= main_~y~0 25) (= main_~c~0 25) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0))} is VALID [2022-04-28 07:49:33,817 INFO L290 TraceCheckUtils]: 187: Hoare triple {26152#(and (= main_~y~0 25) (= main_~c~0 25) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0))} assume !false; {26152#(and (= main_~y~0 25) (= main_~c~0 25) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0))} is VALID [2022-04-28 07:49:33,817 INFO L272 TraceCheckUtils]: 188: Hoare triple {26152#(and (= main_~y~0 25) (= main_~c~0 25) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) 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)); {25561#true} is VALID [2022-04-28 07:49:33,817 INFO L290 TraceCheckUtils]: 189: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,817 INFO L290 TraceCheckUtils]: 190: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,817 INFO L290 TraceCheckUtils]: 191: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,817 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {25561#true} {26152#(and (= main_~y~0 25) (= main_~c~0 25) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0))} #54#return; {26152#(and (= main_~y~0 25) (= main_~c~0 25) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0))} is VALID [2022-04-28 07:49:33,819 INFO L290 TraceCheckUtils]: 193: Hoare triple {26152#(and (= main_~y~0 25) (= main_~c~0 25) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26174#(and (= main_~c~0 26) (<= (+ 105625 (* main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 26))} is VALID [2022-04-28 07:49:33,819 INFO L290 TraceCheckUtils]: 194: Hoare triple {26174#(and (= main_~c~0 26) (<= (+ 105625 (* main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 26))} assume !false; {26174#(and (= main_~c~0 26) (<= (+ 105625 (* main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 26))} is VALID [2022-04-28 07:49:33,819 INFO L272 TraceCheckUtils]: 195: Hoare triple {26174#(and (= main_~c~0 26) (<= (+ 105625 (* main_~y~0 main_~y~0 main_~y~0)) main_~x~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)); {25561#true} is VALID [2022-04-28 07:49:33,820 INFO L290 TraceCheckUtils]: 196: Hoare triple {25561#true} ~cond := #in~cond; {26137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:49:33,820 INFO L290 TraceCheckUtils]: 197: Hoare triple {26137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:33,820 INFO L290 TraceCheckUtils]: 198: Hoare triple {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:33,821 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} {26174#(and (= main_~c~0 26) (<= (+ 105625 (* main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 26))} #54#return; {26193#(and (= main_~c~0 26) (= (+ (* 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)) (= main_~y~0 26))} is VALID [2022-04-28 07:49:33,822 INFO L290 TraceCheckUtils]: 200: Hoare triple {26193#(and (= main_~c~0 26) (= (+ (* 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)) (= 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; {26197#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) 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)) 4))) (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:49:33,823 INFO L290 TraceCheckUtils]: 201: Hoare triple {26197#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) 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)) 4))) (= main_~y~0 27) (= main_~c~0 27))} assume !false; {26197#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) 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)) 4))) (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:49:33,823 INFO L272 TraceCheckUtils]: 202: Hoare triple {26197#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) 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)) 4))) (= 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)); {25561#true} is VALID [2022-04-28 07:49:33,823 INFO L290 TraceCheckUtils]: 203: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-28 07:49:33,823 INFO L290 TraceCheckUtils]: 204: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-28 07:49:33,823 INFO L290 TraceCheckUtils]: 205: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-28 07:49:33,823 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {25561#true} {26197#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) 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)) 4))) (= main_~y~0 27) (= main_~c~0 27))} #54#return; {26197#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) 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)) 4))) (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:49:33,824 INFO L290 TraceCheckUtils]: 207: Hoare triple {26197#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) 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)) 4))) (= 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; {26219#(and (<= (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1) (+ (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2) (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 (- 12)) (* main_~y~0 main_~y~0 13) 4 (* main_~y~0 main_~y~0 main_~y~0 (- 6))) 4))) (<= main_~c~0 28) (< 27 main_~k~0) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-28 07:49:33,825 INFO L290 TraceCheckUtils]: 208: Hoare triple {26219#(and (<= (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1) (+ (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2) (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 (- 12)) (* main_~y~0 main_~y~0 13) 4 (* main_~y~0 main_~y~0 main_~y~0 (- 6))) 4))) (<= main_~c~0 28) (< 27 main_~k~0) (= (+ (- 1) main_~y~0) 27))} assume !false; {26219#(and (<= (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1) (+ (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2) (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 (- 12)) (* main_~y~0 main_~y~0 13) 4 (* main_~y~0 main_~y~0 main_~y~0 (- 6))) 4))) (<= main_~c~0 28) (< 27 main_~k~0) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-28 07:49:33,825 INFO L272 TraceCheckUtils]: 209: Hoare triple {26219#(and (<= (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1) (+ (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2) (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 (- 12)) (* main_~y~0 main_~y~0 13) 4 (* main_~y~0 main_~y~0 main_~y~0 (- 6))) 4))) (<= main_~c~0 28) (< 27 main_~k~0) (= (+ (- 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)); {25561#true} is VALID [2022-04-28 07:49:33,825 INFO L290 TraceCheckUtils]: 210: Hoare triple {25561#true} ~cond := #in~cond; {26137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:49:33,826 INFO L290 TraceCheckUtils]: 211: Hoare triple {26137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:33,826 INFO L290 TraceCheckUtils]: 212: Hoare triple {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:33,827 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} {26219#(and (<= (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1) (+ (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2) (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 (- 12)) (* main_~y~0 main_~y~0 13) 4 (* main_~y~0 main_~y~0 main_~y~0 (- 6))) 4))) (<= main_~c~0 28) (< 27 main_~k~0) (= (+ (- 1) main_~y~0) 27))} #54#return; {26238#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-28 07:49:33,827 INFO L290 TraceCheckUtils]: 214: Hoare triple {26238#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} assume !(~c~0 < ~k~0); {26242#(and (<= main_~k~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-28 07:49:33,828 INFO L272 TraceCheckUtils]: 215: Hoare triple {26242#(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)); {26246#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:49:33,828 INFO L290 TraceCheckUtils]: 216: Hoare triple {26246#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26250#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:49:33,828 INFO L290 TraceCheckUtils]: 217: Hoare triple {26250#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25562#false} is VALID [2022-04-28 07:49:33,829 INFO L290 TraceCheckUtils]: 218: Hoare triple {25562#false} assume !false; {25562#false} is VALID [2022-04-28 07:49:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2900 backedges. 280 proven. 1230 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2022-04-28 07:49:33,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:50:27,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:50:27,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154259890] [2022-04-28 07:50:27,779 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:50:27,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645779800] [2022-04-28 07:50:27,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645779800] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:50:27,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:50:27,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2022-04-28 07:50:27,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:50:27,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1708083744] [2022-04-28 07:50:27,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1708083744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:50:27,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:50:27,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 07:50:27,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240139916] [2022-04-28 07:50:27,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:50:27,780 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 35 states have internal predecessors, (74), 31 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) Word has length 219 [2022-04-28 07:50:27,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:50:27,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 35 states have internal predecessors, (74), 31 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-28 07:50:28,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:50:28,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 07:50:28,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:50:28,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 07:50:28,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1748, Unknown=9, NotChecked=0, Total=1892 [2022-04-28 07:50:28,252 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 35 states have internal predecessors, (74), 31 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-28 07:50:52,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:50:52,833 INFO L93 Difference]: Finished difference Result 120 states and 148 transitions. [2022-04-28 07:50:52,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 07:50:52,833 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 35 states have internal predecessors, (74), 31 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) Word has length 219 [2022-04-28 07:50:52,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:50:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 35 states have internal predecessors, (74), 31 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-28 07:50:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 144 transitions. [2022-04-28 07:50:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 35 states have internal predecessors, (74), 31 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-28 07:50:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 144 transitions. [2022-04-28 07:50:52,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 144 transitions. [2022-04-28 07:50:53,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:50:53,377 INFO L225 Difference]: With dead ends: 120 [2022-04-28 07:50:53,377 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 07:50:53,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=156, Invalid=1997, Unknown=9, NotChecked=0, Total=2162 [2022-04-28 07:50:53,378 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 9 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 3321 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:50:53,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1514 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3321 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2022-04-28 07:50:53,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 07:50:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-28 07:50:53,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:50:53,519 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), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 07:50:53,520 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), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 07:50:53,520 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), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 07:50:53,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:50:53,522 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-04-28 07:50:53,522 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2022-04-28 07:50:53,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:50:53,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:50:53,523 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), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 115 states. [2022-04-28 07:50:53,523 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), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 115 states. [2022-04-28 07:50:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:50:53,525 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-04-28 07:50:53,526 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2022-04-28 07:50:53,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:50:53,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:50:53,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:50:53,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:50:53,526 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), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 07:50:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 143 transitions. [2022-04-28 07:50:53,529 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 143 transitions. Word has length 219 [2022-04-28 07:50:53,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:50:53,529 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 143 transitions. [2022-04-28 07:50:53,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 35 states have internal predecessors, (74), 31 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-28 07:50:53,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 143 transitions. [2022-04-28 07:50:54,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:50:54,558 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2022-04-28 07:50:54,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-04-28 07:50:54,559 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:50:54,559 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:50:54,565 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-28 07:50:54,763 WARN L477 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-28 07:50:54,764 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:50:54,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:50:54,764 INFO L85 PathProgramCache]: Analyzing trace with hash 963111432, now seen corresponding path program 57 times [2022-04-28 07:50:54,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:50:54,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [957254197] [2022-04-28 07:50:54,854 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:50:54,855 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:50:54,855 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:50:54,855 INFO L85 PathProgramCache]: Analyzing trace with hash 963111432, now seen corresponding path program 58 times [2022-04-28 07:50:54,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:50:54,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806673073] [2022-04-28 07:50:54,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:50:54,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:50:54,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:50:54,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1831657088] [2022-04-28 07:50:54,875 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:50:54,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:50:54,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:50:54,877 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-28 07:50:54,912 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-28 07:50:55,740 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:50:55,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:50:55,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 124 conjunts are in the unsatisfiable core [2022-04-28 07:50:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:50:55,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:50:57,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {27006#true} call ULTIMATE.init(); {27006#true} is VALID [2022-04-28 07:50:57,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {27006#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); {27006#true} is VALID [2022-04-28 07:50:57,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27006#true} {27006#true} #60#return; {27006#true} is VALID [2022-04-28 07:50:57,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {27006#true} call #t~ret5 := main(); {27006#true} is VALID [2022-04-28 07:50:57,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {27006#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; {27006#true} is VALID [2022-04-28 07:50:57,035 INFO L272 TraceCheckUtils]: 6: Hoare triple {27006#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {27006#true} is VALID [2022-04-28 07:50:57,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,035 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27006#true} {27006#true} #52#return; {27006#true} is VALID [2022-04-28 07:50:57,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {27006#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {27044#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:50:57,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {27044#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {27044#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:50:57,036 INFO L272 TraceCheckUtils]: 13: Hoare triple {27044#(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)); {27006#true} is VALID [2022-04-28 07:50:57,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,036 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27006#true} {27044#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {27044#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:50:57,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {27044#(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; {27066#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:50:57,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {27066#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {27066#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:50:57,037 INFO L272 TraceCheckUtils]: 20: Hoare triple {27066#(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)); {27006#true} is VALID [2022-04-28 07:50:57,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,038 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {27006#true} {27066#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {27066#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:50:57,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {27066#(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; {27088#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:50:57,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {27088#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {27088#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:50:57,039 INFO L272 TraceCheckUtils]: 27: Hoare triple {27088#(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)); {27006#true} is VALID [2022-04-28 07:50:57,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,039 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {27006#true} {27088#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {27088#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:50:57,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {27088#(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; {27110#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:50:57,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {27110#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {27110#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:50:57,040 INFO L272 TraceCheckUtils]: 34: Hoare triple {27110#(and (= main_~y~0 3) (= (+ (- 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)); {27006#true} is VALID [2022-04-28 07:50:57,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,040 INFO L290 TraceCheckUtils]: 36: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,041 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {27006#true} {27110#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {27110#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:50:57,041 INFO L290 TraceCheckUtils]: 39: Hoare triple {27110#(and (= main_~y~0 3) (= (+ (- 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; {27132#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:50:57,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {27132#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {27132#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:50:57,042 INFO L272 TraceCheckUtils]: 41: Hoare triple {27132#(and (= 2 (+ (- 2) main_~c~0)) (= 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)); {27006#true} is VALID [2022-04-28 07:50:57,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,042 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {27006#true} {27132#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #54#return; {27132#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:50:57,043 INFO L290 TraceCheckUtils]: 46: Hoare triple {27132#(and (= 2 (+ (- 2) main_~c~0)) (= 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; {27154#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-28 07:50:57,043 INFO L290 TraceCheckUtils]: 47: Hoare triple {27154#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {27154#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-28 07:50:57,043 INFO L272 TraceCheckUtils]: 48: Hoare triple {27154#(and (= 2 (+ main_~c~0 (- 3))) (= 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)); {27006#true} is VALID [2022-04-28 07:50:57,043 INFO L290 TraceCheckUtils]: 49: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,043 INFO L290 TraceCheckUtils]: 50: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,043 INFO L290 TraceCheckUtils]: 51: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,044 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {27006#true} {27154#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #54#return; {27154#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-28 07:50:57,044 INFO L290 TraceCheckUtils]: 53: Hoare triple {27154#(and (= 2 (+ main_~c~0 (- 3))) (= 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; {27176#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:50:57,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {27176#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {27176#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:50:57,044 INFO L272 TraceCheckUtils]: 55: Hoare triple {27176#(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)); {27006#true} is VALID [2022-04-28 07:50:57,045 INFO L290 TraceCheckUtils]: 56: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,045 INFO L290 TraceCheckUtils]: 57: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,045 INFO L290 TraceCheckUtils]: 58: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,045 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {27006#true} {27176#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {27176#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:50:57,046 INFO L290 TraceCheckUtils]: 60: Hoare triple {27176#(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; {27198#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:50:57,046 INFO L290 TraceCheckUtils]: 61: Hoare triple {27198#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {27198#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:50:57,046 INFO L272 TraceCheckUtils]: 62: Hoare triple {27198#(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)); {27006#true} is VALID [2022-04-28 07:50:57,046 INFO L290 TraceCheckUtils]: 63: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,046 INFO L290 TraceCheckUtils]: 64: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,046 INFO L290 TraceCheckUtils]: 65: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,047 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27006#true} {27198#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #54#return; {27198#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:50:57,047 INFO L290 TraceCheckUtils]: 67: Hoare triple {27198#(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; {27220#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:50:57,047 INFO L290 TraceCheckUtils]: 68: Hoare triple {27220#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {27220#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:50:57,047 INFO L272 TraceCheckUtils]: 69: Hoare triple {27220#(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)); {27006#true} is VALID [2022-04-28 07:50:57,047 INFO L290 TraceCheckUtils]: 70: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,048 INFO L290 TraceCheckUtils]: 71: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,048 INFO L290 TraceCheckUtils]: 72: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,048 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {27006#true} {27220#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {27220#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:50:57,048 INFO L290 TraceCheckUtils]: 74: Hoare triple {27220#(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; {27242#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:50:57,049 INFO L290 TraceCheckUtils]: 75: Hoare triple {27242#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {27242#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:50:57,049 INFO L272 TraceCheckUtils]: 76: Hoare triple {27242#(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)); {27006#true} is VALID [2022-04-28 07:50:57,049 INFO L290 TraceCheckUtils]: 77: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,049 INFO L290 TraceCheckUtils]: 78: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,049 INFO L290 TraceCheckUtils]: 79: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,049 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27006#true} {27242#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #54#return; {27242#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:50:57,050 INFO L290 TraceCheckUtils]: 81: Hoare triple {27242#(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; {27264#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:50:57,050 INFO L290 TraceCheckUtils]: 82: Hoare triple {27264#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {27264#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:50:57,050 INFO L272 TraceCheckUtils]: 83: Hoare triple {27264#(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)); {27006#true} is VALID [2022-04-28 07:50:57,050 INFO L290 TraceCheckUtils]: 84: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,050 INFO L290 TraceCheckUtils]: 85: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,050 INFO L290 TraceCheckUtils]: 86: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,051 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {27006#true} {27264#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #54#return; {27264#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:50:57,051 INFO L290 TraceCheckUtils]: 88: Hoare triple {27264#(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; {27286#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:50:57,052 INFO L290 TraceCheckUtils]: 89: Hoare triple {27286#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {27286#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:50:57,052 INFO L272 TraceCheckUtils]: 90: Hoare triple {27286#(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)); {27006#true} is VALID [2022-04-28 07:50:57,052 INFO L290 TraceCheckUtils]: 91: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,052 INFO L290 TraceCheckUtils]: 92: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,052 INFO L290 TraceCheckUtils]: 93: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,052 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27006#true} {27286#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {27286#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:50:57,053 INFO L290 TraceCheckUtils]: 95: Hoare triple {27286#(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; {27308#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:50:57,053 INFO L290 TraceCheckUtils]: 96: Hoare triple {27308#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {27308#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:50:57,053 INFO L272 TraceCheckUtils]: 97: Hoare triple {27308#(and (= main_~y~0 12) (= (+ (- 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)); {27006#true} is VALID [2022-04-28 07:50:57,053 INFO L290 TraceCheckUtils]: 98: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,053 INFO L290 TraceCheckUtils]: 99: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,053 INFO L290 TraceCheckUtils]: 100: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,054 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {27006#true} {27308#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {27308#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:50:57,054 INFO L290 TraceCheckUtils]: 102: Hoare triple {27308#(and (= main_~y~0 12) (= (+ (- 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; {27330#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-28 07:50:57,055 INFO L290 TraceCheckUtils]: 103: Hoare triple {27330#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !false; {27330#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-28 07:50:57,055 INFO L272 TraceCheckUtils]: 104: Hoare triple {27330#(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)); {27006#true} is VALID [2022-04-28 07:50:57,055 INFO L290 TraceCheckUtils]: 105: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,055 INFO L290 TraceCheckUtils]: 106: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,055 INFO L290 TraceCheckUtils]: 107: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,055 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {27006#true} {27330#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} #54#return; {27330#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-28 07:50:57,056 INFO L290 TraceCheckUtils]: 109: Hoare triple {27330#(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; {27352#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-28 07:50:57,056 INFO L290 TraceCheckUtils]: 110: Hoare triple {27352#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} assume !false; {27352#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-28 07:50:57,056 INFO L272 TraceCheckUtils]: 111: Hoare triple {27352#(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)); {27006#true} is VALID [2022-04-28 07:50:57,056 INFO L290 TraceCheckUtils]: 112: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,056 INFO L290 TraceCheckUtils]: 113: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,056 INFO L290 TraceCheckUtils]: 114: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,057 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {27006#true} {27352#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} #54#return; {27352#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-28 07:50:57,057 INFO L290 TraceCheckUtils]: 116: Hoare triple {27352#(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; {27374#(and (= 11 (+ main_~c~0 (- 4))) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:50:57,057 INFO L290 TraceCheckUtils]: 117: Hoare triple {27374#(and (= 11 (+ main_~c~0 (- 4))) (= 14 (+ (- 1) main_~y~0)))} assume !false; {27374#(and (= 11 (+ main_~c~0 (- 4))) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:50:57,058 INFO L272 TraceCheckUtils]: 118: Hoare triple {27374#(and (= 11 (+ main_~c~0 (- 4))) (= 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)); {27006#true} is VALID [2022-04-28 07:50:57,058 INFO L290 TraceCheckUtils]: 119: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,058 INFO L290 TraceCheckUtils]: 120: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,058 INFO L290 TraceCheckUtils]: 121: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,058 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {27006#true} {27374#(and (= 11 (+ main_~c~0 (- 4))) (= 14 (+ (- 1) main_~y~0)))} #54#return; {27374#(and (= 11 (+ main_~c~0 (- 4))) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:50:57,059 INFO L290 TraceCheckUtils]: 123: Hoare triple {27374#(and (= 11 (+ main_~c~0 (- 4))) (= 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; {27396#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:50:57,059 INFO L290 TraceCheckUtils]: 124: Hoare triple {27396#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {27396#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:50:57,059 INFO L272 TraceCheckUtils]: 125: Hoare triple {27396#(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)); {27006#true} is VALID [2022-04-28 07:50:57,059 INFO L290 TraceCheckUtils]: 126: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,059 INFO L290 TraceCheckUtils]: 127: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,059 INFO L290 TraceCheckUtils]: 128: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,060 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {27006#true} {27396#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {27396#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:50:57,060 INFO L290 TraceCheckUtils]: 130: Hoare triple {27396#(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; {27418#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:50:57,060 INFO L290 TraceCheckUtils]: 131: Hoare triple {27418#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {27418#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:50:57,060 INFO L272 TraceCheckUtils]: 132: Hoare triple {27418#(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)); {27006#true} is VALID [2022-04-28 07:50:57,060 INFO L290 TraceCheckUtils]: 133: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,061 INFO L290 TraceCheckUtils]: 134: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,061 INFO L290 TraceCheckUtils]: 135: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,061 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {27006#true} {27418#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {27418#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:50:57,061 INFO L290 TraceCheckUtils]: 137: Hoare triple {27418#(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; {27440#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:50:57,062 INFO L290 TraceCheckUtils]: 138: Hoare triple {27440#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {27440#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:50:57,062 INFO L272 TraceCheckUtils]: 139: Hoare triple {27440#(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)); {27006#true} is VALID [2022-04-28 07:50:57,062 INFO L290 TraceCheckUtils]: 140: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,062 INFO L290 TraceCheckUtils]: 141: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,062 INFO L290 TraceCheckUtils]: 142: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,062 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {27006#true} {27440#(and (= main_~c~0 18) (= main_~y~0 18))} #54#return; {27440#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:50:57,063 INFO L290 TraceCheckUtils]: 144: Hoare triple {27440#(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; {27462#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:50:57,063 INFO L290 TraceCheckUtils]: 145: Hoare triple {27462#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {27462#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:50:57,063 INFO L272 TraceCheckUtils]: 146: Hoare triple {27462#(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)); {27006#true} is VALID [2022-04-28 07:50:57,063 INFO L290 TraceCheckUtils]: 147: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,063 INFO L290 TraceCheckUtils]: 148: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,063 INFO L290 TraceCheckUtils]: 149: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,064 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {27006#true} {27462#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #54#return; {27462#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:50:57,064 INFO L290 TraceCheckUtils]: 151: Hoare triple {27462#(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; {27484#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-28 07:50:57,065 INFO L290 TraceCheckUtils]: 152: Hoare triple {27484#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {27484#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-28 07:50:57,065 INFO L272 TraceCheckUtils]: 153: Hoare triple {27484#(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)); {27006#true} is VALID [2022-04-28 07:50:57,065 INFO L290 TraceCheckUtils]: 154: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,065 INFO L290 TraceCheckUtils]: 155: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,065 INFO L290 TraceCheckUtils]: 156: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,065 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {27006#true} {27484#(and (= main_~c~0 20) (= main_~y~0 20))} #54#return; {27484#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-28 07:50:57,066 INFO L290 TraceCheckUtils]: 158: Hoare triple {27484#(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; {27506#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:50:57,066 INFO L290 TraceCheckUtils]: 159: Hoare triple {27506#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)))} assume !false; {27506#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:50:57,066 INFO L272 TraceCheckUtils]: 160: Hoare triple {27506#(and (= (+ (- 1) main_~c~0) 20) (= 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)); {27006#true} is VALID [2022-04-28 07:50:57,066 INFO L290 TraceCheckUtils]: 161: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,066 INFO L290 TraceCheckUtils]: 162: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,066 INFO L290 TraceCheckUtils]: 163: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,067 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {27006#true} {27506#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)))} #54#return; {27506#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:50:57,067 INFO L290 TraceCheckUtils]: 165: Hoare triple {27506#(and (= (+ (- 1) main_~c~0) 20) (= 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; {27528#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-28 07:50:57,068 INFO L290 TraceCheckUtils]: 166: Hoare triple {27528#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} assume !false; {27528#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-28 07:50:57,068 INFO L272 TraceCheckUtils]: 167: Hoare triple {27528#(and (= main_~c~0 22) (= (+ (- 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)); {27006#true} is VALID [2022-04-28 07:50:57,068 INFO L290 TraceCheckUtils]: 168: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,068 INFO L290 TraceCheckUtils]: 169: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,068 INFO L290 TraceCheckUtils]: 170: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,068 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {27006#true} {27528#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} #54#return; {27528#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-28 07:50:57,069 INFO L290 TraceCheckUtils]: 172: Hoare triple {27528#(and (= main_~c~0 22) (= (+ (- 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; {27550#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} is VALID [2022-04-28 07:50:57,069 INFO L290 TraceCheckUtils]: 173: Hoare triple {27550#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} assume !false; {27550#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} is VALID [2022-04-28 07:50:57,069 INFO L272 TraceCheckUtils]: 174: Hoare triple {27550#(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)); {27006#true} is VALID [2022-04-28 07:50:57,069 INFO L290 TraceCheckUtils]: 175: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,069 INFO L290 TraceCheckUtils]: 176: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,069 INFO L290 TraceCheckUtils]: 177: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,070 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {27006#true} {27550#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} #54#return; {27550#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} is VALID [2022-04-28 07:50:57,070 INFO L290 TraceCheckUtils]: 179: Hoare triple {27550#(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; {27572#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} is VALID [2022-04-28 07:50:57,070 INFO L290 TraceCheckUtils]: 180: Hoare triple {27572#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} assume !false; {27572#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} is VALID [2022-04-28 07:50:57,071 INFO L272 TraceCheckUtils]: 181: Hoare triple {27572#(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)); {27006#true} is VALID [2022-04-28 07:50:57,071 INFO L290 TraceCheckUtils]: 182: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,071 INFO L290 TraceCheckUtils]: 183: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,071 INFO L290 TraceCheckUtils]: 184: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,071 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {27006#true} {27572#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} #54#return; {27572#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} is VALID [2022-04-28 07:50:57,072 INFO L290 TraceCheckUtils]: 186: Hoare triple {27572#(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; {27594#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-28 07:50:57,072 INFO L290 TraceCheckUtils]: 187: Hoare triple {27594#(and (= main_~y~0 25) (= main_~c~0 25))} assume !false; {27594#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-28 07:50:57,072 INFO L272 TraceCheckUtils]: 188: Hoare triple {27594#(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)); {27006#true} is VALID [2022-04-28 07:50:57,072 INFO L290 TraceCheckUtils]: 189: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,072 INFO L290 TraceCheckUtils]: 190: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,072 INFO L290 TraceCheckUtils]: 191: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,073 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {27006#true} {27594#(and (= main_~y~0 25) (= main_~c~0 25))} #54#return; {27594#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-28 07:50:57,073 INFO L290 TraceCheckUtils]: 193: Hoare triple {27594#(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; {27616#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:50:57,073 INFO L290 TraceCheckUtils]: 194: Hoare triple {27616#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} assume !false; {27616#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:50:57,073 INFO L272 TraceCheckUtils]: 195: Hoare triple {27616#(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)); {27006#true} is VALID [2022-04-28 07:50:57,073 INFO L290 TraceCheckUtils]: 196: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,074 INFO L290 TraceCheckUtils]: 197: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,074 INFO L290 TraceCheckUtils]: 198: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,074 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {27006#true} {27616#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} #54#return; {27616#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:50:57,074 INFO L290 TraceCheckUtils]: 200: Hoare triple {27616#(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; {27638#(and (= 25 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-28 07:50:57,075 INFO L290 TraceCheckUtils]: 201: Hoare triple {27638#(and (= 25 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 25))} assume !false; {27638#(and (= 25 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-28 07:50:57,075 INFO L272 TraceCheckUtils]: 202: Hoare triple {27638#(and (= 25 (+ (- 2) main_~c~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)); {27006#true} is VALID [2022-04-28 07:50:57,075 INFO L290 TraceCheckUtils]: 203: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,075 INFO L290 TraceCheckUtils]: 204: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,075 INFO L290 TraceCheckUtils]: 205: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,075 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {27006#true} {27638#(and (= 25 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 25))} #54#return; {27638#(and (= 25 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-28 07:50:57,076 INFO L290 TraceCheckUtils]: 207: Hoare triple {27638#(and (= 25 (+ (- 2) main_~c~0)) (= (+ (- 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; {27660#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-28 07:50:57,076 INFO L290 TraceCheckUtils]: 208: Hoare triple {27660#(and (= main_~c~0 28) (= main_~y~0 28))} assume !false; {27660#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-28 07:50:57,076 INFO L272 TraceCheckUtils]: 209: Hoare triple {27660#(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)); {27006#true} is VALID [2022-04-28 07:50:57,076 INFO L290 TraceCheckUtils]: 210: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,076 INFO L290 TraceCheckUtils]: 211: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,077 INFO L290 TraceCheckUtils]: 212: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,077 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {27006#true} {27660#(and (= main_~c~0 28) (= main_~y~0 28))} #54#return; {27660#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-28 07:50:57,077 INFO L290 TraceCheckUtils]: 214: Hoare triple {27660#(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; {27682#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:50:57,078 INFO L290 TraceCheckUtils]: 215: Hoare triple {27682#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} assume !false; {27682#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:50:57,078 INFO L272 TraceCheckUtils]: 216: Hoare triple {27682#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 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)); {27006#true} is VALID [2022-04-28 07:50:57,078 INFO L290 TraceCheckUtils]: 217: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-28 07:50:57,078 INFO L290 TraceCheckUtils]: 218: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-28 07:50:57,078 INFO L290 TraceCheckUtils]: 219: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-28 07:50:57,078 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {27006#true} {27682#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} #54#return; {27682#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:50:57,079 INFO L290 TraceCheckUtils]: 221: Hoare triple {27682#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} assume !(~c~0 < ~k~0); {27704#(and (< 28 main_~k~0) (= 28 (+ (- 1) main_~y~0)) (<= main_~k~0 29))} is VALID [2022-04-28 07:50:57,080 INFO L272 TraceCheckUtils]: 222: Hoare triple {27704#(and (< 28 main_~k~0) (= 28 (+ (- 1) main_~y~0)) (<= main_~k~0 29))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27708#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:50:57,080 INFO L290 TraceCheckUtils]: 223: Hoare triple {27708#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27712#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:50:57,080 INFO L290 TraceCheckUtils]: 224: Hoare triple {27712#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27007#false} is VALID [2022-04-28 07:50:57,080 INFO L290 TraceCheckUtils]: 225: Hoare triple {27007#false} assume !false; {27007#false} is VALID [2022-04-28 07:50:57,081 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-28 07:50:57,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:50:57,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:50:57,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806673073] [2022-04-28 07:50:57,493 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:50:57,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831657088] [2022-04-28 07:50:57,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831657088] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:50:57,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:50:57,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2022-04-28 07:50:57,494 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:50:57,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [957254197] [2022-04-28 07:50:57,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [957254197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:50:57,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:50:57,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 07:50:57,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768331591] [2022-04-28 07:50:57,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:50:57,495 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) Word has length 226 [2022-04-28 07:50:57,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:50:57,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2022-04-28 07:50:58,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:50:58,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 07:50:58,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:50:58,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 07:50:58,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 07:50:58,022 INFO L87 Difference]: Start difference. First operand 115 states and 143 transitions. Second operand has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2022-04-28 07:51:22,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:51:22,752 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2022-04-28 07:51:22,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 07:51:22,752 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) Word has length 226 [2022-04-28 07:51:22,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:51:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2022-04-28 07:51:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 148 transitions. [2022-04-28 07:51:22,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2022-04-28 07:51:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 148 transitions. [2022-04-28 07:51:22,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 148 transitions. [2022-04-28 07:51:23,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:51:23,363 INFO L225 Difference]: With dead ends: 123 [2022-04-28 07:51:23,363 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 07:51:23,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 07:51:23,364 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 3047 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 3047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-04-28 07:51:23,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1655 Invalid, 3047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3047 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2022-04-28 07:51:23,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 07:51:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-28 07:51:23,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:51:23,501 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), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 07:51:23,501 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), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 07:51:23,502 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), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 07:51:23,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:51:23,504 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-28 07:51:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2022-04-28 07:51:23,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:51:23,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:51:23,504 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), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 118 states. [2022-04-28 07:51:23,504 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), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 118 states. [2022-04-28 07:51:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:51:23,506 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-28 07:51:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2022-04-28 07:51:23,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:51:23,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:51:23,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:51:23,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:51:23,507 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), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 07:51:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2022-04-28 07:51:23,509 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 226 [2022-04-28 07:51:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:51:23,509 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2022-04-28 07:51:23,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2022-04-28 07:51:23,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 147 transitions. [2022-04-28 07:51:24,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:51:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2022-04-28 07:51:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-04-28 07:51:24,517 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:51:24,517 INFO L195 NwaCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:51:24,525 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-28 07:51:24,717 WARN L477 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-28 07:51:24,718 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:51:24,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:51:24,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1527648759, now seen corresponding path program 59 times [2022-04-28 07:51:24,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:51:24,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1898920706] [2022-04-28 07:51:24,808 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:51:24,808 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:51:24,808 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:51:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1527648759, now seen corresponding path program 60 times [2022-04-28 07:51:24,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:51:24,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646567843] [2022-04-28 07:51:24,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:51:24,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:51:24,823 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:51:24,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1656352839] [2022-04-28 07:51:24,824 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:51:24,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:51:24,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:51:24,825 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-28 07:51:24,827 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-28 07:51:39,617 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-28 07:51:39,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:51:39,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 128 conjunts are in the unsatisfiable core [2022-04-28 07:51:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:51:39,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:51:41,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {28482#true} call ULTIMATE.init(); {28482#true} is VALID [2022-04-28 07:51:41,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {28482#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); {28482#true} is VALID [2022-04-28 07:51:41,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28482#true} {28482#true} #60#return; {28482#true} is VALID [2022-04-28 07:51:41,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {28482#true} call #t~ret5 := main(); {28482#true} is VALID [2022-04-28 07:51:41,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {28482#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; {28482#true} is VALID [2022-04-28 07:51:41,011 INFO L272 TraceCheckUtils]: 6: Hoare triple {28482#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {28482#true} is VALID [2022-04-28 07:51:41,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,011 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28482#true} {28482#true} #52#return; {28482#true} is VALID [2022-04-28 07:51:41,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {28482#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {28520#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:51:41,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {28520#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {28520#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:51:41,012 INFO L272 TraceCheckUtils]: 13: Hoare triple {28520#(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)); {28482#true} is VALID [2022-04-28 07:51:41,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,012 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {28482#true} {28520#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {28520#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:51:41,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {28520#(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; {28542#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:51:41,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {28542#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {28542#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:51:41,013 INFO L272 TraceCheckUtils]: 20: Hoare triple {28542#(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)); {28482#true} is VALID [2022-04-28 07:51:41,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,014 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {28482#true} {28542#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {28542#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:51:41,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {28542#(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; {28564#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:51:41,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {28564#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {28564#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:51:41,015 INFO L272 TraceCheckUtils]: 27: Hoare triple {28564#(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)); {28482#true} is VALID [2022-04-28 07:51:41,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,015 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28482#true} {28564#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {28564#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:51:41,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {28564#(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; {28586#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:51:41,016 INFO L290 TraceCheckUtils]: 33: Hoare triple {28586#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {28586#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:51:41,016 INFO L272 TraceCheckUtils]: 34: Hoare triple {28586#(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)); {28482#true} is VALID [2022-04-28 07:51:41,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,017 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {28482#true} {28586#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #54#return; {28586#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:51:41,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {28586#(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; {28608#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:51:41,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {28608#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {28608#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:51:41,018 INFO L272 TraceCheckUtils]: 41: Hoare triple {28608#(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)); {28482#true} is VALID [2022-04-28 07:51:41,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,018 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {28482#true} {28608#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {28608#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:51:41,019 INFO L290 TraceCheckUtils]: 46: Hoare triple {28608#(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; {28630#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:51:41,019 INFO L290 TraceCheckUtils]: 47: Hoare triple {28630#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {28630#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:51:41,019 INFO L272 TraceCheckUtils]: 48: Hoare triple {28630#(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)); {28482#true} is VALID [2022-04-28 07:51:41,019 INFO L290 TraceCheckUtils]: 49: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,019 INFO L290 TraceCheckUtils]: 50: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,019 INFO L290 TraceCheckUtils]: 51: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,020 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {28482#true} {28630#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #54#return; {28630#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:51:41,020 INFO L290 TraceCheckUtils]: 53: Hoare triple {28630#(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; {28652#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:51:41,020 INFO L290 TraceCheckUtils]: 54: Hoare triple {28652#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {28652#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:51:41,020 INFO L272 TraceCheckUtils]: 55: Hoare triple {28652#(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)); {28482#true} is VALID [2022-04-28 07:51:41,020 INFO L290 TraceCheckUtils]: 56: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,021 INFO L290 TraceCheckUtils]: 57: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,021 INFO L290 TraceCheckUtils]: 58: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,021 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {28482#true} {28652#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {28652#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:51:41,021 INFO L290 TraceCheckUtils]: 60: Hoare triple {28652#(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; {28674#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:41,022 INFO L290 TraceCheckUtils]: 61: Hoare triple {28674#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {28674#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:41,022 INFO L272 TraceCheckUtils]: 62: Hoare triple {28674#(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)); {28482#true} is VALID [2022-04-28 07:51:41,022 INFO L290 TraceCheckUtils]: 63: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,022 INFO L290 TraceCheckUtils]: 64: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,022 INFO L290 TraceCheckUtils]: 65: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,022 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {28482#true} {28674#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {28674#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:41,023 INFO L290 TraceCheckUtils]: 67: Hoare triple {28674#(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; {28696#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:51:41,023 INFO L290 TraceCheckUtils]: 68: Hoare triple {28696#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {28696#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:51:41,023 INFO L272 TraceCheckUtils]: 69: Hoare triple {28696#(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)); {28482#true} is VALID [2022-04-28 07:51:41,023 INFO L290 TraceCheckUtils]: 70: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,023 INFO L290 TraceCheckUtils]: 71: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,023 INFO L290 TraceCheckUtils]: 72: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,024 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {28482#true} {28696#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #54#return; {28696#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:51:41,024 INFO L290 TraceCheckUtils]: 74: Hoare triple {28696#(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; {28718#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:51:41,025 INFO L290 TraceCheckUtils]: 75: Hoare triple {28718#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {28718#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:51:41,025 INFO L272 TraceCheckUtils]: 76: Hoare triple {28718#(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)); {28482#true} is VALID [2022-04-28 07:51:41,025 INFO L290 TraceCheckUtils]: 77: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,025 INFO L290 TraceCheckUtils]: 78: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,025 INFO L290 TraceCheckUtils]: 79: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,025 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {28482#true} {28718#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {28718#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:51:41,026 INFO L290 TraceCheckUtils]: 81: Hoare triple {28718#(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; {28740#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:51:41,026 INFO L290 TraceCheckUtils]: 82: Hoare triple {28740#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {28740#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:51:41,026 INFO L272 TraceCheckUtils]: 83: Hoare triple {28740#(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)); {28482#true} is VALID [2022-04-28 07:51:41,026 INFO L290 TraceCheckUtils]: 84: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,026 INFO L290 TraceCheckUtils]: 85: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,026 INFO L290 TraceCheckUtils]: 86: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,027 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {28482#true} {28740#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {28740#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:51:41,027 INFO L290 TraceCheckUtils]: 88: Hoare triple {28740#(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; {28762#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:51:41,027 INFO L290 TraceCheckUtils]: 89: Hoare triple {28762#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {28762#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:51:41,027 INFO L272 TraceCheckUtils]: 90: Hoare triple {28762#(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)); {28482#true} is VALID [2022-04-28 07:51:41,028 INFO L290 TraceCheckUtils]: 91: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,028 INFO L290 TraceCheckUtils]: 92: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,028 INFO L290 TraceCheckUtils]: 93: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,028 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {28482#true} {28762#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {28762#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:51:41,029 INFO L290 TraceCheckUtils]: 95: Hoare triple {28762#(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; {28784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:51:41,029 INFO L290 TraceCheckUtils]: 96: Hoare triple {28784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} assume !false; {28784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:51:41,029 INFO L272 TraceCheckUtils]: 97: Hoare triple {28784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 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)); {28482#true} is VALID [2022-04-28 07:51:41,029 INFO L290 TraceCheckUtils]: 98: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,029 INFO L290 TraceCheckUtils]: 99: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,029 INFO L290 TraceCheckUtils]: 100: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,030 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {28482#true} {28784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} #54#return; {28784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:51:41,030 INFO L290 TraceCheckUtils]: 102: Hoare triple {28784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 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; {28806#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:51:41,030 INFO L290 TraceCheckUtils]: 103: Hoare triple {28806#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {28806#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:51:41,030 INFO L272 TraceCheckUtils]: 104: Hoare triple {28806#(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)); {28482#true} is VALID [2022-04-28 07:51:41,030 INFO L290 TraceCheckUtils]: 105: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,030 INFO L290 TraceCheckUtils]: 106: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,031 INFO L290 TraceCheckUtils]: 107: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,031 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {28482#true} {28806#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {28806#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:51:41,031 INFO L290 TraceCheckUtils]: 109: Hoare triple {28806#(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; {28828#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:51:41,032 INFO L290 TraceCheckUtils]: 110: Hoare triple {28828#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {28828#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:51:41,032 INFO L272 TraceCheckUtils]: 111: Hoare triple {28828#(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)); {28482#true} is VALID [2022-04-28 07:51:41,032 INFO L290 TraceCheckUtils]: 112: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,032 INFO L290 TraceCheckUtils]: 113: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,032 INFO L290 TraceCheckUtils]: 114: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,032 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {28482#true} {28828#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #54#return; {28828#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:51:41,033 INFO L290 TraceCheckUtils]: 116: Hoare triple {28828#(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; {28850#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:51:41,033 INFO L290 TraceCheckUtils]: 117: Hoare triple {28850#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} assume !false; {28850#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:51:41,033 INFO L272 TraceCheckUtils]: 118: Hoare triple {28850#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 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)); {28482#true} is VALID [2022-04-28 07:51:41,033 INFO L290 TraceCheckUtils]: 119: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,033 INFO L290 TraceCheckUtils]: 120: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,033 INFO L290 TraceCheckUtils]: 121: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,034 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {28482#true} {28850#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} #54#return; {28850#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:51:41,049 INFO L290 TraceCheckUtils]: 123: Hoare triple {28850#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 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; {28872#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-28 07:51:41,050 INFO L290 TraceCheckUtils]: 124: Hoare triple {28872#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} assume !false; {28872#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-28 07:51:41,050 INFO L272 TraceCheckUtils]: 125: Hoare triple {28872#(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)); {28482#true} is VALID [2022-04-28 07:51:41,050 INFO L290 TraceCheckUtils]: 126: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,050 INFO L290 TraceCheckUtils]: 127: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,050 INFO L290 TraceCheckUtils]: 128: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,051 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {28482#true} {28872#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} #54#return; {28872#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-28 07:51:41,051 INFO L290 TraceCheckUtils]: 130: Hoare triple {28872#(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; {28894#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:41,051 INFO L290 TraceCheckUtils]: 131: Hoare triple {28894#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {28894#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:41,051 INFO L272 TraceCheckUtils]: 132: Hoare triple {28894#(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)); {28482#true} is VALID [2022-04-28 07:51:41,051 INFO L290 TraceCheckUtils]: 133: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,052 INFO L290 TraceCheckUtils]: 134: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,052 INFO L290 TraceCheckUtils]: 135: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,052 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {28482#true} {28894#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #54#return; {28894#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:41,052 INFO L290 TraceCheckUtils]: 137: Hoare triple {28894#(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; {28916#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-28 07:51:41,053 INFO L290 TraceCheckUtils]: 138: Hoare triple {28916#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} assume !false; {28916#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-28 07:51:41,053 INFO L272 TraceCheckUtils]: 139: Hoare triple {28916#(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)); {28482#true} is VALID [2022-04-28 07:51:41,053 INFO L290 TraceCheckUtils]: 140: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,053 INFO L290 TraceCheckUtils]: 141: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,053 INFO L290 TraceCheckUtils]: 142: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,053 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {28482#true} {28916#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} #54#return; {28916#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-28 07:51:41,054 INFO L290 TraceCheckUtils]: 144: Hoare triple {28916#(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; {28938#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:51:41,054 INFO L290 TraceCheckUtils]: 145: Hoare triple {28938#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {28938#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:51:41,054 INFO L272 TraceCheckUtils]: 146: Hoare triple {28938#(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)); {28482#true} is VALID [2022-04-28 07:51:41,054 INFO L290 TraceCheckUtils]: 147: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,054 INFO L290 TraceCheckUtils]: 148: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,054 INFO L290 TraceCheckUtils]: 149: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,055 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {28482#true} {28938#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {28938#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:51:41,055 INFO L290 TraceCheckUtils]: 151: Hoare triple {28938#(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; {28960#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:51:41,056 INFO L290 TraceCheckUtils]: 152: Hoare triple {28960#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {28960#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:51:41,056 INFO L272 TraceCheckUtils]: 153: Hoare triple {28960#(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)); {28482#true} is VALID [2022-04-28 07:51:41,056 INFO L290 TraceCheckUtils]: 154: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,056 INFO L290 TraceCheckUtils]: 155: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,056 INFO L290 TraceCheckUtils]: 156: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,056 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {28482#true} {28960#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #54#return; {28960#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:51:41,057 INFO L290 TraceCheckUtils]: 158: Hoare triple {28960#(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; {28982#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:51:41,057 INFO L290 TraceCheckUtils]: 159: Hoare triple {28982#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !false; {28982#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:51:41,057 INFO L272 TraceCheckUtils]: 160: Hoare triple {28982#(and (= main_~c~0 21) (= 19 (+ (- 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)); {28482#true} is VALID [2022-04-28 07:51:41,057 INFO L290 TraceCheckUtils]: 161: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,057 INFO L290 TraceCheckUtils]: 162: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,057 INFO L290 TraceCheckUtils]: 163: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,058 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {28482#true} {28982#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} #54#return; {28982#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:51:41,058 INFO L290 TraceCheckUtils]: 165: Hoare triple {28982#(and (= main_~c~0 21) (= 19 (+ (- 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; {29004#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:51:41,059 INFO L290 TraceCheckUtils]: 166: Hoare triple {29004#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {29004#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:51:41,059 INFO L272 TraceCheckUtils]: 167: Hoare triple {29004#(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)); {28482#true} is VALID [2022-04-28 07:51:41,059 INFO L290 TraceCheckUtils]: 168: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,059 INFO L290 TraceCheckUtils]: 169: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,059 INFO L290 TraceCheckUtils]: 170: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,059 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {28482#true} {29004#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #54#return; {29004#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:51:41,060 INFO L290 TraceCheckUtils]: 172: Hoare triple {29004#(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; {29026#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:41,060 INFO L290 TraceCheckUtils]: 173: Hoare triple {29026#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} assume !false; {29026#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:41,060 INFO L272 TraceCheckUtils]: 174: Hoare triple {29026#(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)); {28482#true} is VALID [2022-04-28 07:51:41,060 INFO L290 TraceCheckUtils]: 175: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,060 INFO L290 TraceCheckUtils]: 176: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,060 INFO L290 TraceCheckUtils]: 177: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,061 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {28482#true} {29026#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} #54#return; {29026#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:41,061 INFO L290 TraceCheckUtils]: 179: Hoare triple {29026#(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; {29048#(and (= 21 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-28 07:51:41,061 INFO L290 TraceCheckUtils]: 180: Hoare triple {29048#(and (= 21 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 22))} assume !false; {29048#(and (= 21 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-28 07:51:41,062 INFO L272 TraceCheckUtils]: 181: Hoare triple {29048#(and (= 21 (+ main_~c~0 (- 3))) (= (+ (- 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)); {28482#true} is VALID [2022-04-28 07:51:41,062 INFO L290 TraceCheckUtils]: 182: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,062 INFO L290 TraceCheckUtils]: 183: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,062 INFO L290 TraceCheckUtils]: 184: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,062 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {28482#true} {29048#(and (= 21 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 22))} #54#return; {29048#(and (= 21 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-28 07:51:41,063 INFO L290 TraceCheckUtils]: 186: Hoare triple {29048#(and (= 21 (+ main_~c~0 (- 3))) (= (+ (- 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; {29070#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-28 07:51:41,063 INFO L290 TraceCheckUtils]: 187: Hoare triple {29070#(and (= main_~y~0 25) (= main_~c~0 25))} assume !false; {29070#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-28 07:51:41,063 INFO L272 TraceCheckUtils]: 188: Hoare triple {29070#(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)); {28482#true} is VALID [2022-04-28 07:51:41,063 INFO L290 TraceCheckUtils]: 189: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,063 INFO L290 TraceCheckUtils]: 190: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,063 INFO L290 TraceCheckUtils]: 191: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,064 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {28482#true} {29070#(and (= main_~y~0 25) (= main_~c~0 25))} #54#return; {29070#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-28 07:51:41,064 INFO L290 TraceCheckUtils]: 193: Hoare triple {29070#(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; {29092#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:51:41,064 INFO L290 TraceCheckUtils]: 194: Hoare triple {29092#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} assume !false; {29092#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:51:41,064 INFO L272 TraceCheckUtils]: 195: Hoare triple {29092#(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)); {28482#true} is VALID [2022-04-28 07:51:41,065 INFO L290 TraceCheckUtils]: 196: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,065 INFO L290 TraceCheckUtils]: 197: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,065 INFO L290 TraceCheckUtils]: 198: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,065 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {28482#true} {29092#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} #54#return; {29092#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:51:41,065 INFO L290 TraceCheckUtils]: 200: Hoare triple {29092#(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; {29114#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-28 07:51:41,066 INFO L290 TraceCheckUtils]: 201: Hoare triple {29114#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} assume !false; {29114#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-28 07:51:41,066 INFO L272 TraceCheckUtils]: 202: Hoare triple {29114#(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)); {28482#true} is VALID [2022-04-28 07:51:41,066 INFO L290 TraceCheckUtils]: 203: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,066 INFO L290 TraceCheckUtils]: 204: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,066 INFO L290 TraceCheckUtils]: 205: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,066 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {28482#true} {29114#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} #54#return; {29114#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-28 07:51:41,067 INFO L290 TraceCheckUtils]: 207: Hoare triple {29114#(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; {29136#(and (= (+ main_~y~0 (- 3)) 25) (= main_~c~0 28))} is VALID [2022-04-28 07:51:41,067 INFO L290 TraceCheckUtils]: 208: Hoare triple {29136#(and (= (+ main_~y~0 (- 3)) 25) (= main_~c~0 28))} assume !false; {29136#(and (= (+ main_~y~0 (- 3)) 25) (= main_~c~0 28))} is VALID [2022-04-28 07:51:41,067 INFO L272 TraceCheckUtils]: 209: Hoare triple {29136#(and (= (+ main_~y~0 (- 3)) 25) (= 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)); {28482#true} is VALID [2022-04-28 07:51:41,067 INFO L290 TraceCheckUtils]: 210: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,067 INFO L290 TraceCheckUtils]: 211: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,068 INFO L290 TraceCheckUtils]: 212: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,068 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {28482#true} {29136#(and (= (+ main_~y~0 (- 3)) 25) (= main_~c~0 28))} #54#return; {29136#(and (= (+ main_~y~0 (- 3)) 25) (= main_~c~0 28))} is VALID [2022-04-28 07:51:41,068 INFO L290 TraceCheckUtils]: 214: Hoare triple {29136#(and (= (+ main_~y~0 (- 3)) 25) (= 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; {29158#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-28 07:51:41,069 INFO L290 TraceCheckUtils]: 215: Hoare triple {29158#(and (= 29 main_~y~0) (= 29 main_~c~0))} assume !false; {29158#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-28 07:51:41,069 INFO L272 TraceCheckUtils]: 216: Hoare triple {29158#(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)); {28482#true} is VALID [2022-04-28 07:51:41,069 INFO L290 TraceCheckUtils]: 217: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,069 INFO L290 TraceCheckUtils]: 218: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,069 INFO L290 TraceCheckUtils]: 219: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,069 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {28482#true} {29158#(and (= 29 main_~y~0) (= 29 main_~c~0))} #54#return; {29158#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-28 07:51:41,070 INFO L290 TraceCheckUtils]: 221: Hoare triple {29158#(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; {29180#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-28 07:51:41,070 INFO L290 TraceCheckUtils]: 222: Hoare triple {29180#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} assume !false; {29180#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-28 07:51:41,070 INFO L272 TraceCheckUtils]: 223: Hoare triple {29180#(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)); {28482#true} is VALID [2022-04-28 07:51:41,070 INFO L290 TraceCheckUtils]: 224: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-28 07:51:41,070 INFO L290 TraceCheckUtils]: 225: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-28 07:51:41,070 INFO L290 TraceCheckUtils]: 226: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-28 07:51:41,071 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {28482#true} {29180#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} #54#return; {29180#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-28 07:51:41,071 INFO L290 TraceCheckUtils]: 228: Hoare triple {29180#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} assume !(~c~0 < ~k~0); {29202#(and (<= main_~k~0 30) (= 30 main_~y~0) (< 29 main_~k~0))} is VALID [2022-04-28 07:51:41,072 INFO L272 TraceCheckUtils]: 229: Hoare triple {29202#(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)); {29206#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:51:41,072 INFO L290 TraceCheckUtils]: 230: Hoare triple {29206#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29210#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:51:41,073 INFO L290 TraceCheckUtils]: 231: Hoare triple {29210#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28483#false} is VALID [2022-04-28 07:51:41,073 INFO L290 TraceCheckUtils]: 232: Hoare triple {28483#false} assume !false; {28483#false} is VALID [2022-04-28 07:51:41,074 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-28 07:51:41,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:51:41,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:51:41,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646567843] [2022-04-28 07:51:41,487 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:51:41,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656352839] [2022-04-28 07:51:41,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656352839] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:51:41,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:51:41,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2022-04-28 07:51:41,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:51:41,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1898920706] [2022-04-28 07:51:41,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1898920706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:51:41,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:51:41,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 07:51:41,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217540762] [2022-04-28 07:51:41,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:51:41,489 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) Word has length 233 [2022-04-28 07:51:41,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:51:41,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-04-28 07:51:42,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:51:42,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 07:51:42,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:51:42,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 07:51:42,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 07:51:42,076 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-04-28 07:52:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:52:10,017 INFO L93 Difference]: Finished difference Result 126 states and 156 transitions. [2022-04-28 07:52:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 07:52:10,017 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) Word has length 233 [2022-04-28 07:52:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:52:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-04-28 07:52:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 152 transitions. [2022-04-28 07:52:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-04-28 07:52:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 152 transitions. [2022-04-28 07:52:10,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 152 transitions. [2022-04-28 07:52:10,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:52:10,700 INFO L225 Difference]: With dead ends: 126 [2022-04-28 07:52:10,700 INFO L226 Difference]: Without dead ends: 121 [2022-04-28 07:52:10,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=1519, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 07:52:10,701 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 3241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 3241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:52:10,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1739 Invalid, 3241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3241 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2022-04-28 07:52:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-28 07:52:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-04-28 07:52:10,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:52:10,842 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), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 07:52:10,842 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), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 07:52:10,843 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), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 07:52:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:52:10,845 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-28 07:52:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-28 07:52:10,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:52:10,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:52:10,846 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), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 121 states. [2022-04-28 07:52:10,846 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), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 121 states. [2022-04-28 07:52:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:52:10,849 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-28 07:52:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-28 07:52:10,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:52:10,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:52:10,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:52:10,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:52:10,850 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), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 07:52:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 151 transitions. [2022-04-28 07:52:10,853 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 151 transitions. Word has length 233 [2022-04-28 07:52:10,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:52:10,853 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 151 transitions. [2022-04-28 07:52:10,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-04-28 07:52:10,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 151 transitions. [2022-04-28 07:52:11,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:52:11,939 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-28 07:52:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-04-28 07:52:11,940 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:52:11,940 INFO L195 NwaCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:52:11,952 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-28 07:52:12,140 WARN L477 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-28 07:52:12,141 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:52:12,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:52:12,141 INFO L85 PathProgramCache]: Analyzing trace with hash -155412760, now seen corresponding path program 61 times [2022-04-28 07:52:12,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:52:12,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [342933815] [2022-04-28 07:52:12,249 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:52:12,249 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:52:12,249 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:52:12,249 INFO L85 PathProgramCache]: Analyzing trace with hash -155412760, now seen corresponding path program 62 times [2022-04-28 07:52:12,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:52:12,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981205288] [2022-04-28 07:52:12,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:52:12,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:52:12,273 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:52:12,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [799697115] [2022-04-28 07:52:12,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:52:12,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:52:12,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:52:12,276 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-28 07:52:12,277 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-28 07:52:13,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:52:13,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:52:13,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 149 conjunts are in the unsatisfiable core [2022-04-28 07:52:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:52:13,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:52:14,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {29998#true} call ULTIMATE.init(); {29998#true} is VALID [2022-04-28 07:52:14,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {29998#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); {29998#true} is VALID [2022-04-28 07:52:14,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29998#true} {29998#true} #60#return; {29998#true} is VALID [2022-04-28 07:52:14,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {29998#true} call #t~ret5 := main(); {29998#true} is VALID [2022-04-28 07:52:14,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {29998#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; {29998#true} is VALID [2022-04-28 07:52:14,941 INFO L272 TraceCheckUtils]: 6: Hoare triple {29998#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {29998#true} is VALID [2022-04-28 07:52:14,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,941 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29998#true} {29998#true} #52#return; {29998#true} is VALID [2022-04-28 07:52:14,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {29998#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {30036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:52:14,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {30036#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {30036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:52:14,942 INFO L272 TraceCheckUtils]: 13: Hoare triple {30036#(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)); {29998#true} is VALID [2022-04-28 07:52:14,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,942 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29998#true} {30036#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {30036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:52:14,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {30036#(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; {30058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:52:14,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {30058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {30058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:52:14,943 INFO L272 TraceCheckUtils]: 20: Hoare triple {30058#(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)); {29998#true} is VALID [2022-04-28 07:52:14,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,944 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {29998#true} {30058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {30058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:52:14,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {30058#(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; {30080#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:52:14,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {30080#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {30080#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:52:14,945 INFO L272 TraceCheckUtils]: 27: Hoare triple {30080#(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)); {29998#true} is VALID [2022-04-28 07:52:14,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,945 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {29998#true} {30080#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {30080#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:52:14,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {30080#(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; {30102#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:52:14,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {30102#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {30102#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:52:14,946 INFO L272 TraceCheckUtils]: 34: Hoare triple {30102#(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)); {29998#true} is VALID [2022-04-28 07:52:14,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,946 INFO L290 TraceCheckUtils]: 36: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,946 INFO L290 TraceCheckUtils]: 37: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,947 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {29998#true} {30102#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {30102#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:52:14,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {30102#(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; {30124#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:52:14,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {30124#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {30124#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:52:14,948 INFO L272 TraceCheckUtils]: 41: Hoare triple {30124#(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)); {29998#true} is VALID [2022-04-28 07:52:14,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,956 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {29998#true} {30124#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {30124#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:52:14,956 INFO L290 TraceCheckUtils]: 46: Hoare triple {30124#(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; {30146#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:52:14,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {30146#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} assume !false; {30146#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:52:14,957 INFO L272 TraceCheckUtils]: 48: Hoare triple {30146#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 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)); {29998#true} is VALID [2022-04-28 07:52:14,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,957 INFO L290 TraceCheckUtils]: 50: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,957 INFO L290 TraceCheckUtils]: 51: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,958 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {29998#true} {30146#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} #54#return; {30146#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:52:14,958 INFO L290 TraceCheckUtils]: 53: Hoare triple {30146#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 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; {30168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:52:14,959 INFO L290 TraceCheckUtils]: 54: Hoare triple {30168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {30168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:52:14,959 INFO L272 TraceCheckUtils]: 55: Hoare triple {30168#(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)); {29998#true} is VALID [2022-04-28 07:52:14,959 INFO L290 TraceCheckUtils]: 56: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,959 INFO L290 TraceCheckUtils]: 57: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,959 INFO L290 TraceCheckUtils]: 58: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,960 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29998#true} {30168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {30168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:52:14,960 INFO L290 TraceCheckUtils]: 60: Hoare triple {30168#(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; {30190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 07:52:14,961 INFO L290 TraceCheckUtils]: 61: Hoare triple {30190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !false; {30190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 07:52:14,961 INFO L272 TraceCheckUtils]: 62: Hoare triple {30190#(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)); {29998#true} is VALID [2022-04-28 07:52:14,961 INFO L290 TraceCheckUtils]: 63: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,961 INFO L290 TraceCheckUtils]: 64: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,961 INFO L290 TraceCheckUtils]: 65: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,962 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29998#true} {30190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #54#return; {30190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 07:52:14,963 INFO L290 TraceCheckUtils]: 67: Hoare triple {30190#(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; {30212#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:52:14,963 INFO L290 TraceCheckUtils]: 68: Hoare triple {30212#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} assume !false; {30212#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:52:14,963 INFO L272 TraceCheckUtils]: 69: Hoare triple {30212#(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)); {29998#true} is VALID [2022-04-28 07:52:14,963 INFO L290 TraceCheckUtils]: 70: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,963 INFO L290 TraceCheckUtils]: 71: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,963 INFO L290 TraceCheckUtils]: 72: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,964 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {29998#true} {30212#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} #54#return; {30212#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:52:14,965 INFO L290 TraceCheckUtils]: 74: Hoare triple {30212#(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; {30234#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:52:14,965 INFO L290 TraceCheckUtils]: 75: Hoare triple {30234#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {30234#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:52:14,965 INFO L272 TraceCheckUtils]: 76: Hoare triple {30234#(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)); {29998#true} is VALID [2022-04-28 07:52:14,965 INFO L290 TraceCheckUtils]: 77: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,965 INFO L290 TraceCheckUtils]: 78: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,965 INFO L290 TraceCheckUtils]: 79: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,966 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {29998#true} {30234#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {30234#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:52:14,967 INFO L290 TraceCheckUtils]: 81: Hoare triple {30234#(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; {30256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:52:14,967 INFO L290 TraceCheckUtils]: 82: Hoare triple {30256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {30256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:52:14,967 INFO L272 TraceCheckUtils]: 83: Hoare triple {30256#(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)); {29998#true} is VALID [2022-04-28 07:52:14,967 INFO L290 TraceCheckUtils]: 84: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,967 INFO L290 TraceCheckUtils]: 85: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,967 INFO L290 TraceCheckUtils]: 86: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,968 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {29998#true} {30256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #54#return; {30256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:52:14,969 INFO L290 TraceCheckUtils]: 88: Hoare triple {30256#(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; {30278#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:52:14,969 INFO L290 TraceCheckUtils]: 89: Hoare triple {30278#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} assume !false; {30278#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:52:14,969 INFO L272 TraceCheckUtils]: 90: Hoare triple {30278#(and (= main_~c~0 11) (= (+ (- 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)); {29998#true} is VALID [2022-04-28 07:52:14,969 INFO L290 TraceCheckUtils]: 91: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,969 INFO L290 TraceCheckUtils]: 92: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,969 INFO L290 TraceCheckUtils]: 93: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,970 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {29998#true} {30278#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} #54#return; {30278#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:52:14,970 INFO L290 TraceCheckUtils]: 95: Hoare triple {30278#(and (= main_~c~0 11) (= (+ (- 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; {30300#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-28 07:52:14,971 INFO L290 TraceCheckUtils]: 96: Hoare triple {30300#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} assume !false; {30300#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-28 07:52:14,971 INFO L272 TraceCheckUtils]: 97: Hoare triple {30300#(and (= main_~c~0 12) (= (+ 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)); {29998#true} is VALID [2022-04-28 07:52:14,971 INFO L290 TraceCheckUtils]: 98: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,971 INFO L290 TraceCheckUtils]: 99: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,971 INFO L290 TraceCheckUtils]: 100: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,972 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {29998#true} {30300#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} #54#return; {30300#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-28 07:52:14,972 INFO L290 TraceCheckUtils]: 102: Hoare triple {30300#(and (= main_~c~0 12) (= (+ 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; {30322#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:52:14,973 INFO L290 TraceCheckUtils]: 103: Hoare triple {30322#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {30322#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:52:14,973 INFO L272 TraceCheckUtils]: 104: Hoare triple {30322#(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)); {29998#true} is VALID [2022-04-28 07:52:14,973 INFO L290 TraceCheckUtils]: 105: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,973 INFO L290 TraceCheckUtils]: 106: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,973 INFO L290 TraceCheckUtils]: 107: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,974 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {29998#true} {30322#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {30322#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:52:14,974 INFO L290 TraceCheckUtils]: 109: Hoare triple {30322#(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; {30344#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:52:14,975 INFO L290 TraceCheckUtils]: 110: Hoare triple {30344#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {30344#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:52:14,975 INFO L272 TraceCheckUtils]: 111: Hoare triple {30344#(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)); {29998#true} is VALID [2022-04-28 07:52:14,975 INFO L290 TraceCheckUtils]: 112: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,975 INFO L290 TraceCheckUtils]: 113: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,975 INFO L290 TraceCheckUtils]: 114: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,976 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {29998#true} {30344#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #54#return; {30344#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:52:14,976 INFO L290 TraceCheckUtils]: 116: Hoare triple {30344#(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; {30366#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-28 07:52:14,977 INFO L290 TraceCheckUtils]: 117: Hoare triple {30366#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} assume !false; {30366#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-28 07:52:14,977 INFO L272 TraceCheckUtils]: 118: Hoare triple {30366#(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)); {29998#true} is VALID [2022-04-28 07:52:14,977 INFO L290 TraceCheckUtils]: 119: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,977 INFO L290 TraceCheckUtils]: 120: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,977 INFO L290 TraceCheckUtils]: 121: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,978 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29998#true} {30366#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} #54#return; {30366#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-28 07:52:14,978 INFO L290 TraceCheckUtils]: 123: Hoare triple {30366#(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; {30388#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-28 07:52:14,978 INFO L290 TraceCheckUtils]: 124: Hoare triple {30388#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} assume !false; {30388#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-28 07:52:14,979 INFO L272 TraceCheckUtils]: 125: Hoare triple {30388#(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)); {29998#true} is VALID [2022-04-28 07:52:14,979 INFO L290 TraceCheckUtils]: 126: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,979 INFO L290 TraceCheckUtils]: 127: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,979 INFO L290 TraceCheckUtils]: 128: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,979 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {29998#true} {30388#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} #54#return; {30388#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-28 07:52:14,980 INFO L290 TraceCheckUtils]: 130: Hoare triple {30388#(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; {30410#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:52:14,980 INFO L290 TraceCheckUtils]: 131: Hoare triple {30410#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {30410#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:52:14,980 INFO L272 TraceCheckUtils]: 132: Hoare triple {30410#(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)); {29998#true} is VALID [2022-04-28 07:52:14,980 INFO L290 TraceCheckUtils]: 133: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,981 INFO L290 TraceCheckUtils]: 134: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,981 INFO L290 TraceCheckUtils]: 135: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,981 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {29998#true} {30410#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {30410#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:52:14,982 INFO L290 TraceCheckUtils]: 137: Hoare triple {30410#(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; {30432#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:52:14,982 INFO L290 TraceCheckUtils]: 138: Hoare triple {30432#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} assume !false; {30432#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:52:14,982 INFO L272 TraceCheckUtils]: 139: Hoare triple {30432#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 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)); {29998#true} is VALID [2022-04-28 07:52:14,982 INFO L290 TraceCheckUtils]: 140: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,982 INFO L290 TraceCheckUtils]: 141: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,982 INFO L290 TraceCheckUtils]: 142: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,983 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {29998#true} {30432#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} #54#return; {30432#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:52:14,983 INFO L290 TraceCheckUtils]: 144: Hoare triple {30432#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 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; {30454#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-28 07:52:14,984 INFO L290 TraceCheckUtils]: 145: Hoare triple {30454#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !false; {30454#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-28 07:52:14,984 INFO L272 TraceCheckUtils]: 146: Hoare triple {30454#(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)); {29998#true} is VALID [2022-04-28 07:52:14,984 INFO L290 TraceCheckUtils]: 147: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,984 INFO L290 TraceCheckUtils]: 148: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,984 INFO L290 TraceCheckUtils]: 149: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,985 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {29998#true} {30454#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} #54#return; {30454#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-28 07:52:14,985 INFO L290 TraceCheckUtils]: 151: Hoare triple {30454#(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; {30476#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17))} is VALID [2022-04-28 07:52:14,985 INFO L290 TraceCheckUtils]: 152: Hoare triple {30476#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17))} assume !false; {30476#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17))} is VALID [2022-04-28 07:52:14,986 INFO L272 TraceCheckUtils]: 153: Hoare triple {30476#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~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)); {29998#true} is VALID [2022-04-28 07:52:14,986 INFO L290 TraceCheckUtils]: 154: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,986 INFO L290 TraceCheckUtils]: 155: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,986 INFO L290 TraceCheckUtils]: 156: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,986 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {29998#true} {30476#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17))} #54#return; {30476#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17))} is VALID [2022-04-28 07:52:14,987 INFO L290 TraceCheckUtils]: 158: Hoare triple {30476#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~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; {30498#(and (= (+ main_~y~0 (- 4)) 17) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:52:14,987 INFO L290 TraceCheckUtils]: 159: Hoare triple {30498#(and (= (+ main_~y~0 (- 4)) 17) (= 19 (+ (- 2) main_~c~0)))} assume !false; {30498#(and (= (+ main_~y~0 (- 4)) 17) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:52:14,987 INFO L272 TraceCheckUtils]: 160: Hoare triple {30498#(and (= (+ main_~y~0 (- 4)) 17) (= 19 (+ (- 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)); {29998#true} is VALID [2022-04-28 07:52:14,987 INFO L290 TraceCheckUtils]: 161: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,987 INFO L290 TraceCheckUtils]: 162: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,987 INFO L290 TraceCheckUtils]: 163: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,988 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {29998#true} {30498#(and (= (+ main_~y~0 (- 4)) 17) (= 19 (+ (- 2) main_~c~0)))} #54#return; {30498#(and (= (+ main_~y~0 (- 4)) 17) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:52:14,988 INFO L290 TraceCheckUtils]: 165: Hoare triple {30498#(and (= (+ main_~y~0 (- 4)) 17) (= 19 (+ (- 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; {30520#(and (= (+ main_~y~0 (- 5)) 17) (= main_~c~0 22))} is VALID [2022-04-28 07:52:14,988 INFO L290 TraceCheckUtils]: 166: Hoare triple {30520#(and (= (+ main_~y~0 (- 5)) 17) (= main_~c~0 22))} assume !false; {30520#(and (= (+ main_~y~0 (- 5)) 17) (= main_~c~0 22))} is VALID [2022-04-28 07:52:14,988 INFO L272 TraceCheckUtils]: 167: Hoare triple {30520#(and (= (+ main_~y~0 (- 5)) 17) (= 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)); {29998#true} is VALID [2022-04-28 07:52:14,989 INFO L290 TraceCheckUtils]: 168: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,989 INFO L290 TraceCheckUtils]: 169: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,989 INFO L290 TraceCheckUtils]: 170: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,989 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {29998#true} {30520#(and (= (+ main_~y~0 (- 5)) 17) (= main_~c~0 22))} #54#return; {30520#(and (= (+ main_~y~0 (- 5)) 17) (= main_~c~0 22))} is VALID [2022-04-28 07:52:14,989 INFO L290 TraceCheckUtils]: 172: Hoare triple {30520#(and (= (+ main_~y~0 (- 5)) 17) (= 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; {30542#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:52:14,990 INFO L290 TraceCheckUtils]: 173: Hoare triple {30542#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {30542#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:52:14,990 INFO L272 TraceCheckUtils]: 174: Hoare triple {30542#(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)); {29998#true} is VALID [2022-04-28 07:52:14,990 INFO L290 TraceCheckUtils]: 175: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,990 INFO L290 TraceCheckUtils]: 176: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,990 INFO L290 TraceCheckUtils]: 177: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,991 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {29998#true} {30542#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {30542#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:52:14,991 INFO L290 TraceCheckUtils]: 179: Hoare triple {30542#(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; {30564#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-28 07:52:14,991 INFO L290 TraceCheckUtils]: 180: Hoare triple {30564#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {30564#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-28 07:52:14,991 INFO L272 TraceCheckUtils]: 181: Hoare triple {30564#(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)); {29998#true} is VALID [2022-04-28 07:52:14,991 INFO L290 TraceCheckUtils]: 182: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,991 INFO L290 TraceCheckUtils]: 183: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,992 INFO L290 TraceCheckUtils]: 184: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,992 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {29998#true} {30564#(and (= main_~c~0 24) (= main_~y~0 24))} #54#return; {30564#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-28 07:52:14,992 INFO L290 TraceCheckUtils]: 186: Hoare triple {30564#(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; {30586#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-28 07:52:14,993 INFO L290 TraceCheckUtils]: 187: Hoare triple {30586#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} assume !false; {30586#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-28 07:52:14,993 INFO L272 TraceCheckUtils]: 188: Hoare triple {30586#(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)); {29998#true} is VALID [2022-04-28 07:52:14,993 INFO L290 TraceCheckUtils]: 189: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,993 INFO L290 TraceCheckUtils]: 190: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,993 INFO L290 TraceCheckUtils]: 191: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,993 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {29998#true} {30586#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} #54#return; {30586#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-28 07:52:14,994 INFO L290 TraceCheckUtils]: 193: Hoare triple {30586#(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; {30608#(and (= (+ (- 2) main_~c~0) 24) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:52:14,994 INFO L290 TraceCheckUtils]: 194: Hoare triple {30608#(and (= (+ (- 2) main_~c~0) 24) (= (+ (- 1) main_~y~0) 25))} assume !false; {30608#(and (= (+ (- 2) main_~c~0) 24) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:52:14,994 INFO L272 TraceCheckUtils]: 195: Hoare triple {30608#(and (= (+ (- 2) main_~c~0) 24) (= (+ (- 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)); {29998#true} is VALID [2022-04-28 07:52:14,994 INFO L290 TraceCheckUtils]: 196: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,994 INFO L290 TraceCheckUtils]: 197: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,994 INFO L290 TraceCheckUtils]: 198: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,995 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {29998#true} {30608#(and (= (+ (- 2) main_~c~0) 24) (= (+ (- 1) main_~y~0) 25))} #54#return; {30608#(and (= (+ (- 2) main_~c~0) 24) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:52:14,995 INFO L290 TraceCheckUtils]: 200: Hoare triple {30608#(and (= (+ (- 2) main_~c~0) 24) (= (+ (- 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; {30630#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27))} is VALID [2022-04-28 07:52:14,996 INFO L290 TraceCheckUtils]: 201: Hoare triple {30630#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27))} assume !false; {30630#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27))} is VALID [2022-04-28 07:52:14,996 INFO L272 TraceCheckUtils]: 202: Hoare triple {30630#(and (= (+ main_~c~0 (- 3)) 24) (= 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)); {29998#true} is VALID [2022-04-28 07:52:14,996 INFO L290 TraceCheckUtils]: 203: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,996 INFO L290 TraceCheckUtils]: 204: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,996 INFO L290 TraceCheckUtils]: 205: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,996 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {29998#true} {30630#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27))} #54#return; {30630#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27))} is VALID [2022-04-28 07:52:14,997 INFO L290 TraceCheckUtils]: 207: Hoare triple {30630#(and (= (+ main_~c~0 (- 3)) 24) (= 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; {30652#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 24))} is VALID [2022-04-28 07:52:14,997 INFO L290 TraceCheckUtils]: 208: Hoare triple {30652#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 24))} assume !false; {30652#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 24))} is VALID [2022-04-28 07:52:14,997 INFO L272 TraceCheckUtils]: 209: Hoare triple {30652#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 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)); {29998#true} is VALID [2022-04-28 07:52:14,997 INFO L290 TraceCheckUtils]: 210: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-28 07:52:14,997 INFO L290 TraceCheckUtils]: 211: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-28 07:52:14,997 INFO L290 TraceCheckUtils]: 212: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-28 07:52:14,998 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {29998#true} {30652#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 24))} #54#return; {30652#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 24))} is VALID [2022-04-28 07:52:14,998 INFO L290 TraceCheckUtils]: 214: Hoare triple {30652#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 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; {30674#(and (= (+ (- 2) main_~y~0) 27) (= (+ main_~c~0 (- 5)) 24))} is VALID [2022-04-28 07:52:14,999 INFO L290 TraceCheckUtils]: 215: Hoare triple {30674#(and (= (+ (- 2) main_~y~0) 27) (= (+ main_~c~0 (- 5)) 24))} assume !false; {30674#(and (= (+ (- 2) main_~y~0) 27) (= (+ main_~c~0 (- 5)) 24))} is VALID [2022-04-28 07:52:14,999 INFO L272 TraceCheckUtils]: 216: Hoare triple {30674#(and (= (+ (- 2) main_~y~0) 27) (= (+ main_~c~0 (- 5)) 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)); {29998#true} is VALID [2022-04-28 07:52:14,999 INFO L290 TraceCheckUtils]: 217: Hoare triple {29998#true} ~cond := #in~cond; {30684#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:52:14,999 INFO L290 TraceCheckUtils]: 218: Hoare triple {30684#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:52:15,000 INFO L290 TraceCheckUtils]: 219: Hoare triple {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:52:15,000 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} {30674#(and (= (+ (- 2) main_~y~0) 27) (= (+ main_~c~0 (- 5)) 24))} #54#return; {30695#(and (= (+ (- 2) main_~y~0) 27) (= (+ main_~c~0 (- 5)) 24) (= (+ (* 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-28 07:52:15,001 INFO L290 TraceCheckUtils]: 221: Hoare triple {30695#(and (= (+ (- 2) main_~y~0) 27) (= (+ main_~c~0 (- 5)) 24) (= (+ (* 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; {30699#(and (= 30 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 189225) main_~x~0) (= (+ main_~c~0 (- 6)) 24))} is VALID [2022-04-28 07:52:15,001 INFO L290 TraceCheckUtils]: 222: Hoare triple {30699#(and (= 30 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 189225) main_~x~0) (= (+ main_~c~0 (- 6)) 24))} assume !false; {30699#(and (= 30 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 189225) main_~x~0) (= (+ main_~c~0 (- 6)) 24))} is VALID [2022-04-28 07:52:15,001 INFO L272 TraceCheckUtils]: 223: Hoare triple {30699#(and (= 30 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 189225) main_~x~0) (= (+ main_~c~0 (- 6)) 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)); {29998#true} is VALID [2022-04-28 07:52:15,002 INFO L290 TraceCheckUtils]: 224: Hoare triple {29998#true} ~cond := #in~cond; {30684#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:52:15,002 INFO L290 TraceCheckUtils]: 225: Hoare triple {30684#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:52:15,002 INFO L290 TraceCheckUtils]: 226: Hoare triple {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:52:15,003 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} {30699#(and (= 30 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 189225) main_~x~0) (= (+ main_~c~0 (- 6)) 24))} #54#return; {30718#(and (= 30 main_~y~0) (= 30 main_~c~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 main_~y~0) 2)) (* main_~x~0 4)))} is VALID [2022-04-28 07:52:15,004 INFO L290 TraceCheckUtils]: 228: Hoare triple {30718#(and (= 30 main_~y~0) (= 30 main_~c~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 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; {30722#(and (<= main_~c~0 31) (= main_~y~0 31) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 216225)) (< 30 main_~k~0))} is VALID [2022-04-28 07:52:15,004 INFO L290 TraceCheckUtils]: 229: Hoare triple {30722#(and (<= main_~c~0 31) (= main_~y~0 31) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 216225)) (< 30 main_~k~0))} assume !false; {30722#(and (<= main_~c~0 31) (= main_~y~0 31) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 216225)) (< 30 main_~k~0))} is VALID [2022-04-28 07:52:15,004 INFO L272 TraceCheckUtils]: 230: Hoare triple {30722#(and (<= main_~c~0 31) (= main_~y~0 31) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 216225)) (< 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)); {29998#true} is VALID [2022-04-28 07:52:15,004 INFO L290 TraceCheckUtils]: 231: Hoare triple {29998#true} ~cond := #in~cond; {30684#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:52:15,005 INFO L290 TraceCheckUtils]: 232: Hoare triple {30684#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:52:15,005 INFO L290 TraceCheckUtils]: 233: Hoare triple {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:52:15,006 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} {30722#(and (<= main_~c~0 31) (= main_~y~0 31) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 216225)) (< 30 main_~k~0))} #54#return; {30741#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} is VALID [2022-04-28 07:52:15,006 INFO L290 TraceCheckUtils]: 235: Hoare triple {30741#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} assume !(~c~0 < ~k~0); {30745#(and (= main_~y~0 31) (< 30 main_~k~0) (<= main_~k~0 31))} is VALID [2022-04-28 07:52:15,007 INFO L272 TraceCheckUtils]: 236: Hoare triple {30745#(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)); {30749#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:52:15,007 INFO L290 TraceCheckUtils]: 237: Hoare triple {30749#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30753#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:52:15,007 INFO L290 TraceCheckUtils]: 238: Hoare triple {30753#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29999#false} is VALID [2022-04-28 07:52:15,007 INFO L290 TraceCheckUtils]: 239: Hoare triple {29999#false} assume !false; {29999#false} is VALID [2022-04-28 07:52:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3536 backedges. 322 proven. 1491 refuted. 0 times theorem prover too weak. 1723 trivial. 0 not checked. [2022-04-28 07:52:15,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:52:33,668 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse2 (* (- 13) c_main_~y~0 c_main_~y~0)) (.cse3 (* (- 1) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (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 (+ .cse1 .cse2 .cse3) 4) 0)) (not (<= (div (+ .cse1 .cse2 .cse3 (- 4)) (- 4)) (+ (* c_main_~y~0 c_main_~y~0 c_main_~y~0) c_main_~x~0 1 (* 3 (* c_main_~y~0 c_main_~y~0))))))) is different from false [2022-04-28 07:52:34,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:52:34,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981205288] [2022-04-28 07:52:34,014 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:52:34,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799697115] [2022-04-28 07:52:34,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799697115] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:52:34,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:52:34,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2022-04-28 07:52:34,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:52:34,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [342933815] [2022-04-28 07:52:34,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [342933815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:52:34,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:52:34,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 07:52:34,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143650556] [2022-04-28 07:52:34,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:52:34,015 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 38 states have internal predecessors, (80), 34 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) Word has length 240 [2022-04-28 07:52:34,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:52:34,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 38 states have internal predecessors, (80), 34 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2022-04-28 07:52:34,682 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-28 07:52:34,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 07:52:34,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:52:34,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 07:52:34,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2019, Unknown=1, NotChecked=90, Total=2256 [2022-04-28 07:52:34,683 INFO L87 Difference]: Start difference. First operand 121 states and 151 transitions. Second operand has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 38 states have internal predecessors, (80), 34 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2022-04-28 07:53:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:53:11,205 INFO L93 Difference]: Finished difference Result 133 states and 163 transitions. [2022-04-28 07:53:11,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 07:53:11,206 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 38 states have internal predecessors, (80), 34 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) Word has length 240 [2022-04-28 07:53:11,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:53:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 38 states have internal predecessors, (80), 34 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2022-04-28 07:53:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 158 transitions. [2022-04-28 07:53:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 38 states have internal predecessors, (80), 34 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2022-04-28 07:53:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 158 transitions. [2022-04-28 07:53:11,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 158 transitions. [2022-04-28 07:53:11,990 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-28 07:53:11,992 INFO L225 Difference]: With dead ends: 133 [2022-04-28 07:53:11,992 INFO L226 Difference]: Without dead ends: 128 [2022-04-28 07:53:11,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=167, Invalid=2286, Unknown=1, NotChecked=96, Total=2550 [2022-04-28 07:53:11,993 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 12 mSDsluCounter, 1755 mSDsCounter, 0 mSdLazyCounter, 4083 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 4088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:53:11,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1836 Invalid, 4088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4083 Invalid, 0 Unknown, 0 Unchecked, 18.4s Time] [2022-04-28 07:53:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-28 07:53:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-04-28 07:53:12,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:53:12,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 128 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 37 states have call successors, (37), 7 states have call predecessors, (37), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 07:53:12,191 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 128 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 37 states have call successors, (37), 7 states have call predecessors, (37), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 07:53:12,192 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 128 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 37 states have call successors, (37), 7 states have call predecessors, (37), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 07:53:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:53:12,194 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2022-04-28 07:53:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2022-04-28 07:53:12,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:53:12,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:53:12,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 37 states have call successors, (37), 7 states have call predecessors, (37), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 128 states. [2022-04-28 07:53:12,195 INFO L87 Difference]: Start difference. First operand has 128 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 37 states have call successors, (37), 7 states have call predecessors, (37), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 128 states. [2022-04-28 07:53:12,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:53:12,198 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2022-04-28 07:53:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2022-04-28 07:53:12,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:53:12,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:53:12,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:53:12,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:53:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 37 states have call successors, (37), 7 states have call predecessors, (37), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 07:53:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2022-04-28 07:53:12,205 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 240 [2022-04-28 07:53:12,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:53:12,205 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2022-04-28 07:53:12,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 38 states have internal predecessors, (80), 34 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2022-04-28 07:53:12,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 158 transitions. [2022-04-28 07:53:13,436 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-28 07:53:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2022-04-28 07:53:13,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-04-28 07:53:13,437 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:53:13,438 INFO L195 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:53:13,444 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-28 07:53:13,638 WARN L477 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-28 07:53:13,638 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:53:13,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:53:13,638 INFO L85 PathProgramCache]: Analyzing trace with hash 810222889, now seen corresponding path program 63 times [2022-04-28 07:53:13,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:53:13,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1095807183] [2022-04-28 07:53:13,714 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:53:13,714 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:53:13,714 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:53:13,714 INFO L85 PathProgramCache]: Analyzing trace with hash 810222889, now seen corresponding path program 64 times [2022-04-28 07:53:13,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:53:13,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664919784] [2022-04-28 07:53:13,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:53:13,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:53:13,732 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:53:13,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [374878368] [2022-04-28 07:53:13,732 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:53:13,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:53:13,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:53:13,734 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-28 07:53:13,734 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-28 07:53:15,229 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:53:15,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:53:15,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 136 conjunts are in the unsatisfiable core [2022-04-28 07:53:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:53:15,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:53:16,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {31588#true} call ULTIMATE.init(); {31588#true} is VALID [2022-04-28 07:53:16,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {31588#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); {31588#true} is VALID [2022-04-28 07:53:16,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31588#true} {31588#true} #60#return; {31588#true} is VALID [2022-04-28 07:53:16,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {31588#true} call #t~ret5 := main(); {31588#true} is VALID [2022-04-28 07:53:16,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {31588#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; {31588#true} is VALID [2022-04-28 07:53:16,633 INFO L272 TraceCheckUtils]: 6: Hoare triple {31588#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {31588#true} is VALID [2022-04-28 07:53:16,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,633 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31588#true} {31588#true} #52#return; {31588#true} is VALID [2022-04-28 07:53:16,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {31588#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {31626#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:53:16,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {31626#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {31626#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:53:16,634 INFO L272 TraceCheckUtils]: 13: Hoare triple {31626#(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)); {31588#true} is VALID [2022-04-28 07:53:16,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,634 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {31588#true} {31626#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {31626#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:53:16,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {31626#(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; {31648#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:53:16,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {31648#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {31648#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:53:16,635 INFO L272 TraceCheckUtils]: 20: Hoare triple {31648#(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)); {31588#true} is VALID [2022-04-28 07:53:16,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,636 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {31588#true} {31648#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {31648#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:53:16,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {31648#(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; {31670#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:53:16,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {31670#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {31670#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:53:16,636 INFO L272 TraceCheckUtils]: 27: Hoare triple {31670#(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)); {31588#true} is VALID [2022-04-28 07:53:16,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,637 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31588#true} {31670#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {31670#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:53:16,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {31670#(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; {31692#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:53:16,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {31692#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {31692#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:53:16,638 INFO L272 TraceCheckUtils]: 34: Hoare triple {31692#(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)); {31588#true} is VALID [2022-04-28 07:53:16,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,638 INFO L290 TraceCheckUtils]: 36: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,638 INFO L290 TraceCheckUtils]: 37: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,639 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {31588#true} {31692#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {31692#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:53:16,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {31692#(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; {31714#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:16,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {31714#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {31714#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:16,639 INFO L272 TraceCheckUtils]: 41: Hoare triple {31714#(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)); {31588#true} is VALID [2022-04-28 07:53:16,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,640 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {31588#true} {31714#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {31714#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:16,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {31714#(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; {31736#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:53:16,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {31736#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} assume !false; {31736#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:53:16,641 INFO L272 TraceCheckUtils]: 48: Hoare triple {31736#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 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)); {31588#true} is VALID [2022-04-28 07:53:16,641 INFO L290 TraceCheckUtils]: 49: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,641 INFO L290 TraceCheckUtils]: 50: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,642 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {31588#true} {31736#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} #54#return; {31736#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:53:16,642 INFO L290 TraceCheckUtils]: 53: Hoare triple {31736#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 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; {31758#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:53:16,642 INFO L290 TraceCheckUtils]: 54: Hoare triple {31758#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {31758#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:53:16,642 INFO L272 TraceCheckUtils]: 55: Hoare triple {31758#(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)); {31588#true} is VALID [2022-04-28 07:53:16,642 INFO L290 TraceCheckUtils]: 56: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,642 INFO L290 TraceCheckUtils]: 57: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,643 INFO L290 TraceCheckUtils]: 58: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,643 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {31588#true} {31758#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {31758#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:53:16,643 INFO L290 TraceCheckUtils]: 60: Hoare triple {31758#(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; {31780#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:53:16,644 INFO L290 TraceCheckUtils]: 61: Hoare triple {31780#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {31780#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:53:16,644 INFO L272 TraceCheckUtils]: 62: Hoare triple {31780#(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)); {31588#true} is VALID [2022-04-28 07:53:16,644 INFO L290 TraceCheckUtils]: 63: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,644 INFO L290 TraceCheckUtils]: 64: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,644 INFO L290 TraceCheckUtils]: 65: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,644 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {31588#true} {31780#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {31780#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:53:16,645 INFO L290 TraceCheckUtils]: 67: Hoare triple {31780#(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; {31802#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:53:16,645 INFO L290 TraceCheckUtils]: 68: Hoare triple {31802#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {31802#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:53:16,645 INFO L272 TraceCheckUtils]: 69: Hoare triple {31802#(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)); {31588#true} is VALID [2022-04-28 07:53:16,645 INFO L290 TraceCheckUtils]: 70: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,645 INFO L290 TraceCheckUtils]: 71: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,645 INFO L290 TraceCheckUtils]: 72: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,646 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {31588#true} {31802#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #54#return; {31802#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:53:16,646 INFO L290 TraceCheckUtils]: 74: Hoare triple {31802#(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; {31824#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:53:16,647 INFO L290 TraceCheckUtils]: 75: Hoare triple {31824#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {31824#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:53:16,647 INFO L272 TraceCheckUtils]: 76: Hoare triple {31824#(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)); {31588#true} is VALID [2022-04-28 07:53:16,647 INFO L290 TraceCheckUtils]: 77: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,647 INFO L290 TraceCheckUtils]: 78: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,647 INFO L290 TraceCheckUtils]: 79: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,647 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {31588#true} {31824#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {31824#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:53:16,648 INFO L290 TraceCheckUtils]: 81: Hoare triple {31824#(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; {31846#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:53:16,648 INFO L290 TraceCheckUtils]: 82: Hoare triple {31846#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {31846#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:53:16,648 INFO L272 TraceCheckUtils]: 83: Hoare triple {31846#(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)); {31588#true} is VALID [2022-04-28 07:53:16,648 INFO L290 TraceCheckUtils]: 84: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,648 INFO L290 TraceCheckUtils]: 85: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,648 INFO L290 TraceCheckUtils]: 86: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,649 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31588#true} {31846#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {31846#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:53:16,649 INFO L290 TraceCheckUtils]: 88: Hoare triple {31846#(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; {31868#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:53:16,649 INFO L290 TraceCheckUtils]: 89: Hoare triple {31868#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {31868#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:53:16,650 INFO L272 TraceCheckUtils]: 90: Hoare triple {31868#(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)); {31588#true} is VALID [2022-04-28 07:53:16,650 INFO L290 TraceCheckUtils]: 91: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,650 INFO L290 TraceCheckUtils]: 92: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,650 INFO L290 TraceCheckUtils]: 93: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,650 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {31588#true} {31868#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {31868#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:53:16,650 INFO L290 TraceCheckUtils]: 95: Hoare triple {31868#(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; {31890#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:53:16,651 INFO L290 TraceCheckUtils]: 96: Hoare triple {31890#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} assume !false; {31890#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:53:16,651 INFO L272 TraceCheckUtils]: 97: Hoare triple {31890#(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)); {31588#true} is VALID [2022-04-28 07:53:16,651 INFO L290 TraceCheckUtils]: 98: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,651 INFO L290 TraceCheckUtils]: 99: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,651 INFO L290 TraceCheckUtils]: 100: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,652 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {31588#true} {31890#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} #54#return; {31890#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:53:16,652 INFO L290 TraceCheckUtils]: 102: Hoare triple {31890#(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; {31912#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:16,652 INFO L290 TraceCheckUtils]: 103: Hoare triple {31912#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} assume !false; {31912#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:16,652 INFO L272 TraceCheckUtils]: 104: Hoare triple {31912#(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)); {31588#true} is VALID [2022-04-28 07:53:16,652 INFO L290 TraceCheckUtils]: 105: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,653 INFO L290 TraceCheckUtils]: 106: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,653 INFO L290 TraceCheckUtils]: 107: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,653 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {31588#true} {31912#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} #54#return; {31912#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:16,653 INFO L290 TraceCheckUtils]: 109: Hoare triple {31912#(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; {31934#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-28 07:53:16,654 INFO L290 TraceCheckUtils]: 110: Hoare triple {31934#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} assume !false; {31934#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-28 07:53:16,654 INFO L272 TraceCheckUtils]: 111: Hoare triple {31934#(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)); {31588#true} is VALID [2022-04-28 07:53:16,654 INFO L290 TraceCheckUtils]: 112: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,654 INFO L290 TraceCheckUtils]: 113: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,654 INFO L290 TraceCheckUtils]: 114: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,654 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {31588#true} {31934#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} #54#return; {31934#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-28 07:53:16,655 INFO L290 TraceCheckUtils]: 116: Hoare triple {31934#(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; {31956#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:53:16,655 INFO L290 TraceCheckUtils]: 117: Hoare triple {31956#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {31956#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:53:16,655 INFO L272 TraceCheckUtils]: 118: Hoare triple {31956#(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)); {31588#true} is VALID [2022-04-28 07:53:16,655 INFO L290 TraceCheckUtils]: 119: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,655 INFO L290 TraceCheckUtils]: 120: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,655 INFO L290 TraceCheckUtils]: 121: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,656 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {31588#true} {31956#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {31956#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:53:16,656 INFO L290 TraceCheckUtils]: 123: Hoare triple {31956#(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; {31978#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:53:16,656 INFO L290 TraceCheckUtils]: 124: Hoare triple {31978#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {31978#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:53:16,657 INFO L272 TraceCheckUtils]: 125: Hoare triple {31978#(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)); {31588#true} is VALID [2022-04-28 07:53:16,657 INFO L290 TraceCheckUtils]: 126: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,657 INFO L290 TraceCheckUtils]: 127: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,657 INFO L290 TraceCheckUtils]: 128: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,657 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {31588#true} {31978#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {31978#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:53:16,658 INFO L290 TraceCheckUtils]: 130: Hoare triple {31978#(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; {32000#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-28 07:53:16,658 INFO L290 TraceCheckUtils]: 131: Hoare triple {32000#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !false; {32000#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-28 07:53:16,658 INFO L272 TraceCheckUtils]: 132: Hoare triple {32000#(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)); {31588#true} is VALID [2022-04-28 07:53:16,658 INFO L290 TraceCheckUtils]: 133: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,658 INFO L290 TraceCheckUtils]: 134: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,658 INFO L290 TraceCheckUtils]: 135: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,659 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {31588#true} {32000#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} #54#return; {32000#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-28 07:53:16,659 INFO L290 TraceCheckUtils]: 137: Hoare triple {32000#(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; {32022#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-28 07:53:16,659 INFO L290 TraceCheckUtils]: 138: Hoare triple {32022#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} assume !false; {32022#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-28 07:53:16,659 INFO L272 TraceCheckUtils]: 139: Hoare triple {32022#(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)); {31588#true} is VALID [2022-04-28 07:53:16,660 INFO L290 TraceCheckUtils]: 140: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,660 INFO L290 TraceCheckUtils]: 141: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,660 INFO L290 TraceCheckUtils]: 142: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,660 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {31588#true} {32022#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} #54#return; {32022#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-28 07:53:16,660 INFO L290 TraceCheckUtils]: 144: Hoare triple {32022#(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; {32044#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:53:16,661 INFO L290 TraceCheckUtils]: 145: Hoare triple {32044#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {32044#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:53:16,661 INFO L272 TraceCheckUtils]: 146: Hoare triple {32044#(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)); {31588#true} is VALID [2022-04-28 07:53:16,661 INFO L290 TraceCheckUtils]: 147: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,661 INFO L290 TraceCheckUtils]: 148: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,661 INFO L290 TraceCheckUtils]: 149: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,662 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {31588#true} {32044#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {32044#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:53:16,662 INFO L290 TraceCheckUtils]: 151: Hoare triple {32044#(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; {32066#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:53:16,662 INFO L290 TraceCheckUtils]: 152: Hoare triple {32066#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {32066#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:53:16,662 INFO L272 TraceCheckUtils]: 153: Hoare triple {32066#(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)); {31588#true} is VALID [2022-04-28 07:53:16,662 INFO L290 TraceCheckUtils]: 154: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,662 INFO L290 TraceCheckUtils]: 155: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,663 INFO L290 TraceCheckUtils]: 156: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,663 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {31588#true} {32066#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #54#return; {32066#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:53:16,663 INFO L290 TraceCheckUtils]: 158: Hoare triple {32066#(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; {32088#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-28 07:53:16,664 INFO L290 TraceCheckUtils]: 159: Hoare triple {32088#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {32088#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-28 07:53:16,664 INFO L272 TraceCheckUtils]: 160: Hoare triple {32088#(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)); {31588#true} is VALID [2022-04-28 07:53:16,664 INFO L290 TraceCheckUtils]: 161: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,664 INFO L290 TraceCheckUtils]: 162: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,664 INFO L290 TraceCheckUtils]: 163: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,664 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {31588#true} {32088#(and (= main_~c~0 21) (= main_~y~0 21))} #54#return; {32088#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-28 07:53:16,665 INFO L290 TraceCheckUtils]: 165: Hoare triple {32088#(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; {32110#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:53:16,665 INFO L290 TraceCheckUtils]: 166: Hoare triple {32110#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {32110#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:53:16,665 INFO L272 TraceCheckUtils]: 167: Hoare triple {32110#(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)); {31588#true} is VALID [2022-04-28 07:53:16,665 INFO L290 TraceCheckUtils]: 168: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,665 INFO L290 TraceCheckUtils]: 169: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,665 INFO L290 TraceCheckUtils]: 170: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,666 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {31588#true} {32110#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #54#return; {32110#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:53:16,666 INFO L290 TraceCheckUtils]: 172: Hoare triple {32110#(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; {32132#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:16,667 INFO L290 TraceCheckUtils]: 173: Hoare triple {32132#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} assume !false; {32132#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:16,667 INFO L272 TraceCheckUtils]: 174: Hoare triple {32132#(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)); {31588#true} is VALID [2022-04-28 07:53:16,667 INFO L290 TraceCheckUtils]: 175: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,667 INFO L290 TraceCheckUtils]: 176: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,667 INFO L290 TraceCheckUtils]: 177: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,667 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {31588#true} {32132#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} #54#return; {32132#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:16,668 INFO L290 TraceCheckUtils]: 179: Hoare triple {32132#(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; {32154#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-28 07:53:16,668 INFO L290 TraceCheckUtils]: 180: Hoare triple {32154#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {32154#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-28 07:53:16,668 INFO L272 TraceCheckUtils]: 181: Hoare triple {32154#(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)); {31588#true} is VALID [2022-04-28 07:53:16,668 INFO L290 TraceCheckUtils]: 182: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,668 INFO L290 TraceCheckUtils]: 183: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,668 INFO L290 TraceCheckUtils]: 184: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,669 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {31588#true} {32154#(and (= main_~c~0 24) (= main_~y~0 24))} #54#return; {32154#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-28 07:53:16,669 INFO L290 TraceCheckUtils]: 186: Hoare triple {32154#(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; {32176#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-28 07:53:16,669 INFO L290 TraceCheckUtils]: 187: Hoare triple {32176#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !false; {32176#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-28 07:53:16,670 INFO L272 TraceCheckUtils]: 188: Hoare triple {32176#(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)); {31588#true} is VALID [2022-04-28 07:53:16,670 INFO L290 TraceCheckUtils]: 189: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,670 INFO L290 TraceCheckUtils]: 190: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,670 INFO L290 TraceCheckUtils]: 191: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,670 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {31588#true} {32176#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} #54#return; {32176#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-28 07:53:16,671 INFO L290 TraceCheckUtils]: 193: Hoare triple {32176#(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; {32198#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-28 07:53:16,671 INFO L290 TraceCheckUtils]: 194: Hoare triple {32198#(and (= main_~c~0 26) (= main_~y~0 26))} assume !false; {32198#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-28 07:53:16,671 INFO L272 TraceCheckUtils]: 195: Hoare triple {32198#(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)); {31588#true} is VALID [2022-04-28 07:53:16,671 INFO L290 TraceCheckUtils]: 196: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,671 INFO L290 TraceCheckUtils]: 197: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,671 INFO L290 TraceCheckUtils]: 198: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,672 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {31588#true} {32198#(and (= main_~c~0 26) (= main_~y~0 26))} #54#return; {32198#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-28 07:53:16,672 INFO L290 TraceCheckUtils]: 200: Hoare triple {32198#(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; {32220#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:53:16,672 INFO L290 TraceCheckUtils]: 201: Hoare triple {32220#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {32220#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:53:16,672 INFO L272 TraceCheckUtils]: 202: Hoare triple {32220#(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)); {31588#true} is VALID [2022-04-28 07:53:16,672 INFO L290 TraceCheckUtils]: 203: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,673 INFO L290 TraceCheckUtils]: 204: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,673 INFO L290 TraceCheckUtils]: 205: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,673 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {31588#true} {32220#(and (= main_~y~0 27) (= main_~c~0 27))} #54#return; {32220#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:53:16,673 INFO L290 TraceCheckUtils]: 207: Hoare triple {32220#(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; {32242#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-28 07:53:16,674 INFO L290 TraceCheckUtils]: 208: Hoare triple {32242#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} assume !false; {32242#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-28 07:53:16,674 INFO L272 TraceCheckUtils]: 209: Hoare triple {32242#(and (= (+ (- 1) main_~c~0) 27) (= 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)); {31588#true} is VALID [2022-04-28 07:53:16,674 INFO L290 TraceCheckUtils]: 210: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,674 INFO L290 TraceCheckUtils]: 211: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,674 INFO L290 TraceCheckUtils]: 212: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,674 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {31588#true} {32242#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} #54#return; {32242#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-28 07:53:16,675 INFO L290 TraceCheckUtils]: 214: Hoare triple {32242#(and (= (+ (- 1) main_~c~0) 27) (= 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; {32264#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-28 07:53:16,675 INFO L290 TraceCheckUtils]: 215: Hoare triple {32264#(and (= 29 main_~y~0) (= 29 main_~c~0))} assume !false; {32264#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-28 07:53:16,675 INFO L272 TraceCheckUtils]: 216: Hoare triple {32264#(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)); {31588#true} is VALID [2022-04-28 07:53:16,675 INFO L290 TraceCheckUtils]: 217: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,675 INFO L290 TraceCheckUtils]: 218: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,675 INFO L290 TraceCheckUtils]: 219: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,676 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {31588#true} {32264#(and (= 29 main_~y~0) (= 29 main_~c~0))} #54#return; {32264#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-28 07:53:16,676 INFO L290 TraceCheckUtils]: 221: Hoare triple {32264#(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; {32286#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-28 07:53:16,677 INFO L290 TraceCheckUtils]: 222: Hoare triple {32286#(and (= 30 main_~y~0) (= 30 main_~c~0))} assume !false; {32286#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-28 07:53:16,677 INFO L272 TraceCheckUtils]: 223: Hoare triple {32286#(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)); {31588#true} is VALID [2022-04-28 07:53:16,677 INFO L290 TraceCheckUtils]: 224: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,677 INFO L290 TraceCheckUtils]: 225: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,677 INFO L290 TraceCheckUtils]: 226: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,677 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {31588#true} {32286#(and (= 30 main_~y~0) (= 30 main_~c~0))} #54#return; {32286#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-28 07:53:16,678 INFO L290 TraceCheckUtils]: 228: Hoare triple {32286#(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; {32308#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-28 07:53:16,678 INFO L290 TraceCheckUtils]: 229: Hoare triple {32308#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} assume !false; {32308#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-28 07:53:16,678 INFO L272 TraceCheckUtils]: 230: Hoare triple {32308#(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)); {31588#true} is VALID [2022-04-28 07:53:16,678 INFO L290 TraceCheckUtils]: 231: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,678 INFO L290 TraceCheckUtils]: 232: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,678 INFO L290 TraceCheckUtils]: 233: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,679 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {31588#true} {32308#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} #54#return; {32308#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-28 07:53:16,679 INFO L290 TraceCheckUtils]: 235: Hoare triple {32308#(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; {32330#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-28 07:53:16,679 INFO L290 TraceCheckUtils]: 236: Hoare triple {32330#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} assume !false; {32330#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-28 07:53:16,680 INFO L272 TraceCheckUtils]: 237: Hoare triple {32330#(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)); {31588#true} is VALID [2022-04-28 07:53:16,680 INFO L290 TraceCheckUtils]: 238: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-28 07:53:16,680 INFO L290 TraceCheckUtils]: 239: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-28 07:53:16,680 INFO L290 TraceCheckUtils]: 240: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-28 07:53:16,680 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {31588#true} {32330#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} #54#return; {32330#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-28 07:53:16,684 INFO L290 TraceCheckUtils]: 242: Hoare triple {32330#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} assume !(~c~0 < ~k~0); {32352#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~k~0 32))} is VALID [2022-04-28 07:53:16,685 INFO L272 TraceCheckUtils]: 243: Hoare triple {32352#(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)); {32356#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:53:16,686 INFO L290 TraceCheckUtils]: 244: Hoare triple {32356#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32360#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:53:16,686 INFO L290 TraceCheckUtils]: 245: Hoare triple {32360#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31589#false} is VALID [2022-04-28 07:53:16,686 INFO L290 TraceCheckUtils]: 246: Hoare triple {31589#false} assume !false; {31589#false} is VALID [2022-04-28 07:53:16,688 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-28 07:53:16,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:53:17,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:53:17,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664919784] [2022-04-28 07:53:17,168 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:53:17,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374878368] [2022-04-28 07:53:17,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374878368] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:53:17,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:53:17,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2022-04-28 07:53:17,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:53:17,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1095807183] [2022-04-28 07:53:17,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1095807183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:53:17,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:53:17,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 07:53:17,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399158654] [2022-04-28 07:53:17,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:53:17,169 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) Word has length 247 [2022-04-28 07:53:17,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:53:17,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-28 07:53:17,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:53:17,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 07:53:17,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:53:17,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 07:53:17,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 07:53:17,914 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-28 07:53:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:53:54,605 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2022-04-28 07:53:54,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 07:53:54,605 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) Word has length 247 [2022-04-28 07:53:54,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:53:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-28 07:53:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 160 transitions. [2022-04-28 07:53:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-28 07:53:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 160 transitions. [2022-04-28 07:53:54,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 160 transitions. [2022-04-28 07:53:55,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:53:55,467 INFO L225 Difference]: With dead ends: 136 [2022-04-28 07:53:55,467 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 07:53:55,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=1679, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 07:53:55,468 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 3647 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 3647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2022-04-28 07:53:55,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1913 Invalid, 3647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3647 Invalid, 0 Unknown, 0 Unchecked, 18.6s Time] [2022-04-28 07:53:55,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 07:53:55,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-28 07:53:55,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:53:55,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 38 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-28 07:53:55,613 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 38 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-28 07:53:55,613 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 38 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-28 07:53:55,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:53:55,615 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-28 07:53:55,615 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-28 07:53:55,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:53:55,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:53:55,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 38 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 131 states. [2022-04-28 07:53:55,616 INFO L87 Difference]: Start difference. First operand has 131 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 38 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 131 states. [2022-04-28 07:53:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:53:55,619 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-28 07:53:55,619 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-28 07:53:55,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:53:55,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:53:55,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:53:55,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:53:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 38 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-28 07:53:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2022-04-28 07:53:55,623 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 247 [2022-04-28 07:53:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:53:55,623 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2022-04-28 07:53:55,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-28 07:53:55,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 162 transitions. [2022-04-28 07:53:56,858 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-28 07:53:56,858 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-28 07:53:56,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-04-28 07:53:56,859 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:53:56,859 INFO L195 NwaCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:53:56,866 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-28 07:53:57,060 WARN L477 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-28 07:53:57,060 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:53:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:53:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash -596558904, now seen corresponding path program 65 times [2022-04-28 07:53:57,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:53:57,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1991027473] [2022-04-28 07:53:57,155 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:53:57,155 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:53:57,155 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:53:57,155 INFO L85 PathProgramCache]: Analyzing trace with hash -596558904, now seen corresponding path program 66 times [2022-04-28 07:53:57,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:53:57,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70009444] [2022-04-28 07:53:57,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:53:57,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:53:57,171 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:53:57,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1578778426] [2022-04-28 07:53:57,171 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:53:57,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:53:57,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:53:57,172 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-28 07:53:57,173 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-28 07:54:04,889 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2022-04-28 07:54:04,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:54:04,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 140 conjunts are in the unsatisfiable core [2022-04-28 07:54:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:54:04,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:54:06,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {33208#true} call ULTIMATE.init(); {33208#true} is VALID [2022-04-28 07:54:06,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {33208#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); {33208#true} is VALID [2022-04-28 07:54:06,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33208#true} {33208#true} #60#return; {33208#true} is VALID [2022-04-28 07:54:06,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {33208#true} call #t~ret5 := main(); {33208#true} is VALID [2022-04-28 07:54:06,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {33208#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; {33208#true} is VALID [2022-04-28 07:54:06,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {33208#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {33208#true} is VALID [2022-04-28 07:54:06,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33208#true} {33208#true} #52#return; {33208#true} is VALID [2022-04-28 07:54:06,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {33208#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33246#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:54:06,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {33246#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {33246#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:54:06,459 INFO L272 TraceCheckUtils]: 13: Hoare triple {33246#(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)); {33208#true} is VALID [2022-04-28 07:54:06,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,460 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {33208#true} {33246#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {33246#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:54:06,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {33246#(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; {33268#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:54:06,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {33268#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {33268#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:54:06,461 INFO L272 TraceCheckUtils]: 20: Hoare triple {33268#(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)); {33208#true} is VALID [2022-04-28 07:54:06,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,461 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {33208#true} {33268#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {33268#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:54:06,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {33268#(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; {33290#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:54:06,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {33290#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {33290#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:54:06,462 INFO L272 TraceCheckUtils]: 27: Hoare triple {33290#(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)); {33208#true} is VALID [2022-04-28 07:54:06,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,463 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {33208#true} {33290#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {33290#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:54:06,463 INFO L290 TraceCheckUtils]: 32: Hoare triple {33290#(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; {33312#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:54:06,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {33312#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {33312#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:54:06,463 INFO L272 TraceCheckUtils]: 34: Hoare triple {33312#(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)); {33208#true} is VALID [2022-04-28 07:54:06,463 INFO L290 TraceCheckUtils]: 35: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,464 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {33208#true} {33312#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {33312#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:54:06,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {33312#(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; {33334#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:54:06,465 INFO L290 TraceCheckUtils]: 40: Hoare triple {33334#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {33334#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:54:06,465 INFO L272 TraceCheckUtils]: 41: Hoare triple {33334#(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)); {33208#true} is VALID [2022-04-28 07:54:06,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,465 INFO L290 TraceCheckUtils]: 44: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,465 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {33208#true} {33334#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {33334#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:54:06,466 INFO L290 TraceCheckUtils]: 46: Hoare triple {33334#(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; {33356#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:54:06,466 INFO L290 TraceCheckUtils]: 47: Hoare triple {33356#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {33356#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:54:06,466 INFO L272 TraceCheckUtils]: 48: Hoare triple {33356#(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)); {33208#true} is VALID [2022-04-28 07:54:06,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,467 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {33208#true} {33356#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {33356#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:54:06,467 INFO L290 TraceCheckUtils]: 53: Hoare triple {33356#(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; {33378#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:54:06,468 INFO L290 TraceCheckUtils]: 54: Hoare triple {33378#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {33378#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:54:06,468 INFO L272 TraceCheckUtils]: 55: Hoare triple {33378#(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)); {33208#true} is VALID [2022-04-28 07:54:06,468 INFO L290 TraceCheckUtils]: 56: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,468 INFO L290 TraceCheckUtils]: 57: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,468 INFO L290 TraceCheckUtils]: 58: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,468 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {33208#true} {33378#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {33378#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:54:06,469 INFO L290 TraceCheckUtils]: 60: Hoare triple {33378#(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; {33400#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:54:06,469 INFO L290 TraceCheckUtils]: 61: Hoare triple {33400#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {33400#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:54:06,469 INFO L272 TraceCheckUtils]: 62: Hoare triple {33400#(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)); {33208#true} is VALID [2022-04-28 07:54:06,469 INFO L290 TraceCheckUtils]: 63: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,469 INFO L290 TraceCheckUtils]: 64: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,469 INFO L290 TraceCheckUtils]: 65: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,470 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {33208#true} {33400#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #54#return; {33400#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:54:06,470 INFO L290 TraceCheckUtils]: 67: Hoare triple {33400#(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; {33422#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:54:06,470 INFO L290 TraceCheckUtils]: 68: Hoare triple {33422#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} assume !false; {33422#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:54:06,471 INFO L272 TraceCheckUtils]: 69: Hoare triple {33422#(and (= 7 (+ (- 1) main_~y~0)) (= 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)); {33208#true} is VALID [2022-04-28 07:54:06,471 INFO L290 TraceCheckUtils]: 70: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,471 INFO L290 TraceCheckUtils]: 71: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,471 INFO L290 TraceCheckUtils]: 72: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,471 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {33208#true} {33422#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} #54#return; {33422#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:54:06,472 INFO L290 TraceCheckUtils]: 74: Hoare triple {33422#(and (= 7 (+ (- 1) main_~y~0)) (= 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; {33444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:54:06,472 INFO L290 TraceCheckUtils]: 75: Hoare triple {33444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !false; {33444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:54:06,472 INFO L272 TraceCheckUtils]: 76: Hoare triple {33444#(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)); {33208#true} is VALID [2022-04-28 07:54:06,472 INFO L290 TraceCheckUtils]: 77: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,472 INFO L290 TraceCheckUtils]: 78: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,472 INFO L290 TraceCheckUtils]: 79: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,473 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {33208#true} {33444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} #54#return; {33444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:54:06,473 INFO L290 TraceCheckUtils]: 81: Hoare triple {33444#(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; {33466#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:54:06,473 INFO L290 TraceCheckUtils]: 82: Hoare triple {33466#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {33466#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:54:06,473 INFO L272 TraceCheckUtils]: 83: Hoare triple {33466#(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)); {33208#true} is VALID [2022-04-28 07:54:06,473 INFO L290 TraceCheckUtils]: 84: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,473 INFO L290 TraceCheckUtils]: 85: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,474 INFO L290 TraceCheckUtils]: 86: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,474 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {33208#true} {33466#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {33466#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:54:06,474 INFO L290 TraceCheckUtils]: 88: Hoare triple {33466#(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; {33488#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:54:06,475 INFO L290 TraceCheckUtils]: 89: Hoare triple {33488#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {33488#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:54:06,475 INFO L272 TraceCheckUtils]: 90: Hoare triple {33488#(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)); {33208#true} is VALID [2022-04-28 07:54:06,475 INFO L290 TraceCheckUtils]: 91: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,475 INFO L290 TraceCheckUtils]: 92: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,475 INFO L290 TraceCheckUtils]: 93: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,475 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {33208#true} {33488#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {33488#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:54:06,476 INFO L290 TraceCheckUtils]: 95: Hoare triple {33488#(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; {33510#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:54:06,476 INFO L290 TraceCheckUtils]: 96: Hoare triple {33510#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {33510#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:54:06,476 INFO L272 TraceCheckUtils]: 97: Hoare triple {33510#(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)); {33208#true} is VALID [2022-04-28 07:54:06,476 INFO L290 TraceCheckUtils]: 98: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,476 INFO L290 TraceCheckUtils]: 99: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,476 INFO L290 TraceCheckUtils]: 100: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,477 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {33208#true} {33510#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #54#return; {33510#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:54:06,477 INFO L290 TraceCheckUtils]: 102: Hoare triple {33510#(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; {33532#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-28 07:54:06,478 INFO L290 TraceCheckUtils]: 103: Hoare triple {33532#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} assume !false; {33532#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-28 07:54:06,478 INFO L272 TraceCheckUtils]: 104: Hoare triple {33532#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) 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)); {33208#true} is VALID [2022-04-28 07:54:06,478 INFO L290 TraceCheckUtils]: 105: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,478 INFO L290 TraceCheckUtils]: 106: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,478 INFO L290 TraceCheckUtils]: 107: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,478 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {33208#true} {33532#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} #54#return; {33532#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-28 07:54:06,479 INFO L290 TraceCheckUtils]: 109: Hoare triple {33532#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) 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; {33554#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} is VALID [2022-04-28 07:54:06,479 INFO L290 TraceCheckUtils]: 110: Hoare triple {33554#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} assume !false; {33554#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} is VALID [2022-04-28 07:54:06,479 INFO L272 TraceCheckUtils]: 111: Hoare triple {33554#(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)); {33208#true} is VALID [2022-04-28 07:54:06,479 INFO L290 TraceCheckUtils]: 112: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,479 INFO L290 TraceCheckUtils]: 113: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,479 INFO L290 TraceCheckUtils]: 114: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,480 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {33208#true} {33554#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} #54#return; {33554#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} is VALID [2022-04-28 07:54:06,480 INFO L290 TraceCheckUtils]: 116: Hoare triple {33554#(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; {33576#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:54:06,480 INFO L290 TraceCheckUtils]: 117: Hoare triple {33576#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 1) main_~c~0) 14))} assume !false; {33576#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:54:06,481 INFO L272 TraceCheckUtils]: 118: Hoare triple {33576#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 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)); {33208#true} is VALID [2022-04-28 07:54:06,481 INFO L290 TraceCheckUtils]: 119: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,481 INFO L290 TraceCheckUtils]: 120: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,481 INFO L290 TraceCheckUtils]: 121: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,481 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {33208#true} {33576#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 1) main_~c~0) 14))} #54#return; {33576#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:54:06,482 INFO L290 TraceCheckUtils]: 123: Hoare triple {33576#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 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; {33598#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:54:06,482 INFO L290 TraceCheckUtils]: 124: Hoare triple {33598#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {33598#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:54:06,482 INFO L272 TraceCheckUtils]: 125: Hoare triple {33598#(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)); {33208#true} is VALID [2022-04-28 07:54:06,482 INFO L290 TraceCheckUtils]: 126: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,482 INFO L290 TraceCheckUtils]: 127: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,482 INFO L290 TraceCheckUtils]: 128: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,483 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {33208#true} {33598#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {33598#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:54:06,483 INFO L290 TraceCheckUtils]: 130: Hoare triple {33598#(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; {33620#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:54:06,483 INFO L290 TraceCheckUtils]: 131: Hoare triple {33620#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {33620#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:54:06,483 INFO L272 TraceCheckUtils]: 132: Hoare triple {33620#(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)); {33208#true} is VALID [2022-04-28 07:54:06,483 INFO L290 TraceCheckUtils]: 133: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,484 INFO L290 TraceCheckUtils]: 134: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,484 INFO L290 TraceCheckUtils]: 135: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,484 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {33208#true} {33620#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #54#return; {33620#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:54:06,484 INFO L290 TraceCheckUtils]: 137: Hoare triple {33620#(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; {33642#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:54:06,485 INFO L290 TraceCheckUtils]: 138: Hoare triple {33642#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {33642#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:54:06,485 INFO L272 TraceCheckUtils]: 139: Hoare triple {33642#(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)); {33208#true} is VALID [2022-04-28 07:54:06,485 INFO L290 TraceCheckUtils]: 140: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,485 INFO L290 TraceCheckUtils]: 141: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,485 INFO L290 TraceCheckUtils]: 142: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,485 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {33208#true} {33642#(and (= main_~c~0 18) (= main_~y~0 18))} #54#return; {33642#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:54:06,486 INFO L290 TraceCheckUtils]: 144: Hoare triple {33642#(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; {33664#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:54:06,486 INFO L290 TraceCheckUtils]: 145: Hoare triple {33664#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {33664#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:54:06,486 INFO L272 TraceCheckUtils]: 146: Hoare triple {33664#(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)); {33208#true} is VALID [2022-04-28 07:54:06,486 INFO L290 TraceCheckUtils]: 147: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,486 INFO L290 TraceCheckUtils]: 148: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,486 INFO L290 TraceCheckUtils]: 149: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,487 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {33208#true} {33664#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #54#return; {33664#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:54:06,487 INFO L290 TraceCheckUtils]: 151: Hoare triple {33664#(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; {33686#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-28 07:54:06,488 INFO L290 TraceCheckUtils]: 152: Hoare triple {33686#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} assume !false; {33686#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-28 07:54:06,488 INFO L272 TraceCheckUtils]: 153: Hoare triple {33686#(and (= 19 (+ (- 1) main_~y~0)) (= 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)); {33208#true} is VALID [2022-04-28 07:54:06,488 INFO L290 TraceCheckUtils]: 154: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,488 INFO L290 TraceCheckUtils]: 155: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,488 INFO L290 TraceCheckUtils]: 156: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,488 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {33208#true} {33686#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} #54#return; {33686#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-28 07:54:06,489 INFO L290 TraceCheckUtils]: 158: Hoare triple {33686#(and (= 19 (+ (- 1) main_~y~0)) (= 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; {33708#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:54:06,489 INFO L290 TraceCheckUtils]: 159: Hoare triple {33708#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !false; {33708#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:54:06,489 INFO L272 TraceCheckUtils]: 160: Hoare triple {33708#(and (= main_~c~0 21) (= 19 (+ (- 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)); {33208#true} is VALID [2022-04-28 07:54:06,489 INFO L290 TraceCheckUtils]: 161: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,489 INFO L290 TraceCheckUtils]: 162: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,489 INFO L290 TraceCheckUtils]: 163: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,490 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {33208#true} {33708#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} #54#return; {33708#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:54:06,490 INFO L290 TraceCheckUtils]: 165: Hoare triple {33708#(and (= main_~c~0 21) (= 19 (+ (- 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; {33730#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:54:06,490 INFO L290 TraceCheckUtils]: 166: Hoare triple {33730#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {33730#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:54:06,491 INFO L272 TraceCheckUtils]: 167: Hoare triple {33730#(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)); {33208#true} is VALID [2022-04-28 07:54:06,491 INFO L290 TraceCheckUtils]: 168: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,491 INFO L290 TraceCheckUtils]: 169: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,491 INFO L290 TraceCheckUtils]: 170: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,491 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {33208#true} {33730#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #54#return; {33730#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:54:06,492 INFO L290 TraceCheckUtils]: 172: Hoare triple {33730#(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; {33752#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} is VALID [2022-04-28 07:54:06,492 INFO L290 TraceCheckUtils]: 173: Hoare triple {33752#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} assume !false; {33752#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} is VALID [2022-04-28 07:54:06,492 INFO L272 TraceCheckUtils]: 174: Hoare triple {33752#(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)); {33208#true} is VALID [2022-04-28 07:54:06,492 INFO L290 TraceCheckUtils]: 175: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,492 INFO L290 TraceCheckUtils]: 176: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,492 INFO L290 TraceCheckUtils]: 177: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,493 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {33208#true} {33752#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} #54#return; {33752#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} is VALID [2022-04-28 07:54:06,493 INFO L290 TraceCheckUtils]: 179: Hoare triple {33752#(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; {33774#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-28 07:54:06,493 INFO L290 TraceCheckUtils]: 180: Hoare triple {33774#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} assume !false; {33774#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-28 07:54:06,493 INFO L272 TraceCheckUtils]: 181: Hoare triple {33774#(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)); {33208#true} is VALID [2022-04-28 07:54:06,494 INFO L290 TraceCheckUtils]: 182: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,494 INFO L290 TraceCheckUtils]: 183: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,494 INFO L290 TraceCheckUtils]: 184: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,494 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {33208#true} {33774#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} #54#return; {33774#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-28 07:54:06,494 INFO L290 TraceCheckUtils]: 186: Hoare triple {33774#(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; {33796#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} is VALID [2022-04-28 07:54:06,495 INFO L290 TraceCheckUtils]: 187: Hoare triple {33796#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} assume !false; {33796#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} is VALID [2022-04-28 07:54:06,495 INFO L272 TraceCheckUtils]: 188: Hoare triple {33796#(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)); {33208#true} is VALID [2022-04-28 07:54:06,495 INFO L290 TraceCheckUtils]: 189: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,495 INFO L290 TraceCheckUtils]: 190: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,495 INFO L290 TraceCheckUtils]: 191: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,495 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {33208#true} {33796#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} #54#return; {33796#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} is VALID [2022-04-28 07:54:06,496 INFO L290 TraceCheckUtils]: 193: Hoare triple {33796#(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; {33818#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} is VALID [2022-04-28 07:54:06,496 INFO L290 TraceCheckUtils]: 194: Hoare triple {33818#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} assume !false; {33818#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} is VALID [2022-04-28 07:54:06,496 INFO L272 TraceCheckUtils]: 195: Hoare triple {33818#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~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)); {33208#true} is VALID [2022-04-28 07:54:06,496 INFO L290 TraceCheckUtils]: 196: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,496 INFO L290 TraceCheckUtils]: 197: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,497 INFO L290 TraceCheckUtils]: 198: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,497 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {33208#true} {33818#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} #54#return; {33818#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} is VALID [2022-04-28 07:54:06,497 INFO L290 TraceCheckUtils]: 200: Hoare triple {33818#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~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; {33840#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} is VALID [2022-04-28 07:54:06,498 INFO L290 TraceCheckUtils]: 201: Hoare triple {33840#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} assume !false; {33840#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} is VALID [2022-04-28 07:54:06,498 INFO L272 TraceCheckUtils]: 202: Hoare triple {33840#(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)); {33208#true} is VALID [2022-04-28 07:54:06,498 INFO L290 TraceCheckUtils]: 203: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,498 INFO L290 TraceCheckUtils]: 204: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,498 INFO L290 TraceCheckUtils]: 205: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,498 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {33208#true} {33840#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} #54#return; {33840#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} is VALID [2022-04-28 07:54:06,499 INFO L290 TraceCheckUtils]: 207: Hoare triple {33840#(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; {33862#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-28 07:54:06,499 INFO L290 TraceCheckUtils]: 208: Hoare triple {33862#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} assume !false; {33862#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-28 07:54:06,499 INFO L272 TraceCheckUtils]: 209: Hoare triple {33862#(and (= main_~c~0 28) (= (+ (- 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)); {33208#true} is VALID [2022-04-28 07:54:06,499 INFO L290 TraceCheckUtils]: 210: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,499 INFO L290 TraceCheckUtils]: 211: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,499 INFO L290 TraceCheckUtils]: 212: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,500 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {33208#true} {33862#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} #54#return; {33862#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-28 07:54:06,500 INFO L290 TraceCheckUtils]: 214: Hoare triple {33862#(and (= main_~c~0 28) (= (+ (- 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; {33884#(and (= (+ (- 2) main_~y~0) 27) (= 29 main_~c~0))} is VALID [2022-04-28 07:54:06,501 INFO L290 TraceCheckUtils]: 215: Hoare triple {33884#(and (= (+ (- 2) main_~y~0) 27) (= 29 main_~c~0))} assume !false; {33884#(and (= (+ (- 2) main_~y~0) 27) (= 29 main_~c~0))} is VALID [2022-04-28 07:54:06,501 INFO L272 TraceCheckUtils]: 216: Hoare triple {33884#(and (= (+ (- 2) main_~y~0) 27) (= 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)); {33208#true} is VALID [2022-04-28 07:54:06,501 INFO L290 TraceCheckUtils]: 217: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,501 INFO L290 TraceCheckUtils]: 218: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,501 INFO L290 TraceCheckUtils]: 219: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,501 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {33208#true} {33884#(and (= (+ (- 2) main_~y~0) 27) (= 29 main_~c~0))} #54#return; {33884#(and (= (+ (- 2) main_~y~0) 27) (= 29 main_~c~0))} is VALID [2022-04-28 07:54:06,502 INFO L290 TraceCheckUtils]: 221: Hoare triple {33884#(and (= (+ (- 2) main_~y~0) 27) (= 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; {33906#(and (= (+ main_~y~0 (- 3)) 27) (= 30 main_~c~0))} is VALID [2022-04-28 07:54:06,502 INFO L290 TraceCheckUtils]: 222: Hoare triple {33906#(and (= (+ main_~y~0 (- 3)) 27) (= 30 main_~c~0))} assume !false; {33906#(and (= (+ main_~y~0 (- 3)) 27) (= 30 main_~c~0))} is VALID [2022-04-28 07:54:06,502 INFO L272 TraceCheckUtils]: 223: Hoare triple {33906#(and (= (+ main_~y~0 (- 3)) 27) (= 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)); {33208#true} is VALID [2022-04-28 07:54:06,502 INFO L290 TraceCheckUtils]: 224: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,502 INFO L290 TraceCheckUtils]: 225: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,502 INFO L290 TraceCheckUtils]: 226: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,503 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {33208#true} {33906#(and (= (+ main_~y~0 (- 3)) 27) (= 30 main_~c~0))} #54#return; {33906#(and (= (+ main_~y~0 (- 3)) 27) (= 30 main_~c~0))} is VALID [2022-04-28 07:54:06,503 INFO L290 TraceCheckUtils]: 228: Hoare triple {33906#(and (= (+ main_~y~0 (- 3)) 27) (= 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; {33928#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-28 07:54:06,503 INFO L290 TraceCheckUtils]: 229: Hoare triple {33928#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} assume !false; {33928#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-28 07:54:06,503 INFO L272 TraceCheckUtils]: 230: Hoare triple {33928#(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)); {33208#true} is VALID [2022-04-28 07:54:06,504 INFO L290 TraceCheckUtils]: 231: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,504 INFO L290 TraceCheckUtils]: 232: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,504 INFO L290 TraceCheckUtils]: 233: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,504 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {33208#true} {33928#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} #54#return; {33928#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-28 07:54:06,505 INFO L290 TraceCheckUtils]: 235: Hoare triple {33928#(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; {33950#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:06,505 INFO L290 TraceCheckUtils]: 236: Hoare triple {33950#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} assume !false; {33950#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:06,505 INFO L272 TraceCheckUtils]: 237: Hoare triple {33950#(and (= 32 main_~c~0) (= 31 (+ (- 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)); {33208#true} is VALID [2022-04-28 07:54:06,505 INFO L290 TraceCheckUtils]: 238: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,505 INFO L290 TraceCheckUtils]: 239: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,505 INFO L290 TraceCheckUtils]: 240: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,506 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {33208#true} {33950#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} #54#return; {33950#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:06,506 INFO L290 TraceCheckUtils]: 242: Hoare triple {33950#(and (= 32 main_~c~0) (= 31 (+ (- 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; {33972#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-28 07:54:06,506 INFO L290 TraceCheckUtils]: 243: Hoare triple {33972#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} assume !false; {33972#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-28 07:54:06,506 INFO L272 TraceCheckUtils]: 244: Hoare triple {33972#(and (= (+ (- 2) main_~y~0) 31) (<= 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)); {33208#true} is VALID [2022-04-28 07:54:06,506 INFO L290 TraceCheckUtils]: 245: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-28 07:54:06,507 INFO L290 TraceCheckUtils]: 246: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-28 07:54:06,507 INFO L290 TraceCheckUtils]: 247: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-28 07:54:06,507 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {33208#true} {33972#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} #54#return; {33972#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-28 07:54:06,509 INFO L290 TraceCheckUtils]: 249: Hoare triple {33972#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} assume !(~c~0 < ~k~0); {33994#(and (= (+ (- 2) main_~y~0) 31) (<= main_~k~0 33) (< 32 main_~k~0))} is VALID [2022-04-28 07:54:06,510 INFO L272 TraceCheckUtils]: 250: Hoare triple {33994#(and (= (+ (- 2) main_~y~0) 31) (<= 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)); {33998#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:54:06,510 INFO L290 TraceCheckUtils]: 251: Hoare triple {33998#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34002#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:54:06,510 INFO L290 TraceCheckUtils]: 252: Hoare triple {34002#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33209#false} is VALID [2022-04-28 07:54:06,511 INFO L290 TraceCheckUtils]: 253: Hoare triple {33209#false} assume !false; {33209#false} is VALID [2022-04-28 07:54:06,512 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-28 07:54:06,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:54:06,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:54:06,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70009444] [2022-04-28 07:54:06,956 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:54:06,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578778426] [2022-04-28 07:54:06,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578778426] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:54:06,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:54:06,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2022-04-28 07:54:06,957 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:54:06,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1991027473] [2022-04-28 07:54:06,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1991027473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:54:06,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:54:06,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 07:54:06,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247297866] [2022-04-28 07:54:06,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:54:06,957 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) Word has length 254 [2022-04-28 07:54:06,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:54:06,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2022-04-28 07:54:07,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:54:07,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 07:54:07,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:54:07,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 07:54:07,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 07:54:07,816 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2022-04-28 07:54:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:54:49,795 INFO L93 Difference]: Finished difference Result 139 states and 171 transitions. [2022-04-28 07:54:49,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 07:54:49,795 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) Word has length 254 [2022-04-28 07:54:49,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:54:49,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2022-04-28 07:54:49,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 164 transitions. [2022-04-28 07:54:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2022-04-28 07:54:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 164 transitions. [2022-04-28 07:54:49,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 164 transitions. [2022-04-28 07:54:50,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:54:50,795 INFO L225 Difference]: With dead ends: 139 [2022-04-28 07:54:50,795 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 07:54:50,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=1762, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 07:54:50,796 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 2 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 3859 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 3859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2022-04-28 07:54:50,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2003 Invalid, 3859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3859 Invalid, 0 Unknown, 0 Unchecked, 21.5s Time] [2022-04-28 07:54:50,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 07:54:50,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-04-28 07:54:50,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:54:50,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 134 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 39 states have call successors, (39), 7 states have call predecessors, (39), 5 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 07:54:50,972 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 134 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 39 states have call successors, (39), 7 states have call predecessors, (39), 5 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 07:54:50,973 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 134 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 39 states have call successors, (39), 7 states have call predecessors, (39), 5 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 07:54:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:54:50,976 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2022-04-28 07:54:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2022-04-28 07:54:50,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:54:50,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:54:50,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 39 states have call successors, (39), 7 states have call predecessors, (39), 5 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 134 states. [2022-04-28 07:54:50,976 INFO L87 Difference]: Start difference. First operand has 134 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 39 states have call successors, (39), 7 states have call predecessors, (39), 5 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 134 states. [2022-04-28 07:54:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:54:50,979 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2022-04-28 07:54:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2022-04-28 07:54:50,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:54:50,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:54:50,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:54:50,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:54:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 39 states have call successors, (39), 7 states have call predecessors, (39), 5 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 07:54:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2022-04-28 07:54:50,984 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 254 [2022-04-28 07:54:50,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:54:50,984 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2022-04-28 07:54:50,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2022-04-28 07:54:50,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 166 transitions. [2022-04-28 07:54:52,257 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-28 07:54:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2022-04-28 07:54:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2022-04-28 07:54:52,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:54:52,258 INFO L195 NwaCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:54:52,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 07:54:52,459 WARN L477 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-28 07:54:52,459 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:54:52,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:54:52,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1574773833, now seen corresponding path program 67 times [2022-04-28 07:54:52,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:54:52,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [125607234] [2022-04-28 07:54:52,540 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:54:52,540 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:54:52,540 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:54:52,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1574773833, now seen corresponding path program 68 times [2022-04-28 07:54:52,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:54:52,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914369002] [2022-04-28 07:54:52,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:54:52,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:54:52,560 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:54:52,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1103050639] [2022-04-28 07:54:52,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:54:52,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:54:52,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:54:52,562 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-28 07:54:52,563 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-28 07:54:53,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:54:53,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:54:53,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 144 conjunts are in the unsatisfiable core [2022-04-28 07:54:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:54:53,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:54:55,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {34868#true} call ULTIMATE.init(); {34868#true} is VALID [2022-04-28 07:54:55,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {34868#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); {34868#true} is VALID [2022-04-28 07:54:55,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34868#true} {34868#true} #60#return; {34868#true} is VALID [2022-04-28 07:54:55,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {34868#true} call #t~ret5 := main(); {34868#true} is VALID [2022-04-28 07:54:55,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {34868#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; {34868#true} is VALID [2022-04-28 07:54:55,568 INFO L272 TraceCheckUtils]: 6: Hoare triple {34868#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {34868#true} is VALID [2022-04-28 07:54:55,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,568 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34868#true} {34868#true} #52#return; {34868#true} is VALID [2022-04-28 07:54:55,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {34868#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {34906#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:54:55,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {34906#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {34906#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:54:55,572 INFO L272 TraceCheckUtils]: 13: Hoare triple {34906#(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)); {34868#true} is VALID [2022-04-28 07:54:55,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,573 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {34868#true} {34906#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {34906#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:54:55,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {34906#(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; {34928#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:54:55,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {34928#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {34928#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:54:55,574 INFO L272 TraceCheckUtils]: 20: Hoare triple {34928#(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)); {34868#true} is VALID [2022-04-28 07:54:55,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,575 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {34868#true} {34928#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {34928#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:54:55,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {34928#(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; {34950#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:54:55,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {34950#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !false; {34950#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:54:55,575 INFO L272 TraceCheckUtils]: 27: Hoare triple {34950#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) 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)); {34868#true} is VALID [2022-04-28 07:54:55,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,576 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {34868#true} {34950#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #54#return; {34950#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:54:55,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {34950#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) 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; {34972#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:54:55,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {34972#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !false; {34972#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:54:55,577 INFO L272 TraceCheckUtils]: 34: Hoare triple {34972#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 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)); {34868#true} is VALID [2022-04-28 07:54:55,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,577 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {34868#true} {34972#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #54#return; {34972#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:54:55,578 INFO L290 TraceCheckUtils]: 39: Hoare triple {34972#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 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; {34994#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:54:55,578 INFO L290 TraceCheckUtils]: 40: Hoare triple {34994#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !false; {34994#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:54:55,578 INFO L272 TraceCheckUtils]: 41: Hoare triple {34994#(and (= (+ main_~c~0 (- 3)) 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)); {34868#true} is VALID [2022-04-28 07:54:55,578 INFO L290 TraceCheckUtils]: 42: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,578 INFO L290 TraceCheckUtils]: 43: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,579 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {34868#true} {34994#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #54#return; {34994#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:54:55,579 INFO L290 TraceCheckUtils]: 46: Hoare triple {34994#(and (= (+ main_~c~0 (- 3)) 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; {35016#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:54:55,580 INFO L290 TraceCheckUtils]: 47: Hoare triple {35016#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {35016#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:54:55,580 INFO L272 TraceCheckUtils]: 48: Hoare triple {35016#(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)); {34868#true} is VALID [2022-04-28 07:54:55,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,580 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {34868#true} {35016#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {35016#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:54:55,581 INFO L290 TraceCheckUtils]: 53: Hoare triple {35016#(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; {35038#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:55,581 INFO L290 TraceCheckUtils]: 54: Hoare triple {35038#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {35038#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:55,581 INFO L272 TraceCheckUtils]: 55: Hoare triple {35038#(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)); {34868#true} is VALID [2022-04-28 07:54:55,581 INFO L290 TraceCheckUtils]: 56: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,581 INFO L290 TraceCheckUtils]: 57: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,581 INFO L290 TraceCheckUtils]: 58: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,582 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {34868#true} {35038#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {35038#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:55,582 INFO L290 TraceCheckUtils]: 60: Hoare triple {35038#(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; {35060#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:54:55,583 INFO L290 TraceCheckUtils]: 61: Hoare triple {35060#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !false; {35060#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:54:55,583 INFO L272 TraceCheckUtils]: 62: Hoare triple {35060#(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)); {34868#true} is VALID [2022-04-28 07:54:55,583 INFO L290 TraceCheckUtils]: 63: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,583 INFO L290 TraceCheckUtils]: 64: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,583 INFO L290 TraceCheckUtils]: 65: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,583 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {34868#true} {35060#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #54#return; {35060#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:54:55,584 INFO L290 TraceCheckUtils]: 67: Hoare triple {35060#(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; {35082#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:54:55,584 INFO L290 TraceCheckUtils]: 68: Hoare triple {35082#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {35082#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:54:55,584 INFO L272 TraceCheckUtils]: 69: Hoare triple {35082#(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)); {34868#true} is VALID [2022-04-28 07:54:55,584 INFO L290 TraceCheckUtils]: 70: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,584 INFO L290 TraceCheckUtils]: 71: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,584 INFO L290 TraceCheckUtils]: 72: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,585 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {34868#true} {35082#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {35082#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:54:55,585 INFO L290 TraceCheckUtils]: 74: Hoare triple {35082#(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; {35104#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:54:55,585 INFO L290 TraceCheckUtils]: 75: Hoare triple {35104#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !false; {35104#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:54:55,586 INFO L272 TraceCheckUtils]: 76: Hoare triple {35104#(and (= 8 (+ (- 1) 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)); {34868#true} is VALID [2022-04-28 07:54:55,586 INFO L290 TraceCheckUtils]: 77: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,586 INFO L290 TraceCheckUtils]: 78: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,586 INFO L290 TraceCheckUtils]: 79: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,586 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {34868#true} {35104#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #54#return; {35104#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:54:55,587 INFO L290 TraceCheckUtils]: 81: Hoare triple {35104#(and (= 8 (+ (- 1) 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; {35126#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:54:55,587 INFO L290 TraceCheckUtils]: 82: Hoare triple {35126#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {35126#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:54:55,587 INFO L272 TraceCheckUtils]: 83: Hoare triple {35126#(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)); {34868#true} is VALID [2022-04-28 07:54:55,587 INFO L290 TraceCheckUtils]: 84: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,587 INFO L290 TraceCheckUtils]: 85: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,587 INFO L290 TraceCheckUtils]: 86: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,588 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {34868#true} {35126#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {35126#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:54:55,588 INFO L290 TraceCheckUtils]: 88: Hoare triple {35126#(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; {35148#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:54:55,588 INFO L290 TraceCheckUtils]: 89: Hoare triple {35148#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {35148#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:54:55,588 INFO L272 TraceCheckUtils]: 90: Hoare triple {35148#(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)); {34868#true} is VALID [2022-04-28 07:54:55,589 INFO L290 TraceCheckUtils]: 91: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,589 INFO L290 TraceCheckUtils]: 92: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,589 INFO L290 TraceCheckUtils]: 93: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,589 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {34868#true} {35148#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {35148#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:54:55,589 INFO L290 TraceCheckUtils]: 95: Hoare triple {35148#(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; {35170#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:54:55,590 INFO L290 TraceCheckUtils]: 96: Hoare triple {35170#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} assume !false; {35170#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:54:55,590 INFO L272 TraceCheckUtils]: 97: Hoare triple {35170#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 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)); {34868#true} is VALID [2022-04-28 07:54:55,590 INFO L290 TraceCheckUtils]: 98: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,590 INFO L290 TraceCheckUtils]: 99: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,590 INFO L290 TraceCheckUtils]: 100: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,591 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {34868#true} {35170#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} #54#return; {35170#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:54:55,591 INFO L290 TraceCheckUtils]: 102: Hoare triple {35170#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 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; {35192#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 07:54:55,591 INFO L290 TraceCheckUtils]: 103: Hoare triple {35192#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !false; {35192#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 07:54:55,591 INFO L272 TraceCheckUtils]: 104: Hoare triple {35192#(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)); {34868#true} is VALID [2022-04-28 07:54:55,591 INFO L290 TraceCheckUtils]: 105: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,592 INFO L290 TraceCheckUtils]: 106: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,592 INFO L290 TraceCheckUtils]: 107: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,592 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {34868#true} {35192#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #54#return; {35192#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 07:54:55,592 INFO L290 TraceCheckUtils]: 109: Hoare triple {35192#(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; {35214#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:54:55,593 INFO L290 TraceCheckUtils]: 110: Hoare triple {35214#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {35214#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:54:55,593 INFO L272 TraceCheckUtils]: 111: Hoare triple {35214#(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)); {34868#true} is VALID [2022-04-28 07:54:55,593 INFO L290 TraceCheckUtils]: 112: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,593 INFO L290 TraceCheckUtils]: 113: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,593 INFO L290 TraceCheckUtils]: 114: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,593 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {34868#true} {35214#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #54#return; {35214#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:54:55,594 INFO L290 TraceCheckUtils]: 116: Hoare triple {35214#(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; {35236#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:54:55,594 INFO L290 TraceCheckUtils]: 117: Hoare triple {35236#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} assume !false; {35236#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:54:55,594 INFO L272 TraceCheckUtils]: 118: Hoare triple {35236#(and (= 14 (+ (- 1) main_~y~0)) (= 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)); {34868#true} is VALID [2022-04-28 07:54:55,594 INFO L290 TraceCheckUtils]: 119: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,594 INFO L290 TraceCheckUtils]: 120: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,594 INFO L290 TraceCheckUtils]: 121: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,595 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {34868#true} {35236#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} #54#return; {35236#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:54:55,595 INFO L290 TraceCheckUtils]: 123: Hoare triple {35236#(and (= 14 (+ (- 1) main_~y~0)) (= 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; {35258#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-28 07:54:55,596 INFO L290 TraceCheckUtils]: 124: Hoare triple {35258#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} assume !false; {35258#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-28 07:54:55,596 INFO L272 TraceCheckUtils]: 125: Hoare triple {35258#(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)); {34868#true} is VALID [2022-04-28 07:54:55,596 INFO L290 TraceCheckUtils]: 126: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,596 INFO L290 TraceCheckUtils]: 127: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,596 INFO L290 TraceCheckUtils]: 128: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,596 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {34868#true} {35258#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} #54#return; {35258#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-28 07:54:55,597 INFO L290 TraceCheckUtils]: 130: Hoare triple {35258#(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; {35280#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:54:55,597 INFO L290 TraceCheckUtils]: 131: Hoare triple {35280#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {35280#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:54:55,597 INFO L272 TraceCheckUtils]: 132: Hoare triple {35280#(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)); {34868#true} is VALID [2022-04-28 07:54:55,597 INFO L290 TraceCheckUtils]: 133: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,597 INFO L290 TraceCheckUtils]: 134: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,597 INFO L290 TraceCheckUtils]: 135: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,598 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {34868#true} {35280#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {35280#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:54:55,598 INFO L290 TraceCheckUtils]: 137: Hoare triple {35280#(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; {35302#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:54:55,599 INFO L290 TraceCheckUtils]: 138: Hoare triple {35302#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !false; {35302#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:54:55,599 INFO L272 TraceCheckUtils]: 139: Hoare triple {35302#(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)); {34868#true} is VALID [2022-04-28 07:54:55,599 INFO L290 TraceCheckUtils]: 140: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,599 INFO L290 TraceCheckUtils]: 141: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,599 INFO L290 TraceCheckUtils]: 142: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,599 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {34868#true} {35302#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} #54#return; {35302#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:54:55,600 INFO L290 TraceCheckUtils]: 144: Hoare triple {35302#(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; {35324#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:55,600 INFO L290 TraceCheckUtils]: 145: Hoare triple {35324#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} assume !false; {35324#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:55,600 INFO L272 TraceCheckUtils]: 146: Hoare triple {35324#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 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)); {34868#true} is VALID [2022-04-28 07:54:55,600 INFO L290 TraceCheckUtils]: 147: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,600 INFO L290 TraceCheckUtils]: 148: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,600 INFO L290 TraceCheckUtils]: 149: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,601 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {34868#true} {35324#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} #54#return; {35324#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:55,601 INFO L290 TraceCheckUtils]: 151: Hoare triple {35324#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 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; {35346#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-28 07:54:55,601 INFO L290 TraceCheckUtils]: 152: Hoare triple {35346#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} assume !false; {35346#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-28 07:54:55,602 INFO L272 TraceCheckUtils]: 153: Hoare triple {35346#(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)); {34868#true} is VALID [2022-04-28 07:54:55,602 INFO L290 TraceCheckUtils]: 154: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,602 INFO L290 TraceCheckUtils]: 155: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,602 INFO L290 TraceCheckUtils]: 156: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,602 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {34868#true} {35346#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} #54#return; {35346#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-28 07:54:55,603 INFO L290 TraceCheckUtils]: 158: Hoare triple {35346#(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; {35368#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-28 07:54:55,603 INFO L290 TraceCheckUtils]: 159: Hoare triple {35368#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} assume !false; {35368#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-28 07:54:55,603 INFO L272 TraceCheckUtils]: 160: Hoare triple {35368#(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)); {34868#true} is VALID [2022-04-28 07:54:55,603 INFO L290 TraceCheckUtils]: 161: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,603 INFO L290 TraceCheckUtils]: 162: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,603 INFO L290 TraceCheckUtils]: 163: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,604 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {34868#true} {35368#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} #54#return; {35368#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-28 07:54:55,604 INFO L290 TraceCheckUtils]: 165: Hoare triple {35368#(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; {35390#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:54:55,604 INFO L290 TraceCheckUtils]: 166: Hoare triple {35390#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} assume !false; {35390#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:54:55,605 INFO L272 TraceCheckUtils]: 167: Hoare triple {35390#(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)); {34868#true} is VALID [2022-04-28 07:54:55,605 INFO L290 TraceCheckUtils]: 168: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,605 INFO L290 TraceCheckUtils]: 169: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,605 INFO L290 TraceCheckUtils]: 170: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,605 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {34868#true} {35390#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} #54#return; {35390#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:54:55,606 INFO L290 TraceCheckUtils]: 172: Hoare triple {35390#(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; {35412#(and (= 22 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 20))} is VALID [2022-04-28 07:54:55,606 INFO L290 TraceCheckUtils]: 173: Hoare triple {35412#(and (= 22 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 20))} assume !false; {35412#(and (= 22 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 20))} is VALID [2022-04-28 07:54:55,606 INFO L272 TraceCheckUtils]: 174: Hoare triple {35412#(and (= 22 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 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)); {34868#true} is VALID [2022-04-28 07:54:55,606 INFO L290 TraceCheckUtils]: 175: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,606 INFO L290 TraceCheckUtils]: 176: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,606 INFO L290 TraceCheckUtils]: 177: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,607 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {34868#true} {35412#(and (= 22 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 20))} #54#return; {35412#(and (= 22 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 20))} is VALID [2022-04-28 07:54:55,607 INFO L290 TraceCheckUtils]: 179: Hoare triple {35412#(and (= 22 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 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; {35434#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-28 07:54:55,607 INFO L290 TraceCheckUtils]: 180: Hoare triple {35434#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} assume !false; {35434#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-28 07:54:55,607 INFO L272 TraceCheckUtils]: 181: Hoare triple {35434#(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)); {34868#true} is VALID [2022-04-28 07:54:55,608 INFO L290 TraceCheckUtils]: 182: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,608 INFO L290 TraceCheckUtils]: 183: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,608 INFO L290 TraceCheckUtils]: 184: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,608 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {34868#true} {35434#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} #54#return; {35434#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-28 07:54:55,608 INFO L290 TraceCheckUtils]: 186: Hoare triple {35434#(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; {35456#(and (= (+ main_~y~0 (- 3)) 22) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-28 07:54:55,609 INFO L290 TraceCheckUtils]: 187: Hoare triple {35456#(and (= (+ main_~y~0 (- 3)) 22) (= (+ (- 1) main_~c~0) 24))} assume !false; {35456#(and (= (+ main_~y~0 (- 3)) 22) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-28 07:54:55,609 INFO L272 TraceCheckUtils]: 188: Hoare triple {35456#(and (= (+ main_~y~0 (- 3)) 22) (= (+ (- 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)); {34868#true} is VALID [2022-04-28 07:54:55,609 INFO L290 TraceCheckUtils]: 189: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,609 INFO L290 TraceCheckUtils]: 190: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,609 INFO L290 TraceCheckUtils]: 191: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,609 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {34868#true} {35456#(and (= (+ main_~y~0 (- 3)) 22) (= (+ (- 1) main_~c~0) 24))} #54#return; {35456#(and (= (+ main_~y~0 (- 3)) 22) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-28 07:54:55,610 INFO L290 TraceCheckUtils]: 193: Hoare triple {35456#(and (= (+ main_~y~0 (- 3)) 22) (= (+ (- 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; {35478#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} is VALID [2022-04-28 07:54:55,610 INFO L290 TraceCheckUtils]: 194: Hoare triple {35478#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} assume !false; {35478#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} is VALID [2022-04-28 07:54:55,610 INFO L272 TraceCheckUtils]: 195: Hoare triple {35478#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 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)); {34868#true} is VALID [2022-04-28 07:54:55,610 INFO L290 TraceCheckUtils]: 196: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,610 INFO L290 TraceCheckUtils]: 197: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,611 INFO L290 TraceCheckUtils]: 198: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,611 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {34868#true} {35478#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} #54#return; {35478#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} is VALID [2022-04-28 07:54:55,611 INFO L290 TraceCheckUtils]: 200: Hoare triple {35478#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 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; {35500#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:54:55,612 INFO L290 TraceCheckUtils]: 201: Hoare triple {35500#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {35500#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:54:55,612 INFO L272 TraceCheckUtils]: 202: Hoare triple {35500#(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)); {34868#true} is VALID [2022-04-28 07:54:55,612 INFO L290 TraceCheckUtils]: 203: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,612 INFO L290 TraceCheckUtils]: 204: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,612 INFO L290 TraceCheckUtils]: 205: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,612 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {34868#true} {35500#(and (= main_~y~0 27) (= main_~c~0 27))} #54#return; {35500#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:54:55,613 INFO L290 TraceCheckUtils]: 207: Hoare triple {35500#(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; {35522#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-28 07:54:55,613 INFO L290 TraceCheckUtils]: 208: Hoare triple {35522#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} assume !false; {35522#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-28 07:54:55,613 INFO L272 TraceCheckUtils]: 209: Hoare triple {35522#(and (= (+ (- 1) main_~c~0) 27) (= 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)); {34868#true} is VALID [2022-04-28 07:54:55,613 INFO L290 TraceCheckUtils]: 210: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,613 INFO L290 TraceCheckUtils]: 211: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,613 INFO L290 TraceCheckUtils]: 212: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,614 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {34868#true} {35522#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} #54#return; {35522#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-28 07:54:55,614 INFO L290 TraceCheckUtils]: 214: Hoare triple {35522#(and (= (+ (- 1) main_~c~0) 27) (= 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; {35544#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-28 07:54:55,615 INFO L290 TraceCheckUtils]: 215: Hoare triple {35544#(and (= 29 main_~y~0) (= 29 main_~c~0))} assume !false; {35544#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-28 07:54:55,615 INFO L272 TraceCheckUtils]: 216: Hoare triple {35544#(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)); {34868#true} is VALID [2022-04-28 07:54:55,615 INFO L290 TraceCheckUtils]: 217: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,615 INFO L290 TraceCheckUtils]: 218: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,615 INFO L290 TraceCheckUtils]: 219: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,615 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {34868#true} {35544#(and (= 29 main_~y~0) (= 29 main_~c~0))} #54#return; {35544#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-28 07:54:55,616 INFO L290 TraceCheckUtils]: 221: Hoare triple {35544#(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; {35566#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:55,616 INFO L290 TraceCheckUtils]: 222: Hoare triple {35566#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)))} assume !false; {35566#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:55,616 INFO L272 TraceCheckUtils]: 223: Hoare triple {35566#(and (= (+ (- 1) main_~c~0) 29) (= 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)); {34868#true} is VALID [2022-04-28 07:54:55,616 INFO L290 TraceCheckUtils]: 224: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,616 INFO L290 TraceCheckUtils]: 225: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,616 INFO L290 TraceCheckUtils]: 226: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,617 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {34868#true} {35566#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)))} #54#return; {35566#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:55,617 INFO L290 TraceCheckUtils]: 228: Hoare triple {35566#(and (= (+ (- 1) main_~c~0) 29) (= 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; {35588#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-28 07:54:55,617 INFO L290 TraceCheckUtils]: 229: Hoare triple {35588#(and (= main_~y~0 31) (= main_~c~0 31))} assume !false; {35588#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-28 07:54:55,618 INFO L272 TraceCheckUtils]: 230: Hoare triple {35588#(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)); {34868#true} is VALID [2022-04-28 07:54:55,618 INFO L290 TraceCheckUtils]: 231: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,618 INFO L290 TraceCheckUtils]: 232: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,618 INFO L290 TraceCheckUtils]: 233: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,618 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {34868#true} {35588#(and (= main_~y~0 31) (= main_~c~0 31))} #54#return; {35588#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-28 07:54:55,619 INFO L290 TraceCheckUtils]: 235: Hoare triple {35588#(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; {35610#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-28 07:54:55,619 INFO L290 TraceCheckUtils]: 236: Hoare triple {35610#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !false; {35610#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-28 07:54:55,619 INFO L272 TraceCheckUtils]: 237: Hoare triple {35610#(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)); {34868#true} is VALID [2022-04-28 07:54:55,619 INFO L290 TraceCheckUtils]: 238: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,619 INFO L290 TraceCheckUtils]: 239: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,619 INFO L290 TraceCheckUtils]: 240: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,620 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {34868#true} {35610#(and (= 32 main_~y~0) (= 32 main_~c~0))} #54#return; {35610#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-28 07:54:55,620 INFO L290 TraceCheckUtils]: 242: Hoare triple {35610#(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; {35632#(and (= main_~y~0 33) (= main_~c~0 33))} is VALID [2022-04-28 07:54:55,620 INFO L290 TraceCheckUtils]: 243: Hoare triple {35632#(and (= main_~y~0 33) (= main_~c~0 33))} assume !false; {35632#(and (= main_~y~0 33) (= main_~c~0 33))} is VALID [2022-04-28 07:54:55,620 INFO L272 TraceCheckUtils]: 244: Hoare triple {35632#(and (= main_~y~0 33) (= 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)); {34868#true} is VALID [2022-04-28 07:54:55,621 INFO L290 TraceCheckUtils]: 245: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,621 INFO L290 TraceCheckUtils]: 246: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,621 INFO L290 TraceCheckUtils]: 247: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,621 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {34868#true} {35632#(and (= main_~y~0 33) (= main_~c~0 33))} #54#return; {35632#(and (= main_~y~0 33) (= main_~c~0 33))} is VALID [2022-04-28 07:54:55,621 INFO L290 TraceCheckUtils]: 249: Hoare triple {35632#(and (= main_~y~0 33) (= 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; {35654#(and (<= main_~c~0 34) (= main_~y~0 34) (< 33 main_~k~0))} is VALID [2022-04-28 07:54:55,622 INFO L290 TraceCheckUtils]: 250: Hoare triple {35654#(and (<= main_~c~0 34) (= main_~y~0 34) (< 33 main_~k~0))} assume !false; {35654#(and (<= main_~c~0 34) (= main_~y~0 34) (< 33 main_~k~0))} is VALID [2022-04-28 07:54:55,622 INFO L272 TraceCheckUtils]: 251: Hoare triple {35654#(and (<= main_~c~0 34) (= main_~y~0 34) (< 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)); {34868#true} is VALID [2022-04-28 07:54:55,622 INFO L290 TraceCheckUtils]: 252: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-28 07:54:55,622 INFO L290 TraceCheckUtils]: 253: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-28 07:54:55,622 INFO L290 TraceCheckUtils]: 254: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-28 07:54:55,623 INFO L284 TraceCheckUtils]: 255: Hoare quadruple {34868#true} {35654#(and (<= main_~c~0 34) (= main_~y~0 34) (< 33 main_~k~0))} #54#return; {35654#(and (<= main_~c~0 34) (= main_~y~0 34) (< 33 main_~k~0))} is VALID [2022-04-28 07:54:55,623 INFO L290 TraceCheckUtils]: 256: Hoare triple {35654#(and (<= main_~c~0 34) (= main_~y~0 34) (< 33 main_~k~0))} assume !(~c~0 < ~k~0); {35676#(and (<= main_~k~0 34) (= main_~y~0 34) (< 33 main_~k~0))} is VALID [2022-04-28 07:54:55,624 INFO L272 TraceCheckUtils]: 257: Hoare triple {35676#(and (<= main_~k~0 34) (= main_~y~0 34) (< 33 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35680#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:54:55,624 INFO L290 TraceCheckUtils]: 258: Hoare triple {35680#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35684#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:54:55,624 INFO L290 TraceCheckUtils]: 259: Hoare triple {35684#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {34869#false} is VALID [2022-04-28 07:54:55,624 INFO L290 TraceCheckUtils]: 260: Hoare triple {34869#false} assume !false; {34869#false} is VALID [2022-04-28 07:54:55,626 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-28 07:54:55,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:54:56,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:54:56,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914369002] [2022-04-28 07:54:56,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:54:56,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103050639] [2022-04-28 07:54:56,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103050639] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:54:56,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:54:56,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2022-04-28 07:54:56,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:54:56,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [125607234] [2022-04-28 07:54:56,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [125607234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:54:56,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:54:56,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 07:54:56,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049420785] [2022-04-28 07:54:56,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:54:56,175 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) Word has length 261 [2022-04-28 07:54:56,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:54:56,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) [2022-04-28 07:54:57,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:54:57,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 07:54:57,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:54:57,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 07:54:57,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 07:54:57,112 INFO L87 Difference]: Start difference. First operand 134 states and 166 transitions. Second operand has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) [2022-04-28 07:55:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:55:44,489 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2022-04-28 07:55:44,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 07:55:44,490 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) Word has length 261 [2022-04-28 07:55:44,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:55:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) [2022-04-28 07:55:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 168 transitions. [2022-04-28 07:55:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) [2022-04-28 07:55:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 168 transitions. [2022-04-28 07:55:44,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 168 transitions. [2022-04-28 07:55:45,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:55:45,620 INFO L225 Difference]: With dead ends: 142 [2022-04-28 07:55:45,620 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 07:55:45,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=1847, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 07:55:45,621 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 2 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 4077 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 4077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.8s IncrementalHoareTripleChecker+Time [2022-04-28 07:55:45,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2095 Invalid, 4077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4077 Invalid, 0 Unknown, 0 Unchecked, 24.8s Time] [2022-04-28 07:55:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 07:55:45,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-04-28 07:55:45,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:55:45,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 137 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 40 states have call successors, (40), 7 states have call predecessors, (40), 5 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 07:55:45,778 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 137 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 40 states have call successors, (40), 7 states have call predecessors, (40), 5 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 07:55:45,779 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 137 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 40 states have call successors, (40), 7 states have call predecessors, (40), 5 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 07:55:45,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:55:45,781 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2022-04-28 07:55:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2022-04-28 07:55:45,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:55:45,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:55:45,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 40 states have call successors, (40), 7 states have call predecessors, (40), 5 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand 137 states. [2022-04-28 07:55:45,782 INFO L87 Difference]: Start difference. First operand has 137 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 40 states have call successors, (40), 7 states have call predecessors, (40), 5 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand 137 states. [2022-04-28 07:55:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:55:45,784 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2022-04-28 07:55:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2022-04-28 07:55:45,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:55:45,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:55:45,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:55:45,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:55:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 40 states have call successors, (40), 7 states have call predecessors, (40), 5 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 07:55:45,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2022-04-28 07:55:45,787 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 261 [2022-04-28 07:55:45,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:55:45,787 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2022-04-28 07:55:45,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) [2022-04-28 07:55:45,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 170 transitions. [2022-04-28 07:55:47,233 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-28 07:55:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2022-04-28 07:55:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-04-28 07:55:47,234 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:55:47,234 INFO L195 NwaCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:55:47,243 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-28 07:55:47,435 WARN L477 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-28 07:55:47,435 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:55:47,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:55:47,436 INFO L85 PathProgramCache]: Analyzing trace with hash -416032600, now seen corresponding path program 69 times [2022-04-28 07:55:47,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:55:47,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [377220046] [2022-04-28 07:55:47,543 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:55:47,543 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:55:47,543 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:55:47,543 INFO L85 PathProgramCache]: Analyzing trace with hash -416032600, now seen corresponding path program 70 times [2022-04-28 07:55:47,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:55:47,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729258663] [2022-04-28 07:55:47,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:55:47,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:55:47,560 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:55:47,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [766803199] [2022-04-28 07:55:47,560 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:55:47,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:55:47,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:55:47,565 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-28 07:55:47,566 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-28 07:55:48,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:55:48,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:55:48,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 148 conjunts are in the unsatisfiable core [2022-04-28 07:55:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:55:48,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:55:50,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {36568#true} call ULTIMATE.init(); {36568#true} is VALID [2022-04-28 07:55:50,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {36568#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); {36568#true} is VALID [2022-04-28 07:55:50,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36568#true} {36568#true} #60#return; {36568#true} is VALID [2022-04-28 07:55:50,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {36568#true} call #t~ret5 := main(); {36568#true} is VALID [2022-04-28 07:55:50,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {36568#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; {36568#true} is VALID [2022-04-28 07:55:50,402 INFO L272 TraceCheckUtils]: 6: Hoare triple {36568#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {36568#true} is VALID [2022-04-28 07:55:50,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,403 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36568#true} {36568#true} #52#return; {36568#true} is VALID [2022-04-28 07:55:50,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {36568#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {36606#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:55:50,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {36606#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {36606#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:55:50,404 INFO L272 TraceCheckUtils]: 13: Hoare triple {36606#(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)); {36568#true} is VALID [2022-04-28 07:55:50,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,405 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {36568#true} {36606#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {36606#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:55:50,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {36606#(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; {36628#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:55:50,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {36628#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {36628#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:55:50,406 INFO L272 TraceCheckUtils]: 20: Hoare triple {36628#(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)); {36568#true} is VALID [2022-04-28 07:55:50,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,406 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {36568#true} {36628#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {36628#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:55:50,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {36628#(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; {36650#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:55:50,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {36650#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {36650#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:55:50,407 INFO L272 TraceCheckUtils]: 27: Hoare triple {36650#(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)); {36568#true} is VALID [2022-04-28 07:55:50,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,408 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {36568#true} {36650#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {36650#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:55:50,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {36650#(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; {36672#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:55:50,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {36672#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {36672#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:55:50,408 INFO L272 TraceCheckUtils]: 34: Hoare triple {36672#(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)); {36568#true} is VALID [2022-04-28 07:55:50,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,409 INFO L290 TraceCheckUtils]: 36: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,409 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {36568#true} {36672#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #54#return; {36672#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:55:50,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {36672#(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; {36694#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:55:50,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {36694#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {36694#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:55:50,410 INFO L272 TraceCheckUtils]: 41: Hoare triple {36694#(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)); {36568#true} is VALID [2022-04-28 07:55:50,410 INFO L290 TraceCheckUtils]: 42: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,410 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {36568#true} {36694#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {36694#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:55:50,411 INFO L290 TraceCheckUtils]: 46: Hoare triple {36694#(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; {36716#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:55:50,411 INFO L290 TraceCheckUtils]: 47: Hoare triple {36716#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !false; {36716#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:55:50,411 INFO L272 TraceCheckUtils]: 48: Hoare triple {36716#(and (= (+ (- 2) 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)); {36568#true} is VALID [2022-04-28 07:55:50,411 INFO L290 TraceCheckUtils]: 49: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,411 INFO L290 TraceCheckUtils]: 50: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,412 INFO L290 TraceCheckUtils]: 51: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,412 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {36568#true} {36716#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #54#return; {36716#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:55:50,412 INFO L290 TraceCheckUtils]: 53: Hoare triple {36716#(and (= (+ (- 2) 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; {36738#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:55:50,413 INFO L290 TraceCheckUtils]: 54: Hoare triple {36738#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {36738#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:55:50,413 INFO L272 TraceCheckUtils]: 55: Hoare triple {36738#(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)); {36568#true} is VALID [2022-04-28 07:55:50,413 INFO L290 TraceCheckUtils]: 56: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,413 INFO L290 TraceCheckUtils]: 57: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,413 INFO L290 TraceCheckUtils]: 58: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,413 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {36568#true} {36738#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {36738#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:55:50,414 INFO L290 TraceCheckUtils]: 60: Hoare triple {36738#(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; {36760#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:55:50,414 INFO L290 TraceCheckUtils]: 61: Hoare triple {36760#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {36760#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:55:50,414 INFO L272 TraceCheckUtils]: 62: Hoare triple {36760#(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)); {36568#true} is VALID [2022-04-28 07:55:50,414 INFO L290 TraceCheckUtils]: 63: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,414 INFO L290 TraceCheckUtils]: 64: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,414 INFO L290 TraceCheckUtils]: 65: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,415 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {36568#true} {36760#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #54#return; {36760#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:55:50,415 INFO L290 TraceCheckUtils]: 67: Hoare triple {36760#(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; {36782#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:55:50,416 INFO L290 TraceCheckUtils]: 68: Hoare triple {36782#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {36782#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:55:50,416 INFO L272 TraceCheckUtils]: 69: Hoare triple {36782#(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)); {36568#true} is VALID [2022-04-28 07:55:50,416 INFO L290 TraceCheckUtils]: 70: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,416 INFO L290 TraceCheckUtils]: 71: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,416 INFO L290 TraceCheckUtils]: 72: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,416 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {36568#true} {36782#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #54#return; {36782#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:55:50,417 INFO L290 TraceCheckUtils]: 74: Hoare triple {36782#(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; {36804#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:55:50,417 INFO L290 TraceCheckUtils]: 75: Hoare triple {36804#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {36804#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:55:50,417 INFO L272 TraceCheckUtils]: 76: Hoare triple {36804#(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)); {36568#true} is VALID [2022-04-28 07:55:50,417 INFO L290 TraceCheckUtils]: 77: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,417 INFO L290 TraceCheckUtils]: 78: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,417 INFO L290 TraceCheckUtils]: 79: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,418 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {36568#true} {36804#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {36804#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:55:50,418 INFO L290 TraceCheckUtils]: 81: Hoare triple {36804#(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; {36826#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:55:50,419 INFO L290 TraceCheckUtils]: 82: Hoare triple {36826#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {36826#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:55:50,419 INFO L272 TraceCheckUtils]: 83: Hoare triple {36826#(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)); {36568#true} is VALID [2022-04-28 07:55:50,419 INFO L290 TraceCheckUtils]: 84: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,419 INFO L290 TraceCheckUtils]: 85: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,419 INFO L290 TraceCheckUtils]: 86: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,419 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {36568#true} {36826#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {36826#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:55:50,420 INFO L290 TraceCheckUtils]: 88: Hoare triple {36826#(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; {36848#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:55:50,420 INFO L290 TraceCheckUtils]: 89: Hoare triple {36848#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} assume !false; {36848#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:55:50,420 INFO L272 TraceCheckUtils]: 90: Hoare triple {36848#(and (= main_~c~0 11) (= (+ (- 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)); {36568#true} is VALID [2022-04-28 07:55:50,420 INFO L290 TraceCheckUtils]: 91: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,420 INFO L290 TraceCheckUtils]: 92: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,420 INFO L290 TraceCheckUtils]: 93: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,421 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {36568#true} {36848#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} #54#return; {36848#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:55:50,421 INFO L290 TraceCheckUtils]: 95: Hoare triple {36848#(and (= main_~c~0 11) (= (+ (- 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; {36870#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:55:50,422 INFO L290 TraceCheckUtils]: 96: Hoare triple {36870#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {36870#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:55:50,422 INFO L272 TraceCheckUtils]: 97: Hoare triple {36870#(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)); {36568#true} is VALID [2022-04-28 07:55:50,422 INFO L290 TraceCheckUtils]: 98: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,422 INFO L290 TraceCheckUtils]: 99: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,422 INFO L290 TraceCheckUtils]: 100: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,422 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {36568#true} {36870#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {36870#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:55:50,423 INFO L290 TraceCheckUtils]: 102: Hoare triple {36870#(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; {36892#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-28 07:55:50,423 INFO L290 TraceCheckUtils]: 103: Hoare triple {36892#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {36892#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-28 07:55:50,423 INFO L272 TraceCheckUtils]: 104: Hoare triple {36892#(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)); {36568#true} is VALID [2022-04-28 07:55:50,423 INFO L290 TraceCheckUtils]: 105: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,423 INFO L290 TraceCheckUtils]: 106: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,423 INFO L290 TraceCheckUtils]: 107: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,424 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {36568#true} {36892#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #54#return; {36892#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-28 07:55:50,424 INFO L290 TraceCheckUtils]: 109: Hoare triple {36892#(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; {36914#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:55:50,425 INFO L290 TraceCheckUtils]: 110: Hoare triple {36914#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {36914#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:55:50,425 INFO L272 TraceCheckUtils]: 111: Hoare triple {36914#(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)); {36568#true} is VALID [2022-04-28 07:55:50,425 INFO L290 TraceCheckUtils]: 112: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,425 INFO L290 TraceCheckUtils]: 113: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,425 INFO L290 TraceCheckUtils]: 114: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,425 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {36568#true} {36914#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #54#return; {36914#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:55:50,426 INFO L290 TraceCheckUtils]: 116: Hoare triple {36914#(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; {36936#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:55:50,426 INFO L290 TraceCheckUtils]: 117: Hoare triple {36936#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !false; {36936#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:55:50,426 INFO L272 TraceCheckUtils]: 118: Hoare triple {36936#(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)); {36568#true} is VALID [2022-04-28 07:55:50,426 INFO L290 TraceCheckUtils]: 119: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,426 INFO L290 TraceCheckUtils]: 120: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,426 INFO L290 TraceCheckUtils]: 121: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,427 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {36568#true} {36936#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} #54#return; {36936#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:55:50,428 INFO L290 TraceCheckUtils]: 123: Hoare triple {36936#(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; {36958#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:55:50,428 INFO L290 TraceCheckUtils]: 124: Hoare triple {36958#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {36958#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:55:50,428 INFO L272 TraceCheckUtils]: 125: Hoare triple {36958#(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)); {36568#true} is VALID [2022-04-28 07:55:50,429 INFO L290 TraceCheckUtils]: 126: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,429 INFO L290 TraceCheckUtils]: 127: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,429 INFO L290 TraceCheckUtils]: 128: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,429 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {36568#true} {36958#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {36958#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:55:50,430 INFO L290 TraceCheckUtils]: 130: Hoare triple {36958#(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; {36980#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-28 07:55:50,430 INFO L290 TraceCheckUtils]: 131: Hoare triple {36980#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !false; {36980#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-28 07:55:50,430 INFO L272 TraceCheckUtils]: 132: Hoare triple {36980#(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)); {36568#true} is VALID [2022-04-28 07:55:50,431 INFO L290 TraceCheckUtils]: 133: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,431 INFO L290 TraceCheckUtils]: 134: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,431 INFO L290 TraceCheckUtils]: 135: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,431 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {36568#true} {36980#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} #54#return; {36980#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-28 07:55:50,432 INFO L290 TraceCheckUtils]: 137: Hoare triple {36980#(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; {37002#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:55:50,432 INFO L290 TraceCheckUtils]: 138: Hoare triple {37002#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} assume !false; {37002#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:55:50,433 INFO L272 TraceCheckUtils]: 139: Hoare triple {37002#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 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)); {36568#true} is VALID [2022-04-28 07:55:50,433 INFO L290 TraceCheckUtils]: 140: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,433 INFO L290 TraceCheckUtils]: 141: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,433 INFO L290 TraceCheckUtils]: 142: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,433 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {36568#true} {37002#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} #54#return; {37002#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:55:50,434 INFO L290 TraceCheckUtils]: 144: Hoare triple {37002#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 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; {37024#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-28 07:55:50,434 INFO L290 TraceCheckUtils]: 145: Hoare triple {37024#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} assume !false; {37024#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-28 07:55:50,435 INFO L272 TraceCheckUtils]: 146: Hoare triple {37024#(and (= (+ main_~y~0 (- 3)) 16) (= 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)); {36568#true} is VALID [2022-04-28 07:55:50,435 INFO L290 TraceCheckUtils]: 147: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,435 INFO L290 TraceCheckUtils]: 148: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,435 INFO L290 TraceCheckUtils]: 149: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,436 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {36568#true} {37024#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} #54#return; {37024#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-28 07:55:50,436 INFO L290 TraceCheckUtils]: 151: Hoare triple {37024#(and (= (+ main_~y~0 (- 3)) 16) (= 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; {37046#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-28 07:55:50,437 INFO L290 TraceCheckUtils]: 152: Hoare triple {37046#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} assume !false; {37046#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-28 07:55:50,437 INFO L272 TraceCheckUtils]: 153: Hoare triple {37046#(and (= 19 (+ (- 1) main_~c~0)) (= (+ 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)); {36568#true} is VALID [2022-04-28 07:55:50,437 INFO L290 TraceCheckUtils]: 154: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,437 INFO L290 TraceCheckUtils]: 155: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,437 INFO L290 TraceCheckUtils]: 156: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,438 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {36568#true} {37046#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} #54#return; {37046#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-28 07:55:50,438 INFO L290 TraceCheckUtils]: 158: Hoare triple {37046#(and (= 19 (+ (- 1) main_~c~0)) (= (+ 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; {37068#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-28 07:55:50,439 INFO L290 TraceCheckUtils]: 159: Hoare triple {37068#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} assume !false; {37068#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-28 07:55:50,439 INFO L272 TraceCheckUtils]: 160: Hoare triple {37068#(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)); {36568#true} is VALID [2022-04-28 07:55:50,439 INFO L290 TraceCheckUtils]: 161: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,439 INFO L290 TraceCheckUtils]: 162: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,439 INFO L290 TraceCheckUtils]: 163: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,439 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {36568#true} {37068#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} #54#return; {37068#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-28 07:55:50,440 INFO L290 TraceCheckUtils]: 165: Hoare triple {37068#(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; {37090#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:55:50,440 INFO L290 TraceCheckUtils]: 166: Hoare triple {37090#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} assume !false; {37090#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:55:50,441 INFO L272 TraceCheckUtils]: 167: Hoare triple {37090#(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)); {36568#true} is VALID [2022-04-28 07:55:50,441 INFO L290 TraceCheckUtils]: 168: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,441 INFO L290 TraceCheckUtils]: 169: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,441 INFO L290 TraceCheckUtils]: 170: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,441 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {36568#true} {37090#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} #54#return; {37090#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:55:50,442 INFO L290 TraceCheckUtils]: 172: Hoare triple {37090#(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; {37112#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:55:50,442 INFO L290 TraceCheckUtils]: 173: Hoare triple {37112#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {37112#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:55:50,442 INFO L272 TraceCheckUtils]: 174: Hoare triple {37112#(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)); {36568#true} is VALID [2022-04-28 07:55:50,443 INFO L290 TraceCheckUtils]: 175: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,443 INFO L290 TraceCheckUtils]: 176: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,443 INFO L290 TraceCheckUtils]: 177: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,443 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {36568#true} {37112#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {37112#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:55:50,444 INFO L290 TraceCheckUtils]: 179: Hoare triple {37112#(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; {37134#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-28 07:55:50,444 INFO L290 TraceCheckUtils]: 180: Hoare triple {37134#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {37134#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-28 07:55:50,444 INFO L272 TraceCheckUtils]: 181: Hoare triple {37134#(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)); {36568#true} is VALID [2022-04-28 07:55:50,444 INFO L290 TraceCheckUtils]: 182: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,444 INFO L290 TraceCheckUtils]: 183: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,445 INFO L290 TraceCheckUtils]: 184: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,445 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {36568#true} {37134#(and (= main_~c~0 24) (= main_~y~0 24))} #54#return; {37134#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-28 07:55:50,446 INFO L290 TraceCheckUtils]: 186: Hoare triple {37134#(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; {37156#(and (= (+ (- 1) main_~c~0) 24) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-28 07:55:50,446 INFO L290 TraceCheckUtils]: 187: Hoare triple {37156#(and (= (+ (- 1) main_~c~0) 24) (= (+ (- 1) main_~y~0) 24))} assume !false; {37156#(and (= (+ (- 1) main_~c~0) 24) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-28 07:55:50,446 INFO L272 TraceCheckUtils]: 188: Hoare triple {37156#(and (= (+ (- 1) main_~c~0) 24) (= (+ (- 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)); {36568#true} is VALID [2022-04-28 07:55:50,446 INFO L290 TraceCheckUtils]: 189: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,446 INFO L290 TraceCheckUtils]: 190: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,446 INFO L290 TraceCheckUtils]: 191: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,447 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {36568#true} {37156#(and (= (+ (- 1) main_~c~0) 24) (= (+ (- 1) main_~y~0) 24))} #54#return; {37156#(and (= (+ (- 1) main_~c~0) 24) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-28 07:55:50,447 INFO L290 TraceCheckUtils]: 193: Hoare triple {37156#(and (= (+ (- 1) main_~c~0) 24) (= (+ (- 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; {37178#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} is VALID [2022-04-28 07:55:50,448 INFO L290 TraceCheckUtils]: 194: Hoare triple {37178#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} assume !false; {37178#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} is VALID [2022-04-28 07:55:50,448 INFO L272 TraceCheckUtils]: 195: Hoare triple {37178#(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)); {36568#true} is VALID [2022-04-28 07:55:50,448 INFO L290 TraceCheckUtils]: 196: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,448 INFO L290 TraceCheckUtils]: 197: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,448 INFO L290 TraceCheckUtils]: 198: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,448 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {36568#true} {37178#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} #54#return; {37178#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} is VALID [2022-04-28 07:55:50,449 INFO L290 TraceCheckUtils]: 200: Hoare triple {37178#(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; {37200#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:55:50,449 INFO L290 TraceCheckUtils]: 201: Hoare triple {37200#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {37200#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:55:50,449 INFO L272 TraceCheckUtils]: 202: Hoare triple {37200#(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)); {36568#true} is VALID [2022-04-28 07:55:50,449 INFO L290 TraceCheckUtils]: 203: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,449 INFO L290 TraceCheckUtils]: 204: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,449 INFO L290 TraceCheckUtils]: 205: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,450 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {36568#true} {37200#(and (= main_~y~0 27) (= main_~c~0 27))} #54#return; {37200#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:55:50,450 INFO L290 TraceCheckUtils]: 207: Hoare triple {37200#(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; {37222#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-28 07:55:50,451 INFO L290 TraceCheckUtils]: 208: Hoare triple {37222#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} assume !false; {37222#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-28 07:55:50,451 INFO L272 TraceCheckUtils]: 209: Hoare triple {37222#(and (= (+ (- 1) main_~c~0) 27) (= 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)); {36568#true} is VALID [2022-04-28 07:55:50,451 INFO L290 TraceCheckUtils]: 210: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,451 INFO L290 TraceCheckUtils]: 211: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,451 INFO L290 TraceCheckUtils]: 212: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,451 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {36568#true} {37222#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} #54#return; {37222#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-28 07:55:50,452 INFO L290 TraceCheckUtils]: 214: Hoare triple {37222#(and (= (+ (- 1) main_~c~0) 27) (= 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; {37244#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-28 07:55:50,452 INFO L290 TraceCheckUtils]: 215: Hoare triple {37244#(and (= 29 main_~y~0) (= 29 main_~c~0))} assume !false; {37244#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-28 07:55:50,452 INFO L272 TraceCheckUtils]: 216: Hoare triple {37244#(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)); {36568#true} is VALID [2022-04-28 07:55:50,452 INFO L290 TraceCheckUtils]: 217: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,452 INFO L290 TraceCheckUtils]: 218: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,452 INFO L290 TraceCheckUtils]: 219: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,453 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {36568#true} {37244#(and (= 29 main_~y~0) (= 29 main_~c~0))} #54#return; {37244#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-28 07:55:50,453 INFO L290 TraceCheckUtils]: 221: Hoare triple {37244#(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; {37266#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:55:50,453 INFO L290 TraceCheckUtils]: 222: Hoare triple {37266#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} assume !false; {37266#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:55:50,454 INFO L272 TraceCheckUtils]: 223: Hoare triple {37266#(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)); {36568#true} is VALID [2022-04-28 07:55:50,454 INFO L290 TraceCheckUtils]: 224: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,454 INFO L290 TraceCheckUtils]: 225: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,454 INFO L290 TraceCheckUtils]: 226: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,454 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {36568#true} {37266#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} #54#return; {37266#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:55:50,455 INFO L290 TraceCheckUtils]: 228: Hoare triple {37266#(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; {37288#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-28 07:55:50,455 INFO L290 TraceCheckUtils]: 229: Hoare triple {37288#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} assume !false; {37288#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-28 07:55:50,455 INFO L272 TraceCheckUtils]: 230: Hoare triple {37288#(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)); {36568#true} is VALID [2022-04-28 07:55:50,455 INFO L290 TraceCheckUtils]: 231: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,455 INFO L290 TraceCheckUtils]: 232: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,455 INFO L290 TraceCheckUtils]: 233: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,456 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {36568#true} {37288#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} #54#return; {37288#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-28 07:55:50,456 INFO L290 TraceCheckUtils]: 235: Hoare triple {37288#(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; {37310#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:55:50,456 INFO L290 TraceCheckUtils]: 236: Hoare triple {37310#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} assume !false; {37310#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:55:50,456 INFO L272 TraceCheckUtils]: 237: Hoare triple {37310#(and (= 32 main_~c~0) (= 31 (+ (- 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)); {36568#true} is VALID [2022-04-28 07:55:50,457 INFO L290 TraceCheckUtils]: 238: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,457 INFO L290 TraceCheckUtils]: 239: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,457 INFO L290 TraceCheckUtils]: 240: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,457 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {36568#true} {37310#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} #54#return; {37310#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:55:50,457 INFO L290 TraceCheckUtils]: 242: Hoare triple {37310#(and (= 32 main_~c~0) (= 31 (+ (- 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; {37332#(and (= (+ (- 2) main_~y~0) 31) (= main_~c~0 33))} is VALID [2022-04-28 07:55:50,458 INFO L290 TraceCheckUtils]: 243: Hoare triple {37332#(and (= (+ (- 2) main_~y~0) 31) (= main_~c~0 33))} assume !false; {37332#(and (= (+ (- 2) main_~y~0) 31) (= main_~c~0 33))} is VALID [2022-04-28 07:55:50,458 INFO L272 TraceCheckUtils]: 244: Hoare triple {37332#(and (= (+ (- 2) main_~y~0) 31) (= 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)); {36568#true} is VALID [2022-04-28 07:55:50,458 INFO L290 TraceCheckUtils]: 245: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,458 INFO L290 TraceCheckUtils]: 246: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,458 INFO L290 TraceCheckUtils]: 247: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,459 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {36568#true} {37332#(and (= (+ (- 2) main_~y~0) 31) (= main_~c~0 33))} #54#return; {37332#(and (= (+ (- 2) main_~y~0) 31) (= main_~c~0 33))} is VALID [2022-04-28 07:55:50,459 INFO L290 TraceCheckUtils]: 249: Hoare triple {37332#(and (= (+ (- 2) main_~y~0) 31) (= 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; {37354#(and (= main_~c~0 34) (= main_~y~0 34))} is VALID [2022-04-28 07:55:50,459 INFO L290 TraceCheckUtils]: 250: Hoare triple {37354#(and (= main_~c~0 34) (= main_~y~0 34))} assume !false; {37354#(and (= main_~c~0 34) (= main_~y~0 34))} is VALID [2022-04-28 07:55:50,459 INFO L272 TraceCheckUtils]: 251: Hoare triple {37354#(and (= main_~c~0 34) (= 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)); {36568#true} is VALID [2022-04-28 07:55:50,459 INFO L290 TraceCheckUtils]: 252: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,460 INFO L290 TraceCheckUtils]: 253: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,460 INFO L290 TraceCheckUtils]: 254: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,460 INFO L284 TraceCheckUtils]: 255: Hoare quadruple {36568#true} {37354#(and (= main_~c~0 34) (= main_~y~0 34))} #54#return; {37354#(and (= main_~c~0 34) (= main_~y~0 34))} is VALID [2022-04-28 07:55:50,460 INFO L290 TraceCheckUtils]: 256: Hoare triple {37354#(and (= main_~c~0 34) (= 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; {37376#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} is VALID [2022-04-28 07:55:50,461 INFO L290 TraceCheckUtils]: 257: Hoare triple {37376#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} assume !false; {37376#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} is VALID [2022-04-28 07:55:50,461 INFO L272 TraceCheckUtils]: 258: Hoare triple {37376#(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)); {36568#true} is VALID [2022-04-28 07:55:50,461 INFO L290 TraceCheckUtils]: 259: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-28 07:55:50,461 INFO L290 TraceCheckUtils]: 260: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-28 07:55:50,461 INFO L290 TraceCheckUtils]: 261: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-28 07:55:50,461 INFO L284 TraceCheckUtils]: 262: Hoare quadruple {36568#true} {37376#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} #54#return; {37376#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} is VALID [2022-04-28 07:55:50,462 INFO L290 TraceCheckUtils]: 263: Hoare triple {37376#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} assume !(~c~0 < ~k~0); {37398#(and (= 35 main_~y~0) (<= main_~k~0 35) (< 34 main_~k~0))} is VALID [2022-04-28 07:55:50,463 INFO L272 TraceCheckUtils]: 264: Hoare triple {37398#(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)); {37402#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:55:50,463 INFO L290 TraceCheckUtils]: 265: Hoare triple {37402#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37406#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:55:50,463 INFO L290 TraceCheckUtils]: 266: Hoare triple {37406#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36569#false} is VALID [2022-04-28 07:55:50,463 INFO L290 TraceCheckUtils]: 267: Hoare triple {36569#false} assume !false; {36569#false} is VALID [2022-04-28 07:55:50,465 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-28 07:55:50,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:55:50,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:55:50,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729258663] [2022-04-28 07:55:50,971 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:55:50,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766803199] [2022-04-28 07:55:50,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766803199] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:55:50,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:55:50,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2022-04-28 07:55:50,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:55:50,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [377220046] [2022-04-28 07:55:50,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [377220046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:55:50,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:55:50,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 07:55:50,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856514782] [2022-04-28 07:55:50,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:55:50,972 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) Word has length 268 [2022-04-28 07:55:50,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:55:50,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-04-28 07:55:52,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:55:52,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 07:55:52,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:55:52,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 07:55:52,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 07:55:52,038 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-04-28 07:56:46,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:46,044 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2022-04-28 07:56:46,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 07:56:46,044 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) Word has length 268 [2022-04-28 07:56:46,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:56:46,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-04-28 07:56:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 172 transitions. [2022-04-28 07:56:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-04-28 07:56:46,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 172 transitions. [2022-04-28 07:56:46,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 172 transitions. [2022-04-28 07:56:47,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:56:47,245 INFO L225 Difference]: With dead ends: 145 [2022-04-28 07:56:47,245 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 07:56:47,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 237 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-28 07:56:47,246 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 2 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 4301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 4301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2022-04-28 07:56:47,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2189 Invalid, 4301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4301 Invalid, 0 Unknown, 0 Unchecked, 28.3s Time] [2022-04-28 07:56:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 07:56:47,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-04-28 07:56:47,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:56:47,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 140 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 41 states have call successors, (41), 7 states have call predecessors, (41), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-28 07:56:47,407 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 140 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 41 states have call successors, (41), 7 states have call predecessors, (41), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-28 07:56:47,407 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 140 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 41 states have call successors, (41), 7 states have call predecessors, (41), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-28 07:56:47,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:47,410 INFO L93 Difference]: Finished difference Result 140 states and 174 transitions. [2022-04-28 07:56:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2022-04-28 07:56:47,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:47,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:47,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 41 states have call successors, (41), 7 states have call predecessors, (41), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 140 states. [2022-04-28 07:56:47,411 INFO L87 Difference]: Start difference. First operand has 140 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 41 states have call successors, (41), 7 states have call predecessors, (41), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 140 states. [2022-04-28 07:56:47,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:47,415 INFO L93 Difference]: Finished difference Result 140 states and 174 transitions. [2022-04-28 07:56:47,415 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2022-04-28 07:56:47,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:47,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:47,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:56:47,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:56:47,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 41 states have call successors, (41), 7 states have call predecessors, (41), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-28 07:56:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2022-04-28 07:56:47,419 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 268 [2022-04-28 07:56:47,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:56:47,419 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2022-04-28 07:56:47,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-04-28 07:56:47,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 174 transitions. [2022-04-28 07:56:49,030 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-28 07:56:49,030 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2022-04-28 07:56:49,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-04-28 07:56:49,031 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:56:49,031 INFO L195 NwaCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:56:49,040 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-28 07:56:49,240 WARN L477 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-28 07:56:49,240 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:56:49,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:56:49,240 INFO L85 PathProgramCache]: Analyzing trace with hash 825903977, now seen corresponding path program 71 times [2022-04-28 07:56:49,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:49,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1627501326] [2022-04-28 07:56:49,334 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:56:49,334 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:56:49,334 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:56:49,334 INFO L85 PathProgramCache]: Analyzing trace with hash 825903977, now seen corresponding path program 72 times [2022-04-28 07:56:49,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:56:49,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87976382] [2022-04-28 07:56:49,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:56:49,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:56:49,353 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:56:49,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141927554] [2022-04-28 07:56:49,353 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:56:49,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:49,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:56:49,355 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-28 07:56:49,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process