/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_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:42:45,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:42:45,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:42:45,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:42:45,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:42:45,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:42:45,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:42:45,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:42:45,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:42:45,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:42:45,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:42:45,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:42:45,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:42:45,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:42:45,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:42:45,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:42:45,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:42:45,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:42:45,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:42:45,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:42:45,114 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:42:45,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:42:45,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:42:45,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:42:45,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:42:45,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:42:45,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:42:45,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:42:45,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:42:45,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:42:45,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:42:45,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:42:45,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:42:45,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:42:45,126 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:42:45,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:42:45,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:42:45,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:42:45,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:42:45,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:42:45,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:42:45,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:42:45,129 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:42:45,136 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:42:45,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:42:45,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:42:45,138 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:42:45,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:42:45,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:42:45,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:42:45,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:42:45,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:42:45,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:42:45,139 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:42:45,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:42:45,139 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:42:45,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:42:45,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:42:45,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:42:45,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:42:45,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:42:45,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:42:45,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:42:45,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:42:45,140 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:42:45,140 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:42:45,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:42:45,140 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:42:45,140 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:42:45,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:42:45,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:42:45,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:42:45,340 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:42:45,341 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:42:45,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound100.c [2022-04-28 07:42:45,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a208664/f8df4bbe29f7484d93fa1c0d75290cc1/FLAGdc88d41a6 [2022-04-28 07:42:45,727 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:42:45,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound100.c [2022-04-28 07:42:45,731 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a208664/f8df4bbe29f7484d93fa1c0d75290cc1/FLAGdc88d41a6 [2022-04-28 07:42:46,172 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a208664/f8df4bbe29f7484d93fa1c0d75290cc1 [2022-04-28 07:42:46,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:42:46,174 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:42:46,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:42:46,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:42:46,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:42:46,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:42:46" (1/1) ... [2022-04-28 07:42:46,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@598faef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:46, skipping insertion in model container [2022-04-28 07:42:46,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:42:46" (1/1) ... [2022-04-28 07:42:46,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:42:46,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:42:46,300 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_valuebound100.c[458,471] [2022-04-28 07:42:46,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:42:46,323 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:42:46,330 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_valuebound100.c[458,471] [2022-04-28 07:42:46,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:42:46,341 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:42:46,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:46 WrapperNode [2022-04-28 07:42:46,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:42:46,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:42:46,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:42:46,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:42:46,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:46" (1/1) ... [2022-04-28 07:42:46,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:46" (1/1) ... [2022-04-28 07:42:46,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:46" (1/1) ... [2022-04-28 07:42:46,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:46" (1/1) ... [2022-04-28 07:42:46,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:46" (1/1) ... [2022-04-28 07:42:46,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:46" (1/1) ... [2022-04-28 07:42:46,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:46" (1/1) ... [2022-04-28 07:42:46,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:42:46,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:42:46,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:42:46,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:42:46,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:46" (1/1) ... [2022-04-28 07:42:46,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:42:46,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:46,379 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:42:46,398 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:42:46,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:42:46,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:42:46,402 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:42:46,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:42:46,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:42:46,402 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:42:46,402 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:42:46,402 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:42:46,402 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:42:46,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:42:46,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 07:42:46,403 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:42:46,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:42:46,403 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:42:46,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:42:46,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:42:46,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:42:46,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:42:46,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:42:46,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:42:46,440 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:42:46,441 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:42:46,526 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:42:46,530 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:42:46,530 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:42:46,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:42:46 BoogieIcfgContainer [2022-04-28 07:42:46,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:42:46,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:42:46,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:42:46,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:42:46,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:42:46" (1/3) ... [2022-04-28 07:42:46,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2233f7e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:42:46, skipping insertion in model container [2022-04-28 07:42:46,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:46" (2/3) ... [2022-04-28 07:42:46,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2233f7e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:42:46, skipping insertion in model container [2022-04-28 07:42:46,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:42:46" (3/3) ... [2022-04-28 07:42:46,536 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound100.c [2022-04-28 07:42:46,544 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:42:46,544 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:42:46,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:42:46,577 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@36d269db, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1eebba42 [2022-04-28 07:42:46,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:42:46,592 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:42:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 07:42:46,597 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:46,597 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:42:46,597 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:46,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:46,600 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-28 07:42:46,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:46,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [722286063] [2022-04-28 07:42:46,621 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:42:46,621 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 2 times [2022-04-28 07:42:46,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:46,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497511298] [2022-04-28 07:42:46,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:46,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:46,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:42:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:46,836 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:42:46,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 07:42:46,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-28 07:42:46,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:42:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:46,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-28 07:42:46,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-28 07:42:46,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-28 07:42:46,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-28 07:42:46,848 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:42:46,848 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:42:46,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 07:42:46,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-28 07:42:46,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-28 07:42:46,849 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:42:46,849 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {31#true} is VALID [2022-04-28 07:42:46,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-28 07:42:46,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-28 07:42:46,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-28 07:42:46,850 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-28 07:42:46,851 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:42:46,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-28 07:42:46,852 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:42:46,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-28 07:42:46,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-28 07:42:46,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-28 07:42:46,853 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:42:46,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:46,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497511298] [2022-04-28 07:42:46,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497511298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:46,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:46,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:42:46,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:46,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [722286063] [2022-04-28 07:42:46,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [722286063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:46,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:46,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:42:46,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578545122] [2022-04-28 07:42:46,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:46,863 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:42:46,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:46,866 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:42:46,889 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:42:46,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:42:46,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:46,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:42:46,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:42:46,916 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:42:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:47,020 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-28 07:42:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:42:47,020 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:42:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:47,021 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:42:47,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-28 07:42:47,031 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:42:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-28 07:42:47,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-28 07:42:47,085 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:42:47,090 INFO L225 Difference]: With dead ends: 47 [2022-04-28 07:42:47,090 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 07:42:47,092 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:42:47,094 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:42:47,094 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:42:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 07:42:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 07:42:47,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:47,113 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:42:47,113 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:42:47,114 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:42:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:47,116 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 07:42:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 07:42:47,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:47,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:47,117 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:42:47,117 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:42:47,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:47,119 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 07:42:47,127 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 07:42:47,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:47,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:47,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:47,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:47,128 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:42:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-28 07:42:47,143 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-28 07:42:47,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:47,143 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-28 07:42:47,144 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:42:47,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-28 07:42:47,165 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:42:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 07:42:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 07:42:47,166 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:47,166 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:42:47,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:42:47,166 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:47,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:47,167 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-28 07:42:47,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:47,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [59337770] [2022-04-28 07:42:47,168 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:42:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 2 times [2022-04-28 07:42:47,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:47,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328779789] [2022-04-28 07:42:47,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:47,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:47,181 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:47,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [691702614] [2022-04-28 07:42:47,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:47,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:47,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:47,182 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:42:47,212 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:42:47,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:42:47,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:47,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:42:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:47,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:47,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-28 07:42:47,326 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:42:47,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-28 07:42:47,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #60#return; {229#true} is VALID [2022-04-28 07:42:47,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-28 07:42:47,326 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:42:47,326 INFO L272 TraceCheckUtils]: 6: Hoare triple {229#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {229#true} is VALID [2022-04-28 07:42:47,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-28 07:42:47,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-28 07:42:47,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-28 07:42:47,327 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {229#true} {229#true} #52#return; {229#true} is VALID [2022-04-28 07:42:47,327 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:42:47,328 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:42:47,329 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:42:47,329 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:42:47,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-28 07:42:47,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-28 07:42:47,330 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:42:47,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:42:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:47,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328779789] [2022-04-28 07:42:47,330 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:47,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691702614] [2022-04-28 07:42:47,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691702614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:47,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:47,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:42:47,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:47,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [59337770] [2022-04-28 07:42:47,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [59337770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:47,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:47,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:42:47,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692544983] [2022-04-28 07:42:47,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:47,332 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:42:47,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:47,333 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:42:47,344 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:42:47,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:42:47,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:47,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:42:47,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:42:47,345 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:42:47,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:47,436 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 07:42:47,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:42:47,437 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:42:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:47,437 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:42:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 07:42:47,439 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:42:47,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 07:42:47,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-28 07:42:47,466 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:42:47,467 INFO L225 Difference]: With dead ends: 34 [2022-04-28 07:42:47,467 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 07:42:47,467 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:42:47,468 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:42:47,468 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:42:47,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 07:42:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 07:42:47,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:47,476 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:42:47,476 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:42:47,476 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:42:47,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:47,478 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 07:42:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 07:42:47,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:47,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:47,478 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:42:47,479 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:42:47,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:47,480 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 07:42:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 07:42:47,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:47,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:47,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:47,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:47,481 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:42:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-28 07:42:47,482 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-28 07:42:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:47,482 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-28 07:42:47,483 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:42:47,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-28 07:42:47,509 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:42:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 07:42:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 07:42:47,510 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:47,510 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:42:47,539 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:42:47,726 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:42:47,727 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:47,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:47,727 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-28 07:42:47,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:47,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [159871958] [2022-04-28 07:42:47,921 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:47,921 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:47,921 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:47,921 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 2 times [2022-04-28 07:42:47,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:47,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290469951] [2022-04-28 07:42:47,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:47,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:47,935 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:47,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [156016919] [2022-04-28 07:42:47,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:47,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:47,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:47,937 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:42:47,938 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:42:47,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:42:47,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:47,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:42:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:47,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:48,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-28 07:42:48,113 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:42:48,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:42:48,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-28 07:42:48,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-28 07:42:48,113 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:42:48,113 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {474#true} is VALID [2022-04-28 07:42:48,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 07:42:48,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 07:42:48,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:42:48,114 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-28 07:42:48,116 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:42:48,116 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:42:48,116 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:42:48,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 07:42:48,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 07:42:48,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:42:48,118 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:42:48,119 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:42:48,119 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:42:48,120 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:42:48,120 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:42:48,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-28 07:42:48,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-28 07:42:48,121 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:42:48,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:48,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-28 07:42:48,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-28 07:42:48,374 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:42:48,374 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:42:48,375 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:42:48,383 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:42:48,384 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:42:48,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:42:48,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 07:42:48,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 07:42:48,384 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:42:48,385 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:42:48,386 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:42:48,386 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-28 07:42:48,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:42:48,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 07:42:48,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 07:42:48,386 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {474#true} is VALID [2022-04-28 07:42:48,387 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:42:48,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-28 07:42:48,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-28 07:42:48,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:42:48,387 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:42:48,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-28 07:42:48,387 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:42:48,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:48,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290469951] [2022-04-28 07:42:48,388 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:48,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156016919] [2022-04-28 07:42:48,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156016919] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:48,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:48,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 07:42:48,388 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:48,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [159871958] [2022-04-28 07:42:48,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [159871958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:48,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:48,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:42:48,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958765322] [2022-04-28 07:42:48,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:48,389 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:42:48,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:48,390 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:42:48,412 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:42:48,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:42:48,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:48,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:42:48,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 07:42:48,414 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:42:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:48,514 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-28 07:42:48,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:42:48,514 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:42:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:48,514 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:42:48,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 07:42:48,516 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:42:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 07:42:48,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-28 07:42:48,545 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:42:48,546 INFO L225 Difference]: With dead ends: 36 [2022-04-28 07:42:48,546 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 07:42:48,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:42:48,547 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:42:48,548 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:42:48,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 07:42:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 07:42:48,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:48,571 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:42:48,572 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:42:48,572 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:42:48,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:48,573 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 07:42:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 07:42:48,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:48,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:48,574 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:42:48,574 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:42:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:48,575 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 07:42:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 07:42:48,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:48,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:48,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:48,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:48,576 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:42:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 07:42:48,577 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-28 07:42:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:48,577 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 07:42:48,577 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:42:48,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 07:42:48,632 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:42:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 07:42:48,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 07:42:48,633 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:48,633 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:42:48,656 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:42:48,845 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:42:48,846 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:48,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:48,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-28 07:42:48,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:48,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1042674244] [2022-04-28 07:42:48,938 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:48,938 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:48,939 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:48,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 2 times [2022-04-28 07:42:48,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:48,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882392986] [2022-04-28 07:42:48,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:48,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:48,949 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:48,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641192212] [2022-04-28 07:42:48,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:48,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:48,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:48,963 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:42:48,993 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:42:49,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:42:49,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:49,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 07:42:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:49,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:49,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2022-04-28 07:42:49,237 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:42:49,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 07:42:49,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #60#return; {822#true} is VALID [2022-04-28 07:42:49,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret5 := main(); {822#true} is VALID [2022-04-28 07:42:49,238 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:42:49,238 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {822#true} is VALID [2022-04-28 07:42:49,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 07:42:49,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 07:42:49,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 07:42:49,239 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #52#return; {822#true} is VALID [2022-04-28 07:42:49,239 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:42:49,240 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:42:49,240 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:42:49,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 07:42:49,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 07:42:49,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 07:42:49,242 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:42:49,243 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:42:49,243 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:42:49,243 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:42:49,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 07:42:49,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 07:42:49,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 07:42:49,244 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:42:49,244 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:42:49,245 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:42:49,246 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:42:49,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {823#false} is VALID [2022-04-28 07:42:49,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-28 07:42:49,247 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:42:49,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:49,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:49,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882392986] [2022-04-28 07:42:49,530 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:49,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641192212] [2022-04-28 07:42:49,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641192212] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:49,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:49,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 07:42:49,531 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:49,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1042674244] [2022-04-28 07:42:49,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1042674244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:49,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:49,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:42:49,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256230230] [2022-04-28 07:42:49,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:49,532 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:42:49,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:49,532 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:42:49,554 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:42:49,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:42:49,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:49,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:42:49,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:42:49,555 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:42:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:49,742 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-28 07:42:49,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 07:42:49,742 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:42:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:49,743 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:42:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-28 07:42:49,744 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:42:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-28 07:42:49,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-28 07:42:49,772 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:42:49,773 INFO L225 Difference]: With dead ends: 39 [2022-04-28 07:42:49,773 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 07:42:49,774 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:42:49,774 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:42:49,774 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.0s Time] [2022-04-28 07:42:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 07:42:49,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 07:42:49,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:49,789 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:42:49,789 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:42:49,790 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:42:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:49,791 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 07:42:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 07:42:49,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:49,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:49,791 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:42:49,792 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:42:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:49,793 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 07:42:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 07:42:49,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:49,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:49,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:49,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:49,793 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:42:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-28 07:42:49,795 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-28 07:42:49,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:49,795 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-28 07:42:49,795 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:42:49,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-28 07:42:49,832 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:42:49,832 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 07:42:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 07:42:49,832 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:49,833 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:42:49,865 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:42:50,043 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:42:50,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:50,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:50,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 3 times [2022-04-28 07:42:50,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:50,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1249532765] [2022-04-28 07:42:50,137 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:50,137 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:50,137 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:50,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 4 times [2022-04-28 07:42:50,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:50,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853100225] [2022-04-28 07:42:50,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:50,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:50,152 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:50,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1189199177] [2022-04-28 07:42:50,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:42:50,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:50,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:50,155 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:42:50,156 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:42:50,187 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:42:50,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:50,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 07:42:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:50,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:50,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1178#true} is VALID [2022-04-28 07:42:50,429 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:42:50,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 07:42:50,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #60#return; {1178#true} is VALID [2022-04-28 07:42:50,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret5 := main(); {1178#true} is VALID [2022-04-28 07:42:50,429 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:42:50,429 INFO L272 TraceCheckUtils]: 6: Hoare triple {1178#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {1178#true} is VALID [2022-04-28 07:42:50,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 07:42:50,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 07:42:50,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 07:42:50,430 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1178#true} {1178#true} #52#return; {1178#true} is VALID [2022-04-28 07:42:50,430 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:42:50,431 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:42:50,431 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:42:50,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 07:42:50,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 07:42:50,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 07:42:50,432 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:42:50,432 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:42:50,432 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:42:50,433 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:42:50,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 07:42:50,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 07:42:50,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 07:42:50,433 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:42:50,434 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:42:50,434 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:42:50,434 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:42:50,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 07:42:50,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 07:42:50,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 07:42:50,435 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:42:50,436 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:42:50,436 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:42:50,437 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:42:50,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {1290#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1179#false} is VALID [2022-04-28 07:42:50,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-28 07:42:50,437 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:42:50,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:50,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:50,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853100225] [2022-04-28 07:42:50,700 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:50,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189199177] [2022-04-28 07:42:50,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189199177] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:50,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:50,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 07:42:50,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:50,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1249532765] [2022-04-28 07:42:50,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1249532765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:50,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:50,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:42:50,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121632213] [2022-04-28 07:42:50,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:50,702 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:42:50,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:50,703 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:42:50,718 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:42:50,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:42:50,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:50,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:42:50,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 07:42:50,719 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:42:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:50,938 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-28 07:42:50,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:42:50,939 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:42:50,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:50,939 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:42:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-28 07:42:50,940 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:42:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-28 07:42:50,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-28 07:42:50,969 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:42:50,970 INFO L225 Difference]: With dead ends: 42 [2022-04-28 07:42:50,970 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 07:42:50,970 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:42:50,971 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:42:50,971 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:42:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 07:42:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 07:42:50,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:50,986 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:42:50,987 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:42:50,987 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:42:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:50,988 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 07:42:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 07:42:50,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:50,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:50,989 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:42:50,989 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:42:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:50,990 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 07:42:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 07:42:51,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:51,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:51,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:51,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:51,001 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:42:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-28 07:42:51,002 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 37 [2022-04-28 07:42:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:51,002 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-28 07:42:51,002 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:42:51,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-28 07:42:51,046 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:42:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 07:42:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 07:42:51,047 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:51,047 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:42:51,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 07:42:51,252 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:42:51,252 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:51,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 5 times [2022-04-28 07:42:51,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:51,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1343213903] [2022-04-28 07:42:51,338 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:51,338 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:51,339 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 6 times [2022-04-28 07:42:51,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:51,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491797192] [2022-04-28 07:42:51,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:51,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:51,355 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:51,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1855232356] [2022-04-28 07:42:51,355 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:42:51,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:51,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:51,356 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:42:51,423 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:42:51,483 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 07:42:51,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:51,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 07:42:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:51,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:51,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1574#true} is VALID [2022-04-28 07:42:51,741 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:42:51,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:42:51,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #60#return; {1574#true} is VALID [2022-04-28 07:42:51,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret5 := main(); {1574#true} is VALID [2022-04-28 07:42:51,741 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:42:51,741 INFO L272 TraceCheckUtils]: 6: Hoare triple {1574#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {1574#true} is VALID [2022-04-28 07:42:51,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 07:42:51,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 07:42:51,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:42:51,742 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1574#true} {1574#true} #52#return; {1574#true} is VALID [2022-04-28 07:42:51,742 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:42:51,743 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:42:51,743 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:42:51,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 07:42:51,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 07:42:51,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:42:51,743 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:42:51,744 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:42:51,745 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:42:51,745 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:42:51,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 07:42:51,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 07:42:51,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:42:51,746 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:42:51,746 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:42:51,747 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:42:51,747 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:42:51,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 07:42:51,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 07:42:51,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:42:51,750 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:42:51,750 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:42:51,751 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:42:51,751 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:42:51,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 07:42:51,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 07:42:51,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:42:51,752 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:42:51,752 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:42:51,753 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:42:51,753 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:42:51,754 INFO L290 TraceCheckUtils]: 42: Hoare triple {1708#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1575#false} is VALID [2022-04-28 07:42:51,754 INFO L290 TraceCheckUtils]: 43: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-04-28 07:42:51,754 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:42:51,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:52,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:52,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491797192] [2022-04-28 07:42:52,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:52,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855232356] [2022-04-28 07:42:52,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855232356] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:52,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:52,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 07:42:52,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:52,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1343213903] [2022-04-28 07:42:52,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1343213903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:52,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:52,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:42:52,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357406540] [2022-04-28 07:42:52,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:52,094 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:42:52,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:52,094 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:42:52,118 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:42:52,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:42:52,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:52,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:42:52,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:42:52,118 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:42:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:52,390 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-28 07:42:52,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 07:42:52,390 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:42:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:52,391 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:42:52,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 07:42:52,392 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:42:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 07:42:52,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-28 07:42:52,424 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:42:52,425 INFO L225 Difference]: With dead ends: 45 [2022-04-28 07:42:52,425 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 07:42:52,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:42:52,426 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:42:52,426 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:42:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 07:42:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-28 07:42:52,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:52,444 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:42:52,444 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:42:52,445 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:42:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:52,446 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-28 07:42:52,446 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 07:42:52,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:52,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:52,446 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:42:52,446 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:42:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:52,448 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-28 07:42:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 07:42:52,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:52,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:52,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:52,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:52,448 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:42:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-28 07:42:52,449 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 44 [2022-04-28 07:42:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:52,449 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-28 07:42:52,450 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:42:52,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-28 07:42:52,497 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:42:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 07:42:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 07:42:52,498 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:52,498 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:42:52,515 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:42:52,699 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:42:52,699 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:52,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:52,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 7 times [2022-04-28 07:42:52,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:52,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [277961020] [2022-04-28 07:42:52,798 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:52,798 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:52,798 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:52,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 8 times [2022-04-28 07:42:52,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:52,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830733408] [2022-04-28 07:42:52,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:52,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:52,807 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:52,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1650225979] [2022-04-28 07:42:52,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:52,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:52,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:52,809 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:42:52,823 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:42:52,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:42:52,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:52,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 07:42:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:52,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:53,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {2010#true} call ULTIMATE.init(); {2010#true} is VALID [2022-04-28 07:42:53,223 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:42:53,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:42:53,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2010#true} {2010#true} #60#return; {2010#true} is VALID [2022-04-28 07:42:53,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {2010#true} call #t~ret5 := main(); {2010#true} is VALID [2022-04-28 07:42:53,223 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:42:53,223 INFO L272 TraceCheckUtils]: 6: Hoare triple {2010#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {2010#true} is VALID [2022-04-28 07:42:53,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:42:53,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:42:53,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:42:53,224 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2010#true} {2010#true} #52#return; {2010#true} is VALID [2022-04-28 07:42:53,224 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:42:53,224 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:42:53,224 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:42:53,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:42:53,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:42:53,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:42:53,225 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:42:53,226 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:42:53,226 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:42:53,226 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:42:53,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:42:53,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:42:53,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:42:53,227 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:42:53,227 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:42:53,227 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:42:53,228 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:42:53,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:42:53,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:42:53,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:42:53,228 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:42:53,229 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:42:53,229 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:42:53,229 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:42:53,229 INFO L290 TraceCheckUtils]: 35: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:42:53,229 INFO L290 TraceCheckUtils]: 36: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:42:53,230 INFO L290 TraceCheckUtils]: 37: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:42:53,230 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:42:53,230 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:42:53,231 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:42:53,231 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:42:53,231 INFO L290 TraceCheckUtils]: 42: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:42:53,231 INFO L290 TraceCheckUtils]: 43: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:42:53,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:42:53,232 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:42:53,232 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:42:53,233 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:42:53,235 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:42:53,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {2166#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2011#false} is VALID [2022-04-28 07:42:53,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {2011#false} assume !false; {2011#false} is VALID [2022-04-28 07:42:53,236 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:42:53,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:53,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:53,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830733408] [2022-04-28 07:42:53,482 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:53,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650225979] [2022-04-28 07:42:53,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650225979] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:53,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:53,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 07:42:53,482 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:53,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [277961020] [2022-04-28 07:42:53,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [277961020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:53,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:53,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:42:53,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823843106] [2022-04-28 07:42:53,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:53,483 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:42:53,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:53,483 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:42:53,510 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:42:53,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:42:53,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:53,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:42:53,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:42:53,511 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:42:53,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:53,904 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-28 07:42:53,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:42:53,904 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:42:53,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:53,905 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:42:53,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-28 07:42:53,906 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:42:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-28 07:42:53,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-28 07:42:53,953 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:42:53,954 INFO L225 Difference]: With dead ends: 48 [2022-04-28 07:42:53,954 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 07:42:53,954 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:42:53,955 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:42:53,955 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.1s Time] [2022-04-28 07:42:53,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 07:42:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 07:42:53,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:53,982 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:42:53,982 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:42:53,982 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:42:53,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:53,984 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-28 07:42:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 07:42:53,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:53,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:53,984 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:42:53,984 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:42:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:53,986 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-28 07:42:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 07:42:53,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:53,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:53,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:53,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:53,986 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:42:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-28 07:42:53,987 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 51 [2022-04-28 07:42:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:53,988 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-28 07:42:53,988 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:42:53,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-28 07:42:54,045 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:42:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 07:42:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 07:42:54,046 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:54,046 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:42:54,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 07:42:54,246 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:42:54,246 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:54,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:54,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 9 times [2022-04-28 07:42:54,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:54,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1855174081] [2022-04-28 07:42:54,324 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:54,324 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:54,324 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:54,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 10 times [2022-04-28 07:42:54,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:54,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639161517] [2022-04-28 07:42:54,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:54,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:54,333 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:54,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1985855469] [2022-04-28 07:42:54,333 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:42:54,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:54,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:54,348 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:42:54,349 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:42:54,458 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:42:54,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:54,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 07:42:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:54,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:54,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2022-04-28 07:42:54,809 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:42:54,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:42:54,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2486#true} {2486#true} #60#return; {2486#true} is VALID [2022-04-28 07:42:54,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {2486#true} call #t~ret5 := main(); {2486#true} is VALID [2022-04-28 07:42:54,809 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:42:54,809 INFO L272 TraceCheckUtils]: 6: Hoare triple {2486#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {2486#true} is VALID [2022-04-28 07:42:54,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:42:54,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:42:54,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:42:54,810 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2486#true} {2486#true} #52#return; {2486#true} is VALID [2022-04-28 07:42:54,812 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:42:54,812 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:42:54,812 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:42:54,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:42:54,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:42:54,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:42:54,813 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:42:54,813 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:42:54,814 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:42:54,814 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:42:54,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:42:54,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:42:54,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:42:54,814 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:42:54,815 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:42:54,815 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:42:54,815 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:42:54,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:42:54,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:42:54,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:42:54,816 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:42:54,816 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:42:54,817 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:42:54,817 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:42:54,817 INFO L290 TraceCheckUtils]: 35: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:42:54,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:42:54,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:42:54,817 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:42:54,818 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:42:54,818 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:42:54,818 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:42:54,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:42:54,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:42:54,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:42:54,819 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:42:54,820 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:42:54,820 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:42:54,820 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:42:54,820 INFO L290 TraceCheckUtils]: 49: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:42:54,821 INFO L290 TraceCheckUtils]: 50: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:42:54,821 INFO L290 TraceCheckUtils]: 51: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:42:54,821 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:42:54,822 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:42:54,822 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:42:54,823 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:42:54,823 INFO L290 TraceCheckUtils]: 56: Hoare triple {2664#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2487#false} is VALID [2022-04-28 07:42:54,823 INFO L290 TraceCheckUtils]: 57: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-04-28 07:42:54,823 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:42:54,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:55,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:55,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639161517] [2022-04-28 07:42:55,050 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:55,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985855469] [2022-04-28 07:42:55,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985855469] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:55,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:55,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 07:42:55,051 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:55,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1855174081] [2022-04-28 07:42:55,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1855174081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:55,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:55,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:42:55,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546123986] [2022-04-28 07:42:55,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:55,052 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:42:55,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:55,052 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:42:55,095 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:42:55,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:42:55,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:55,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:42:55,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:42:55,096 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:42:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:55,505 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-28 07:42:55,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 07:42:55,505 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:42:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:55,505 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:42:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-28 07:42:55,507 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:42:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-28 07:42:55,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-28 07:42:55,540 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:42:55,541 INFO L225 Difference]: With dead ends: 51 [2022-04-28 07:42:55,541 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 07:42:55,541 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:42:55,542 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:42:55,542 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:42:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 07:42:55,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 07:42:55,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:55,563 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:42:55,564 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:42:55,564 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:42:55,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:55,565 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 07:42:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 07:42:55,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:55,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:55,566 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:42:55,566 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:42:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:55,567 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 07:42:55,567 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 07:42:55,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:55,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:55,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:55,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:55,568 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:42:55,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-28 07:42:55,569 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 58 [2022-04-28 07:42:55,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:55,569 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-28 07:42:55,570 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:42:55,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 51 transitions. [2022-04-28 07:42:55,624 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:42:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 07:42:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 07:42:55,625 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:55,625 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:42:55,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 07:42:55,825 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:42:55,825 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:55,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:55,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 11 times [2022-04-28 07:42:55,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:55,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1232747975] [2022-04-28 07:42:55,938 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:55,938 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:55,938 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:55,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 12 times [2022-04-28 07:42:55,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:55,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671097079] [2022-04-28 07:42:55,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:55,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:55,957 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:55,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [42924569] [2022-04-28 07:42:55,957 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:42:55,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:55,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:55,971 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:42:56,005 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:42:56,156 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 07:42:56,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:56,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 07:42:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:56,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:56,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {3002#true} call ULTIMATE.init(); {3002#true} is VALID [2022-04-28 07:42:56,526 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:42:56,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:42:56,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3002#true} {3002#true} #60#return; {3002#true} is VALID [2022-04-28 07:42:56,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {3002#true} call #t~ret5 := main(); {3002#true} is VALID [2022-04-28 07:42:56,526 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:42:56,527 INFO L272 TraceCheckUtils]: 6: Hoare triple {3002#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {3002#true} is VALID [2022-04-28 07:42:56,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:42:56,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:42:56,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:42:56,527 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3002#true} {3002#true} #52#return; {3002#true} is VALID [2022-04-28 07:42:56,527 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:42:56,528 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:42:56,528 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:42:56,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:42:56,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:42:56,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:42:56,528 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:42:56,529 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:42:56,529 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:42:56,529 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:42:56,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:42:56,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:42:56,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:42:56,530 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:42:56,530 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:42:56,531 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:42:56,531 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:42:56,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:42:56,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:42:56,531 INFO L290 TraceCheckUtils]: 30: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:42:56,532 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:42:56,532 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:42:56,532 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:42:56,532 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:42:56,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:42:56,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:42:56,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:42:56,533 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:42:56,533 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:42:56,534 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:42:56,534 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:42:56,534 INFO L290 TraceCheckUtils]: 42: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:42:56,534 INFO L290 TraceCheckUtils]: 43: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:42:56,534 INFO L290 TraceCheckUtils]: 44: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:42:56,535 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:42:56,535 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:42:56,536 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:42:56,536 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:42:56,536 INFO L290 TraceCheckUtils]: 49: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:42:56,536 INFO L290 TraceCheckUtils]: 50: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:42:56,536 INFO L290 TraceCheckUtils]: 51: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:42:56,536 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:42:56,537 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:42:56,537 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:42:56,537 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:42:56,537 INFO L290 TraceCheckUtils]: 56: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:42:56,537 INFO L290 TraceCheckUtils]: 57: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:42:56,537 INFO L290 TraceCheckUtils]: 58: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:42:56,538 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:42:56,539 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:42:56,539 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:42:56,539 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:42:56,540 INFO L290 TraceCheckUtils]: 63: Hoare triple {3202#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3003#false} is VALID [2022-04-28 07:42:56,540 INFO L290 TraceCheckUtils]: 64: Hoare triple {3003#false} assume !false; {3003#false} is VALID [2022-04-28 07:42:56,540 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:42:56,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:56,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:56,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671097079] [2022-04-28 07:42:56,774 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:56,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42924569] [2022-04-28 07:42:56,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42924569] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:56,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:56,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 07:42:56,774 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:56,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1232747975] [2022-04-28 07:42:56,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1232747975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:56,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:56,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:42:56,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47160476] [2022-04-28 07:42:56,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:56,775 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:42:56,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:56,776 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:42:56,808 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:42:56,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:42:56,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:56,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:42:56,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 07:42:56,809 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:42:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:57,322 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-28 07:42:57,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:42:57,323 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:42:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:57,323 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:42:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-28 07:42:57,330 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:42:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-28 07:42:57,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-28 07:42:57,368 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:42:57,370 INFO L225 Difference]: With dead ends: 54 [2022-04-28 07:42:57,370 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 07:42:57,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-28 07:42:57,372 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:42:57,372 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:42:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 07:42:57,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-28 07:42:57,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:57,396 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:42:57,398 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:42:57,398 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:42:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:57,399 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-28 07:42:57,399 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-28 07:42:57,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:57,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:57,399 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:42:57,400 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:42:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:57,401 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-28 07:42:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-28 07:42:57,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:57,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:57,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:57,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:57,401 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:42:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-04-28 07:42:57,403 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 65 [2022-04-28 07:42:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:57,403 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-04-28 07:42:57,403 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:42:57,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 55 transitions. [2022-04-28 07:42:57,460 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:42:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-28 07:42:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 07:42:57,461 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:57,461 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:42:57,471 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:42:57,666 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:42:57,666 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 13 times [2022-04-28 07:42:57,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:57,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1518713823] [2022-04-28 07:42:57,746 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:57,746 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:57,746 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:57,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 14 times [2022-04-28 07:42:57,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:57,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134357113] [2022-04-28 07:42:57,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:57,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:57,770 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:57,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445129025] [2022-04-28 07:42:57,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:57,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:57,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:57,777 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:42:57,809 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:42:57,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:42:57,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:57,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 07:42:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:57,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:58,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {3558#true} call ULTIMATE.init(); {3558#true} is VALID [2022-04-28 07:42:58,309 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:42:58,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:42:58,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3558#true} {3558#true} #60#return; {3558#true} is VALID [2022-04-28 07:42:58,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {3558#true} call #t~ret5 := main(); {3558#true} is VALID [2022-04-28 07:42:58,309 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:42:58,310 INFO L272 TraceCheckUtils]: 6: Hoare triple {3558#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {3558#true} is VALID [2022-04-28 07:42:58,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:42:58,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:42:58,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:42:58,310 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3558#true} {3558#true} #52#return; {3558#true} is VALID [2022-04-28 07:42:58,311 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:42:58,312 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:42:58,312 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:42:58,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:42:58,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:42:58,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:42:58,312 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:42:58,313 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:42:58,313 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:42:58,313 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:42:58,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:42:58,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:42:58,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:42:58,314 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:42:58,314 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:42:58,314 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:42:58,314 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:42:58,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:42:58,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:42:58,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:42:58,315 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:42:58,315 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:42:58,316 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:42:58,316 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:42:58,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:42:58,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:42:58,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:42:58,316 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:42:58,317 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:42:58,317 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:42:58,317 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:42:58,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:42:58,317 INFO L290 TraceCheckUtils]: 43: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:42:58,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:42:58,319 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:42:58,319 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:42:58,319 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:42:58,320 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:42:58,320 INFO L290 TraceCheckUtils]: 49: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:42:58,320 INFO L290 TraceCheckUtils]: 50: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:42:58,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:42:58,320 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:42:58,321 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:42:58,321 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:42:58,321 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:42:58,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:42:58,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:42:58,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:42:58,321 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:42:58,322 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:42:58,322 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:42:58,322 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:42:58,322 INFO L290 TraceCheckUtils]: 63: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:42:58,322 INFO L290 TraceCheckUtils]: 64: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:42:58,322 INFO L290 TraceCheckUtils]: 65: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:42:58,323 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:42:58,324 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:42:58,324 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:42:58,325 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:42:58,325 INFO L290 TraceCheckUtils]: 70: Hoare triple {3780#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3559#false} is VALID [2022-04-28 07:42:58,325 INFO L290 TraceCheckUtils]: 71: Hoare triple {3559#false} assume !false; {3559#false} is VALID [2022-04-28 07:42:58,329 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:42:58,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:58,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:58,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134357113] [2022-04-28 07:42:58,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:58,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445129025] [2022-04-28 07:42:58,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445129025] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:58,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:58,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 07:42:58,614 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:58,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1518713823] [2022-04-28 07:42:58,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1518713823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:58,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:58,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:42:58,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967515320] [2022-04-28 07:42:58,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:58,615 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:42:58,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:58,615 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:42:58,650 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:42:58,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:42:58,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:58,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:42:58,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:42:58,651 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:42:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:59,311 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-28 07:42:59,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 07:42:59,312 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:42:59,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:59,312 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:42:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 07:42:59,313 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:42:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 07:42:59,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-28 07:42:59,343 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:42:59,344 INFO L225 Difference]: With dead ends: 57 [2022-04-28 07:42:59,344 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 07:42:59,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:42:59,345 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:42:59,345 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:42:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 07:42:59,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 07:42:59,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:59,375 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:42:59,375 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:42:59,375 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:42:59,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:59,383 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-28 07:42:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-28 07:42:59,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:59,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:59,384 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:42:59,384 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:42:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:59,385 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-28 07:42:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-28 07:42:59,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:59,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:59,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:59,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:59,386 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:42:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-28 07:42:59,387 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 72 [2022-04-28 07:42:59,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:59,387 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-28 07:42:59,387 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:42:59,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 59 transitions. [2022-04-28 07:42:59,442 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:42:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-28 07:42:59,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 07:42:59,443 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:59,443 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:42:59,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 07:42:59,643 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:42:59,643 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:59,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 15 times [2022-04-28 07:42:59,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:59,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1534342072] [2022-04-28 07:42:59,736 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:59,736 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:59,736 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:59,736 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 16 times [2022-04-28 07:42:59,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:59,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283349122] [2022-04-28 07:42:59,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:59,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:59,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:59,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1512680989] [2022-04-28 07:42:59,746 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:42:59,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:59,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:59,747 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:42:59,765 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:00,170 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:43:00,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:00,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 07:43:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:00,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:00,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {4154#true} call ULTIMATE.init(); {4154#true} is VALID [2022-04-28 07:43:00,584 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:00,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:00,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4154#true} {4154#true} #60#return; {4154#true} is VALID [2022-04-28 07:43:00,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {4154#true} call #t~ret5 := main(); {4154#true} is VALID [2022-04-28 07:43:00,585 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:00,585 INFO L272 TraceCheckUtils]: 6: Hoare triple {4154#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {4154#true} is VALID [2022-04-28 07:43:00,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:00,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:00,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:00,585 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4154#true} {4154#true} #52#return; {4154#true} is VALID [2022-04-28 07:43:00,586 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:00,586 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:00,586 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:00,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:00,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:00,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:00,587 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:00,587 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:00,587 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:00,588 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:00,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:00,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:00,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:00,590 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:00,590 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:00,590 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:00,591 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:00,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:00,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:00,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:00,591 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:00,592 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:00,592 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:00,592 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:00,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:00,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:00,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:00,593 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:00,593 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:00,594 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:00,594 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:00,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:00,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:00,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:00,594 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:00,595 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:00,595 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:00,595 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:00,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:00,596 INFO L290 TraceCheckUtils]: 50: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:00,596 INFO L290 TraceCheckUtils]: 51: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:00,596 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:00,597 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:00,597 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:00,597 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:00,597 INFO L290 TraceCheckUtils]: 56: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:00,597 INFO L290 TraceCheckUtils]: 57: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:00,597 INFO L290 TraceCheckUtils]: 58: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:00,619 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:00,620 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:00,620 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:00,620 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:00,620 INFO L290 TraceCheckUtils]: 63: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:00,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:00,621 INFO L290 TraceCheckUtils]: 65: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:00,621 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:00,621 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:00,622 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:00,622 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:00,622 INFO L290 TraceCheckUtils]: 70: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:00,622 INFO L290 TraceCheckUtils]: 71: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:00,622 INFO L290 TraceCheckUtils]: 72: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:00,623 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:00,623 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:00,624 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:00,624 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:00,624 INFO L290 TraceCheckUtils]: 77: Hoare triple {4398#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4155#false} is VALID [2022-04-28 07:43:00,624 INFO L290 TraceCheckUtils]: 78: Hoare triple {4155#false} assume !false; {4155#false} is VALID [2022-04-28 07:43:00,625 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:00,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:00,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:00,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283349122] [2022-04-28 07:43:00,801 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:00,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512680989] [2022-04-28 07:43:00,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512680989] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:00,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:00,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 07:43:00,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:00,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1534342072] [2022-04-28 07:43:00,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1534342072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:00,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:00,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 07:43:00,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522515673] [2022-04-28 07:43:00,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:00,802 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:00,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:00,803 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:00,829 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:00,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 07:43:00,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:00,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 07:43:00,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 07:43:00,830 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:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:01,561 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-28 07:43:01,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:43:01,561 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:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:01,561 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:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-28 07:43:01,562 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:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-28 07:43:01,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-28 07:43:01,611 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:01,612 INFO L225 Difference]: With dead ends: 60 [2022-04-28 07:43:01,612 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 07:43:01,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:43:01,613 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:01,613 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.3s Time] [2022-04-28 07:43:01,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 07:43:01,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 07:43:01,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:01,661 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:01,661 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:01,661 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:01,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:01,662 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-28 07:43:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-28 07:43:01,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:01,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:01,663 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:01,663 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:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:01,664 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-28 07:43:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-28 07:43:01,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:01,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:01,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:01,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:01,665 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:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-04-28 07:43:01,666 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 79 [2022-04-28 07:43:01,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:01,666 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-04-28 07:43:01,666 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:01,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 63 transitions. [2022-04-28 07:43:01,732 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:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-28 07:43:01,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 07:43:01,735 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:01,735 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:01,741 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:01,939 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:01,939 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:01,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:01,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 17 times [2022-04-28 07:43:01,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:01,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [447139385] [2022-04-28 07:43:02,004 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:02,004 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:02,004 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:02,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 18 times [2022-04-28 07:43:02,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:02,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427519885] [2022-04-28 07:43:02,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:02,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:02,048 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:02,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1304386052] [2022-04-28 07:43:02,048 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:43:02,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:02,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:02,051 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:02,057 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:02,838 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 07:43:02,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:02,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-28 07:43:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:02,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:03,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {4790#true} call ULTIMATE.init(); {4790#true} is VALID [2022-04-28 07:43:03,341 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:03,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:03,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4790#true} {4790#true} #60#return; {4790#true} is VALID [2022-04-28 07:43:03,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {4790#true} call #t~ret5 := main(); {4790#true} is VALID [2022-04-28 07:43:03,342 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:03,342 INFO L272 TraceCheckUtils]: 6: Hoare triple {4790#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {4790#true} is VALID [2022-04-28 07:43:03,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:03,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:03,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:03,342 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4790#true} {4790#true} #52#return; {4790#true} is VALID [2022-04-28 07:43:03,342 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:03,342 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:03,343 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:03,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:03,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:03,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:03,343 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:03,343 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:03,344 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:03,344 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:03,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:03,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:03,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:03,344 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:03,345 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:03,345 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:03,345 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:03,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:03,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:03,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:03,345 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:03,346 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:03,346 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:03,346 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:03,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:03,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:03,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:03,347 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:03,347 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:03,348 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:03,348 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:03,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:03,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:03,348 INFO L290 TraceCheckUtils]: 44: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:03,348 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:03,349 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:03,349 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:03,349 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:03,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:03,349 INFO L290 TraceCheckUtils]: 50: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:03,349 INFO L290 TraceCheckUtils]: 51: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:03,350 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:03,350 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:03,350 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:03,350 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:03,350 INFO L290 TraceCheckUtils]: 56: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:03,350 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:03,350 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:03,351 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:03,351 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:03,351 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:03,351 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:03,352 INFO L290 TraceCheckUtils]: 63: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:03,352 INFO L290 TraceCheckUtils]: 64: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:03,352 INFO L290 TraceCheckUtils]: 65: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:03,352 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:03,352 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:03,353 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:03,353 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:03,353 INFO L290 TraceCheckUtils]: 70: Hoare triple {4790#true} ~cond := #in~cond; {5014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:03,353 INFO L290 TraceCheckUtils]: 71: Hoare triple {5014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:43:03,353 INFO L290 TraceCheckUtils]: 72: Hoare triple {5018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:43:03,354 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5018#(not (= |__VERIFIER_assert_#in~cond| 0))} {5004#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {5025#(and (= main_~y~0 8) (= main_~c~0 8) (= (+ (* 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:03,354 INFO L290 TraceCheckUtils]: 74: Hoare triple {5025#(and (= main_~y~0 8) (= main_~c~0 8) (= (+ (* 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; {5029#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:43:03,355 INFO L290 TraceCheckUtils]: 75: Hoare triple {5029#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5029#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:43:03,355 INFO L272 TraceCheckUtils]: 76: Hoare triple {5029#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 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:03,355 INFO L290 TraceCheckUtils]: 77: Hoare triple {4790#true} ~cond := #in~cond; {5014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:03,355 INFO L290 TraceCheckUtils]: 78: Hoare triple {5014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:43:03,355 INFO L290 TraceCheckUtils]: 79: Hoare triple {5018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:43:03,356 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5018#(not (= |__VERIFIER_assert_#in~cond| 0))} {5029#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} #54#return; {5048#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:43:03,356 INFO L290 TraceCheckUtils]: 81: Hoare triple {5048#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5052#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 07:43:03,357 INFO L272 TraceCheckUtils]: 82: Hoare triple {5052#(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)); {5056#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:03,357 INFO L290 TraceCheckUtils]: 83: Hoare triple {5056#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5060#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:03,357 INFO L290 TraceCheckUtils]: 84: Hoare triple {5060#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4791#false} is VALID [2022-04-28 07:43:03,357 INFO L290 TraceCheckUtils]: 85: Hoare triple {4791#false} assume !false; {4791#false} is VALID [2022-04-28 07:43:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 66 proven. 137 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-28 07:43:03,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:38,085 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= 0 (mod (+ (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 13 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4)))) is different from false [2022-04-28 07:43:38,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:38,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427519885] [2022-04-28 07:43:38,088 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:38,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304386052] [2022-04-28 07:43:38,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304386052] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:38,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:38,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-28 07:43:38,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:38,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [447139385] [2022-04-28 07:43:38,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [447139385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:38,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:38,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 07:43:38,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260060993] [2022-04-28 07:43:38,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:38,089 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (14), 2 states have call predecessors, (14), 2 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:38,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:38,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:43:38,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:38,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 07:43:38,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:38,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 07:43:38,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=477, Unknown=3, NotChecked=44, Total=600 [2022-04-28 07:43:38,136 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:43:39,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:39,412 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-28 07:43:39,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 07:43:39,412 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (14), 2 states have call predecessors, (14), 2 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:39,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:43:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 68 transitions. [2022-04-28 07:43:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:43:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 68 transitions. [2022-04-28 07:43:39,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 68 transitions. [2022-04-28 07:43:39,462 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:39,463 INFO L225 Difference]: With dead ends: 63 [2022-04-28 07:43:39,463 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 07:43:39,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=97, Invalid=606, Unknown=3, NotChecked=50, Total=756 [2022-04-28 07:43:39,464 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:39,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 369 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 07:43:39,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 07:43:39,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-28 07:43:39,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:39,501 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:39,501 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:39,501 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:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:39,505 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-28 07:43:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 07:43:39,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:39,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:39,505 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:39,506 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:39,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:39,507 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-28 07:43:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 07:43:39,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:39,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:39,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:39,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:39,508 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:39,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-28 07:43:39,509 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 86 [2022-04-28 07:43:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:39,509 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-28 07:43:39,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:43:39,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 67 transitions. [2022-04-28 07:43:39,595 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:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 07:43:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 07:43:39,596 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:39,596 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:39,603 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:39,796 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:39,797 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:39,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:39,797 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 19 times [2022-04-28 07:43:39,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:39,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [307007013] [2022-04-28 07:43:39,871 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:39,871 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:39,871 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:39,871 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 20 times [2022-04-28 07:43:39,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:39,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392243476] [2022-04-28 07:43:39,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:39,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:39,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:39,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1286012581] [2022-04-28 07:43:39,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:43:39,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:39,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:39,908 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:39,926 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:40,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:43:40,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:40,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 07:43:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:40,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:41,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {5475#true} call ULTIMATE.init(); {5475#true} is VALID [2022-04-28 07:43:41,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {5475#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); {5475#true} is VALID [2022-04-28 07:43:41,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-04-28 07:43:41,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5475#true} {5475#true} #60#return; {5475#true} is VALID [2022-04-28 07:43:41,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {5475#true} call #t~ret5 := main(); {5475#true} is VALID [2022-04-28 07:43:41,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {5475#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; {5475#true} is VALID [2022-04-28 07:43:41,051 INFO L272 TraceCheckUtils]: 6: Hoare triple {5475#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {5475#true} is VALID [2022-04-28 07:43:41,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {5475#true} ~cond := #in~cond; {5475#true} is VALID [2022-04-28 07:43:41,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {5475#true} assume !(0 == ~cond); {5475#true} is VALID [2022-04-28 07:43:41,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-04-28 07:43:41,051 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5475#true} {5475#true} #52#return; {5475#true} is VALID [2022-04-28 07:43:41,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {5475#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5513#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:41,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {5513#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5513#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:41,052 INFO L272 TraceCheckUtils]: 13: Hoare triple {5513#(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)); {5475#true} is VALID [2022-04-28 07:43:41,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {5475#true} ~cond := #in~cond; {5475#true} is VALID [2022-04-28 07:43:41,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {5475#true} assume !(0 == ~cond); {5475#true} is VALID [2022-04-28 07:43:41,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-04-28 07:43:41,052 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5475#true} {5513#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {5513#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:41,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {5513#(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; {5535#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:41,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {5535#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {5535#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:41,053 INFO L272 TraceCheckUtils]: 20: Hoare triple {5535#(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)); {5475#true} is VALID [2022-04-28 07:43:41,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {5475#true} ~cond := #in~cond; {5475#true} is VALID [2022-04-28 07:43:41,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {5475#true} assume !(0 == ~cond); {5475#true} is VALID [2022-04-28 07:43:41,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-04-28 07:43:41,053 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5475#true} {5535#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {5535#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:41,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {5535#(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; {5557#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:41,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {5557#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {5557#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:41,054 INFO L272 TraceCheckUtils]: 27: Hoare triple {5557#(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)); {5475#true} is VALID [2022-04-28 07:43:41,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {5475#true} ~cond := #in~cond; {5475#true} is VALID [2022-04-28 07:43:41,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {5475#true} assume !(0 == ~cond); {5475#true} is VALID [2022-04-28 07:43:41,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-04-28 07:43:41,055 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5475#true} {5557#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {5557#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:41,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {5557#(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; {5579#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:43:41,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {5579#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {5579#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:43:41,056 INFO L272 TraceCheckUtils]: 34: Hoare triple {5579#(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)); {5475#true} is VALID [2022-04-28 07:43:41,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {5475#true} ~cond := #in~cond; {5475#true} is VALID [2022-04-28 07:43:41,056 INFO L290 TraceCheckUtils]: 36: Hoare triple {5475#true} assume !(0 == ~cond); {5475#true} is VALID [2022-04-28 07:43:41,056 INFO L290 TraceCheckUtils]: 37: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-04-28 07:43:41,057 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5475#true} {5579#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #54#return; {5579#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:43:41,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {5579#(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; {5601#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:43:41,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {5601#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !false; {5601#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:43:41,057 INFO L272 TraceCheckUtils]: 41: Hoare triple {5601#(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)); {5475#true} is VALID [2022-04-28 07:43:41,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {5475#true} ~cond := #in~cond; {5475#true} is VALID [2022-04-28 07:43:41,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {5475#true} assume !(0 == ~cond); {5475#true} is VALID [2022-04-28 07:43:41,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-04-28 07:43:41,062 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5475#true} {5601#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #54#return; {5601#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:43:41,063 INFO L290 TraceCheckUtils]: 46: Hoare triple {5601#(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; {5623#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:41,063 INFO L290 TraceCheckUtils]: 47: Hoare triple {5623#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {5623#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:41,063 INFO L272 TraceCheckUtils]: 48: Hoare triple {5623#(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)); {5475#true} is VALID [2022-04-28 07:43:41,063 INFO L290 TraceCheckUtils]: 49: Hoare triple {5475#true} ~cond := #in~cond; {5475#true} is VALID [2022-04-28 07:43:41,063 INFO L290 TraceCheckUtils]: 50: Hoare triple {5475#true} assume !(0 == ~cond); {5475#true} is VALID [2022-04-28 07:43:41,063 INFO L290 TraceCheckUtils]: 51: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-04-28 07:43:41,064 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5475#true} {5623#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {5623#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:41,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {5623#(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; {5645#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:41,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {5645#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {5645#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:41,064 INFO L272 TraceCheckUtils]: 55: Hoare triple {5645#(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)); {5475#true} is VALID [2022-04-28 07:43:41,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {5475#true} ~cond := #in~cond; {5475#true} is VALID [2022-04-28 07:43:41,064 INFO L290 TraceCheckUtils]: 57: Hoare triple {5475#true} assume !(0 == ~cond); {5475#true} is VALID [2022-04-28 07:43:41,064 INFO L290 TraceCheckUtils]: 58: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-04-28 07:43:41,065 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5475#true} {5645#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {5645#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:41,065 INFO L290 TraceCheckUtils]: 60: Hoare triple {5645#(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; {5667#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:43:41,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {5667#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !false; {5667#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:43:41,067 INFO L272 TraceCheckUtils]: 62: Hoare triple {5667#(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)); {5475#true} is VALID [2022-04-28 07:43:41,067 INFO L290 TraceCheckUtils]: 63: Hoare triple {5475#true} ~cond := #in~cond; {5475#true} is VALID [2022-04-28 07:43:41,067 INFO L290 TraceCheckUtils]: 64: Hoare triple {5475#true} assume !(0 == ~cond); {5475#true} is VALID [2022-04-28 07:43:41,068 INFO L290 TraceCheckUtils]: 65: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-04-28 07:43:41,068 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5475#true} {5667#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #54#return; {5667#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:43:41,068 INFO L290 TraceCheckUtils]: 67: Hoare triple {5667#(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; {5689#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:43:41,069 INFO L290 TraceCheckUtils]: 68: Hoare triple {5689#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {5689#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:43:41,069 INFO L272 TraceCheckUtils]: 69: Hoare triple {5689#(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)); {5475#true} is VALID [2022-04-28 07:43:41,069 INFO L290 TraceCheckUtils]: 70: Hoare triple {5475#true} ~cond := #in~cond; {5475#true} is VALID [2022-04-28 07:43:41,069 INFO L290 TraceCheckUtils]: 71: Hoare triple {5475#true} assume !(0 == ~cond); {5475#true} is VALID [2022-04-28 07:43:41,069 INFO L290 TraceCheckUtils]: 72: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-04-28 07:43:41,069 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5475#true} {5689#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {5689#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:43:41,069 INFO L290 TraceCheckUtils]: 74: Hoare triple {5689#(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; {5711#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:43:41,070 INFO L290 TraceCheckUtils]: 75: Hoare triple {5711#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !false; {5711#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:43:41,070 INFO L272 TraceCheckUtils]: 76: Hoare triple {5711#(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)); {5475#true} is VALID [2022-04-28 07:43:41,070 INFO L290 TraceCheckUtils]: 77: Hoare triple {5475#true} ~cond := #in~cond; {5475#true} is VALID [2022-04-28 07:43:41,070 INFO L290 TraceCheckUtils]: 78: Hoare triple {5475#true} assume !(0 == ~cond); {5475#true} is VALID [2022-04-28 07:43:41,070 INFO L290 TraceCheckUtils]: 79: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-04-28 07:43:41,070 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5475#true} {5711#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #54#return; {5711#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:43:41,071 INFO L290 TraceCheckUtils]: 81: Hoare triple {5711#(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; {5733#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-28 07:43:41,071 INFO L290 TraceCheckUtils]: 82: Hoare triple {5733#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} assume !false; {5733#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-28 07:43:41,071 INFO L272 TraceCheckUtils]: 83: Hoare triple {5733#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5475#true} is VALID [2022-04-28 07:43:41,071 INFO L290 TraceCheckUtils]: 84: Hoare triple {5475#true} ~cond := #in~cond; {5475#true} is VALID [2022-04-28 07:43:41,071 INFO L290 TraceCheckUtils]: 85: Hoare triple {5475#true} assume !(0 == ~cond); {5475#true} is VALID [2022-04-28 07:43:41,071 INFO L290 TraceCheckUtils]: 86: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-04-28 07:43:41,071 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {5475#true} {5733#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} #54#return; {5733#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-28 07:43:41,072 INFO L290 TraceCheckUtils]: 88: Hoare triple {5733#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {5755#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-28 07:43:41,072 INFO L272 TraceCheckUtils]: 89: Hoare triple {5755#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5759#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:41,073 INFO L290 TraceCheckUtils]: 90: Hoare triple {5759#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5763#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:41,073 INFO L290 TraceCheckUtils]: 91: Hoare triple {5763#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5476#false} is VALID [2022-04-28 07:43:41,073 INFO L290 TraceCheckUtils]: 92: Hoare triple {5476#false} assume !false; {5476#false} is VALID [2022-04-28 07:43:41,075 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:41,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:41,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:41,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392243476] [2022-04-28 07:43:41,281 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:41,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286012581] [2022-04-28 07:43:41,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286012581] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:41,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:41,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 07:43:41,282 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:41,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [307007013] [2022-04-28 07:43:41,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [307007013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:41,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:41,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 07:43:41,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954551706] [2022-04-28 07:43:41,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:41,287 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:41,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:41,288 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:41,317 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:41,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 07:43:41,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:41,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 07:43:41,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:43:41,317 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:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:42,203 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-28 07:43:42,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 07:43:42,204 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:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:42,204 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:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-28 07:43:42,206 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:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-28 07:43:42,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 72 transitions. [2022-04-28 07:43:42,254 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:42,256 INFO L225 Difference]: With dead ends: 66 [2022-04-28 07:43:42,256 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 07:43:42,257 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:42,260 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:42,260 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.4s Time] [2022-04-28 07:43:42,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 07:43:42,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 07:43:42,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:42,317 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:42,317 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:42,317 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:42,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:42,319 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-28 07:43:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-28 07:43:42,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:42,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:42,319 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:42,319 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:42,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:42,320 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-28 07:43:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-28 07:43:42,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:42,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:42,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:42,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:42,321 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:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-04-28 07:43:42,322 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 93 [2022-04-28 07:43:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:42,322 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-04-28 07:43:42,322 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:42,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 71 transitions. [2022-04-28 07:43:42,395 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:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-28 07:43:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 07:43:42,396 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:42,396 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:42,404 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:42,602 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:42,602 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:42,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 21 times [2022-04-28 07:43:42,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:42,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [517210281] [2022-04-28 07:43:42,657 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:42,657 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:42,657 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:42,657 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 22 times [2022-04-28 07:43:42,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:42,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806467393] [2022-04-28 07:43:42,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:42,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:42,691 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:42,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [824033974] [2022-04-28 07:43:42,691 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:43:42,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:42,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:42,695 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:42,696 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:43,771 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:43:43,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:43,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 07:43:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:43,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:44,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {6191#true} call ULTIMATE.init(); {6191#true} is VALID [2022-04-28 07:43:44,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {6191#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); {6191#true} is VALID [2022-04-28 07:43:44,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {6191#true} assume true; {6191#true} is VALID [2022-04-28 07:43:44,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6191#true} {6191#true} #60#return; {6191#true} is VALID [2022-04-28 07:43:44,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {6191#true} call #t~ret5 := main(); {6191#true} is VALID [2022-04-28 07:43:44,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {6191#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; {6191#true} is VALID [2022-04-28 07:43:44,288 INFO L272 TraceCheckUtils]: 6: Hoare triple {6191#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {6191#true} is VALID [2022-04-28 07:43:44,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {6191#true} ~cond := #in~cond; {6191#true} is VALID [2022-04-28 07:43:44,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {6191#true} assume !(0 == ~cond); {6191#true} is VALID [2022-04-28 07:43:44,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {6191#true} assume true; {6191#true} is VALID [2022-04-28 07:43:44,288 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6191#true} {6191#true} #52#return; {6191#true} is VALID [2022-04-28 07:43:44,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {6191#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6229#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:44,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {6229#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6229#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:44,289 INFO L272 TraceCheckUtils]: 13: Hoare triple {6229#(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)); {6191#true} is VALID [2022-04-28 07:43:44,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {6191#true} ~cond := #in~cond; {6191#true} is VALID [2022-04-28 07:43:44,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {6191#true} assume !(0 == ~cond); {6191#true} is VALID [2022-04-28 07:43:44,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {6191#true} assume true; {6191#true} is VALID [2022-04-28 07:43:44,290 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6191#true} {6229#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {6229#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:44,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {6229#(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; {6251#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:44,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {6251#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {6251#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:44,291 INFO L272 TraceCheckUtils]: 20: Hoare triple {6251#(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)); {6191#true} is VALID [2022-04-28 07:43:44,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {6191#true} ~cond := #in~cond; {6191#true} is VALID [2022-04-28 07:43:44,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {6191#true} assume !(0 == ~cond); {6191#true} is VALID [2022-04-28 07:43:44,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {6191#true} assume true; {6191#true} is VALID [2022-04-28 07:43:44,292 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6191#true} {6251#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {6251#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:44,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {6251#(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; {6273#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:44,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {6273#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {6273#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:44,292 INFO L272 TraceCheckUtils]: 27: Hoare triple {6273#(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)); {6191#true} is VALID [2022-04-28 07:43:44,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {6191#true} ~cond := #in~cond; {6191#true} is VALID [2022-04-28 07:43:44,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {6191#true} assume !(0 == ~cond); {6191#true} is VALID [2022-04-28 07:43:44,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {6191#true} assume true; {6191#true} is VALID [2022-04-28 07:43:44,293 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6191#true} {6273#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {6273#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:44,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {6273#(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; {6295#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:44,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {6295#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {6295#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:44,294 INFO L272 TraceCheckUtils]: 34: Hoare triple {6295#(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)); {6191#true} is VALID [2022-04-28 07:43:44,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {6191#true} ~cond := #in~cond; {6191#true} is VALID [2022-04-28 07:43:44,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {6191#true} assume !(0 == ~cond); {6191#true} is VALID [2022-04-28 07:43:44,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {6191#true} assume true; {6191#true} is VALID [2022-04-28 07:43:44,294 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6191#true} {6295#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {6295#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:44,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {6295#(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; {6317#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 07:43:44,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {6317#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !false; {6317#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 07:43:44,296 INFO L272 TraceCheckUtils]: 41: Hoare triple {6317#(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)); {6191#true} is VALID [2022-04-28 07:43:44,296 INFO L290 TraceCheckUtils]: 42: Hoare triple {6191#true} ~cond := #in~cond; {6191#true} is VALID [2022-04-28 07:43:44,296 INFO L290 TraceCheckUtils]: 43: Hoare triple {6191#true} assume !(0 == ~cond); {6191#true} is VALID [2022-04-28 07:43:44,296 INFO L290 TraceCheckUtils]: 44: Hoare triple {6191#true} assume true; {6191#true} is VALID [2022-04-28 07:43:44,297 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6191#true} {6317#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #54#return; {6317#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 07:43:44,297 INFO L290 TraceCheckUtils]: 46: Hoare triple {6317#(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; {6339#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:44,297 INFO L290 TraceCheckUtils]: 47: Hoare triple {6339#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {6339#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:44,297 INFO L272 TraceCheckUtils]: 48: Hoare triple {6339#(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)); {6191#true} is VALID [2022-04-28 07:43:44,298 INFO L290 TraceCheckUtils]: 49: Hoare triple {6191#true} ~cond := #in~cond; {6191#true} is VALID [2022-04-28 07:43:44,298 INFO L290 TraceCheckUtils]: 50: Hoare triple {6191#true} assume !(0 == ~cond); {6191#true} is VALID [2022-04-28 07:43:44,298 INFO L290 TraceCheckUtils]: 51: Hoare triple {6191#true} assume true; {6191#true} is VALID [2022-04-28 07:43:44,298 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6191#true} {6339#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #54#return; {6339#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:44,298 INFO L290 TraceCheckUtils]: 53: Hoare triple {6339#(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; {6361#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:44,299 INFO L290 TraceCheckUtils]: 54: Hoare triple {6361#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {6361#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:44,299 INFO L272 TraceCheckUtils]: 55: Hoare triple {6361#(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)); {6191#true} is VALID [2022-04-28 07:43:44,299 INFO L290 TraceCheckUtils]: 56: Hoare triple {6191#true} ~cond := #in~cond; {6191#true} is VALID [2022-04-28 07:43:44,299 INFO L290 TraceCheckUtils]: 57: Hoare triple {6191#true} assume !(0 == ~cond); {6191#true} is VALID [2022-04-28 07:43:44,299 INFO L290 TraceCheckUtils]: 58: Hoare triple {6191#true} assume true; {6191#true} is VALID [2022-04-28 07:43:44,299 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6191#true} {6361#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {6361#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:44,300 INFO L290 TraceCheckUtils]: 60: Hoare triple {6361#(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; {6383#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:43:44,300 INFO L290 TraceCheckUtils]: 61: Hoare triple {6383#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !false; {6383#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:43:44,300 INFO L272 TraceCheckUtils]: 62: Hoare triple {6383#(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)); {6191#true} is VALID [2022-04-28 07:43:44,300 INFO L290 TraceCheckUtils]: 63: Hoare triple {6191#true} ~cond := #in~cond; {6191#true} is VALID [2022-04-28 07:43:44,300 INFO L290 TraceCheckUtils]: 64: Hoare triple {6191#true} assume !(0 == ~cond); {6191#true} is VALID [2022-04-28 07:43:44,300 INFO L290 TraceCheckUtils]: 65: Hoare triple {6191#true} assume true; {6191#true} is VALID [2022-04-28 07:43:44,301 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6191#true} {6383#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #54#return; {6383#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:43:44,301 INFO L290 TraceCheckUtils]: 67: Hoare triple {6383#(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; {6405#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:43:44,301 INFO L290 TraceCheckUtils]: 68: Hoare triple {6405#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {6405#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:43:44,301 INFO L272 TraceCheckUtils]: 69: Hoare triple {6405#(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)); {6191#true} is VALID [2022-04-28 07:43:44,301 INFO L290 TraceCheckUtils]: 70: Hoare triple {6191#true} ~cond := #in~cond; {6191#true} is VALID [2022-04-28 07:43:44,302 INFO L290 TraceCheckUtils]: 71: Hoare triple {6191#true} assume !(0 == ~cond); {6191#true} is VALID [2022-04-28 07:43:44,302 INFO L290 TraceCheckUtils]: 72: Hoare triple {6191#true} assume true; {6191#true} is VALID [2022-04-28 07:43:44,302 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6191#true} {6405#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #54#return; {6405#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:43:44,302 INFO L290 TraceCheckUtils]: 74: Hoare triple {6405#(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; {6427#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:43:44,303 INFO L290 TraceCheckUtils]: 75: Hoare triple {6427#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {6427#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:43:44,303 INFO L272 TraceCheckUtils]: 76: Hoare triple {6427#(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)); {6191#true} is VALID [2022-04-28 07:43:44,303 INFO L290 TraceCheckUtils]: 77: Hoare triple {6191#true} ~cond := #in~cond; {6191#true} is VALID [2022-04-28 07:43:44,303 INFO L290 TraceCheckUtils]: 78: Hoare triple {6191#true} assume !(0 == ~cond); {6191#true} is VALID [2022-04-28 07:43:44,303 INFO L290 TraceCheckUtils]: 79: Hoare triple {6191#true} assume true; {6191#true} is VALID [2022-04-28 07:43:44,303 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6191#true} {6427#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {6427#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:43:44,304 INFO L290 TraceCheckUtils]: 81: Hoare triple {6427#(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; {6449#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:43:44,304 INFO L290 TraceCheckUtils]: 82: Hoare triple {6449#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {6449#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:43:44,304 INFO L272 TraceCheckUtils]: 83: Hoare triple {6449#(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)); {6191#true} is VALID [2022-04-28 07:43:44,304 INFO L290 TraceCheckUtils]: 84: Hoare triple {6191#true} ~cond := #in~cond; {6191#true} is VALID [2022-04-28 07:43:44,304 INFO L290 TraceCheckUtils]: 85: Hoare triple {6191#true} assume !(0 == ~cond); {6191#true} is VALID [2022-04-28 07:43:44,304 INFO L290 TraceCheckUtils]: 86: Hoare triple {6191#true} assume true; {6191#true} is VALID [2022-04-28 07:43:44,305 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {6191#true} {6449#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {6449#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:43:44,305 INFO L290 TraceCheckUtils]: 88: Hoare triple {6449#(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; {6471#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:43:44,305 INFO L290 TraceCheckUtils]: 89: Hoare triple {6471#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !false; {6471#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:43:44,305 INFO L272 TraceCheckUtils]: 90: Hoare triple {6471#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 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)); {6191#true} is VALID [2022-04-28 07:43:44,305 INFO L290 TraceCheckUtils]: 91: Hoare triple {6191#true} ~cond := #in~cond; {6191#true} is VALID [2022-04-28 07:43:44,305 INFO L290 TraceCheckUtils]: 92: Hoare triple {6191#true} assume !(0 == ~cond); {6191#true} is VALID [2022-04-28 07:43:44,306 INFO L290 TraceCheckUtils]: 93: Hoare triple {6191#true} assume true; {6191#true} is VALID [2022-04-28 07:43:44,312 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6191#true} {6471#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} #54#return; {6471#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:43:44,312 INFO L290 TraceCheckUtils]: 95: Hoare triple {6471#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !(~c~0 < ~k~0); {6493#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-28 07:43:44,313 INFO L272 TraceCheckUtils]: 96: Hoare triple {6493#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6497#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:44,313 INFO L290 TraceCheckUtils]: 97: Hoare triple {6497#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6501#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:44,314 INFO L290 TraceCheckUtils]: 98: Hoare triple {6501#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6192#false} is VALID [2022-04-28 07:43:44,314 INFO L290 TraceCheckUtils]: 99: Hoare triple {6192#false} assume !false; {6192#false} is VALID [2022-04-28 07:43:44,314 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:44,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:44,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:44,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806467393] [2022-04-28 07:43:44,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:44,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824033974] [2022-04-28 07:43:44,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824033974] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:44,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:44,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-28 07:43:44,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:44,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [517210281] [2022-04-28 07:43:44,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [517210281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:44,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:44,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 07:43:44,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939293904] [2022-04-28 07:43:44,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:44,574 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:44,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:44,575 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:44,609 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:44,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 07:43:44,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:44,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 07:43:44,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:43:44,610 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:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:45,567 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-28 07:43:45,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 07:43:45,568 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:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:45,583 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:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-28 07:43:45,585 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:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-28 07:43:45,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 76 transitions. [2022-04-28 07:43:45,622 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:45,623 INFO L225 Difference]: With dead ends: 69 [2022-04-28 07:43:45,623 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 07:43:45,623 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:45,623 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:45,624 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.4s Time] [2022-04-28 07:43:45,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 07:43:45,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-28 07:43:45,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:45,653 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:45,653 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:45,653 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:45,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:45,655 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-28 07:43:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-28 07:43:45,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:45,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:45,656 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:45,656 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:45,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:45,657 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-28 07:43:45,657 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-28 07:43:45,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:45,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:45,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:45,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:45,658 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:45,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-04-28 07:43:45,659 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 100 [2022-04-28 07:43:45,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:45,659 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-04-28 07:43:45,659 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:45,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 75 transitions. [2022-04-28 07:43:45,757 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:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-28 07:43:45,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 07:43:45,759 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:45,759 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:45,781 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:45,964 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:45,964 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:45,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:45,964 INFO L85 PathProgramCache]: Analyzing trace with hash 893158889, now seen corresponding path program 23 times [2022-04-28 07:43:45,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:45,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [162955275] [2022-04-28 07:43:46,025 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:46,025 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:46,025 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:46,025 INFO L85 PathProgramCache]: Analyzing trace with hash 893158889, now seen corresponding path program 24 times [2022-04-28 07:43:46,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:46,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640023007] [2022-04-28 07:43:46,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:46,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:46,038 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:46,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447878688] [2022-04-28 07:43:46,038 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:43:46,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:46,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:46,050 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:46,052 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:46,284 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 07:43:46,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:46,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-28 07:43:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:46,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:46,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {6947#true} call ULTIMATE.init(); {6947#true} is VALID [2022-04-28 07:43:46,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {6947#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); {6947#true} is VALID [2022-04-28 07:43:46,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {6947#true} assume true; {6947#true} is VALID [2022-04-28 07:43:46,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6947#true} {6947#true} #60#return; {6947#true} is VALID [2022-04-28 07:43:46,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {6947#true} call #t~ret5 := main(); {6947#true} is VALID [2022-04-28 07:43:46,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {6947#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; {6947#true} is VALID [2022-04-28 07:43:46,805 INFO L272 TraceCheckUtils]: 6: Hoare triple {6947#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {6947#true} is VALID [2022-04-28 07:43:46,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {6947#true} ~cond := #in~cond; {6947#true} is VALID [2022-04-28 07:43:46,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {6947#true} assume !(0 == ~cond); {6947#true} is VALID [2022-04-28 07:43:46,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {6947#true} assume true; {6947#true} is VALID [2022-04-28 07:43:46,806 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6947#true} {6947#true} #52#return; {6947#true} is VALID [2022-04-28 07:43:46,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {6947#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:46,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {6985#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:46,806 INFO L272 TraceCheckUtils]: 13: Hoare triple {6985#(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)); {6947#true} is VALID [2022-04-28 07:43:46,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {6947#true} ~cond := #in~cond; {6947#true} is VALID [2022-04-28 07:43:46,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {6947#true} assume !(0 == ~cond); {6947#true} is VALID [2022-04-28 07:43:46,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {6947#true} assume true; {6947#true} is VALID [2022-04-28 07:43:46,807 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6947#true} {6985#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {6985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:46,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {6985#(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; {7007#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:43:46,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {7007#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7007#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:43:46,807 INFO L272 TraceCheckUtils]: 20: Hoare triple {7007#(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)); {6947#true} is VALID [2022-04-28 07:43:46,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {6947#true} ~cond := #in~cond; {6947#true} is VALID [2022-04-28 07:43:46,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {6947#true} assume !(0 == ~cond); {6947#true} is VALID [2022-04-28 07:43:46,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {6947#true} assume true; {6947#true} is VALID [2022-04-28 07:43:46,808 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6947#true} {7007#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {7007#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:43:46,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {7007#(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; {7029#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:46,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {7029#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {7029#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:46,809 INFO L272 TraceCheckUtils]: 27: Hoare triple {7029#(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)); {6947#true} is VALID [2022-04-28 07:43:46,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {6947#true} ~cond := #in~cond; {6947#true} is VALID [2022-04-28 07:43:46,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {6947#true} assume !(0 == ~cond); {6947#true} is VALID [2022-04-28 07:43:46,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {6947#true} assume true; {6947#true} is VALID [2022-04-28 07:43:46,809 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6947#true} {7029#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {7029#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:46,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {7029#(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; {7051#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:43:46,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {7051#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {7051#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:43:46,810 INFO L272 TraceCheckUtils]: 34: Hoare triple {7051#(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)); {6947#true} is VALID [2022-04-28 07:43:46,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {6947#true} ~cond := #in~cond; {6947#true} is VALID [2022-04-28 07:43:46,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {6947#true} assume !(0 == ~cond); {6947#true} is VALID [2022-04-28 07:43:46,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {6947#true} assume true; {6947#true} is VALID [2022-04-28 07:43:46,811 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6947#true} {7051#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {7051#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:43:46,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {7051#(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; {7073#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:43:46,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {7073#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {7073#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:43:46,811 INFO L272 TraceCheckUtils]: 41: Hoare triple {7073#(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)); {6947#true} is VALID [2022-04-28 07:43:46,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {6947#true} ~cond := #in~cond; {6947#true} is VALID [2022-04-28 07:43:46,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {6947#true} assume !(0 == ~cond); {6947#true} is VALID [2022-04-28 07:43:46,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {6947#true} assume true; {6947#true} is VALID [2022-04-28 07:43:46,812 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6947#true} {7073#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {7073#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:43:46,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {7073#(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; {7095#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:43:46,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {7095#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {7095#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:43:46,812 INFO L272 TraceCheckUtils]: 48: Hoare triple {7095#(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)); {6947#true} is VALID [2022-04-28 07:43:46,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {6947#true} ~cond := #in~cond; {6947#true} is VALID [2022-04-28 07:43:46,813 INFO L290 TraceCheckUtils]: 50: Hoare triple {6947#true} assume !(0 == ~cond); {6947#true} is VALID [2022-04-28 07:43:46,813 INFO L290 TraceCheckUtils]: 51: Hoare triple {6947#true} assume true; {6947#true} is VALID [2022-04-28 07:43:46,813 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6947#true} {7095#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #54#return; {7095#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:43:46,813 INFO L290 TraceCheckUtils]: 53: Hoare triple {7095#(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; {7117#(and (= main_~y~0 6) (= main_~c~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 07:43:46,814 INFO L290 TraceCheckUtils]: 54: Hoare triple {7117#(and (= main_~y~0 6) (= main_~c~0 6) (< 5 main_~k~0))} assume !false; {7117#(and (= main_~y~0 6) (= main_~c~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 07:43:46,814 INFO L272 TraceCheckUtils]: 55: Hoare triple {7117#(and (= main_~y~0 6) (= main_~c~0 6) (< 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)); {6947#true} is VALID [2022-04-28 07:43:46,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {6947#true} ~cond := #in~cond; {6947#true} is VALID [2022-04-28 07:43:46,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {6947#true} assume !(0 == ~cond); {6947#true} is VALID [2022-04-28 07:43:46,814 INFO L290 TraceCheckUtils]: 58: Hoare triple {6947#true} assume true; {6947#true} is VALID [2022-04-28 07:43:46,814 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6947#true} {7117#(and (= main_~y~0 6) (= main_~c~0 6) (< 5 main_~k~0))} #54#return; {7117#(and (= main_~y~0 6) (= main_~c~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 07:43:46,815 INFO L290 TraceCheckUtils]: 60: Hoare triple {7117#(and (= main_~y~0 6) (= main_~c~0 6) (< 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; {7139#(and (= 7 main_~c~0) (< 5 main_~k~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:46,815 INFO L290 TraceCheckUtils]: 61: Hoare triple {7139#(and (= 7 main_~c~0) (< 5 main_~k~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {7139#(and (= 7 main_~c~0) (< 5 main_~k~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:46,815 INFO L272 TraceCheckUtils]: 62: Hoare triple {7139#(and (= 7 main_~c~0) (< 5 main_~k~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)); {6947#true} is VALID [2022-04-28 07:43:46,815 INFO L290 TraceCheckUtils]: 63: Hoare triple {6947#true} ~cond := #in~cond; {6947#true} is VALID [2022-04-28 07:43:46,815 INFO L290 TraceCheckUtils]: 64: Hoare triple {6947#true} assume !(0 == ~cond); {6947#true} is VALID [2022-04-28 07:43:46,815 INFO L290 TraceCheckUtils]: 65: Hoare triple {6947#true} assume true; {6947#true} is VALID [2022-04-28 07:43:46,815 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6947#true} {7139#(and (= 7 main_~c~0) (< 5 main_~k~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {7139#(and (= 7 main_~c~0) (< 5 main_~k~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:46,816 INFO L290 TraceCheckUtils]: 67: Hoare triple {7139#(and (= 7 main_~c~0) (< 5 main_~k~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; {7161#(and (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:43:46,816 INFO L290 TraceCheckUtils]: 68: Hoare triple {7161#(and (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 6))} assume !false; {7161#(and (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:43:46,816 INFO L272 TraceCheckUtils]: 69: Hoare triple {7161#(and (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~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)); {6947#true} is VALID [2022-04-28 07:43:46,816 INFO L290 TraceCheckUtils]: 70: Hoare triple {6947#true} ~cond := #in~cond; {6947#true} is VALID [2022-04-28 07:43:46,816 INFO L290 TraceCheckUtils]: 71: Hoare triple {6947#true} assume !(0 == ~cond); {6947#true} is VALID [2022-04-28 07:43:46,816 INFO L290 TraceCheckUtils]: 72: Hoare triple {6947#true} assume true; {6947#true} is VALID [2022-04-28 07:43:46,817 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6947#true} {7161#(and (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 6))} #54#return; {7161#(and (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:43:46,817 INFO L290 TraceCheckUtils]: 74: Hoare triple {7161#(and (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~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; {7183#(and (= (+ main_~y~0 (- 3)) 6) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-28 07:43:46,817 INFO L290 TraceCheckUtils]: 75: Hoare triple {7183#(and (= (+ main_~y~0 (- 3)) 6) (< 5 main_~k~0) (= main_~c~0 9))} assume !false; {7183#(and (= (+ main_~y~0 (- 3)) 6) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-28 07:43:46,817 INFO L272 TraceCheckUtils]: 76: Hoare triple {7183#(and (= (+ main_~y~0 (- 3)) 6) (< 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)); {6947#true} is VALID [2022-04-28 07:43:46,818 INFO L290 TraceCheckUtils]: 77: Hoare triple {6947#true} ~cond := #in~cond; {6947#true} is VALID [2022-04-28 07:43:46,818 INFO L290 TraceCheckUtils]: 78: Hoare triple {6947#true} assume !(0 == ~cond); {6947#true} is VALID [2022-04-28 07:43:46,818 INFO L290 TraceCheckUtils]: 79: Hoare triple {6947#true} assume true; {6947#true} is VALID [2022-04-28 07:43:46,818 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6947#true} {7183#(and (= (+ main_~y~0 (- 3)) 6) (< 5 main_~k~0) (= main_~c~0 9))} #54#return; {7183#(and (= (+ main_~y~0 (- 3)) 6) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-28 07:43:46,818 INFO L290 TraceCheckUtils]: 81: Hoare triple {7183#(and (= (+ main_~y~0 (- 3)) 6) (< 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; {7205#(and (= (+ main_~y~0 (- 4)) 6) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:43:46,819 INFO L290 TraceCheckUtils]: 82: Hoare triple {7205#(and (= (+ main_~y~0 (- 4)) 6) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} assume !false; {7205#(and (= (+ main_~y~0 (- 4)) 6) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:43:46,819 INFO L272 TraceCheckUtils]: 83: Hoare triple {7205#(and (= (+ main_~y~0 (- 4)) 6) (< 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)); {6947#true} is VALID [2022-04-28 07:43:46,819 INFO L290 TraceCheckUtils]: 84: Hoare triple {6947#true} ~cond := #in~cond; {6947#true} is VALID [2022-04-28 07:43:46,819 INFO L290 TraceCheckUtils]: 85: Hoare triple {6947#true} assume !(0 == ~cond); {6947#true} is VALID [2022-04-28 07:43:46,819 INFO L290 TraceCheckUtils]: 86: Hoare triple {6947#true} assume true; {6947#true} is VALID [2022-04-28 07:43:46,819 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {6947#true} {7205#(and (= (+ main_~y~0 (- 4)) 6) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} #54#return; {7205#(and (= (+ main_~y~0 (- 4)) 6) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:43:46,820 INFO L290 TraceCheckUtils]: 88: Hoare triple {7205#(and (= (+ main_~y~0 (- 4)) 6) (< 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; {7227#(and (< 5 main_~k~0) (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-28 07:43:46,820 INFO L290 TraceCheckUtils]: 89: Hoare triple {7227#(and (< 5 main_~k~0) (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {7227#(and (< 5 main_~k~0) (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-28 07:43:46,820 INFO L272 TraceCheckUtils]: 90: Hoare triple {7227#(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)); {6947#true} is VALID [2022-04-28 07:43:46,820 INFO L290 TraceCheckUtils]: 91: Hoare triple {6947#true} ~cond := #in~cond; {7237#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:46,821 INFO L290 TraceCheckUtils]: 92: Hoare triple {7237#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7241#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:43:46,821 INFO L290 TraceCheckUtils]: 93: Hoare triple {7241#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7241#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:43:46,821 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7241#(not (= |__VERIFIER_assert_#in~cond| 0))} {7227#(and (< 5 main_~k~0) (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #54#return; {7248#(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,822 INFO L290 TraceCheckUtils]: 95: Hoare triple {7248#(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; {7252#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 4356) main_~x~0) (< 11 main_~k~0))} is VALID [2022-04-28 07:43:46,822 INFO L290 TraceCheckUtils]: 96: Hoare triple {7252#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 4356) main_~x~0) (< 11 main_~k~0))} assume !false; {7252#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 4356) main_~x~0) (< 11 main_~k~0))} is VALID [2022-04-28 07:43:46,822 INFO L272 TraceCheckUtils]: 97: Hoare triple {7252#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 4356) 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)); {6947#true} is VALID [2022-04-28 07:43:46,822 INFO L290 TraceCheckUtils]: 98: Hoare triple {6947#true} ~cond := #in~cond; {7237#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:46,823 INFO L290 TraceCheckUtils]: 99: Hoare triple {7237#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7241#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:43:46,823 INFO L290 TraceCheckUtils]: 100: Hoare triple {7241#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7241#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:43:46,823 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {7241#(not (= |__VERIFIER_assert_#in~cond| 0))} {7252#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 4356) main_~x~0) (< 11 main_~k~0))} #54#return; {7271#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 07:43:46,824 INFO L290 TraceCheckUtils]: 102: Hoare triple {7271#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {7275#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-28 07:43:46,824 INFO L272 TraceCheckUtils]: 103: Hoare triple {7275#(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)); {7279#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:46,824 INFO L290 TraceCheckUtils]: 104: Hoare triple {7279#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7283#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:46,825 INFO L290 TraceCheckUtils]: 105: Hoare triple {7283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6948#false} is VALID [2022-04-28 07:43:46,825 INFO L290 TraceCheckUtils]: 106: Hoare triple {6948#false} assume !false; {6948#false} is VALID [2022-04-28 07:43:46,825 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,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:44:15,450 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~y~0 1))) (or (= (+ (* .cse0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) 3 (* .cse0 .cse0))) (< (+ 2 c_main_~c~0) c_main_~k~0) (<= c_main_~k~0 (+ c_main_~c~0 1)) (not (= (mod (+ (* 6 .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 .cse0) (* 13 .cse0 .cse0)) 4) 0)))) is different from false [2022-04-28 07:44:23,524 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:25,522 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 5 c_main_~y~0))) (or (< (+ 6 c_main_~c~0) c_main_~k~0) (= (+ (* .cse0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) (* .cse0 .cse0) 11)) (not (= (mod (+ (* .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 13) (* 6 .cse0 .cse0 .cse0)) 4) 0)) (<= c_main_~k~0 (+ 5 c_main_~c~0)))) is different from false [2022-04-28 07:45:33,634 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:45:35,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:45:35,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640023007] [2022-04-28 07:45:35,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:45:35,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447878688] [2022-04-28 07:45:35,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447878688] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:45:35,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:45:35,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-28 07:45:35,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:45:35,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [162955275] [2022-04-28 07:45:35,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [162955275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:45:35,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:45:35,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 07:45:35,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661061564] [2022-04-28 07:45:35,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:45:35,699 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:45:35,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:45:35,699 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:45:35,754 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:45:35,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 07:45:35,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:35,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 07:45:35,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=743, Unknown=4, NotChecked=236, Total=1122 [2022-04-28 07:45:35,755 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:45:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:37,788 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-28 07:45:37,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 07:45:37,788 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:45:37,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:45:37,788 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:45:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-28 07:45:37,790 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:45:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-28 07:45:37,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 80 transitions. [2022-04-28 07:45:37,900 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:45:37,901 INFO L225 Difference]: With dead ends: 72 [2022-04-28 07:45:37,901 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 07:45:37,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 54.1s TimeCoverageRelationStatistics Valid=160, Invalid=908, Unknown=4, NotChecked=260, Total=1332 [2022-04-28 07:45:37,904 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 8 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 07:45:37,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 513 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 07:45:37,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 07:45:37,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 07:45:37,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:45:37,945 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:45:37,945 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:45:37,946 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:45:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:37,953 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-28 07:45:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-28 07:45:37,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:37,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:37,954 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:45:37,954 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:45:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:37,955 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-28 07:45:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-28 07:45:37,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:37,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:37,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:45:37,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:45:37,965 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:45:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-04-28 07:45:37,980 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 107 [2022-04-28 07:45:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:45:37,980 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-04-28 07:45:37,981 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:45:37,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 79 transitions. [2022-04-28 07:45:38,075 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:45:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-28 07:45:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-28 07:45:38,076 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:45:38,076 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:45:38,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 07:45:38,276 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:45:38,276 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:45:38,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:45:38,277 INFO L85 PathProgramCache]: Analyzing trace with hash 363946760, now seen corresponding path program 25 times [2022-04-28 07:45:38,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:38,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [935299303] [2022-04-28 07:45:38,327 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:45:38,328 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:45:38,328 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:45:38,328 INFO L85 PathProgramCache]: Analyzing trace with hash 363946760, now seen corresponding path program 26 times [2022-04-28 07:45:38,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:45:38,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715359457] [2022-04-28 07:45:38,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:45:38,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:45:38,348 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:45:38,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1664759353] [2022-04-28 07:45:38,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:45:38,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:45:38,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:45:38,349 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:45:38,350 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:45:39,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:45:39,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:45:39,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 07:45:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:45:39,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:45:39,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {7884#true} call ULTIMATE.init(); {7884#true} is VALID [2022-04-28 07:45:39,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {7884#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); {7884#true} is VALID [2022-04-28 07:45:39,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {7884#true} assume true; {7884#true} is VALID [2022-04-28 07:45:39,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7884#true} {7884#true} #60#return; {7884#true} is VALID [2022-04-28 07:45:39,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {7884#true} call #t~ret5 := main(); {7884#true} is VALID [2022-04-28 07:45:39,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {7884#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; {7884#true} is VALID [2022-04-28 07:45:39,742 INFO L272 TraceCheckUtils]: 6: Hoare triple {7884#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {7884#true} is VALID [2022-04-28 07:45:39,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {7884#true} ~cond := #in~cond; {7884#true} is VALID [2022-04-28 07:45:39,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {7884#true} assume !(0 == ~cond); {7884#true} is VALID [2022-04-28 07:45:39,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {7884#true} assume true; {7884#true} is VALID [2022-04-28 07:45:39,750 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7884#true} {7884#true} #52#return; {7884#true} is VALID [2022-04-28 07:45:39,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {7884#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7922#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:39,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {7922#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7922#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:39,751 INFO L272 TraceCheckUtils]: 13: Hoare triple {7922#(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)); {7884#true} is VALID [2022-04-28 07:45:39,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {7884#true} ~cond := #in~cond; {7884#true} is VALID [2022-04-28 07:45:39,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {7884#true} assume !(0 == ~cond); {7884#true} is VALID [2022-04-28 07:45:39,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {7884#true} assume true; {7884#true} is VALID [2022-04-28 07:45:39,752 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7884#true} {7922#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {7922#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:39,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {7922#(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; {7944#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:45:39,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {7944#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {7944#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:45:39,753 INFO L272 TraceCheckUtils]: 20: Hoare triple {7944#(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)); {7884#true} is VALID [2022-04-28 07:45:39,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {7884#true} ~cond := #in~cond; {7884#true} is VALID [2022-04-28 07:45:39,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {7884#true} assume !(0 == ~cond); {7884#true} is VALID [2022-04-28 07:45:39,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {7884#true} assume true; {7884#true} is VALID [2022-04-28 07:45:39,753 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7884#true} {7944#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {7944#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:45:39,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {7944#(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; {7966#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:45:39,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {7966#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {7966#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:45:39,754 INFO L272 TraceCheckUtils]: 27: Hoare triple {7966#(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)); {7884#true} is VALID [2022-04-28 07:45:39,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {7884#true} ~cond := #in~cond; {7884#true} is VALID [2022-04-28 07:45:39,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {7884#true} assume !(0 == ~cond); {7884#true} is VALID [2022-04-28 07:45:39,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {7884#true} assume true; {7884#true} is VALID [2022-04-28 07:45:39,755 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7884#true} {7966#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #54#return; {7966#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:45:39,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {7966#(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; {7988#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:45:39,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {7988#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {7988#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:45:39,756 INFO L272 TraceCheckUtils]: 34: Hoare triple {7988#(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)); {7884#true} is VALID [2022-04-28 07:45:39,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {7884#true} ~cond := #in~cond; {7884#true} is VALID [2022-04-28 07:45:39,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {7884#true} assume !(0 == ~cond); {7884#true} is VALID [2022-04-28 07:45:39,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {7884#true} assume true; {7884#true} is VALID [2022-04-28 07:45:39,757 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7884#true} {7988#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {7988#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:45:39,757 INFO L290 TraceCheckUtils]: 39: Hoare triple {7988#(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; {8010#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:45:39,757 INFO L290 TraceCheckUtils]: 40: Hoare triple {8010#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {8010#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:45:39,758 INFO L272 TraceCheckUtils]: 41: Hoare triple {8010#(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)); {7884#true} is VALID [2022-04-28 07:45:39,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {7884#true} ~cond := #in~cond; {7884#true} is VALID [2022-04-28 07:45:39,758 INFO L290 TraceCheckUtils]: 43: Hoare triple {7884#true} assume !(0 == ~cond); {7884#true} is VALID [2022-04-28 07:45:39,758 INFO L290 TraceCheckUtils]: 44: Hoare triple {7884#true} assume true; {7884#true} is VALID [2022-04-28 07:45:39,758 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7884#true} {8010#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {8010#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:45:39,759 INFO L290 TraceCheckUtils]: 46: Hoare triple {8010#(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; {8032#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:45:39,759 INFO L290 TraceCheckUtils]: 47: Hoare triple {8032#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {8032#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:45:39,759 INFO L272 TraceCheckUtils]: 48: Hoare triple {8032#(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)); {7884#true} is VALID [2022-04-28 07:45:39,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {7884#true} ~cond := #in~cond; {7884#true} is VALID [2022-04-28 07:45:39,759 INFO L290 TraceCheckUtils]: 50: Hoare triple {7884#true} assume !(0 == ~cond); {7884#true} is VALID [2022-04-28 07:45:39,759 INFO L290 TraceCheckUtils]: 51: Hoare triple {7884#true} assume true; {7884#true} is VALID [2022-04-28 07:45:39,760 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7884#true} {8032#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {8032#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:45:39,760 INFO L290 TraceCheckUtils]: 53: Hoare triple {8032#(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; {8054#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:45:39,761 INFO L290 TraceCheckUtils]: 54: Hoare triple {8054#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {8054#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:45:39,761 INFO L272 TraceCheckUtils]: 55: Hoare triple {8054#(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)); {7884#true} is VALID [2022-04-28 07:45:39,761 INFO L290 TraceCheckUtils]: 56: Hoare triple {7884#true} ~cond := #in~cond; {7884#true} is VALID [2022-04-28 07:45:39,761 INFO L290 TraceCheckUtils]: 57: Hoare triple {7884#true} assume !(0 == ~cond); {7884#true} is VALID [2022-04-28 07:45:39,761 INFO L290 TraceCheckUtils]: 58: Hoare triple {7884#true} assume true; {7884#true} is VALID [2022-04-28 07:45:39,761 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7884#true} {8054#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {8054#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:45:39,762 INFO L290 TraceCheckUtils]: 60: Hoare triple {8054#(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; {8076#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:45:39,762 INFO L290 TraceCheckUtils]: 61: Hoare triple {8076#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {8076#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:45:39,762 INFO L272 TraceCheckUtils]: 62: Hoare triple {8076#(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)); {7884#true} is VALID [2022-04-28 07:45:39,762 INFO L290 TraceCheckUtils]: 63: Hoare triple {7884#true} ~cond := #in~cond; {7884#true} is VALID [2022-04-28 07:45:39,762 INFO L290 TraceCheckUtils]: 64: Hoare triple {7884#true} assume !(0 == ~cond); {7884#true} is VALID [2022-04-28 07:45:39,762 INFO L290 TraceCheckUtils]: 65: Hoare triple {7884#true} assume true; {7884#true} is VALID [2022-04-28 07:45:39,763 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7884#true} {8076#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #54#return; {8076#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:45:39,763 INFO L290 TraceCheckUtils]: 67: Hoare triple {8076#(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; {8098#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 07:45:39,764 INFO L290 TraceCheckUtils]: 68: Hoare triple {8098#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {8098#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 07:45:39,764 INFO L272 TraceCheckUtils]: 69: Hoare triple {8098#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7884#true} is VALID [2022-04-28 07:45:39,764 INFO L290 TraceCheckUtils]: 70: Hoare triple {7884#true} ~cond := #in~cond; {7884#true} is VALID [2022-04-28 07:45:39,764 INFO L290 TraceCheckUtils]: 71: Hoare triple {7884#true} assume !(0 == ~cond); {7884#true} is VALID [2022-04-28 07:45:39,764 INFO L290 TraceCheckUtils]: 72: Hoare triple {7884#true} assume true; {7884#true} is VALID [2022-04-28 07:45:39,764 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7884#true} {8098#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #54#return; {8098#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 07:45:39,765 INFO L290 TraceCheckUtils]: 74: Hoare triple {8098#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8120#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:45:39,765 INFO L290 TraceCheckUtils]: 75: Hoare triple {8120#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !false; {8120#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:45:39,765 INFO L272 TraceCheckUtils]: 76: Hoare triple {8120#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7884#true} is VALID [2022-04-28 07:45:39,765 INFO L290 TraceCheckUtils]: 77: Hoare triple {7884#true} ~cond := #in~cond; {7884#true} is VALID [2022-04-28 07:45:39,765 INFO L290 TraceCheckUtils]: 78: Hoare triple {7884#true} assume !(0 == ~cond); {7884#true} is VALID [2022-04-28 07:45:39,765 INFO L290 TraceCheckUtils]: 79: Hoare triple {7884#true} assume true; {7884#true} is VALID [2022-04-28 07:45:39,766 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7884#true} {8120#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #54#return; {8120#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:45:39,766 INFO L290 TraceCheckUtils]: 81: Hoare triple {8120#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8142#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-28 07:45:39,767 INFO L290 TraceCheckUtils]: 82: Hoare triple {8142#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !false; {8142#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-28 07:45:39,767 INFO L272 TraceCheckUtils]: 83: Hoare triple {8142#(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)); {7884#true} is VALID [2022-04-28 07:45:39,767 INFO L290 TraceCheckUtils]: 84: Hoare triple {7884#true} ~cond := #in~cond; {7884#true} is VALID [2022-04-28 07:45:39,767 INFO L290 TraceCheckUtils]: 85: Hoare triple {7884#true} assume !(0 == ~cond); {7884#true} is VALID [2022-04-28 07:45:39,767 INFO L290 TraceCheckUtils]: 86: Hoare triple {7884#true} assume true; {7884#true} is VALID [2022-04-28 07:45:39,767 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {7884#true} {8142#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} #54#return; {8142#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-28 07:45:39,768 INFO L290 TraceCheckUtils]: 88: Hoare triple {8142#(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; {8164#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:45:39,768 INFO L290 TraceCheckUtils]: 89: Hoare triple {8164#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {8164#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:45:39,768 INFO L272 TraceCheckUtils]: 90: Hoare triple {8164#(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)); {7884#true} is VALID [2022-04-28 07:45:39,768 INFO L290 TraceCheckUtils]: 91: Hoare triple {7884#true} ~cond := #in~cond; {7884#true} is VALID [2022-04-28 07:45:39,768 INFO L290 TraceCheckUtils]: 92: Hoare triple {7884#true} assume !(0 == ~cond); {7884#true} is VALID [2022-04-28 07:45:39,769 INFO L290 TraceCheckUtils]: 93: Hoare triple {7884#true} assume true; {7884#true} is VALID [2022-04-28 07:45:39,769 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7884#true} {8164#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {8164#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:45:39,769 INFO L290 TraceCheckUtils]: 95: Hoare triple {8164#(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; {8186#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:45:39,770 INFO L290 TraceCheckUtils]: 96: Hoare triple {8186#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !false; {8186#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:45:39,770 INFO L272 TraceCheckUtils]: 97: Hoare triple {8186#(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)); {7884#true} is VALID [2022-04-28 07:45:39,770 INFO L290 TraceCheckUtils]: 98: Hoare triple {7884#true} ~cond := #in~cond; {7884#true} is VALID [2022-04-28 07:45:39,770 INFO L290 TraceCheckUtils]: 99: Hoare triple {7884#true} assume !(0 == ~cond); {7884#true} is VALID [2022-04-28 07:45:39,770 INFO L290 TraceCheckUtils]: 100: Hoare triple {7884#true} assume true; {7884#true} is VALID [2022-04-28 07:45:39,771 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {7884#true} {8186#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #54#return; {8186#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:45:39,771 INFO L290 TraceCheckUtils]: 102: Hoare triple {8186#(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; {8208#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:45:39,772 INFO L290 TraceCheckUtils]: 103: Hoare triple {8208#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !false; {8208#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:45:39,772 INFO L272 TraceCheckUtils]: 104: Hoare triple {8208#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7884#true} is VALID [2022-04-28 07:45:39,772 INFO L290 TraceCheckUtils]: 105: Hoare triple {7884#true} ~cond := #in~cond; {7884#true} is VALID [2022-04-28 07:45:39,772 INFO L290 TraceCheckUtils]: 106: Hoare triple {7884#true} assume !(0 == ~cond); {7884#true} is VALID [2022-04-28 07:45:39,772 INFO L290 TraceCheckUtils]: 107: Hoare triple {7884#true} assume true; {7884#true} is VALID [2022-04-28 07:45:39,773 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {7884#true} {8208#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #54#return; {8208#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:45:39,773 INFO L290 TraceCheckUtils]: 109: Hoare triple {8208#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !(~c~0 < ~k~0); {8230#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:45:39,774 INFO L272 TraceCheckUtils]: 110: Hoare triple {8230#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8234#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:45:39,774 INFO L290 TraceCheckUtils]: 111: Hoare triple {8234#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8238#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:45:39,774 INFO L290 TraceCheckUtils]: 112: Hoare triple {8238#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7885#false} is VALID [2022-04-28 07:45:39,774 INFO L290 TraceCheckUtils]: 113: Hoare triple {7885#false} assume !false; {7885#false} is VALID [2022-04-28 07:45:39,775 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:45:39,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:45:40,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:45:40,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715359457] [2022-04-28 07:45:40,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:45:40,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664759353] [2022-04-28 07:45:40,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664759353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:45:40,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:45:40,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-28 07:45:40,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:45:40,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [935299303] [2022-04-28 07:45:40,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [935299303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:45:40,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:45:40,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 07:45:40,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040169242] [2022-04-28 07:45:40,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:45:40,062 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:45:40,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:45:40,063 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:45:40,120 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:45:40,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 07:45:40,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:40,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 07:45:40,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-28 07:45:40,121 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:45:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:41,651 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-04-28 07:45:41,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 07:45:41,651 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:45:41,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:45:41,651 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:45:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 84 transitions. [2022-04-28 07:45:41,653 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:45:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 84 transitions. [2022-04-28 07:45:41,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 84 transitions. [2022-04-28 07:45:41,735 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:45:41,736 INFO L225 Difference]: With dead ends: 75 [2022-04-28 07:45:41,737 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 07:45:41,737 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:45:41,737 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 07:45:41,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 583 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 07:45:41,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 07:45:41,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 07:45:41,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:45:41,790 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:45:41,790 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:45:41,790 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:45:41,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:41,792 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-28 07:45:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 07:45:41,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:41,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:41,792 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:45:41,792 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:45:41,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:41,794 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-28 07:45:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 07:45:41,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:41,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:41,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:45:41,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:45:41,794 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:45:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-04-28 07:45:41,796 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 114 [2022-04-28 07:45:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:45:41,796 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-04-28 07:45:41,796 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:45:41,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 83 transitions. [2022-04-28 07:45:41,926 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:45:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 07:45:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 07:45:41,927 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:45:41,927 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:45:41,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-28 07:45:42,127 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:45:42,128 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:45:42,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:45:42,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2101455607, now seen corresponding path program 27 times [2022-04-28 07:45:42,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:42,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1749396909] [2022-04-28 07:45:42,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:45:42,202 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:45:42,202 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:45:42,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2101455607, now seen corresponding path program 28 times [2022-04-28 07:45:42,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:45:42,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218844062] [2022-04-28 07:45:42,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:45:42,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:45:42,213 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:45:42,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [153179411] [2022-04-28 07:45:42,213 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:45:42,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:45:42,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:45:42,215 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:45:42,215 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:45:43,174 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:45:43,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:45:43,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-28 07:45:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:45:43,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:45:43,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {8720#true} call ULTIMATE.init(); {8720#true} is VALID [2022-04-28 07:45:43,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {8720#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); {8720#true} is VALID [2022-04-28 07:45:43,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8720#true} {8720#true} #60#return; {8720#true} is VALID [2022-04-28 07:45:43,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {8720#true} call #t~ret5 := main(); {8720#true} is VALID [2022-04-28 07:45:43,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {8720#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; {8720#true} is VALID [2022-04-28 07:45:43,855 INFO L272 TraceCheckUtils]: 6: Hoare triple {8720#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {8720#true} is VALID [2022-04-28 07:45:43,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 07:45:43,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 07:45:43,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,855 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8720#true} {8720#true} #52#return; {8720#true} is VALID [2022-04-28 07:45:43,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {8720#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8758#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:43,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {8758#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {8758#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:43,856 INFO L272 TraceCheckUtils]: 13: Hoare triple {8758#(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)); {8720#true} is VALID [2022-04-28 07:45:43,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 07:45:43,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 07:45:43,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,857 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8720#true} {8758#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {8758#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:43,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {8758#(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; {8780#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:45:43,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {8780#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {8780#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:45:43,858 INFO L272 TraceCheckUtils]: 20: Hoare triple {8780#(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)); {8720#true} is VALID [2022-04-28 07:45:43,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 07:45:43,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 07:45:43,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,858 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8720#true} {8780#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {8780#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:45:43,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {8780#(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; {8802#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:45:43,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {8802#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {8802#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:45:43,859 INFO L272 TraceCheckUtils]: 27: Hoare triple {8802#(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)); {8720#true} is VALID [2022-04-28 07:45:43,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 07:45:43,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 07:45:43,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,860 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8720#true} {8802#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {8802#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:45:43,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {8802#(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; {8824#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:45:43,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {8824#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {8824#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:45:43,860 INFO L272 TraceCheckUtils]: 34: Hoare triple {8824#(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)); {8720#true} is VALID [2022-04-28 07:45:43,861 INFO L290 TraceCheckUtils]: 35: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 07:45:43,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 07:45:43,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,861 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8720#true} {8824#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {8824#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:45:43,861 INFO L290 TraceCheckUtils]: 39: Hoare triple {8824#(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; {8846#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:45:43,862 INFO L290 TraceCheckUtils]: 40: Hoare triple {8846#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {8846#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:45:43,862 INFO L272 TraceCheckUtils]: 41: Hoare triple {8846#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8720#true} is VALID [2022-04-28 07:45:43,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 07:45:43,862 INFO L290 TraceCheckUtils]: 43: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 07:45:43,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,863 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8720#true} {8846#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #54#return; {8846#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:45:43,863 INFO L290 TraceCheckUtils]: 46: Hoare triple {8846#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8868#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:45:43,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {8868#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {8868#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:45:43,863 INFO L272 TraceCheckUtils]: 48: Hoare triple {8868#(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)); {8720#true} is VALID [2022-04-28 07:45:43,863 INFO L290 TraceCheckUtils]: 49: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 07:45:43,863 INFO L290 TraceCheckUtils]: 50: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 07:45:43,864 INFO L290 TraceCheckUtils]: 51: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,864 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8720#true} {8868#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {8868#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:45:43,864 INFO L290 TraceCheckUtils]: 53: Hoare triple {8868#(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; {8890#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:45:43,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {8890#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {8890#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:45:43,865 INFO L272 TraceCheckUtils]: 55: Hoare triple {8890#(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)); {8720#true} is VALID [2022-04-28 07:45:43,865 INFO L290 TraceCheckUtils]: 56: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 07:45:43,865 INFO L290 TraceCheckUtils]: 57: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 07:45:43,865 INFO L290 TraceCheckUtils]: 58: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,866 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8720#true} {8890#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {8890#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:45:43,866 INFO L290 TraceCheckUtils]: 60: Hoare triple {8890#(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; {8912#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:45:43,866 INFO L290 TraceCheckUtils]: 61: Hoare triple {8912#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !false; {8912#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:45:43,866 INFO L272 TraceCheckUtils]: 62: Hoare triple {8912#(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)); {8720#true} is VALID [2022-04-28 07:45:43,866 INFO L290 TraceCheckUtils]: 63: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 07:45:43,867 INFO L290 TraceCheckUtils]: 64: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 07:45:43,867 INFO L290 TraceCheckUtils]: 65: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,867 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8720#true} {8912#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} #54#return; {8912#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:45:43,867 INFO L290 TraceCheckUtils]: 67: Hoare triple {8912#(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; {8934#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:45:43,868 INFO L290 TraceCheckUtils]: 68: Hoare triple {8934#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {8934#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:45:43,868 INFO L272 TraceCheckUtils]: 69: Hoare triple {8934#(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)); {8720#true} is VALID [2022-04-28 07:45:43,868 INFO L290 TraceCheckUtils]: 70: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 07:45:43,868 INFO L290 TraceCheckUtils]: 71: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 07:45:43,868 INFO L290 TraceCheckUtils]: 72: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,869 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8720#true} {8934#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #54#return; {8934#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:45:43,869 INFO L290 TraceCheckUtils]: 74: Hoare triple {8934#(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; {8956#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:45:43,869 INFO L290 TraceCheckUtils]: 75: Hoare triple {8956#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {8956#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:45:43,869 INFO L272 TraceCheckUtils]: 76: Hoare triple {8956#(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)); {8720#true} is VALID [2022-04-28 07:45:43,869 INFO L290 TraceCheckUtils]: 77: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 07:45:43,870 INFO L290 TraceCheckUtils]: 78: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 07:45:43,870 INFO L290 TraceCheckUtils]: 79: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,870 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {8720#true} {8956#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #54#return; {8956#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:45:43,870 INFO L290 TraceCheckUtils]: 81: Hoare triple {8956#(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; {8978#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:45:43,871 INFO L290 TraceCheckUtils]: 82: Hoare triple {8978#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {8978#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:45:43,871 INFO L272 TraceCheckUtils]: 83: Hoare triple {8978#(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)); {8720#true} is VALID [2022-04-28 07:45:43,871 INFO L290 TraceCheckUtils]: 84: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 07:45:43,871 INFO L290 TraceCheckUtils]: 85: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 07:45:43,871 INFO L290 TraceCheckUtils]: 86: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,871 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {8720#true} {8978#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {8978#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:45:43,872 INFO L290 TraceCheckUtils]: 88: Hoare triple {8978#(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; {9000#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:45:43,872 INFO L290 TraceCheckUtils]: 89: Hoare triple {9000#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !false; {9000#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:45:43,872 INFO L272 TraceCheckUtils]: 90: Hoare triple {9000#(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)); {8720#true} is VALID [2022-04-28 07:45:43,872 INFO L290 TraceCheckUtils]: 91: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 07:45:43,872 INFO L290 TraceCheckUtils]: 92: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 07:45:43,872 INFO L290 TraceCheckUtils]: 93: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,873 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8720#true} {9000#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} #54#return; {9000#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:45:43,873 INFO L290 TraceCheckUtils]: 95: Hoare triple {9000#(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; {9022#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-28 07:45:43,874 INFO L290 TraceCheckUtils]: 96: Hoare triple {9022#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} assume !false; {9022#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-28 07:45:43,874 INFO L272 TraceCheckUtils]: 97: Hoare triple {9022#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8720#true} is VALID [2022-04-28 07:45:43,874 INFO L290 TraceCheckUtils]: 98: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 07:45:43,874 INFO L290 TraceCheckUtils]: 99: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 07:45:43,874 INFO L290 TraceCheckUtils]: 100: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,874 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {8720#true} {9022#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} #54#return; {9022#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-28 07:45:43,875 INFO L290 TraceCheckUtils]: 102: Hoare triple {9022#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9044#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-28 07:45:43,875 INFO L290 TraceCheckUtils]: 103: Hoare triple {9044#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} assume !false; {9044#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-28 07:45:43,875 INFO L272 TraceCheckUtils]: 104: Hoare triple {9044#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8720#true} is VALID [2022-04-28 07:45:43,875 INFO L290 TraceCheckUtils]: 105: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 07:45:43,875 INFO L290 TraceCheckUtils]: 106: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 07:45:43,875 INFO L290 TraceCheckUtils]: 107: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,876 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {8720#true} {9044#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} #54#return; {9044#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-28 07:45:43,876 INFO L290 TraceCheckUtils]: 109: Hoare triple {9044#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9066#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} is VALID [2022-04-28 07:45:43,877 INFO L290 TraceCheckUtils]: 110: Hoare triple {9066#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} assume !false; {9066#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} is VALID [2022-04-28 07:45:43,877 INFO L272 TraceCheckUtils]: 111: Hoare triple {9066#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= 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)); {8720#true} is VALID [2022-04-28 07:45:43,877 INFO L290 TraceCheckUtils]: 112: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 07:45:43,877 INFO L290 TraceCheckUtils]: 113: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 07:45:43,877 INFO L290 TraceCheckUtils]: 114: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 07:45:43,877 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {8720#true} {9066#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} #54#return; {9066#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} is VALID [2022-04-28 07:45:43,878 INFO L290 TraceCheckUtils]: 116: Hoare triple {9066#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {9088#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~k~0 14))} is VALID [2022-04-28 07:45:43,879 INFO L272 TraceCheckUtils]: 117: Hoare triple {9088#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~k~0 14))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9092#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:45:43,879 INFO L290 TraceCheckUtils]: 118: Hoare triple {9092#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9096#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:45:43,880 INFO L290 TraceCheckUtils]: 119: Hoare triple {9096#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8721#false} is VALID [2022-04-28 07:45:43,880 INFO L290 TraceCheckUtils]: 120: Hoare triple {8721#false} assume !false; {8721#false} is VALID [2022-04-28 07:45:43,880 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:45:43,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:45:44,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:45:44,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218844062] [2022-04-28 07:45:44,150 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:45:44,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153179411] [2022-04-28 07:45:44,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153179411] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:45:44,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:45:44,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-28 07:45:44,150 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:45:44,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1749396909] [2022-04-28 07:45:44,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1749396909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:45:44,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:45:44,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 07:45:44,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086654166] [2022-04-28 07:45:44,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:45:44,151 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:45:44,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:45:44,152 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:45:44,197 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:45:44,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 07:45:44,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:44,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 07:45:44,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-28 07:45:44,198 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:45:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:46,011 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2022-04-28 07:45:46,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 07:45:46,011 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:45:46,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:45:46,012 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:45:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-28 07:45:46,014 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:45:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-28 07:45:46,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 88 transitions. [2022-04-28 07:45:46,112 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:45:46,113 INFO L225 Difference]: With dead ends: 78 [2022-04-28 07:45:46,114 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 07:45:46,114 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:45:46,114 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 07:45:46,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 635 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 07:45:46,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 07:45:46,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-28 07:45:46,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:45:46,171 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:45:46,172 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:45:46,172 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:45:46,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:46,173 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-28 07:45:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-28 07:45:46,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:46,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:46,174 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:45:46,174 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:45:46,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:46,179 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-28 07:45:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-28 07:45:46,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:46,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:46,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:45:46,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:45:46,180 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:45:46,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2022-04-28 07:45:46,181 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 121 [2022-04-28 07:45:46,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:45:46,181 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2022-04-28 07:45:46,181 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:45:46,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 87 transitions. [2022-04-28 07:45:46,284 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:45:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-28 07:45:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-28 07:45:46,285 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:45:46,285 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:45:46,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-28 07:45:46,490 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:45:46,490 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:45:46,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:45:46,491 INFO L85 PathProgramCache]: Analyzing trace with hash -729919512, now seen corresponding path program 29 times [2022-04-28 07:45:46,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:46,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1465049720] [2022-04-28 07:45:46,567 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:45:46,567 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:45:46,567 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:45:46,567 INFO L85 PathProgramCache]: Analyzing trace with hash -729919512, now seen corresponding path program 30 times [2022-04-28 07:45:46,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:45:46,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76363324] [2022-04-28 07:45:46,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:45:46,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:45:46,579 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:45:46,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1678311396] [2022-04-28 07:45:46,579 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:45:46,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:45:46,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:45:46,580 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:45:46,581 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:45:46,984 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 07:45:46,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:45:46,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-28 07:45:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:45:47,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:45:47,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {9596#true} call ULTIMATE.init(); {9596#true} is VALID [2022-04-28 07:45:47,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {9596#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); {9596#true} is VALID [2022-04-28 07:45:47,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9596#true} {9596#true} #60#return; {9596#true} is VALID [2022-04-28 07:45:47,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {9596#true} call #t~ret5 := main(); {9596#true} is VALID [2022-04-28 07:45:47,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {9596#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; {9596#true} is VALID [2022-04-28 07:45:47,509 INFO L272 TraceCheckUtils]: 6: Hoare triple {9596#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {9596#true} is VALID [2022-04-28 07:45:47,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,509 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9596#true} {9596#true} #52#return; {9596#true} is VALID [2022-04-28 07:45:47,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {9596#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9634#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:47,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {9634#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {9634#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:47,510 INFO L272 TraceCheckUtils]: 13: Hoare triple {9634#(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)); {9596#true} is VALID [2022-04-28 07:45:47,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,510 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9596#true} {9634#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {9634#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:47,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {9634#(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; {9656#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:45:47,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {9656#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {9656#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:45:47,511 INFO L272 TraceCheckUtils]: 20: Hoare triple {9656#(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)); {9596#true} is VALID [2022-04-28 07:45:47,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,511 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9596#true} {9656#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {9656#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:45:47,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {9656#(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; {9678#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:45:47,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {9678#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {9678#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:45:47,512 INFO L272 TraceCheckUtils]: 27: Hoare triple {9678#(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)); {9596#true} is VALID [2022-04-28 07:45:47,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,512 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9596#true} {9678#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {9678#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:45:47,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {9678#(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; {9700#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 07:45:47,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {9700#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !false; {9700#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 07:45:47,513 INFO L272 TraceCheckUtils]: 34: Hoare triple {9700#(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)); {9596#true} is VALID [2022-04-28 07:45:47,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,513 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9596#true} {9700#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} #54#return; {9700#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 07:45:47,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {9700#(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; {9722#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:45:47,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {9722#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {9722#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:45:47,514 INFO L272 TraceCheckUtils]: 41: Hoare triple {9722#(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)); {9596#true} is VALID [2022-04-28 07:45:47,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,515 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9596#true} {9722#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {9722#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:45:47,515 INFO L290 TraceCheckUtils]: 46: Hoare triple {9722#(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; {9744#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:45:47,515 INFO L290 TraceCheckUtils]: 47: Hoare triple {9744#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {9744#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:45:47,515 INFO L272 TraceCheckUtils]: 48: Hoare triple {9744#(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)); {9596#true} is VALID [2022-04-28 07:45:47,515 INFO L290 TraceCheckUtils]: 49: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,515 INFO L290 TraceCheckUtils]: 50: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,515 INFO L290 TraceCheckUtils]: 51: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,516 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9596#true} {9744#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {9744#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:45:47,516 INFO L290 TraceCheckUtils]: 53: Hoare triple {9744#(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; {9766#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:45:47,516 INFO L290 TraceCheckUtils]: 54: Hoare triple {9766#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !false; {9766#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:45:47,516 INFO L272 TraceCheckUtils]: 55: Hoare triple {9766#(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)); {9596#true} is VALID [2022-04-28 07:45:47,516 INFO L290 TraceCheckUtils]: 56: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,516 INFO L290 TraceCheckUtils]: 57: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,517 INFO L290 TraceCheckUtils]: 58: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,517 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9596#true} {9766#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #54#return; {9766#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:45:47,517 INFO L290 TraceCheckUtils]: 60: Hoare triple {9766#(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; {9788#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-28 07:45:47,517 INFO L290 TraceCheckUtils]: 61: Hoare triple {9788#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {9788#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-28 07:45:47,517 INFO L272 TraceCheckUtils]: 62: Hoare triple {9788#(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)); {9596#true} is VALID [2022-04-28 07:45:47,517 INFO L290 TraceCheckUtils]: 63: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,518 INFO L290 TraceCheckUtils]: 64: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,518 INFO L290 TraceCheckUtils]: 65: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,518 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9596#true} {9788#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #54#return; {9788#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-28 07:45:47,518 INFO L290 TraceCheckUtils]: 67: Hoare triple {9788#(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; {9810#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:45:47,518 INFO L290 TraceCheckUtils]: 68: Hoare triple {9810#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {9810#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:45:47,519 INFO L272 TraceCheckUtils]: 69: Hoare triple {9810#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)) (< 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)); {9596#true} is VALID [2022-04-28 07:45:47,519 INFO L290 TraceCheckUtils]: 70: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,519 INFO L290 TraceCheckUtils]: 71: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,519 INFO L290 TraceCheckUtils]: 72: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,519 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9596#true} {9810#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {9810#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:45:47,520 INFO L290 TraceCheckUtils]: 74: Hoare triple {9810#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)) (< 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; {9832#(and (< 7 main_~k~0) (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:45:47,520 INFO L290 TraceCheckUtils]: 75: Hoare triple {9832#(and (< 7 main_~k~0) (= main_~y~0 9) (= main_~c~0 9))} assume !false; {9832#(and (< 7 main_~k~0) (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:45:47,520 INFO L272 TraceCheckUtils]: 76: Hoare triple {9832#(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)); {9596#true} is VALID [2022-04-28 07:45:47,520 INFO L290 TraceCheckUtils]: 77: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,520 INFO L290 TraceCheckUtils]: 78: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,520 INFO L290 TraceCheckUtils]: 79: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,521 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9596#true} {9832#(and (< 7 main_~k~0) (= main_~y~0 9) (= main_~c~0 9))} #54#return; {9832#(and (< 7 main_~k~0) (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:45:47,521 INFO L290 TraceCheckUtils]: 81: Hoare triple {9832#(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; {9854#(and (< 7 main_~k~0) (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:45:47,521 INFO L290 TraceCheckUtils]: 82: Hoare triple {9854#(and (< 7 main_~k~0) (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {9854#(and (< 7 main_~k~0) (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:45:47,521 INFO L272 TraceCheckUtils]: 83: Hoare triple {9854#(and (< 7 main_~k~0) (= 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)); {9596#true} is VALID [2022-04-28 07:45:47,521 INFO L290 TraceCheckUtils]: 84: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,521 INFO L290 TraceCheckUtils]: 85: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,521 INFO L290 TraceCheckUtils]: 86: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,522 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {9596#true} {9854#(and (< 7 main_~k~0) (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #54#return; {9854#(and (< 7 main_~k~0) (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:45:47,522 INFO L290 TraceCheckUtils]: 88: Hoare triple {9854#(and (< 7 main_~k~0) (= 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; {9876#(and (< 7 main_~k~0) (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:45:47,522 INFO L290 TraceCheckUtils]: 89: Hoare triple {9876#(and (< 7 main_~k~0) (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} assume !false; {9876#(and (< 7 main_~k~0) (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:45:47,522 INFO L272 TraceCheckUtils]: 90: Hoare triple {9876#(and (< 7 main_~k~0) (= 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)); {9596#true} is VALID [2022-04-28 07:45:47,522 INFO L290 TraceCheckUtils]: 91: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,522 INFO L290 TraceCheckUtils]: 92: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,523 INFO L290 TraceCheckUtils]: 93: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,523 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {9596#true} {9876#(and (< 7 main_~k~0) (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} #54#return; {9876#(and (< 7 main_~k~0) (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:45:47,523 INFO L290 TraceCheckUtils]: 95: Hoare triple {9876#(and (< 7 main_~k~0) (= 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; {9898#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-28 07:45:47,523 INFO L290 TraceCheckUtils]: 96: Hoare triple {9898#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9))} assume !false; {9898#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-28 07:45:47,524 INFO L272 TraceCheckUtils]: 97: Hoare triple {9898#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 11) (= (+ 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)); {9596#true} is VALID [2022-04-28 07:45:47,524 INFO L290 TraceCheckUtils]: 98: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,524 INFO L290 TraceCheckUtils]: 99: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,524 INFO L290 TraceCheckUtils]: 100: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,524 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9596#true} {9898#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9))} #54#return; {9898#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-28 07:45:47,524 INFO L290 TraceCheckUtils]: 102: Hoare triple {9898#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 11) (= (+ 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; {9920#(and (< 7 main_~k~0) (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-28 07:45:47,525 INFO L290 TraceCheckUtils]: 103: Hoare triple {9920#(and (< 7 main_~k~0) (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} assume !false; {9920#(and (< 7 main_~k~0) (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-28 07:45:47,525 INFO L272 TraceCheckUtils]: 104: Hoare triple {9920#(and (< 7 main_~k~0) (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9596#true} is VALID [2022-04-28 07:45:47,525 INFO L290 TraceCheckUtils]: 105: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,525 INFO L290 TraceCheckUtils]: 106: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,525 INFO L290 TraceCheckUtils]: 107: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,525 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9596#true} {9920#(and (< 7 main_~k~0) (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} #54#return; {9920#(and (< 7 main_~k~0) (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-28 07:45:47,525 INFO L290 TraceCheckUtils]: 109: Hoare triple {9920#(and (< 7 main_~k~0) (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9942#(and (< 7 main_~k~0) (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:45:47,526 INFO L290 TraceCheckUtils]: 110: Hoare triple {9942#(and (< 7 main_~k~0) (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} assume !false; {9942#(and (< 7 main_~k~0) (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:45:47,526 INFO L272 TraceCheckUtils]: 111: Hoare triple {9942#(and (< 7 main_~k~0) (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9596#true} is VALID [2022-04-28 07:45:47,526 INFO L290 TraceCheckUtils]: 112: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,526 INFO L290 TraceCheckUtils]: 113: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,526 INFO L290 TraceCheckUtils]: 114: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,526 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {9596#true} {9942#(and (< 7 main_~k~0) (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} #54#return; {9942#(and (< 7 main_~k~0) (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:45:47,527 INFO L290 TraceCheckUtils]: 116: Hoare triple {9942#(and (< 7 main_~k~0) (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9964#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-28 07:45:47,527 INFO L290 TraceCheckUtils]: 117: Hoare triple {9964#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} assume !false; {9964#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-28 07:45:47,527 INFO L272 TraceCheckUtils]: 118: Hoare triple {9964#(and (= main_~y~0 15) (< 14 main_~k~0) (<= 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)); {9596#true} is VALID [2022-04-28 07:45:47,527 INFO L290 TraceCheckUtils]: 119: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 07:45:47,527 INFO L290 TraceCheckUtils]: 120: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 07:45:47,527 INFO L290 TraceCheckUtils]: 121: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 07:45:47,527 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9596#true} {9964#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} #54#return; {9964#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-28 07:45:47,528 INFO L290 TraceCheckUtils]: 123: Hoare triple {9964#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} assume !(~c~0 < ~k~0); {9986#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-28 07:45:47,528 INFO L272 TraceCheckUtils]: 124: Hoare triple {9986#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9990#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:45:47,529 INFO L290 TraceCheckUtils]: 125: Hoare triple {9990#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9994#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:45:47,529 INFO L290 TraceCheckUtils]: 126: Hoare triple {9994#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9597#false} is VALID [2022-04-28 07:45:47,529 INFO L290 TraceCheckUtils]: 127: Hoare triple {9597#false} assume !false; {9597#false} is VALID [2022-04-28 07:45:47,529 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:45:47,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:45:48,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:45:48,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76363324] [2022-04-28 07:45:48,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:45:48,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678311396] [2022-04-28 07:45:48,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678311396] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:45:48,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:45:48,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-28 07:45:48,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:45:48,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1465049720] [2022-04-28 07:45:48,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1465049720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:45:48,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:45:48,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 07:45:48,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220371744] [2022-04-28 07:45:48,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:45:48,272 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:45:48,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:45:48,273 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:45:48,343 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:45:48,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 07:45:48,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:48,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 07:45:48,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2022-04-28 07:45:48,345 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:45:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:50,779 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2022-04-28 07:45:50,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 07:45:50,779 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:45:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:45:50,779 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:45:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-28 07:45:50,781 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:45:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-28 07:45:50,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 92 transitions. [2022-04-28 07:45:50,856 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:45:50,857 INFO L225 Difference]: With dead ends: 81 [2022-04-28 07:45:50,857 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 07:45:50,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 07:45:50,858 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:45:50,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 682 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 07:45:50,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 07:45:50,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 07:45:50,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:45:50,920 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:45:50,920 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:45:50,920 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:45:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:50,922 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-28 07:45:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-28 07:45:50,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:50,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:50,922 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:45:50,922 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:45:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:50,924 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-28 07:45:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-28 07:45:50,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:50,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:50,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:45:50,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:45:50,924 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:45:50,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2022-04-28 07:45:50,925 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 128 [2022-04-28 07:45:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:45:50,926 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2022-04-28 07:45:50,926 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:45:50,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 91 transitions. [2022-04-28 07:45:51,056 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:45:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-28 07:45:51,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 07:45:51,056 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:45:51,056 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:45:51,062 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:45:51,262 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:45:51,262 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:45:51,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:45:51,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843369, now seen corresponding path program 31 times [2022-04-28 07:45:51,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:51,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2109446204] [2022-04-28 07:45:51,349 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:45:51,349 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:45:51,349 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:45:51,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843369, now seen corresponding path program 32 times [2022-04-28 07:45:51,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:45:51,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692499009] [2022-04-28 07:45:51,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:45:51,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:45:51,360 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:45:51,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633390204] [2022-04-28 07:45:51,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:45:51,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:45:51,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:45:51,362 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:45:51,363 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:45:51,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:45:51,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:45:51,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-28 07:45:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:45:51,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:45:52,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {10666#true} call ULTIMATE.init(); {10666#true} is VALID [2022-04-28 07:45:52,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {10666#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); {10666#true} is VALID [2022-04-28 07:45:52,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10666#true} {10666#true} #60#return; {10666#true} is VALID [2022-04-28 07:45:52,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {10666#true} call #t~ret5 := main(); {10666#true} is VALID [2022-04-28 07:45:52,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {10666#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; {10666#true} is VALID [2022-04-28 07:45:52,428 INFO L272 TraceCheckUtils]: 6: Hoare triple {10666#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {10666#true} is VALID [2022-04-28 07:45:52,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,428 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10666#true} {10666#true} #52#return; {10666#true} is VALID [2022-04-28 07:45:52,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {10666#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10704#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:52,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {10704#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {10704#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:52,428 INFO L272 TraceCheckUtils]: 13: Hoare triple {10704#(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)); {10666#true} is VALID [2022-04-28 07:45:52,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,429 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10666#true} {10704#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {10704#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:52,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {10704#(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; {10726#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:45:52,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {10726#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {10726#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:45:52,430 INFO L272 TraceCheckUtils]: 20: Hoare triple {10726#(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)); {10666#true} is VALID [2022-04-28 07:45:52,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,430 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10666#true} {10726#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {10726#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:45:52,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {10726#(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; {10748#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:45:52,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {10748#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {10748#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:45:52,431 INFO L272 TraceCheckUtils]: 27: Hoare triple {10748#(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)); {10666#true} is VALID [2022-04-28 07:45:52,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,435 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10666#true} {10748#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {10748#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:45:52,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {10748#(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; {10770#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:45:52,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {10770#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {10770#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:45:52,436 INFO L272 TraceCheckUtils]: 34: Hoare triple {10770#(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)); {10666#true} is VALID [2022-04-28 07:45:52,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,436 INFO L290 TraceCheckUtils]: 37: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,436 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10666#true} {10770#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #54#return; {10770#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:45:52,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {10770#(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; {10792#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:45:52,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {10792#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {10792#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:45:52,437 INFO L272 TraceCheckUtils]: 41: Hoare triple {10792#(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)); {10666#true} is VALID [2022-04-28 07:45:52,437 INFO L290 TraceCheckUtils]: 42: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,437 INFO L290 TraceCheckUtils]: 43: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,437 INFO L290 TraceCheckUtils]: 44: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,437 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10666#true} {10792#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {10792#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:45:52,437 INFO L290 TraceCheckUtils]: 46: Hoare triple {10792#(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; {10814#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:45:52,438 INFO L290 TraceCheckUtils]: 47: Hoare triple {10814#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {10814#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:45:52,438 INFO L272 TraceCheckUtils]: 48: Hoare triple {10814#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10666#true} is VALID [2022-04-28 07:45:52,438 INFO L290 TraceCheckUtils]: 49: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,438 INFO L290 TraceCheckUtils]: 50: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,438 INFO L290 TraceCheckUtils]: 51: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,438 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10666#true} {10814#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #54#return; {10814#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:45:52,439 INFO L290 TraceCheckUtils]: 53: Hoare triple {10814#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10836#(and (= 4 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:45:52,439 INFO L290 TraceCheckUtils]: 54: Hoare triple {10836#(and (= 4 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 4))} assume !false; {10836#(and (= 4 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:45:52,439 INFO L272 TraceCheckUtils]: 55: Hoare triple {10836#(and (= 4 (+ (- 2) main_~c~0)) (= (+ (- 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)); {10666#true} is VALID [2022-04-28 07:45:52,439 INFO L290 TraceCheckUtils]: 56: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,439 INFO L290 TraceCheckUtils]: 57: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,439 INFO L290 TraceCheckUtils]: 58: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,439 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10666#true} {10836#(and (= 4 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 4))} #54#return; {10836#(and (= 4 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:45:52,440 INFO L290 TraceCheckUtils]: 60: Hoare triple {10836#(and (= 4 (+ (- 2) main_~c~0)) (= (+ (- 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; {10858#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:45:52,440 INFO L290 TraceCheckUtils]: 61: Hoare triple {10858#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {10858#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:45:52,440 INFO L272 TraceCheckUtils]: 62: Hoare triple {10858#(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)); {10666#true} is VALID [2022-04-28 07:45:52,440 INFO L290 TraceCheckUtils]: 63: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,440 INFO L290 TraceCheckUtils]: 64: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,440 INFO L290 TraceCheckUtils]: 65: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,441 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10666#true} {10858#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {10858#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:45:52,441 INFO L290 TraceCheckUtils]: 67: Hoare triple {10858#(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; {10880#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 07:45:52,441 INFO L290 TraceCheckUtils]: 68: Hoare triple {10880#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {10880#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 07:45:52,441 INFO L272 TraceCheckUtils]: 69: Hoare triple {10880#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10666#true} is VALID [2022-04-28 07:45:52,441 INFO L290 TraceCheckUtils]: 70: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,441 INFO L290 TraceCheckUtils]: 71: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,441 INFO L290 TraceCheckUtils]: 72: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,442 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10666#true} {10880#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #54#return; {10880#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 07:45:52,442 INFO L290 TraceCheckUtils]: 74: Hoare triple {10880#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10902#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:45:52,442 INFO L290 TraceCheckUtils]: 75: Hoare triple {10902#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {10902#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:45:52,442 INFO L272 TraceCheckUtils]: 76: Hoare triple {10902#(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)); {10666#true} is VALID [2022-04-28 07:45:52,442 INFO L290 TraceCheckUtils]: 77: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,442 INFO L290 TraceCheckUtils]: 78: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,443 INFO L290 TraceCheckUtils]: 79: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,443 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10666#true} {10902#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #54#return; {10902#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:45:52,443 INFO L290 TraceCheckUtils]: 81: Hoare triple {10902#(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; {10924#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:45:52,443 INFO L290 TraceCheckUtils]: 82: Hoare triple {10924#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {10924#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:45:52,444 INFO L272 TraceCheckUtils]: 83: Hoare triple {10924#(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)); {10666#true} is VALID [2022-04-28 07:45:52,444 INFO L290 TraceCheckUtils]: 84: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,444 INFO L290 TraceCheckUtils]: 85: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,444 INFO L290 TraceCheckUtils]: 86: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,444 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {10666#true} {10924#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {10924#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:45:52,444 INFO L290 TraceCheckUtils]: 88: Hoare triple {10924#(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; {10946#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:45:52,445 INFO L290 TraceCheckUtils]: 89: Hoare triple {10946#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {10946#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:45:52,445 INFO L272 TraceCheckUtils]: 90: Hoare triple {10946#(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)); {10666#true} is VALID [2022-04-28 07:45:52,445 INFO L290 TraceCheckUtils]: 91: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,445 INFO L290 TraceCheckUtils]: 92: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,445 INFO L290 TraceCheckUtils]: 93: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,446 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {10666#true} {10946#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #54#return; {10946#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:45:52,446 INFO L290 TraceCheckUtils]: 95: Hoare triple {10946#(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; {10968#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:45:52,446 INFO L290 TraceCheckUtils]: 96: Hoare triple {10968#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} assume !false; {10968#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:45:52,446 INFO L272 TraceCheckUtils]: 97: Hoare triple {10968#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 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)); {10666#true} is VALID [2022-04-28 07:45:52,446 INFO L290 TraceCheckUtils]: 98: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,447 INFO L290 TraceCheckUtils]: 99: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,447 INFO L290 TraceCheckUtils]: 100: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,447 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10666#true} {10968#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} #54#return; {10968#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:45:52,447 INFO L290 TraceCheckUtils]: 102: Hoare triple {10968#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 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; {10990#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-28 07:45:52,448 INFO L290 TraceCheckUtils]: 103: Hoare triple {10990#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} assume !false; {10990#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-28 07:45:52,448 INFO L272 TraceCheckUtils]: 104: Hoare triple {10990#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10666#true} is VALID [2022-04-28 07:45:52,448 INFO L290 TraceCheckUtils]: 105: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,448 INFO L290 TraceCheckUtils]: 106: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,448 INFO L290 TraceCheckUtils]: 107: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,448 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {10666#true} {10990#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} #54#return; {10990#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-28 07:45:52,449 INFO L290 TraceCheckUtils]: 109: Hoare triple {10990#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11012#(and (= (+ main_~c~0 (- 3)) 11) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-28 07:45:52,449 INFO L290 TraceCheckUtils]: 110: Hoare triple {11012#(and (= (+ main_~c~0 (- 3)) 11) (= (+ main_~y~0 (- 4)) 10))} assume !false; {11012#(and (= (+ main_~c~0 (- 3)) 11) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-28 07:45:52,449 INFO L272 TraceCheckUtils]: 111: Hoare triple {11012#(and (= (+ main_~c~0 (- 3)) 11) (= (+ main_~y~0 (- 4)) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10666#true} is VALID [2022-04-28 07:45:52,449 INFO L290 TraceCheckUtils]: 112: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,449 INFO L290 TraceCheckUtils]: 113: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,450 INFO L290 TraceCheckUtils]: 114: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,450 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {10666#true} {11012#(and (= (+ main_~c~0 (- 3)) 11) (= (+ main_~y~0 (- 4)) 10))} #54#return; {11012#(and (= (+ main_~c~0 (- 3)) 11) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-28 07:45:52,450 INFO L290 TraceCheckUtils]: 116: Hoare triple {11012#(and (= (+ main_~c~0 (- 3)) 11) (= (+ main_~y~0 (- 4)) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11034#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:45:52,451 INFO L290 TraceCheckUtils]: 117: Hoare triple {11034#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} assume !false; {11034#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:45:52,451 INFO L272 TraceCheckUtils]: 118: Hoare triple {11034#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10666#true} is VALID [2022-04-28 07:45:52,451 INFO L290 TraceCheckUtils]: 119: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,451 INFO L290 TraceCheckUtils]: 120: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,451 INFO L290 TraceCheckUtils]: 121: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,472 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {10666#true} {11034#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} #54#return; {11034#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:45:52,472 INFO L290 TraceCheckUtils]: 123: Hoare triple {11034#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11056#(and (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-28 07:45:52,473 INFO L290 TraceCheckUtils]: 124: Hoare triple {11056#(and (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0) (<= main_~c~0 16))} assume !false; {11056#(and (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-28 07:45:52,473 INFO L272 TraceCheckUtils]: 125: Hoare triple {11056#(and (= 15 (+ (- 1) main_~y~0)) (< 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)); {10666#true} is VALID [2022-04-28 07:45:52,473 INFO L290 TraceCheckUtils]: 126: Hoare triple {10666#true} ~cond := #in~cond; {10666#true} is VALID [2022-04-28 07:45:52,473 INFO L290 TraceCheckUtils]: 127: Hoare triple {10666#true} assume !(0 == ~cond); {10666#true} is VALID [2022-04-28 07:45:52,473 INFO L290 TraceCheckUtils]: 128: Hoare triple {10666#true} assume true; {10666#true} is VALID [2022-04-28 07:45:52,473 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {10666#true} {11056#(and (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0) (<= main_~c~0 16))} #54#return; {11056#(and (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-28 07:45:52,474 INFO L290 TraceCheckUtils]: 130: Hoare triple {11056#(and (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0) (<= main_~c~0 16))} assume !(~c~0 < ~k~0); {11078#(and (<= main_~k~0 16) (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0))} is VALID [2022-04-28 07:45:52,474 INFO L272 TraceCheckUtils]: 131: Hoare triple {11078#(and (<= main_~k~0 16) (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11082#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:45:52,475 INFO L290 TraceCheckUtils]: 132: Hoare triple {11082#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11086#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:45:52,475 INFO L290 TraceCheckUtils]: 133: Hoare triple {11086#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10667#false} is VALID [2022-04-28 07:45:52,475 INFO L290 TraceCheckUtils]: 134: Hoare triple {10667#false} assume !false; {10667#false} is VALID [2022-04-28 07:45:52,475 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:45:52,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:45:52,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:45:52,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692499009] [2022-04-28 07:45:52,688 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:45:52,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633390204] [2022-04-28 07:45:52,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633390204] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:45:52,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:45:52,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-28 07:45:52,689 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:45:52,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2109446204] [2022-04-28 07:45:52,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2109446204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:45:52,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:45:52,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 07:45:52,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609685657] [2022-04-28 07:45:52,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:45:52,689 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:45:52,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:45:52,690 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:45:52,742 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:45:52,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 07:45:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:52,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 07:45:52,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-28 07:45:52,743 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:45:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:55,176 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-04-28 07:45:55,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 07:45:55,176 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:45:55,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:45:55,176 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:45:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2022-04-28 07:45:55,178 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:45:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2022-04-28 07:45:55,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 96 transitions. [2022-04-28 07:45:55,314 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:45:55,315 INFO L225 Difference]: With dead ends: 84 [2022-04-28 07:45:55,315 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 07:45:55,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-04-28 07:45:55,317 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:45:55,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 745 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 07:45:55,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 07:45:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-28 07:45:55,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:45:55,393 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:45:55,394 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:45:55,394 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:45:55,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:55,395 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-28 07:45:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-28 07:45:55,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:55,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:55,396 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:45:55,396 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:45:55,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:55,397 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-28 07:45:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-28 07:45:55,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:55,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:55,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:45:55,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:45:55,398 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:45:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-28 07:45:55,400 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 135 [2022-04-28 07:45:55,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:45:55,400 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-28 07:45:55,400 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:45:55,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 95 transitions. [2022-04-28 07:45:55,620 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:45:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-28 07:45:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-04-28 07:45:55,621 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:45:55,621 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:45:55,640 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:45:55,821 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:45:55,821 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:45:55,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:45:55,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1539623736, now seen corresponding path program 33 times [2022-04-28 07:45:55,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:55,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [141830902] [2022-04-28 07:45:55,871 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:45:55,871 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:45:55,871 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:45:55,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1539623736, now seen corresponding path program 34 times [2022-04-28 07:45:55,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:45:55,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455834593] [2022-04-28 07:45:55,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:45:55,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:45:55,880 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:45:55,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1325774788] [2022-04-28 07:45:55,880 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:45:55,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:45:55,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:45:55,881 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:45:55,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:45:56,412 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:45:56,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:45:56,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-28 07:45:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:45:56,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:45:57,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {11622#true} call ULTIMATE.init(); {11622#true} is VALID [2022-04-28 07:45:57,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {11622#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); {11622#true} is VALID [2022-04-28 07:45:57,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11622#true} {11622#true} #60#return; {11622#true} is VALID [2022-04-28 07:45:57,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {11622#true} call #t~ret5 := main(); {11622#true} is VALID [2022-04-28 07:45:57,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {11622#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; {11622#true} is VALID [2022-04-28 07:45:57,124 INFO L272 TraceCheckUtils]: 6: Hoare triple {11622#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {11622#true} is VALID [2022-04-28 07:45:57,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,124 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11622#true} {11622#true} #52#return; {11622#true} is VALID [2022-04-28 07:45:57,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {11622#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11660#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:57,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {11660#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {11660#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:57,125 INFO L272 TraceCheckUtils]: 13: Hoare triple {11660#(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)); {11622#true} is VALID [2022-04-28 07:45:57,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,125 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11622#true} {11660#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {11660#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:57,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {11660#(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; {11682#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:45:57,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {11682#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {11682#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:45:57,126 INFO L272 TraceCheckUtils]: 20: Hoare triple {11682#(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)); {11622#true} is VALID [2022-04-28 07:45:57,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,127 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11622#true} {11682#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {11682#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:45:57,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {11682#(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; {11704#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:45:57,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {11704#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {11704#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:45:57,128 INFO L272 TraceCheckUtils]: 27: Hoare triple {11704#(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)); {11622#true} is VALID [2022-04-28 07:45:57,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,128 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11622#true} {11704#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #54#return; {11704#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:45:57,129 INFO L290 TraceCheckUtils]: 32: Hoare triple {11704#(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; {11726#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:45:57,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {11726#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} assume !false; {11726#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:45:57,129 INFO L272 TraceCheckUtils]: 34: Hoare triple {11726#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11622#true} is VALID [2022-04-28 07:45:57,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,129 INFO L290 TraceCheckUtils]: 36: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,130 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11622#true} {11726#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} #54#return; {11726#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:45:57,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {11726#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11748#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 07:45:57,131 INFO L290 TraceCheckUtils]: 40: Hoare triple {11748#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !false; {11748#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 07:45:57,131 INFO L272 TraceCheckUtils]: 41: Hoare triple {11748#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11622#true} is VALID [2022-04-28 07:45:57,131 INFO L290 TraceCheckUtils]: 42: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,131 INFO L290 TraceCheckUtils]: 43: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,131 INFO L290 TraceCheckUtils]: 44: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,131 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11622#true} {11748#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #54#return; {11748#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 07:45:57,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {11748#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11770#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:45:57,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {11770#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {11770#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:45:57,132 INFO L272 TraceCheckUtils]: 48: Hoare triple {11770#(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)); {11622#true} is VALID [2022-04-28 07:45:57,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,132 INFO L290 TraceCheckUtils]: 50: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,133 INFO L290 TraceCheckUtils]: 51: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,142 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11622#true} {11770#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {11770#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:45:57,143 INFO L290 TraceCheckUtils]: 53: Hoare triple {11770#(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; {11792#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:45:57,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {11792#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {11792#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:45:57,143 INFO L272 TraceCheckUtils]: 55: Hoare triple {11792#(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)); {11622#true} is VALID [2022-04-28 07:45:57,143 INFO L290 TraceCheckUtils]: 56: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,143 INFO L290 TraceCheckUtils]: 57: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,143 INFO L290 TraceCheckUtils]: 58: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,144 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11622#true} {11792#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {11792#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:45:57,144 INFO L290 TraceCheckUtils]: 60: Hoare triple {11792#(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; {11814#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:45:57,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {11814#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !false; {11814#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:45:57,144 INFO L272 TraceCheckUtils]: 62: Hoare triple {11814#(and (= (+ main_~c~0 (- 3)) 4) (= 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)); {11622#true} is VALID [2022-04-28 07:45:57,145 INFO L290 TraceCheckUtils]: 63: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,145 INFO L290 TraceCheckUtils]: 64: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,145 INFO L290 TraceCheckUtils]: 65: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,145 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11622#true} {11814#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #54#return; {11814#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:45:57,145 INFO L290 TraceCheckUtils]: 67: Hoare triple {11814#(and (= (+ main_~c~0 (- 3)) 4) (= 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; {11836#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:45:57,146 INFO L290 TraceCheckUtils]: 68: Hoare triple {11836#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} assume !false; {11836#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:45:57,146 INFO L272 TraceCheckUtils]: 69: Hoare triple {11836#(and (= main_~y~0 8) (= 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)); {11622#true} is VALID [2022-04-28 07:45:57,146 INFO L290 TraceCheckUtils]: 70: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,146 INFO L290 TraceCheckUtils]: 71: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,146 INFO L290 TraceCheckUtils]: 72: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,146 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11622#true} {11836#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} #54#return; {11836#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:45:57,147 INFO L290 TraceCheckUtils]: 74: Hoare triple {11836#(and (= main_~y~0 8) (= 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; {11858#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:45:57,147 INFO L290 TraceCheckUtils]: 75: Hoare triple {11858#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {11858#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:45:57,147 INFO L272 TraceCheckUtils]: 76: Hoare triple {11858#(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)); {11622#true} is VALID [2022-04-28 07:45:57,147 INFO L290 TraceCheckUtils]: 77: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,148 INFO L290 TraceCheckUtils]: 78: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,148 INFO L290 TraceCheckUtils]: 79: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,148 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {11622#true} {11858#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {11858#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:45:57,148 INFO L290 TraceCheckUtils]: 81: Hoare triple {11858#(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; {11880#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:45:57,149 INFO L290 TraceCheckUtils]: 82: Hoare triple {11880#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {11880#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:45:57,149 INFO L272 TraceCheckUtils]: 83: Hoare triple {11880#(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)); {11622#true} is VALID [2022-04-28 07:45:57,149 INFO L290 TraceCheckUtils]: 84: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,149 INFO L290 TraceCheckUtils]: 85: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,149 INFO L290 TraceCheckUtils]: 86: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,149 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {11622#true} {11880#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #54#return; {11880#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:45:57,150 INFO L290 TraceCheckUtils]: 88: Hoare triple {11880#(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; {11902#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:45:57,150 INFO L290 TraceCheckUtils]: 89: Hoare triple {11902#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} assume !false; {11902#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:45:57,150 INFO L272 TraceCheckUtils]: 90: Hoare triple {11902#(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)); {11622#true} is VALID [2022-04-28 07:45:57,150 INFO L290 TraceCheckUtils]: 91: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,150 INFO L290 TraceCheckUtils]: 92: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,150 INFO L290 TraceCheckUtils]: 93: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,151 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {11622#true} {11902#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} #54#return; {11902#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:45:57,151 INFO L290 TraceCheckUtils]: 95: Hoare triple {11902#(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; {11924#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:45:57,151 INFO L290 TraceCheckUtils]: 96: Hoare triple {11924#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {11924#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:45:57,151 INFO L272 TraceCheckUtils]: 97: Hoare triple {11924#(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)); {11622#true} is VALID [2022-04-28 07:45:57,151 INFO L290 TraceCheckUtils]: 98: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,152 INFO L290 TraceCheckUtils]: 99: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,152 INFO L290 TraceCheckUtils]: 100: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,153 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11622#true} {11924#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {11924#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:45:57,154 INFO L290 TraceCheckUtils]: 102: Hoare triple {11924#(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; {11946#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-28 07:45:57,154 INFO L290 TraceCheckUtils]: 103: Hoare triple {11946#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !false; {11946#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-28 07:45:57,154 INFO L272 TraceCheckUtils]: 104: Hoare triple {11946#(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)); {11622#true} is VALID [2022-04-28 07:45:57,154 INFO L290 TraceCheckUtils]: 105: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,154 INFO L290 TraceCheckUtils]: 106: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,154 INFO L290 TraceCheckUtils]: 107: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,155 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {11622#true} {11946#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} #54#return; {11946#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-28 07:45:57,155 INFO L290 TraceCheckUtils]: 109: Hoare triple {11946#(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; {11968#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:45:57,155 INFO L290 TraceCheckUtils]: 110: Hoare triple {11968#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {11968#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:45:57,155 INFO L272 TraceCheckUtils]: 111: Hoare triple {11968#(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)); {11622#true} is VALID [2022-04-28 07:45:57,155 INFO L290 TraceCheckUtils]: 112: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,155 INFO L290 TraceCheckUtils]: 113: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,156 INFO L290 TraceCheckUtils]: 114: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,156 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {11622#true} {11968#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #54#return; {11968#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:45:57,156 INFO L290 TraceCheckUtils]: 116: Hoare triple {11968#(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; {11990#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:45:57,156 INFO L290 TraceCheckUtils]: 117: Hoare triple {11990#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} assume !false; {11990#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:45:57,157 INFO L272 TraceCheckUtils]: 118: Hoare triple {11990#(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)); {11622#true} is VALID [2022-04-28 07:45:57,157 INFO L290 TraceCheckUtils]: 119: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,157 INFO L290 TraceCheckUtils]: 120: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,157 INFO L290 TraceCheckUtils]: 121: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,157 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {11622#true} {11990#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} #54#return; {11990#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:45:57,157 INFO L290 TraceCheckUtils]: 123: Hoare triple {11990#(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; {12012#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-28 07:45:57,158 INFO L290 TraceCheckUtils]: 124: Hoare triple {12012#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} assume !false; {12012#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-28 07:45:57,158 INFO L272 TraceCheckUtils]: 125: Hoare triple {12012#(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)); {11622#true} is VALID [2022-04-28 07:45:57,158 INFO L290 TraceCheckUtils]: 126: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,158 INFO L290 TraceCheckUtils]: 127: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,158 INFO L290 TraceCheckUtils]: 128: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,158 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {11622#true} {12012#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} #54#return; {12012#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-28 07:45:57,159 INFO L290 TraceCheckUtils]: 130: Hoare triple {12012#(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; {12034#(and (<= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13) (< 16 main_~k~0))} is VALID [2022-04-28 07:45:57,159 INFO L290 TraceCheckUtils]: 131: Hoare triple {12034#(and (<= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13) (< 16 main_~k~0))} assume !false; {12034#(and (<= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13) (< 16 main_~k~0))} is VALID [2022-04-28 07:45:57,159 INFO L272 TraceCheckUtils]: 132: Hoare triple {12034#(and (<= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13) (< 16 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11622#true} is VALID [2022-04-28 07:45:57,159 INFO L290 TraceCheckUtils]: 133: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2022-04-28 07:45:57,159 INFO L290 TraceCheckUtils]: 134: Hoare triple {11622#true} assume !(0 == ~cond); {11622#true} is VALID [2022-04-28 07:45:57,159 INFO L290 TraceCheckUtils]: 135: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-28 07:45:57,160 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {11622#true} {12034#(and (<= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13) (< 16 main_~k~0))} #54#return; {12034#(and (<= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13) (< 16 main_~k~0))} is VALID [2022-04-28 07:45:57,161 INFO L290 TraceCheckUtils]: 137: Hoare triple {12034#(and (<= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13) (< 16 main_~k~0))} assume !(~c~0 < ~k~0); {12056#(and (<= main_~k~0 17) (= (+ main_~y~0 (- 4)) 13) (< 16 main_~k~0))} is VALID [2022-04-28 07:45:57,162 INFO L272 TraceCheckUtils]: 138: Hoare triple {12056#(and (<= main_~k~0 17) (= (+ main_~y~0 (- 4)) 13) (< 16 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12060#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:45:57,162 INFO L290 TraceCheckUtils]: 139: Hoare triple {12060#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12064#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:45:57,162 INFO L290 TraceCheckUtils]: 140: Hoare triple {12064#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11623#false} is VALID [2022-04-28 07:45:57,163 INFO L290 TraceCheckUtils]: 141: Hoare triple {11623#false} assume !false; {11623#false} is VALID [2022-04-28 07:45:57,163 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:45:57,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:45:57,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:45:57,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455834593] [2022-04-28 07:45:57,431 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:45:57,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325774788] [2022-04-28 07:45:57,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325774788] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:45:57,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:45:57,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-28 07:45:57,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:45:57,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [141830902] [2022-04-28 07:45:57,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [141830902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:45:57,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:45:57,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 07:45:57,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34777739] [2022-04-28 07:45:57,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:45:57,434 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:45:57,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:45:57,434 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:45:57,503 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:45:57,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 07:45:57,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:57,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 07:45:57,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-28 07:45:57,504 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:00,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:00,376 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-04-28 07:46:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 07:46:00,377 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:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:46:00,377 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:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-28 07:46:00,378 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:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-28 07:46:00,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 100 transitions. [2022-04-28 07:46:00,468 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:00,469 INFO L225 Difference]: With dead ends: 87 [2022-04-28 07:46:00,469 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 07:46:00,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2022-04-28 07:46:00,470 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:46:00,470 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.4s Time] [2022-04-28 07:46:00,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 07:46:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-28 07:46:00,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:46:00,544 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:00,545 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:00,545 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:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:00,546 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-28 07:46:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-28 07:46:00,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:00,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:00,547 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:00,547 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:00,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:00,549 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-28 07:46:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-28 07:46:00,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:00,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:00,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:46:00,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:46:00,550 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:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-04-28 07:46:00,551 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 142 [2022-04-28 07:46:00,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:46:00,552 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-04-28 07:46:00,552 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:00,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 99 transitions. [2022-04-28 07:46:00,786 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:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-28 07:46:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-28 07:46:00,787 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:46:00,787 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:00,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 07:46:00,987 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:00,988 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:46:00,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:46:00,988 INFO L85 PathProgramCache]: Analyzing trace with hash -157742263, now seen corresponding path program 35 times [2022-04-28 07:46:00,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:00,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [425653259] [2022-04-28 07:46:01,069 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:01,069 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:46:01,069 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:46:01,069 INFO L85 PathProgramCache]: Analyzing trace with hash -157742263, now seen corresponding path program 36 times [2022-04-28 07:46:01,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:46:01,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620308030] [2022-04-28 07:46:01,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:46:01,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:46:01,087 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:46:01,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [681766887] [2022-04-28 07:46:01,087 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:46:01,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:46:01,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:46:01,091 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:01,091 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:10,165 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 07:46:10,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:46:10,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-28 07:46:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:46:10,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:46:10,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {12618#true} call ULTIMATE.init(); {12618#true} is VALID [2022-04-28 07:46:10,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {12618#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); {12618#true} is VALID [2022-04-28 07:46:10,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12618#true} {12618#true} #60#return; {12618#true} is VALID [2022-04-28 07:46:10,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {12618#true} call #t~ret5 := main(); {12618#true} is VALID [2022-04-28 07:46:10,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {12618#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; {12618#true} is VALID [2022-04-28 07:46:10,977 INFO L272 TraceCheckUtils]: 6: Hoare triple {12618#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {12618#true} is VALID [2022-04-28 07:46:10,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,977 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12618#true} {12618#true} #52#return; {12618#true} is VALID [2022-04-28 07:46:10,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {12618#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12656#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:10,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {12656#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {12656#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:10,978 INFO L272 TraceCheckUtils]: 13: Hoare triple {12656#(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)); {12618#true} is VALID [2022-04-28 07:46:10,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,978 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12618#true} {12656#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {12656#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:10,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {12656#(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; {12678#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:46:10,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {12678#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {12678#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:46:10,979 INFO L272 TraceCheckUtils]: 20: Hoare triple {12678#(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)); {12618#true} is VALID [2022-04-28 07:46:10,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,980 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {12618#true} {12678#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {12678#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:46:10,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {12678#(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; {12700#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:46:10,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {12700#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {12700#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:46:10,981 INFO L272 TraceCheckUtils]: 27: Hoare triple {12700#(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)); {12618#true} is VALID [2022-04-28 07:46:10,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,981 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12618#true} {12700#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {12700#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:46:10,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {12700#(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; {12722#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:46:10,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {12722#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {12722#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:46:10,982 INFO L272 TraceCheckUtils]: 34: Hoare triple {12722#(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)); {12618#true} is VALID [2022-04-28 07:46:10,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,983 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12618#true} {12722#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {12722#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:46:10,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {12722#(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; {12744#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:10,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {12744#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {12744#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:10,984 INFO L272 TraceCheckUtils]: 41: Hoare triple {12744#(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)); {12618#true} is VALID [2022-04-28 07:46:10,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,984 INFO L290 TraceCheckUtils]: 43: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,984 INFO L290 TraceCheckUtils]: 44: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,984 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12618#true} {12744#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #54#return; {12744#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:10,985 INFO L290 TraceCheckUtils]: 46: Hoare triple {12744#(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; {12766#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 07:46:10,985 INFO L290 TraceCheckUtils]: 47: Hoare triple {12766#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !false; {12766#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 07:46:10,985 INFO L272 TraceCheckUtils]: 48: Hoare triple {12766#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12618#true} is VALID [2022-04-28 07:46:10,985 INFO L290 TraceCheckUtils]: 49: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,985 INFO L290 TraceCheckUtils]: 50: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,985 INFO L290 TraceCheckUtils]: 51: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,986 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12618#true} {12766#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #54#return; {12766#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 07:46:10,986 INFO L290 TraceCheckUtils]: 53: Hoare triple {12766#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12788#(and (= 2 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-28 07:46:10,986 INFO L290 TraceCheckUtils]: 54: Hoare triple {12788#(and (= 2 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 3))} assume !false; {12788#(and (= 2 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-28 07:46:10,986 INFO L272 TraceCheckUtils]: 55: Hoare triple {12788#(and (= 2 (+ main_~c~0 (- 4))) (= (+ 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)); {12618#true} is VALID [2022-04-28 07:46:10,986 INFO L290 TraceCheckUtils]: 56: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,987 INFO L290 TraceCheckUtils]: 57: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,987 INFO L290 TraceCheckUtils]: 58: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,987 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12618#true} {12788#(and (= 2 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 3))} #54#return; {12788#(and (= 2 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-28 07:46:10,987 INFO L290 TraceCheckUtils]: 60: Hoare triple {12788#(and (= 2 (+ main_~c~0 (- 4))) (= (+ 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; {12810#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-28 07:46:10,988 INFO L290 TraceCheckUtils]: 61: Hoare triple {12810#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} assume !false; {12810#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-28 07:46:10,988 INFO L272 TraceCheckUtils]: 62: Hoare triple {12810#(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)); {12618#true} is VALID [2022-04-28 07:46:10,988 INFO L290 TraceCheckUtils]: 63: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,988 INFO L290 TraceCheckUtils]: 64: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,988 INFO L290 TraceCheckUtils]: 65: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,988 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12618#true} {12810#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} #54#return; {12810#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-28 07:46:10,989 INFO L290 TraceCheckUtils]: 67: Hoare triple {12810#(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; {12832#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:46:10,989 INFO L290 TraceCheckUtils]: 68: Hoare triple {12832#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {12832#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:46:10,989 INFO L272 TraceCheckUtils]: 69: Hoare triple {12832#(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)); {12618#true} is VALID [2022-04-28 07:46:10,989 INFO L290 TraceCheckUtils]: 70: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,989 INFO L290 TraceCheckUtils]: 71: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,989 INFO L290 TraceCheckUtils]: 72: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,990 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12618#true} {12832#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {12832#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:46:10,990 INFO L290 TraceCheckUtils]: 74: Hoare triple {12832#(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; {12854#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:10,991 INFO L290 TraceCheckUtils]: 75: Hoare triple {12854#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {12854#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:10,991 INFO L272 TraceCheckUtils]: 76: Hoare triple {12854#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12618#true} is VALID [2022-04-28 07:46:10,991 INFO L290 TraceCheckUtils]: 77: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,991 INFO L290 TraceCheckUtils]: 78: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,991 INFO L290 TraceCheckUtils]: 79: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,991 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12618#true} {12854#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #54#return; {12854#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:10,992 INFO L290 TraceCheckUtils]: 81: Hoare triple {12854#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12876#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:46:10,992 INFO L290 TraceCheckUtils]: 82: Hoare triple {12876#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} assume !false; {12876#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:46:10,992 INFO L272 TraceCheckUtils]: 83: Hoare triple {12876#(and (= main_~y~0 10) (= 7 (+ 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)); {12618#true} is VALID [2022-04-28 07:46:10,992 INFO L290 TraceCheckUtils]: 84: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,992 INFO L290 TraceCheckUtils]: 85: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,992 INFO L290 TraceCheckUtils]: 86: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,993 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {12618#true} {12876#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} #54#return; {12876#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:46:10,993 INFO L290 TraceCheckUtils]: 88: Hoare triple {12876#(and (= main_~y~0 10) (= 7 (+ 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; {12898#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:46:10,993 INFO L290 TraceCheckUtils]: 89: Hoare triple {12898#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {12898#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:46:10,994 INFO L272 TraceCheckUtils]: 90: Hoare triple {12898#(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)); {12618#true} is VALID [2022-04-28 07:46:10,994 INFO L290 TraceCheckUtils]: 91: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,994 INFO L290 TraceCheckUtils]: 92: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,994 INFO L290 TraceCheckUtils]: 93: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,994 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {12618#true} {12898#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {12898#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:46:10,995 INFO L290 TraceCheckUtils]: 95: Hoare triple {12898#(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; {12920#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:46:10,995 INFO L290 TraceCheckUtils]: 96: Hoare triple {12920#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {12920#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:46:10,995 INFO L272 TraceCheckUtils]: 97: Hoare triple {12920#(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)); {12618#true} is VALID [2022-04-28 07:46:10,995 INFO L290 TraceCheckUtils]: 98: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,995 INFO L290 TraceCheckUtils]: 99: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,995 INFO L290 TraceCheckUtils]: 100: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,996 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {12618#true} {12920#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {12920#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:46:10,996 INFO L290 TraceCheckUtils]: 102: Hoare triple {12920#(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; {12942#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-28 07:46:10,996 INFO L290 TraceCheckUtils]: 103: Hoare triple {12942#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {12942#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-28 07:46:10,996 INFO L272 TraceCheckUtils]: 104: Hoare triple {12942#(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)); {12618#true} is VALID [2022-04-28 07:46:10,996 INFO L290 TraceCheckUtils]: 105: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,996 INFO L290 TraceCheckUtils]: 106: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,997 INFO L290 TraceCheckUtils]: 107: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,997 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {12618#true} {12942#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #54#return; {12942#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-28 07:46:10,997 INFO L290 TraceCheckUtils]: 109: Hoare triple {12942#(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; {12964#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:10,998 INFO L290 TraceCheckUtils]: 110: Hoare triple {12964#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} assume !false; {12964#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:10,998 INFO L272 TraceCheckUtils]: 111: Hoare triple {12964#(and (= 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)); {12618#true} is VALID [2022-04-28 07:46:10,998 INFO L290 TraceCheckUtils]: 112: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,998 INFO L290 TraceCheckUtils]: 113: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,998 INFO L290 TraceCheckUtils]: 114: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:10,998 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {12618#true} {12964#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} #54#return; {12964#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:10,999 INFO L290 TraceCheckUtils]: 116: Hoare triple {12964#(and (= 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; {12986#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:10,999 INFO L290 TraceCheckUtils]: 117: Hoare triple {12986#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {12986#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:10,999 INFO L272 TraceCheckUtils]: 118: Hoare triple {12986#(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)); {12618#true} is VALID [2022-04-28 07:46:10,999 INFO L290 TraceCheckUtils]: 119: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:10,999 INFO L290 TraceCheckUtils]: 120: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:10,999 INFO L290 TraceCheckUtils]: 121: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:11,000 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12618#true} {12986#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {12986#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:11,000 INFO L290 TraceCheckUtils]: 123: Hoare triple {12986#(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; {13008#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:46:11,001 INFO L290 TraceCheckUtils]: 124: Hoare triple {13008#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {13008#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:46:11,001 INFO L272 TraceCheckUtils]: 125: Hoare triple {13008#(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)); {12618#true} is VALID [2022-04-28 07:46:11,001 INFO L290 TraceCheckUtils]: 126: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:11,001 INFO L290 TraceCheckUtils]: 127: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:11,001 INFO L290 TraceCheckUtils]: 128: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:11,001 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {12618#true} {13008#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {13008#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:46:11,002 INFO L290 TraceCheckUtils]: 130: Hoare triple {13008#(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; {13030#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:46:11,002 INFO L290 TraceCheckUtils]: 131: Hoare triple {13030#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {13030#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:46:11,002 INFO L272 TraceCheckUtils]: 132: Hoare triple {13030#(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)); {12618#true} is VALID [2022-04-28 07:46:11,002 INFO L290 TraceCheckUtils]: 133: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:11,002 INFO L290 TraceCheckUtils]: 134: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:11,002 INFO L290 TraceCheckUtils]: 135: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:11,003 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {12618#true} {13030#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #54#return; {13030#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:46:11,003 INFO L290 TraceCheckUtils]: 137: Hoare triple {13030#(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; {13052#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:46:11,003 INFO L290 TraceCheckUtils]: 138: Hoare triple {13052#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {13052#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:46:11,004 INFO L272 TraceCheckUtils]: 139: Hoare triple {13052#(and (< 17 main_~k~0) (<= 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)); {12618#true} is VALID [2022-04-28 07:46:11,004 INFO L290 TraceCheckUtils]: 140: Hoare triple {12618#true} ~cond := #in~cond; {12618#true} is VALID [2022-04-28 07:46:11,004 INFO L290 TraceCheckUtils]: 141: Hoare triple {12618#true} assume !(0 == ~cond); {12618#true} is VALID [2022-04-28 07:46:11,004 INFO L290 TraceCheckUtils]: 142: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 07:46:11,004 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {12618#true} {13052#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #54#return; {13052#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:46:11,005 INFO L290 TraceCheckUtils]: 144: Hoare triple {13052#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !(~c~0 < ~k~0); {13074#(and (< 17 main_~k~0) (<= main_~k~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:46:11,005 INFO L272 TraceCheckUtils]: 145: Hoare triple {13074#(and (< 17 main_~k~0) (<= main_~k~0 18) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13078#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:46:11,006 INFO L290 TraceCheckUtils]: 146: Hoare triple {13078#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13082#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:46:11,006 INFO L290 TraceCheckUtils]: 147: Hoare triple {13082#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12619#false} is VALID [2022-04-28 07:46:11,006 INFO L290 TraceCheckUtils]: 148: Hoare triple {12619#false} assume !false; {12619#false} is VALID [2022-04-28 07:46:11,007 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:11,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:46:11,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:46:11,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620308030] [2022-04-28 07:46:11,288 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:46:11,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681766887] [2022-04-28 07:46:11,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681766887] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:46:11,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:46:11,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2022-04-28 07:46:11,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:46:11,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [425653259] [2022-04-28 07:46:11,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [425653259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:46:11,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:46:11,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 07:46:11,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039782347] [2022-04-28 07:46:11,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:46:11,289 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:11,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:46:11,289 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:11,376 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:11,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 07:46:11,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:11,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 07:46:11,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-04-28 07:46:11,377 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:14,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:14,890 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2022-04-28 07:46:14,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 07:46:14,890 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:14,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:46:14,890 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:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-28 07:46:14,892 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:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-28 07:46:14,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 104 transitions. [2022-04-28 07:46:14,990 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:14,991 INFO L225 Difference]: With dead ends: 90 [2022-04-28 07:46:14,991 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 07:46:14,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2022-04-28 07:46:14,992 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 07:46:14,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 863 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 07:46:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 07:46:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-28 07:46:15,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:46:15,066 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:15,066 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:15,066 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:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:15,068 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-28 07:46:15,068 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-28 07:46:15,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:15,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:15,068 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:15,068 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:15,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:15,070 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-28 07:46:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-28 07:46:15,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:15,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:15,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:46:15,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:46:15,070 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:15,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-04-28 07:46:15,072 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 149 [2022-04-28 07:46:15,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:46:15,072 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-04-28 07:46:15,072 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:15,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 103 transitions. [2022-04-28 07:46:15,228 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:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-28 07:46:15,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-28 07:46:15,229 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:46:15,229 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:15,236 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:15,429 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:15,430 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:46:15,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:46:15,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1167462824, now seen corresponding path program 37 times [2022-04-28 07:46:15,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:15,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [975987246] [2022-04-28 07:46:15,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:15,501 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:46:15,501 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:46:15,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1167462824, now seen corresponding path program 38 times [2022-04-28 07:46:15,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:46:15,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520936890] [2022-04-28 07:46:15,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:46:15,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:46:15,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:46:15,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457595874] [2022-04-28 07:46:15,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:46:15,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:46:15,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:46:15,515 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:15,517 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:46:16,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:46:16,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:46:16,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-28 07:46:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:46:16,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:46:17,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {13654#true} call ULTIMATE.init(); {13654#true} is VALID [2022-04-28 07:46:17,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {13654#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); {13654#true} is VALID [2022-04-28 07:46:17,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13654#true} {13654#true} #60#return; {13654#true} is VALID [2022-04-28 07:46:17,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {13654#true} call #t~ret5 := main(); {13654#true} is VALID [2022-04-28 07:46:17,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {13654#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; {13654#true} is VALID [2022-04-28 07:46:17,168 INFO L272 TraceCheckUtils]: 6: Hoare triple {13654#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {13654#true} is VALID [2022-04-28 07:46:17,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,168 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13654#true} {13654#true} #52#return; {13654#true} is VALID [2022-04-28 07:46:17,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {13654#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:17,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {13692#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {13692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:17,169 INFO L272 TraceCheckUtils]: 13: Hoare triple {13692#(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)); {13654#true} is VALID [2022-04-28 07:46:17,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,170 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13654#true} {13692#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {13692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:17,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {13692#(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; {13714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:46:17,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {13714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {13714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:46:17,171 INFO L272 TraceCheckUtils]: 20: Hoare triple {13714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13654#true} is VALID [2022-04-28 07:46:17,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,171 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {13654#true} {13714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {13714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:46:17,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {13714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13736#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {13736#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2) (< 0 main_~k~0))} assume !false; {13736#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,173 INFO L272 TraceCheckUtils]: 27: Hoare triple {13736#(and (= (+ (- 1) main_~y~0) 1) (= 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)); {13654#true} is VALID [2022-04-28 07:46:17,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,174 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13654#true} {13736#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2) (< 0 main_~k~0))} #54#return; {13736#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {13736#(and (= (+ (- 1) main_~y~0) 1) (= 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; {13758#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,175 INFO L290 TraceCheckUtils]: 33: Hoare triple {13758#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !false; {13758#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,175 INFO L272 TraceCheckUtils]: 34: Hoare triple {13758#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) 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)); {13654#true} is VALID [2022-04-28 07:46:17,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,175 INFO L290 TraceCheckUtils]: 37: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,175 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13654#true} {13758#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #54#return; {13758#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,176 INFO L290 TraceCheckUtils]: 39: Hoare triple {13758#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) 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; {13780#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {13780#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} assume !false; {13780#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,176 INFO L272 TraceCheckUtils]: 41: Hoare triple {13780#(and (= (+ main_~y~0 (- 3)) 1) (= 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)); {13654#true} is VALID [2022-04-28 07:46:17,176 INFO L290 TraceCheckUtils]: 42: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,176 INFO L290 TraceCheckUtils]: 43: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,176 INFO L290 TraceCheckUtils]: 44: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,177 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13654#true} {13780#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} #54#return; {13780#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,177 INFO L290 TraceCheckUtils]: 46: Hoare triple {13780#(and (= (+ main_~y~0 (- 3)) 1) (= 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; {13802#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,178 INFO L290 TraceCheckUtils]: 47: Hoare triple {13802#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {13802#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,178 INFO L272 TraceCheckUtils]: 48: Hoare triple {13802#(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)); {13654#true} is VALID [2022-04-28 07:46:17,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,178 INFO L290 TraceCheckUtils]: 50: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,178 INFO L290 TraceCheckUtils]: 51: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,178 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13654#true} {13802#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} #54#return; {13802#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,179 INFO L290 TraceCheckUtils]: 53: Hoare triple {13802#(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; {13824#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:17,179 INFO L290 TraceCheckUtils]: 54: Hoare triple {13824#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !false; {13824#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:17,179 INFO L272 TraceCheckUtils]: 55: Hoare triple {13824#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13654#true} is VALID [2022-04-28 07:46:17,179 INFO L290 TraceCheckUtils]: 56: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,179 INFO L290 TraceCheckUtils]: 57: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,179 INFO L290 TraceCheckUtils]: 58: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,180 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13654#true} {13824#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} #54#return; {13824#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:17,180 INFO L290 TraceCheckUtils]: 60: Hoare triple {13824#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13846#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,181 INFO L290 TraceCheckUtils]: 61: Hoare triple {13846#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0) (< 0 main_~k~0))} assume !false; {13846#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,181 INFO L272 TraceCheckUtils]: 62: Hoare triple {13846#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13654#true} is VALID [2022-04-28 07:46:17,181 INFO L290 TraceCheckUtils]: 63: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,181 INFO L290 TraceCheckUtils]: 64: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,181 INFO L290 TraceCheckUtils]: 65: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,181 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13654#true} {13846#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0) (< 0 main_~k~0))} #54#return; {13846#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,182 INFO L290 TraceCheckUtils]: 67: Hoare triple {13846#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13868#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,182 INFO L290 TraceCheckUtils]: 68: Hoare triple {13868#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {13868#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,182 INFO L272 TraceCheckUtils]: 69: Hoare triple {13868#(and (= main_~y~0 8) (= 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)); {13654#true} is VALID [2022-04-28 07:46:17,182 INFO L290 TraceCheckUtils]: 70: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,182 INFO L290 TraceCheckUtils]: 71: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,182 INFO L290 TraceCheckUtils]: 72: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,183 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13654#true} {13868#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} #54#return; {13868#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,183 INFO L290 TraceCheckUtils]: 74: Hoare triple {13868#(and (= main_~y~0 8) (= 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; {13890#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,184 INFO L290 TraceCheckUtils]: 75: Hoare triple {13890#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} assume !false; {13890#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,184 INFO L272 TraceCheckUtils]: 76: Hoare triple {13890#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 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)); {13654#true} is VALID [2022-04-28 07:46:17,184 INFO L290 TraceCheckUtils]: 77: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,184 INFO L290 TraceCheckUtils]: 78: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,184 INFO L290 TraceCheckUtils]: 79: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,184 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13654#true} {13890#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} #54#return; {13890#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,185 INFO L290 TraceCheckUtils]: 81: Hoare triple {13890#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 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; {13912#(and (= 8 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,185 INFO L290 TraceCheckUtils]: 82: Hoare triple {13912#(and (= 8 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} assume !false; {13912#(and (= 8 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,185 INFO L272 TraceCheckUtils]: 83: Hoare triple {13912#(and (= 8 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13654#true} is VALID [2022-04-28 07:46:17,185 INFO L290 TraceCheckUtils]: 84: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,185 INFO L290 TraceCheckUtils]: 85: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,185 INFO L290 TraceCheckUtils]: 86: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,186 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13654#true} {13912#(and (= 8 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} #54#return; {13912#(and (= 8 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,186 INFO L290 TraceCheckUtils]: 88: Hoare triple {13912#(and (= 8 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13934#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,187 INFO L290 TraceCheckUtils]: 89: Hoare triple {13934#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8) (< 0 main_~k~0))} assume !false; {13934#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,187 INFO L272 TraceCheckUtils]: 90: Hoare triple {13934#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 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)); {13654#true} is VALID [2022-04-28 07:46:17,187 INFO L290 TraceCheckUtils]: 91: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,187 INFO L290 TraceCheckUtils]: 92: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,187 INFO L290 TraceCheckUtils]: 93: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,187 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {13654#true} {13934#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8) (< 0 main_~k~0))} #54#return; {13934#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,188 INFO L290 TraceCheckUtils]: 95: Hoare triple {13934#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 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; {13956#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,188 INFO L290 TraceCheckUtils]: 96: Hoare triple {13956#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} assume !false; {13956#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,188 INFO L272 TraceCheckUtils]: 97: Hoare triple {13956#(and (= main_~y~0 12) (= main_~c~0 12) (< 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)); {13654#true} is VALID [2022-04-28 07:46:17,188 INFO L290 TraceCheckUtils]: 98: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,188 INFO L290 TraceCheckUtils]: 99: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,188 INFO L290 TraceCheckUtils]: 100: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,189 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13654#true} {13956#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} #54#return; {13956#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,189 INFO L290 TraceCheckUtils]: 102: Hoare triple {13956#(and (= main_~y~0 12) (= main_~c~0 12) (< 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; {13978#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,190 INFO L290 TraceCheckUtils]: 103: Hoare triple {13978#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {13978#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,190 INFO L272 TraceCheckUtils]: 104: Hoare triple {13978#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 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)); {13654#true} is VALID [2022-04-28 07:46:17,190 INFO L290 TraceCheckUtils]: 105: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,190 INFO L290 TraceCheckUtils]: 106: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,190 INFO L290 TraceCheckUtils]: 107: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,190 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {13654#true} {13978#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {13978#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,191 INFO L290 TraceCheckUtils]: 109: Hoare triple {13978#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 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; {14000#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,191 INFO L290 TraceCheckUtils]: 110: Hoare triple {14000#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {14000#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,191 INFO L272 TraceCheckUtils]: 111: Hoare triple {14000#(and (= main_~y~0 14) (= 12 (+ (- 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)); {13654#true} is VALID [2022-04-28 07:46:17,191 INFO L290 TraceCheckUtils]: 112: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,191 INFO L290 TraceCheckUtils]: 113: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,191 INFO L290 TraceCheckUtils]: 114: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,192 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {13654#true} {14000#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #54#return; {14000#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,192 INFO L290 TraceCheckUtils]: 116: Hoare triple {14000#(and (= main_~y~0 14) (= 12 (+ (- 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; {14022#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:17,193 INFO L290 TraceCheckUtils]: 117: Hoare triple {14022#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} assume !false; {14022#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:17,193 INFO L272 TraceCheckUtils]: 118: Hoare triple {14022#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13654#true} is VALID [2022-04-28 07:46:17,193 INFO L290 TraceCheckUtils]: 119: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,193 INFO L290 TraceCheckUtils]: 120: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,193 INFO L290 TraceCheckUtils]: 121: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,193 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13654#true} {14022#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} #54#return; {14022#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:17,194 INFO L290 TraceCheckUtils]: 123: Hoare triple {14022#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14044#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,194 INFO L290 TraceCheckUtils]: 124: Hoare triple {14044#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} assume !false; {14044#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,194 INFO L272 TraceCheckUtils]: 125: Hoare triple {14044#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13654#true} is VALID [2022-04-28 07:46:17,194 INFO L290 TraceCheckUtils]: 126: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,194 INFO L290 TraceCheckUtils]: 127: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,194 INFO L290 TraceCheckUtils]: 128: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,195 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {13654#true} {14044#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} #54#return; {14044#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} is VALID [2022-04-28 07:46:17,196 INFO L290 TraceCheckUtils]: 130: Hoare triple {14044#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14066#(and (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-28 07:46:17,196 INFO L290 TraceCheckUtils]: 131: Hoare triple {14066#(and (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0) (= main_~y~0 17))} assume !false; {14066#(and (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-28 07:46:17,196 INFO L272 TraceCheckUtils]: 132: Hoare triple {14066#(and (= (+ (- 1) main_~c~0) 16) (< 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)); {13654#true} is VALID [2022-04-28 07:46:17,196 INFO L290 TraceCheckUtils]: 133: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,197 INFO L290 TraceCheckUtils]: 134: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,197 INFO L290 TraceCheckUtils]: 135: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,197 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {13654#true} {14066#(and (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0) (= main_~y~0 17))} #54#return; {14066#(and (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-28 07:46:17,197 INFO L290 TraceCheckUtils]: 137: Hoare triple {14066#(and (= (+ (- 1) main_~c~0) 16) (< 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; {14088#(and (= main_~c~0 18) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:46:17,198 INFO L290 TraceCheckUtils]: 138: Hoare triple {14088#(and (= main_~c~0 18) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 17))} assume !false; {14088#(and (= main_~c~0 18) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:46:17,198 INFO L272 TraceCheckUtils]: 139: Hoare triple {14088#(and (= main_~c~0 18) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13654#true} is VALID [2022-04-28 07:46:17,198 INFO L290 TraceCheckUtils]: 140: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,198 INFO L290 TraceCheckUtils]: 141: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,198 INFO L290 TraceCheckUtils]: 142: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,199 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {13654#true} {14088#(and (= main_~c~0 18) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 17))} #54#return; {14088#(and (= main_~c~0 18) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:46:17,199 INFO L290 TraceCheckUtils]: 144: Hoare triple {14088#(and (= main_~c~0 18) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14110#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-28 07:46:17,199 INFO L290 TraceCheckUtils]: 145: Hoare triple {14110#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} assume !false; {14110#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-28 07:46:17,199 INFO L272 TraceCheckUtils]: 146: Hoare triple {14110#(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)); {13654#true} is VALID [2022-04-28 07:46:17,199 INFO L290 TraceCheckUtils]: 147: Hoare triple {13654#true} ~cond := #in~cond; {13654#true} is VALID [2022-04-28 07:46:17,199 INFO L290 TraceCheckUtils]: 148: Hoare triple {13654#true} assume !(0 == ~cond); {13654#true} is VALID [2022-04-28 07:46:17,200 INFO L290 TraceCheckUtils]: 149: Hoare triple {13654#true} assume true; {13654#true} is VALID [2022-04-28 07:46:17,200 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {13654#true} {14110#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} #54#return; {14110#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-28 07:46:17,201 INFO L290 TraceCheckUtils]: 151: Hoare triple {14110#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} assume !(~c~0 < ~k~0); {14132#(and (< 18 main_~k~0) (<= main_~k~0 19) (= 19 main_~y~0))} is VALID [2022-04-28 07:46:17,202 INFO L272 TraceCheckUtils]: 152: Hoare triple {14132#(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)); {14136#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:46:17,202 INFO L290 TraceCheckUtils]: 153: Hoare triple {14136#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14140#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:46:17,202 INFO L290 TraceCheckUtils]: 154: Hoare triple {14140#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13655#false} is VALID [2022-04-28 07:46:17,202 INFO L290 TraceCheckUtils]: 155: Hoare triple {13655#false} assume !false; {13655#false} is VALID [2022-04-28 07:46:17,203 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:46:17,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:46:19,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:46:19,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520936890] [2022-04-28 07:46:19,331 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:46:19,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457595874] [2022-04-28 07:46:19,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457595874] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:46:19,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:46:19,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-04-28 07:46:19,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:46:19,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [975987246] [2022-04-28 07:46:19,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [975987246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:46:19,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:46:19,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 07:46:19,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150181315] [2022-04-28 07:46:19,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:46:19,332 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:46:19,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:46:19,333 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:46:19,430 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:19,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 07:46:19,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:19,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 07:46:19,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1613, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 07:46:19,431 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:46:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:23,973 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-04-28 07:46:23,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 07:46:23,973 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:46:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:46:23,973 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:46:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-28 07:46:23,976 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:46:23,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-28 07:46:23,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 108 transitions. [2022-04-28 07:46:24,157 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:46:24,158 INFO L225 Difference]: With dead ends: 93 [2022-04-28 07:46:24,158 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 07:46:24,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=467, Invalid=1789, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 07:46:24,159 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:46:24,159 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.1s Time] [2022-04-28 07:46:24,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 07:46:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-28 07:46:24,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:46:24,264 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:46:24,264 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:46:24,264 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:46:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:24,266 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-28 07:46:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-28 07:46:24,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:24,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:24,266 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:46:24,266 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:46:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:24,268 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-28 07:46:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-28 07:46:24,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:24,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:24,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:46:24,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:46:24,269 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:46:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-04-28 07:46:24,270 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 156 [2022-04-28 07:46:24,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:46:24,271 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-04-28 07:46:24,271 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:46:24,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 107 transitions. [2022-04-28 07:46:24,492 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:46:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-28 07:46:24,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-28 07:46:24,492 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:46:24,493 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:46:24,498 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:46:24,693 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:46:24,693 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:46:24,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:46:24,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1670771305, now seen corresponding path program 39 times [2022-04-28 07:46:24,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:24,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1378639354] [2022-04-28 07:46:24,772 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:24,772 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:46:24,772 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:46:24,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1670771305, now seen corresponding path program 40 times [2022-04-28 07:46:24,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:46:24,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880021159] [2022-04-28 07:46:24,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:46:24,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:46:24,785 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:46:24,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501495456] [2022-04-28 07:46:24,786 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:46:24,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:46:24,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:46:24,798 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:46:24,834 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:46:25,319 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:46:25,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:46:25,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-28 07:46:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:46:25,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:46:26,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {15126#true} call ULTIMATE.init(); {15126#true} is VALID [2022-04-28 07:46:26,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {15126#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); {15126#true} is VALID [2022-04-28 07:46:26,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15126#true} {15126#true} #60#return; {15126#true} is VALID [2022-04-28 07:46:26,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {15126#true} call #t~ret5 := main(); {15126#true} is VALID [2022-04-28 07:46:26,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {15126#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; {15126#true} is VALID [2022-04-28 07:46:26,282 INFO L272 TraceCheckUtils]: 6: Hoare triple {15126#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {15126#true} is VALID [2022-04-28 07:46:26,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,282 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15126#true} {15126#true} #52#return; {15126#true} is VALID [2022-04-28 07:46:26,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {15126#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15164#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:26,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {15164#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {15164#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:26,283 INFO L272 TraceCheckUtils]: 13: Hoare triple {15164#(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)); {15126#true} is VALID [2022-04-28 07:46:26,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,284 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15126#true} {15164#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {15164#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:26,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {15164#(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; {15186#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:46:26,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {15186#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {15186#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:46:26,285 INFO L272 TraceCheckUtils]: 20: Hoare triple {15186#(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)); {15126#true} is VALID [2022-04-28 07:46:26,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,285 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {15126#true} {15186#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {15186#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:46:26,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {15186#(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; {15208#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:46:26,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {15208#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {15208#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:46:26,286 INFO L272 TraceCheckUtils]: 27: Hoare triple {15208#(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)); {15126#true} is VALID [2022-04-28 07:46:26,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,287 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15126#true} {15208#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {15208#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:46:26,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {15208#(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; {15230#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:46:26,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {15230#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !false; {15230#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:46:26,288 INFO L272 TraceCheckUtils]: 34: Hoare triple {15230#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15126#true} is VALID [2022-04-28 07:46:26,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,288 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15126#true} {15230#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #54#return; {15230#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:46:26,289 INFO L290 TraceCheckUtils]: 39: Hoare triple {15230#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15252#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:46:26,289 INFO L290 TraceCheckUtils]: 40: Hoare triple {15252#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {15252#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:46:26,289 INFO L272 TraceCheckUtils]: 41: Hoare triple {15252#(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)); {15126#true} is VALID [2022-04-28 07:46:26,289 INFO L290 TraceCheckUtils]: 42: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,289 INFO L290 TraceCheckUtils]: 43: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,289 INFO L290 TraceCheckUtils]: 44: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,290 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15126#true} {15252#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {15252#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:46:26,290 INFO L290 TraceCheckUtils]: 46: Hoare triple {15252#(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; {15274#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:46:26,291 INFO L290 TraceCheckUtils]: 47: Hoare triple {15274#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {15274#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:46:26,291 INFO L272 TraceCheckUtils]: 48: Hoare triple {15274#(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)); {15126#true} is VALID [2022-04-28 07:46:26,291 INFO L290 TraceCheckUtils]: 49: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,291 INFO L290 TraceCheckUtils]: 50: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,291 INFO L290 TraceCheckUtils]: 51: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,291 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15126#true} {15274#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {15274#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:46:26,292 INFO L290 TraceCheckUtils]: 53: Hoare triple {15274#(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; {15296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:46:26,292 INFO L290 TraceCheckUtils]: 54: Hoare triple {15296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {15296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:46:26,292 INFO L272 TraceCheckUtils]: 55: Hoare triple {15296#(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)); {15126#true} is VALID [2022-04-28 07:46:26,292 INFO L290 TraceCheckUtils]: 56: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,292 INFO L290 TraceCheckUtils]: 57: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,292 INFO L290 TraceCheckUtils]: 58: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,293 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15126#true} {15296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {15296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:46:26,293 INFO L290 TraceCheckUtils]: 60: Hoare triple {15296#(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; {15318#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:26,294 INFO L290 TraceCheckUtils]: 61: Hoare triple {15318#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {15318#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:26,294 INFO L272 TraceCheckUtils]: 62: Hoare triple {15318#(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)); {15126#true} is VALID [2022-04-28 07:46:26,294 INFO L290 TraceCheckUtils]: 63: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,294 INFO L290 TraceCheckUtils]: 64: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,294 INFO L290 TraceCheckUtils]: 65: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,294 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15126#true} {15318#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {15318#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:26,295 INFO L290 TraceCheckUtils]: 67: Hoare triple {15318#(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; {15340#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:46:26,295 INFO L290 TraceCheckUtils]: 68: Hoare triple {15340#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {15340#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:46:26,295 INFO L272 TraceCheckUtils]: 69: Hoare triple {15340#(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)); {15126#true} is VALID [2022-04-28 07:46:26,295 INFO L290 TraceCheckUtils]: 70: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,295 INFO L290 TraceCheckUtils]: 71: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,295 INFO L290 TraceCheckUtils]: 72: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,296 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15126#true} {15340#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #54#return; {15340#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:46:26,296 INFO L290 TraceCheckUtils]: 74: Hoare triple {15340#(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; {15362#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:26,296 INFO L290 TraceCheckUtils]: 75: Hoare triple {15362#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} assume !false; {15362#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:26,297 INFO L272 TraceCheckUtils]: 76: Hoare triple {15362#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15126#true} is VALID [2022-04-28 07:46:26,297 INFO L290 TraceCheckUtils]: 77: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,297 INFO L290 TraceCheckUtils]: 78: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,297 INFO L290 TraceCheckUtils]: 79: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,297 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15126#true} {15362#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} #54#return; {15362#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:26,298 INFO L290 TraceCheckUtils]: 81: Hoare triple {15362#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15384#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:46:26,298 INFO L290 TraceCheckUtils]: 82: Hoare triple {15384#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} assume !false; {15384#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:46:26,298 INFO L272 TraceCheckUtils]: 83: Hoare triple {15384#(and (= main_~y~0 10) (= 7 (+ 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)); {15126#true} is VALID [2022-04-28 07:46:26,298 INFO L290 TraceCheckUtils]: 84: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,298 INFO L290 TraceCheckUtils]: 85: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,298 INFO L290 TraceCheckUtils]: 86: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,299 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {15126#true} {15384#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} #54#return; {15384#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:46:26,299 INFO L290 TraceCheckUtils]: 88: Hoare triple {15384#(and (= main_~y~0 10) (= 7 (+ 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; {15406#(and (= main_~y~0 11) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:46:26,299 INFO L290 TraceCheckUtils]: 89: Hoare triple {15406#(and (= main_~y~0 11) (= 7 (+ main_~c~0 (- 4))))} assume !false; {15406#(and (= main_~y~0 11) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:46:26,299 INFO L272 TraceCheckUtils]: 90: Hoare triple {15406#(and (= main_~y~0 11) (= 7 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15126#true} is VALID [2022-04-28 07:46:26,300 INFO L290 TraceCheckUtils]: 91: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,300 INFO L290 TraceCheckUtils]: 92: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,300 INFO L290 TraceCheckUtils]: 93: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,300 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {15126#true} {15406#(and (= main_~y~0 11) (= 7 (+ main_~c~0 (- 4))))} #54#return; {15406#(and (= main_~y~0 11) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:46:26,300 INFO L290 TraceCheckUtils]: 95: Hoare triple {15406#(and (= main_~y~0 11) (= 7 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15428#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:46:26,301 INFO L290 TraceCheckUtils]: 96: Hoare triple {15428#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {15428#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:46:26,301 INFO L272 TraceCheckUtils]: 97: Hoare triple {15428#(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)); {15126#true} is VALID [2022-04-28 07:46:26,301 INFO L290 TraceCheckUtils]: 98: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,301 INFO L290 TraceCheckUtils]: 99: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,301 INFO L290 TraceCheckUtils]: 100: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,302 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15126#true} {15428#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {15428#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:46:26,302 INFO L290 TraceCheckUtils]: 102: Hoare triple {15428#(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; {15450#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:26,302 INFO L290 TraceCheckUtils]: 103: Hoare triple {15450#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !false; {15450#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:26,302 INFO L272 TraceCheckUtils]: 104: Hoare triple {15450#(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)); {15126#true} is VALID [2022-04-28 07:46:26,302 INFO L290 TraceCheckUtils]: 105: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,302 INFO L290 TraceCheckUtils]: 106: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,303 INFO L290 TraceCheckUtils]: 107: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,303 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15126#true} {15450#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} #54#return; {15450#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:26,303 INFO L290 TraceCheckUtils]: 109: Hoare triple {15450#(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; {15472#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:46:26,304 INFO L290 TraceCheckUtils]: 110: Hoare triple {15472#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {15472#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:46:26,304 INFO L272 TraceCheckUtils]: 111: Hoare triple {15472#(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)); {15126#true} is VALID [2022-04-28 07:46:26,304 INFO L290 TraceCheckUtils]: 112: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,304 INFO L290 TraceCheckUtils]: 113: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,304 INFO L290 TraceCheckUtils]: 114: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,304 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {15126#true} {15472#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {15472#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:46:26,305 INFO L290 TraceCheckUtils]: 116: Hoare triple {15472#(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; {15494#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:46:26,305 INFO L290 TraceCheckUtils]: 117: Hoare triple {15494#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !false; {15494#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:46:26,305 INFO L272 TraceCheckUtils]: 118: Hoare triple {15494#(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)); {15126#true} is VALID [2022-04-28 07:46:26,305 INFO L290 TraceCheckUtils]: 119: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,305 INFO L290 TraceCheckUtils]: 120: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,305 INFO L290 TraceCheckUtils]: 121: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,306 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {15126#true} {15494#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} #54#return; {15494#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:46:26,306 INFO L290 TraceCheckUtils]: 123: Hoare triple {15494#(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; {15516#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-28 07:46:26,307 INFO L290 TraceCheckUtils]: 124: Hoare triple {15516#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} assume !false; {15516#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-28 07:46:26,307 INFO L272 TraceCheckUtils]: 125: Hoare triple {15516#(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)); {15126#true} is VALID [2022-04-28 07:46:26,307 INFO L290 TraceCheckUtils]: 126: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,307 INFO L290 TraceCheckUtils]: 127: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,307 INFO L290 TraceCheckUtils]: 128: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,307 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {15126#true} {15516#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} #54#return; {15516#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-28 07:46:26,308 INFO L290 TraceCheckUtils]: 130: Hoare triple {15516#(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; {15538#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:26,308 INFO L290 TraceCheckUtils]: 131: Hoare triple {15538#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {15538#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:26,308 INFO L272 TraceCheckUtils]: 132: Hoare triple {15538#(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)); {15126#true} is VALID [2022-04-28 07:46:26,308 INFO L290 TraceCheckUtils]: 133: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,308 INFO L290 TraceCheckUtils]: 134: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,309 INFO L290 TraceCheckUtils]: 135: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,309 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {15126#true} {15538#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #54#return; {15538#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:26,309 INFO L290 TraceCheckUtils]: 137: Hoare triple {15538#(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; {15560#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-28 07:46:26,310 INFO L290 TraceCheckUtils]: 138: Hoare triple {15560#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} assume !false; {15560#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-28 07:46:26,310 INFO L272 TraceCheckUtils]: 139: Hoare triple {15560#(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)); {15126#true} is VALID [2022-04-28 07:46:26,310 INFO L290 TraceCheckUtils]: 140: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,310 INFO L290 TraceCheckUtils]: 141: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,310 INFO L290 TraceCheckUtils]: 142: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,310 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {15126#true} {15560#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} #54#return; {15560#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-28 07:46:26,311 INFO L290 TraceCheckUtils]: 144: Hoare triple {15560#(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; {15582#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:46:26,311 INFO L290 TraceCheckUtils]: 145: Hoare triple {15582#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {15582#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:46:26,311 INFO L272 TraceCheckUtils]: 146: Hoare triple {15582#(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)); {15126#true} is VALID [2022-04-28 07:46:26,311 INFO L290 TraceCheckUtils]: 147: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,311 INFO L290 TraceCheckUtils]: 148: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,311 INFO L290 TraceCheckUtils]: 149: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,312 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {15126#true} {15582#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #54#return; {15582#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:46:26,312 INFO L290 TraceCheckUtils]: 151: Hoare triple {15582#(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; {15604#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} is VALID [2022-04-28 07:46:26,313 INFO L290 TraceCheckUtils]: 152: Hoare triple {15604#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} assume !false; {15604#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} is VALID [2022-04-28 07:46:26,313 INFO L272 TraceCheckUtils]: 153: Hoare triple {15604#(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)); {15126#true} is VALID [2022-04-28 07:46:26,313 INFO L290 TraceCheckUtils]: 154: Hoare triple {15126#true} ~cond := #in~cond; {15126#true} is VALID [2022-04-28 07:46:26,313 INFO L290 TraceCheckUtils]: 155: Hoare triple {15126#true} assume !(0 == ~cond); {15126#true} is VALID [2022-04-28 07:46:26,313 INFO L290 TraceCheckUtils]: 156: Hoare triple {15126#true} assume true; {15126#true} is VALID [2022-04-28 07:46:26,313 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {15126#true} {15604#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} #54#return; {15604#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} is VALID [2022-04-28 07:46:26,314 INFO L290 TraceCheckUtils]: 158: Hoare triple {15604#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} assume !(~c~0 < ~k~0); {15626#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~k~0 20) (< 19 main_~k~0))} is VALID [2022-04-28 07:46:26,315 INFO L272 TraceCheckUtils]: 159: Hoare triple {15626#(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)); {15630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:46:26,315 INFO L290 TraceCheckUtils]: 160: Hoare triple {15630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:46:26,316 INFO L290 TraceCheckUtils]: 161: Hoare triple {15634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15127#false} is VALID [2022-04-28 07:46:26,316 INFO L290 TraceCheckUtils]: 162: Hoare triple {15127#false} assume !false; {15127#false} is VALID [2022-04-28 07:46:26,316 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:46:26,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:46:26,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:46:26,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880021159] [2022-04-28 07:46:26,708 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:46:26,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501495456] [2022-04-28 07:46:26,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501495456] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:46:26,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:46:26,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-04-28 07:46:26,709 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:46:26,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1378639354] [2022-04-28 07:46:26,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1378639354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:46:26,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:46:26,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 07:46:26,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904281569] [2022-04-28 07:46:26,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:46:26,709 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:46:26,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:46:26,710 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:46:26,857 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:26,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 07:46:26,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:26,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 07:46:26,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-28 07:46:26,858 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:46:31,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:31,356 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-04-28 07:46:31,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 07:46:31,356 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:46:31,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:46:31,357 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:46:31,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-28 07:46:31,358 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:46:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-28 07:46:31,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 112 transitions. [2022-04-28 07:46:31,476 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:46:31,478 INFO L225 Difference]: With dead ends: 96 [2022-04-28 07:46:31,478 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 07:46:31,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2022-04-28 07:46:31,478 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:46:31,479 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.2s Time] [2022-04-28 07:46:31,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 07:46:31,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-28 07:46:31,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:46:31,584 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:46:31,584 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:46:31,584 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:46:31,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:31,586 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-28 07:46:31,586 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 07:46:31,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:31,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:31,586 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:46:31,586 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:46:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:31,588 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-28 07:46:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 07:46:31,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:31,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:31,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:46:31,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:46:31,588 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:46:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-04-28 07:46:31,590 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 163 [2022-04-28 07:46:31,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:46:31,590 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-04-28 07:46:31,590 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:46:31,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 111 transitions. [2022-04-28 07:46:31,777 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:46:31,777 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 07:46:31,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-04-28 07:46:31,778 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:46:31,778 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:46:31,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-28 07:46:31,978 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:46:31,978 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:46:31,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:46:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1329797496, now seen corresponding path program 41 times [2022-04-28 07:46:31,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:31,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [403590094] [2022-04-28 07:46:32,053 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:32,053 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:46:32,053 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:46:32,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1329797496, now seen corresponding path program 42 times [2022-04-28 07:46:32,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:46:32,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821674609] [2022-04-28 07:46:32,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:46:32,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:46:32,075 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:46:32,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585464569] [2022-04-28 07:46:32,076 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:46:32,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:46:32,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:46:32,076 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:46:32,077 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:46:34,434 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-28 07:46:34,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:46:34,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-28 07:46:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:46:34,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:46:35,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {16242#true} call ULTIMATE.init(); {16242#true} is VALID [2022-04-28 07:46:35,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {16242#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); {16242#true} is VALID [2022-04-28 07:46:35,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16242#true} {16242#true} #60#return; {16242#true} is VALID [2022-04-28 07:46:35,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {16242#true} call #t~ret5 := main(); {16242#true} is VALID [2022-04-28 07:46:35,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {16242#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; {16242#true} is VALID [2022-04-28 07:46:35,427 INFO L272 TraceCheckUtils]: 6: Hoare triple {16242#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {16242#true} is VALID [2022-04-28 07:46:35,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,427 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16242#true} {16242#true} #52#return; {16242#true} is VALID [2022-04-28 07:46:35,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {16242#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {16280#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:35,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {16280#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {16280#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:35,428 INFO L272 TraceCheckUtils]: 13: Hoare triple {16280#(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)); {16242#true} is VALID [2022-04-28 07:46:35,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,429 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16242#true} {16280#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {16280#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:35,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {16280#(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; {16302#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:46:35,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {16302#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {16302#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:46:35,430 INFO L272 TraceCheckUtils]: 20: Hoare triple {16302#(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)); {16242#true} is VALID [2022-04-28 07:46:35,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,430 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {16242#true} {16302#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {16302#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:46:35,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {16302#(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; {16324#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:46:35,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {16324#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {16324#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:46:35,431 INFO L272 TraceCheckUtils]: 27: Hoare triple {16324#(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)); {16242#true} is VALID [2022-04-28 07:46:35,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,432 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16242#true} {16324#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {16324#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:46:35,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {16324#(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; {16346#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:46:35,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {16346#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {16346#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:46:35,433 INFO L272 TraceCheckUtils]: 34: Hoare triple {16346#(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)); {16242#true} is VALID [2022-04-28 07:46:35,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,433 INFO L290 TraceCheckUtils]: 36: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,433 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16242#true} {16346#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #54#return; {16346#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:46:35,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {16346#(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; {16368#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:46:35,434 INFO L290 TraceCheckUtils]: 40: Hoare triple {16368#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {16368#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:46:35,434 INFO L272 TraceCheckUtils]: 41: Hoare triple {16368#(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)); {16242#true} is VALID [2022-04-28 07:46:35,434 INFO L290 TraceCheckUtils]: 42: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,434 INFO L290 TraceCheckUtils]: 43: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,435 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16242#true} {16368#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {16368#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:46:35,435 INFO L290 TraceCheckUtils]: 46: Hoare triple {16368#(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; {16390#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:46:35,435 INFO L290 TraceCheckUtils]: 47: Hoare triple {16390#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {16390#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:46:35,435 INFO L272 TraceCheckUtils]: 48: Hoare triple {16390#(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)); {16242#true} is VALID [2022-04-28 07:46:35,436 INFO L290 TraceCheckUtils]: 49: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,436 INFO L290 TraceCheckUtils]: 50: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,436 INFO L290 TraceCheckUtils]: 51: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,436 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16242#true} {16390#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {16390#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:46:35,437 INFO L290 TraceCheckUtils]: 53: Hoare triple {16390#(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; {16412#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:46:35,437 INFO L290 TraceCheckUtils]: 54: Hoare triple {16412#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {16412#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:46:35,437 INFO L272 TraceCheckUtils]: 55: Hoare triple {16412#(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)); {16242#true} is VALID [2022-04-28 07:46:35,437 INFO L290 TraceCheckUtils]: 56: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,437 INFO L290 TraceCheckUtils]: 57: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,437 INFO L290 TraceCheckUtils]: 58: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,438 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16242#true} {16412#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {16412#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:46:35,438 INFO L290 TraceCheckUtils]: 60: Hoare triple {16412#(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; {16434#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:35,438 INFO L290 TraceCheckUtils]: 61: Hoare triple {16434#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {16434#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:35,438 INFO L272 TraceCheckUtils]: 62: Hoare triple {16434#(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)); {16242#true} is VALID [2022-04-28 07:46:35,439 INFO L290 TraceCheckUtils]: 63: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,439 INFO L290 TraceCheckUtils]: 64: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,439 INFO L290 TraceCheckUtils]: 65: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,439 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16242#true} {16434#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {16434#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:35,440 INFO L290 TraceCheckUtils]: 67: Hoare triple {16434#(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; {16456#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:46:35,440 INFO L290 TraceCheckUtils]: 68: Hoare triple {16456#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {16456#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:46:35,440 INFO L272 TraceCheckUtils]: 69: Hoare triple {16456#(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)); {16242#true} is VALID [2022-04-28 07:46:35,440 INFO L290 TraceCheckUtils]: 70: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,440 INFO L290 TraceCheckUtils]: 71: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,440 INFO L290 TraceCheckUtils]: 72: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,441 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16242#true} {16456#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #54#return; {16456#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:46:35,441 INFO L290 TraceCheckUtils]: 74: Hoare triple {16456#(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; {16478#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-28 07:46:35,441 INFO L290 TraceCheckUtils]: 75: Hoare triple {16478#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !false; {16478#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-28 07:46:35,441 INFO L272 TraceCheckUtils]: 76: Hoare triple {16478#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16242#true} is VALID [2022-04-28 07:46:35,442 INFO L290 TraceCheckUtils]: 77: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,442 INFO L290 TraceCheckUtils]: 78: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,442 INFO L290 TraceCheckUtils]: 79: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,442 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16242#true} {16478#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} #54#return; {16478#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-28 07:46:35,443 INFO L290 TraceCheckUtils]: 81: Hoare triple {16478#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16500#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:46:35,443 INFO L290 TraceCheckUtils]: 82: Hoare triple {16500#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {16500#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:46:35,443 INFO L272 TraceCheckUtils]: 83: Hoare triple {16500#(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)); {16242#true} is VALID [2022-04-28 07:46:35,443 INFO L290 TraceCheckUtils]: 84: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,443 INFO L290 TraceCheckUtils]: 85: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,443 INFO L290 TraceCheckUtils]: 86: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,444 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {16242#true} {16500#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {16500#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:46:35,444 INFO L290 TraceCheckUtils]: 88: Hoare triple {16500#(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; {16522#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:46:35,444 INFO L290 TraceCheckUtils]: 89: Hoare triple {16522#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {16522#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:46:35,444 INFO L272 TraceCheckUtils]: 90: Hoare triple {16522#(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)); {16242#true} is VALID [2022-04-28 07:46:35,445 INFO L290 TraceCheckUtils]: 91: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,445 INFO L290 TraceCheckUtils]: 92: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,445 INFO L290 TraceCheckUtils]: 93: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,445 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {16242#true} {16522#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #54#return; {16522#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:46:35,445 INFO L290 TraceCheckUtils]: 95: Hoare triple {16522#(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; {16544#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:46:35,446 INFO L290 TraceCheckUtils]: 96: Hoare triple {16544#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} assume !false; {16544#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:46:35,446 INFO L272 TraceCheckUtils]: 97: Hoare triple {16544#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 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)); {16242#true} is VALID [2022-04-28 07:46:35,446 INFO L290 TraceCheckUtils]: 98: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,446 INFO L290 TraceCheckUtils]: 99: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,446 INFO L290 TraceCheckUtils]: 100: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,447 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {16242#true} {16544#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} #54#return; {16544#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:46:35,447 INFO L290 TraceCheckUtils]: 102: Hoare triple {16544#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 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; {16566#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-28 07:46:35,447 INFO L290 TraceCheckUtils]: 103: Hoare triple {16566#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} assume !false; {16566#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-28 07:46:35,447 INFO L272 TraceCheckUtils]: 104: Hoare triple {16566#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16242#true} is VALID [2022-04-28 07:46:35,448 INFO L290 TraceCheckUtils]: 105: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,448 INFO L290 TraceCheckUtils]: 106: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,448 INFO L290 TraceCheckUtils]: 107: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,448 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16242#true} {16566#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} #54#return; {16566#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-28 07:46:35,449 INFO L290 TraceCheckUtils]: 109: Hoare triple {16566#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16588#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-28 07:46:35,449 INFO L290 TraceCheckUtils]: 110: Hoare triple {16588#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} assume !false; {16588#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-28 07:46:35,449 INFO L272 TraceCheckUtils]: 111: Hoare triple {16588#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16242#true} is VALID [2022-04-28 07:46:35,449 INFO L290 TraceCheckUtils]: 112: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,449 INFO L290 TraceCheckUtils]: 113: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,449 INFO L290 TraceCheckUtils]: 114: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,450 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {16242#true} {16588#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} #54#return; {16588#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-28 07:46:35,450 INFO L290 TraceCheckUtils]: 116: Hoare triple {16588#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16610#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:46:35,450 INFO L290 TraceCheckUtils]: 117: Hoare triple {16610#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {16610#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:46:35,450 INFO L272 TraceCheckUtils]: 118: Hoare triple {16610#(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)); {16242#true} is VALID [2022-04-28 07:46:35,450 INFO L290 TraceCheckUtils]: 119: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,451 INFO L290 TraceCheckUtils]: 120: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,451 INFO L290 TraceCheckUtils]: 121: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,451 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {16242#true} {16610#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {16610#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:46:35,451 INFO L290 TraceCheckUtils]: 123: Hoare triple {16610#(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; {16632#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:35,452 INFO L290 TraceCheckUtils]: 124: Hoare triple {16632#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {16632#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:35,452 INFO L272 TraceCheckUtils]: 125: Hoare triple {16632#(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)); {16242#true} is VALID [2022-04-28 07:46:35,452 INFO L290 TraceCheckUtils]: 126: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,452 INFO L290 TraceCheckUtils]: 127: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,452 INFO L290 TraceCheckUtils]: 128: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,453 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {16242#true} {16632#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #54#return; {16632#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:35,453 INFO L290 TraceCheckUtils]: 130: Hoare triple {16632#(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; {16654#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:46:35,453 INFO L290 TraceCheckUtils]: 131: Hoare triple {16654#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {16654#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:46:35,453 INFO L272 TraceCheckUtils]: 132: Hoare triple {16654#(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)); {16242#true} is VALID [2022-04-28 07:46:35,453 INFO L290 TraceCheckUtils]: 133: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,454 INFO L290 TraceCheckUtils]: 134: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,454 INFO L290 TraceCheckUtils]: 135: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,454 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {16242#true} {16654#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #54#return; {16654#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:46:35,454 INFO L290 TraceCheckUtils]: 137: Hoare triple {16654#(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; {16676#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:46:35,455 INFO L290 TraceCheckUtils]: 138: Hoare triple {16676#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {16676#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:46:35,455 INFO L272 TraceCheckUtils]: 139: Hoare triple {16676#(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)); {16242#true} is VALID [2022-04-28 07:46:35,455 INFO L290 TraceCheckUtils]: 140: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,455 INFO L290 TraceCheckUtils]: 141: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,455 INFO L290 TraceCheckUtils]: 142: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,456 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {16242#true} {16676#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #54#return; {16676#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:46:35,456 INFO L290 TraceCheckUtils]: 144: Hoare triple {16676#(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; {16698#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:46:35,456 INFO L290 TraceCheckUtils]: 145: Hoare triple {16698#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {16698#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:46:35,456 INFO L272 TraceCheckUtils]: 146: Hoare triple {16698#(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)); {16242#true} is VALID [2022-04-28 07:46:35,456 INFO L290 TraceCheckUtils]: 147: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,457 INFO L290 TraceCheckUtils]: 148: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,457 INFO L290 TraceCheckUtils]: 149: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,457 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {16242#true} {16698#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #54#return; {16698#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:46:35,457 INFO L290 TraceCheckUtils]: 151: Hoare triple {16698#(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; {16720#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-28 07:46:35,458 INFO L290 TraceCheckUtils]: 152: Hoare triple {16720#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} assume !false; {16720#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-28 07:46:35,458 INFO L272 TraceCheckUtils]: 153: Hoare triple {16720#(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)); {16242#true} is VALID [2022-04-28 07:46:35,458 INFO L290 TraceCheckUtils]: 154: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,458 INFO L290 TraceCheckUtils]: 155: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,458 INFO L290 TraceCheckUtils]: 156: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,459 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {16242#true} {16720#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} #54#return; {16720#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-28 07:46:35,459 INFO L290 TraceCheckUtils]: 158: Hoare triple {16720#(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; {16742#(and (<= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)) (< 20 main_~k~0))} is VALID [2022-04-28 07:46:35,459 INFO L290 TraceCheckUtils]: 159: Hoare triple {16742#(and (<= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)) (< 20 main_~k~0))} assume !false; {16742#(and (<= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)) (< 20 main_~k~0))} is VALID [2022-04-28 07:46:35,459 INFO L272 TraceCheckUtils]: 160: Hoare triple {16742#(and (<= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)) (< 20 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)); {16242#true} is VALID [2022-04-28 07:46:35,460 INFO L290 TraceCheckUtils]: 161: Hoare triple {16242#true} ~cond := #in~cond; {16242#true} is VALID [2022-04-28 07:46:35,460 INFO L290 TraceCheckUtils]: 162: Hoare triple {16242#true} assume !(0 == ~cond); {16242#true} is VALID [2022-04-28 07:46:35,460 INFO L290 TraceCheckUtils]: 163: Hoare triple {16242#true} assume true; {16242#true} is VALID [2022-04-28 07:46:35,460 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {16242#true} {16742#(and (<= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)) (< 20 main_~k~0))} #54#return; {16742#(and (<= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)) (< 20 main_~k~0))} is VALID [2022-04-28 07:46:35,462 INFO L290 TraceCheckUtils]: 165: Hoare triple {16742#(and (<= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)) (< 20 main_~k~0))} assume !(~c~0 < ~k~0); {16764#(and (= 19 (+ (- 2) main_~y~0)) (< 20 main_~k~0) (<= main_~k~0 21))} is VALID [2022-04-28 07:46:35,463 INFO L272 TraceCheckUtils]: 166: Hoare triple {16764#(and (= 19 (+ (- 2) main_~y~0)) (< 20 main_~k~0) (<= main_~k~0 21))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16768#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:46:35,463 INFO L290 TraceCheckUtils]: 167: Hoare triple {16768#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16772#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:46:35,464 INFO L290 TraceCheckUtils]: 168: Hoare triple {16772#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16243#false} is VALID [2022-04-28 07:46:35,464 INFO L290 TraceCheckUtils]: 169: Hoare triple {16243#false} assume !false; {16243#false} is VALID [2022-04-28 07:46:35,464 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:46:35,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:46:35,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:46:35,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821674609] [2022-04-28 07:46:35,810 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:46:35,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585464569] [2022-04-28 07:46:35,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585464569] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:46:35,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:46:35,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-04-28 07:46:35,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:46:35,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [403590094] [2022-04-28 07:46:35,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [403590094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:46:35,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:46:35,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 07:46:35,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632685132] [2022-04-28 07:46:35,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:46:35,812 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:46:35,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:46:35,812 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:46:36,037 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:46:36,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 07:46:36,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:36,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 07:46:36,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2022-04-28 07:46:36,038 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:46:42,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:42,553 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2022-04-28 07:46:42,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 07:46:42,553 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:46:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:46:42,553 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:46:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 116 transitions. [2022-04-28 07:46:42,555 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:46:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 116 transitions. [2022-04-28 07:46:42,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 116 transitions. [2022-04-28 07:46:42,805 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:46:42,806 INFO L225 Difference]: With dead ends: 99 [2022-04-28 07:46:42,806 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 07:46:42,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2022-04-28 07:46:42,807 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 2 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:46:42,807 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.1s Time] [2022-04-28 07:46:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 07:46:42,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-28 07:46:42,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:46:42,915 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:46:42,915 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:46:42,915 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:46:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:42,923 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-28 07:46:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-28 07:46:42,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:42,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:42,924 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:46:42,924 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:46:42,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:42,926 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-28 07:46:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-28 07:46:42,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:42,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:42,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:46:42,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:46:42,927 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:46:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2022-04-28 07:46:42,932 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 170 [2022-04-28 07:46:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:46:42,932 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2022-04-28 07:46:42,932 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:46:42,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 115 transitions. [2022-04-28 07:46:43,205 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:46:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-28 07:46:43,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-04-28 07:46:43,206 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:46:43,206 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:46:43,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 07:46:43,406 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:46:43,406 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:46:43,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:46:43,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1612717687, now seen corresponding path program 43 times [2022-04-28 07:46:43,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:43,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [679893757] [2022-04-28 07:46:43,477 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:43,477 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:46:43,477 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:46:43,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1612717687, now seen corresponding path program 44 times [2022-04-28 07:46:43,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:46:43,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985125824] [2022-04-28 07:46:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:46:43,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:46:43,491 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:46:43,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293139739] [2022-04-28 07:46:43,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:46:43,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:46:43,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:46:43,492 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:46:43,493 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:46:43,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:46:43,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:46:43,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-28 07:46:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:46:44,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:46:44,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {17398#true} call ULTIMATE.init(); {17398#true} is VALID [2022-04-28 07:46:44,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {17398#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); {17398#true} is VALID [2022-04-28 07:46:44,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17398#true} {17398#true} #60#return; {17398#true} is VALID [2022-04-28 07:46:44,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {17398#true} call #t~ret5 := main(); {17398#true} is VALID [2022-04-28 07:46:44,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {17398#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; {17398#true} is VALID [2022-04-28 07:46:44,732 INFO L272 TraceCheckUtils]: 6: Hoare triple {17398#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {17398#true} is VALID [2022-04-28 07:46:44,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,732 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17398#true} {17398#true} #52#return; {17398#true} is VALID [2022-04-28 07:46:44,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {17398#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {17436#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:44,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {17436#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {17436#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:44,733 INFO L272 TraceCheckUtils]: 13: Hoare triple {17436#(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)); {17398#true} is VALID [2022-04-28 07:46:44,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,733 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17398#true} {17436#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {17436#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:44,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {17436#(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; {17458#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:46:44,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {17458#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {17458#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:46:44,734 INFO L272 TraceCheckUtils]: 20: Hoare triple {17458#(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)); {17398#true} is VALID [2022-04-28 07:46:44,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,734 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {17398#true} {17458#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {17458#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:46:44,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {17458#(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; {17480#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:46:44,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {17480#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !false; {17480#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:46:44,735 INFO L272 TraceCheckUtils]: 27: Hoare triple {17480#(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)); {17398#true} is VALID [2022-04-28 07:46:44,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,736 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17398#true} {17480#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #54#return; {17480#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:46:44,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {17480#(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; {17502#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:46:44,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {17502#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {17502#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:46:44,736 INFO L272 TraceCheckUtils]: 34: Hoare triple {17502#(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)); {17398#true} is VALID [2022-04-28 07:46:44,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,737 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17398#true} {17502#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #54#return; {17502#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:46:44,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {17502#(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; {17524#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:46:44,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {17524#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {17524#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:46:44,737 INFO L272 TraceCheckUtils]: 41: Hoare triple {17524#(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)); {17398#true} is VALID [2022-04-28 07:46:44,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,737 INFO L290 TraceCheckUtils]: 44: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,738 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17398#true} {17524#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {17524#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:46:44,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {17524#(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; {17546#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-28 07:46:44,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {17546#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {17546#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-28 07:46:44,738 INFO L272 TraceCheckUtils]: 48: Hoare triple {17546#(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)); {17398#true} is VALID [2022-04-28 07:46:44,738 INFO L290 TraceCheckUtils]: 49: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,738 INFO L290 TraceCheckUtils]: 50: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,739 INFO L290 TraceCheckUtils]: 51: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,739 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17398#true} {17546#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #54#return; {17546#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-28 07:46:44,739 INFO L290 TraceCheckUtils]: 53: Hoare triple {17546#(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; {17568#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:46:44,739 INFO L290 TraceCheckUtils]: 54: Hoare triple {17568#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {17568#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:46:44,739 INFO L272 TraceCheckUtils]: 55: Hoare triple {17568#(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)); {17398#true} is VALID [2022-04-28 07:46:44,739 INFO L290 TraceCheckUtils]: 56: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,739 INFO L290 TraceCheckUtils]: 57: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,740 INFO L290 TraceCheckUtils]: 58: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,740 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17398#true} {17568#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {17568#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:46:44,740 INFO L290 TraceCheckUtils]: 60: Hoare triple {17568#(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; {17590#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:44,740 INFO L290 TraceCheckUtils]: 61: Hoare triple {17590#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {17590#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:44,740 INFO L272 TraceCheckUtils]: 62: Hoare triple {17590#(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)); {17398#true} is VALID [2022-04-28 07:46:44,740 INFO L290 TraceCheckUtils]: 63: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,741 INFO L290 TraceCheckUtils]: 64: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,741 INFO L290 TraceCheckUtils]: 65: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,741 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17398#true} {17590#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #54#return; {17590#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:44,741 INFO L290 TraceCheckUtils]: 67: Hoare triple {17590#(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; {17612#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:46:44,741 INFO L290 TraceCheckUtils]: 68: Hoare triple {17612#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {17612#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:46:44,741 INFO L272 TraceCheckUtils]: 69: Hoare triple {17612#(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)); {17398#true} is VALID [2022-04-28 07:46:44,742 INFO L290 TraceCheckUtils]: 70: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,742 INFO L290 TraceCheckUtils]: 71: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,742 INFO L290 TraceCheckUtils]: 72: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,742 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17398#true} {17612#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #54#return; {17612#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:46:44,742 INFO L290 TraceCheckUtils]: 74: Hoare triple {17612#(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; {17634#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:46:44,742 INFO L290 TraceCheckUtils]: 75: Hoare triple {17634#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} assume !false; {17634#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:46:44,743 INFO L272 TraceCheckUtils]: 76: Hoare triple {17634#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17398#true} is VALID [2022-04-28 07:46:44,743 INFO L290 TraceCheckUtils]: 77: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,743 INFO L290 TraceCheckUtils]: 78: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,743 INFO L290 TraceCheckUtils]: 79: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,743 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {17398#true} {17634#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} #54#return; {17634#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:46:44,743 INFO L290 TraceCheckUtils]: 81: Hoare triple {17634#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17656#(and (= (+ main_~y~0 (- 4)) 6) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:44,744 INFO L290 TraceCheckUtils]: 82: Hoare triple {17656#(and (= (+ main_~y~0 (- 4)) 6) (= 8 (+ (- 2) main_~c~0)))} assume !false; {17656#(and (= (+ main_~y~0 (- 4)) 6) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:44,744 INFO L272 TraceCheckUtils]: 83: Hoare triple {17656#(and (= (+ main_~y~0 (- 4)) 6) (= 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)); {17398#true} is VALID [2022-04-28 07:46:44,744 INFO L290 TraceCheckUtils]: 84: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,744 INFO L290 TraceCheckUtils]: 85: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,744 INFO L290 TraceCheckUtils]: 86: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,744 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {17398#true} {17656#(and (= (+ main_~y~0 (- 4)) 6) (= 8 (+ (- 2) main_~c~0)))} #54#return; {17656#(and (= (+ main_~y~0 (- 4)) 6) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:44,744 INFO L290 TraceCheckUtils]: 88: Hoare triple {17656#(and (= (+ main_~y~0 (- 4)) 6) (= 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; {17678#(and (= main_~y~0 11) (= (+ main_~c~0 (- 3)) 8))} is VALID [2022-04-28 07:46:44,745 INFO L290 TraceCheckUtils]: 89: Hoare triple {17678#(and (= main_~y~0 11) (= (+ main_~c~0 (- 3)) 8))} assume !false; {17678#(and (= main_~y~0 11) (= (+ main_~c~0 (- 3)) 8))} is VALID [2022-04-28 07:46:44,745 INFO L272 TraceCheckUtils]: 90: Hoare triple {17678#(and (= main_~y~0 11) (= (+ main_~c~0 (- 3)) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17398#true} is VALID [2022-04-28 07:46:44,745 INFO L290 TraceCheckUtils]: 91: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,745 INFO L290 TraceCheckUtils]: 92: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,745 INFO L290 TraceCheckUtils]: 93: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,745 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {17398#true} {17678#(and (= main_~y~0 11) (= (+ main_~c~0 (- 3)) 8))} #54#return; {17678#(and (= main_~y~0 11) (= (+ main_~c~0 (- 3)) 8))} is VALID [2022-04-28 07:46:44,746 INFO L290 TraceCheckUtils]: 95: Hoare triple {17678#(and (= main_~y~0 11) (= (+ main_~c~0 (- 3)) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17700#(and (= 8 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:46:44,746 INFO L290 TraceCheckUtils]: 96: Hoare triple {17700#(and (= 8 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 11))} assume !false; {17700#(and (= 8 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:46:44,746 INFO L272 TraceCheckUtils]: 97: Hoare triple {17700#(and (= 8 (+ main_~c~0 (- 4))) (= (+ (- 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)); {17398#true} is VALID [2022-04-28 07:46:44,746 INFO L290 TraceCheckUtils]: 98: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,746 INFO L290 TraceCheckUtils]: 99: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,746 INFO L290 TraceCheckUtils]: 100: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,746 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {17398#true} {17700#(and (= 8 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 11))} #54#return; {17700#(and (= 8 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:46:44,747 INFO L290 TraceCheckUtils]: 102: Hoare triple {17700#(and (= 8 (+ main_~c~0 (- 4))) (= (+ (- 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; {17722#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 07:46:44,747 INFO L290 TraceCheckUtils]: 103: Hoare triple {17722#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !false; {17722#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 07:46:44,747 INFO L272 TraceCheckUtils]: 104: Hoare triple {17722#(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)); {17398#true} is VALID [2022-04-28 07:46:44,747 INFO L290 TraceCheckUtils]: 105: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,747 INFO L290 TraceCheckUtils]: 106: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,747 INFO L290 TraceCheckUtils]: 107: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,747 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17398#true} {17722#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #54#return; {17722#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 07:46:44,748 INFO L290 TraceCheckUtils]: 109: Hoare triple {17722#(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; {17744#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:46:44,748 INFO L290 TraceCheckUtils]: 110: Hoare triple {17744#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} assume !false; {17744#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:46:44,748 INFO L272 TraceCheckUtils]: 111: Hoare triple {17744#(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)); {17398#true} is VALID [2022-04-28 07:46:44,748 INFO L290 TraceCheckUtils]: 112: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,748 INFO L290 TraceCheckUtils]: 113: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,748 INFO L290 TraceCheckUtils]: 114: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,749 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {17398#true} {17744#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} #54#return; {17744#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:46:44,749 INFO L290 TraceCheckUtils]: 116: Hoare triple {17744#(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; {17766#(and (= main_~c~0 15) (= (+ main_~y~0 (- 4)) 11))} is VALID [2022-04-28 07:46:44,749 INFO L290 TraceCheckUtils]: 117: Hoare triple {17766#(and (= main_~c~0 15) (= (+ main_~y~0 (- 4)) 11))} assume !false; {17766#(and (= main_~c~0 15) (= (+ main_~y~0 (- 4)) 11))} is VALID [2022-04-28 07:46:44,749 INFO L272 TraceCheckUtils]: 118: Hoare triple {17766#(and (= main_~c~0 15) (= (+ main_~y~0 (- 4)) 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)); {17398#true} is VALID [2022-04-28 07:46:44,749 INFO L290 TraceCheckUtils]: 119: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,749 INFO L290 TraceCheckUtils]: 120: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,749 INFO L290 TraceCheckUtils]: 121: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,750 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {17398#true} {17766#(and (= main_~c~0 15) (= (+ main_~y~0 (- 4)) 11))} #54#return; {17766#(and (= main_~c~0 15) (= (+ main_~y~0 (- 4)) 11))} is VALID [2022-04-28 07:46:44,750 INFO L290 TraceCheckUtils]: 123: Hoare triple {17766#(and (= main_~c~0 15) (= (+ main_~y~0 (- 4)) 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; {17788#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:46:44,750 INFO L290 TraceCheckUtils]: 124: Hoare triple {17788#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {17788#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:46:44,750 INFO L272 TraceCheckUtils]: 125: Hoare triple {17788#(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)); {17398#true} is VALID [2022-04-28 07:46:44,750 INFO L290 TraceCheckUtils]: 126: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,750 INFO L290 TraceCheckUtils]: 127: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,750 INFO L290 TraceCheckUtils]: 128: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,751 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17398#true} {17788#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {17788#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:46:44,751 INFO L290 TraceCheckUtils]: 130: Hoare triple {17788#(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; {17810#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:46:44,751 INFO L290 TraceCheckUtils]: 131: Hoare triple {17810#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {17810#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:46:44,751 INFO L272 TraceCheckUtils]: 132: Hoare triple {17810#(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)); {17398#true} is VALID [2022-04-28 07:46:44,751 INFO L290 TraceCheckUtils]: 133: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,751 INFO L290 TraceCheckUtils]: 134: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,751 INFO L290 TraceCheckUtils]: 135: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,752 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {17398#true} {17810#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {17810#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:46:44,752 INFO L290 TraceCheckUtils]: 137: Hoare triple {17810#(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; {17832#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:46:44,752 INFO L290 TraceCheckUtils]: 138: Hoare triple {17832#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {17832#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:46:44,752 INFO L272 TraceCheckUtils]: 139: Hoare triple {17832#(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)); {17398#true} is VALID [2022-04-28 07:46:44,752 INFO L290 TraceCheckUtils]: 140: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,753 INFO L290 TraceCheckUtils]: 141: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,753 INFO L290 TraceCheckUtils]: 142: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,753 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {17398#true} {17832#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #54#return; {17832#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:46:44,753 INFO L290 TraceCheckUtils]: 144: Hoare triple {17832#(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; {17854#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:46:44,753 INFO L290 TraceCheckUtils]: 145: Hoare triple {17854#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {17854#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:46:44,753 INFO L272 TraceCheckUtils]: 146: Hoare triple {17854#(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)); {17398#true} is VALID [2022-04-28 07:46:44,753 INFO L290 TraceCheckUtils]: 147: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,754 INFO L290 TraceCheckUtils]: 148: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,754 INFO L290 TraceCheckUtils]: 149: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,754 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {17398#true} {17854#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {17854#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:46:44,754 INFO L290 TraceCheckUtils]: 151: Hoare triple {17854#(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; {17876#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:46:44,755 INFO L290 TraceCheckUtils]: 152: Hoare triple {17876#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {17876#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:46:44,755 INFO L272 TraceCheckUtils]: 153: Hoare triple {17876#(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)); {17398#true} is VALID [2022-04-28 07:46:44,755 INFO L290 TraceCheckUtils]: 154: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,755 INFO L290 TraceCheckUtils]: 155: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,755 INFO L290 TraceCheckUtils]: 156: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,755 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {17398#true} {17876#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #54#return; {17876#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:46:44,755 INFO L290 TraceCheckUtils]: 158: Hoare triple {17876#(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; {17898#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-28 07:46:44,762 INFO L290 TraceCheckUtils]: 159: Hoare triple {17898#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {17898#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-28 07:46:44,762 INFO L272 TraceCheckUtils]: 160: Hoare triple {17898#(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)); {17398#true} is VALID [2022-04-28 07:46:44,763 INFO L290 TraceCheckUtils]: 161: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,763 INFO L290 TraceCheckUtils]: 162: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,763 INFO L290 TraceCheckUtils]: 163: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,763 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {17398#true} {17898#(and (= main_~c~0 21) (= main_~y~0 21))} #54#return; {17898#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-28 07:46:44,763 INFO L290 TraceCheckUtils]: 165: Hoare triple {17898#(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; {17920#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-28 07:46:44,764 INFO L290 TraceCheckUtils]: 166: Hoare triple {17920#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} assume !false; {17920#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-28 07:46:44,764 INFO L272 TraceCheckUtils]: 167: Hoare triple {17920#(and (<= main_~c~0 22) (= main_~y~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)); {17398#true} is VALID [2022-04-28 07:46:44,764 INFO L290 TraceCheckUtils]: 168: Hoare triple {17398#true} ~cond := #in~cond; {17398#true} is VALID [2022-04-28 07:46:44,764 INFO L290 TraceCheckUtils]: 169: Hoare triple {17398#true} assume !(0 == ~cond); {17398#true} is VALID [2022-04-28 07:46:44,764 INFO L290 TraceCheckUtils]: 170: Hoare triple {17398#true} assume true; {17398#true} is VALID [2022-04-28 07:46:44,764 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {17398#true} {17920#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} #54#return; {17920#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-28 07:46:44,765 INFO L290 TraceCheckUtils]: 172: Hoare triple {17920#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} assume !(~c~0 < ~k~0); {17942#(and (<= main_~k~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-28 07:46:44,766 INFO L272 TraceCheckUtils]: 173: Hoare triple {17942#(and (<= main_~k~0 22) (= main_~y~0 22) (< 21 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17946#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:46:44,766 INFO L290 TraceCheckUtils]: 174: Hoare triple {17946#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17950#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:46:44,766 INFO L290 TraceCheckUtils]: 175: Hoare triple {17950#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17399#false} is VALID [2022-04-28 07:46:44,766 INFO L290 TraceCheckUtils]: 176: Hoare triple {17399#false} assume !false; {17399#false} is VALID [2022-04-28 07:46:44,767 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:46:44,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:46:45,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:46:45,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985125824] [2022-04-28 07:46:45,036 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:46:45,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293139739] [2022-04-28 07:46:45,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293139739] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:46:45,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:46:45,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-04-28 07:46:45,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:46:45,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [679893757] [2022-04-28 07:46:45,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [679893757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:46:45,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:46:45,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 07:46:45,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004851049] [2022-04-28 07:46:45,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:46:45,037 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:46:45,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:46:45,038 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:46:45,195 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:46:45,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 07:46:45,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:45,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 07:46:45,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-04-28 07:46:45,196 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:46:53,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:53,402 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-04-28 07:46:53,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 07:46:53,403 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:46:53,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:46:53,403 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:46:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-28 07:46:53,405 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:46:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-28 07:46:53,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 120 transitions. [2022-04-28 07:46:53,659 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:46:53,661 INFO L225 Difference]: With dead ends: 102 [2022-04-28 07:46:53,661 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 07:46:53,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 07:46:53,662 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:46:53,663 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.2s Time] [2022-04-28 07:46:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 07:46:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-04-28 07:46:53,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:46:53,797 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:46:53,797 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:46:53,798 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:46:53,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:53,800 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-04-28 07:46:53,801 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-28 07:46:53,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:53,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:53,801 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:46:53,801 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:46:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:46:53,804 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-04-28 07:46:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-28 07:46:53,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:46:53,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:46:53,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:46:53,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:46:53,805 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:46:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2022-04-28 07:46:53,807 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 177 [2022-04-28 07:46:53,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:46:53,807 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2022-04-28 07:46:53,807 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:46:53,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 119 transitions. [2022-04-28 07:46:54,207 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:46:54,207 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-28 07:46:54,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-04-28 07:46:54,208 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:46:54,208 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:46:54,213 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:46:54,411 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:46:54,411 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:46:54,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:46:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash -178408600, now seen corresponding path program 45 times [2022-04-28 07:46:54,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:54,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2119809641] [2022-04-28 07:46:54,497 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:54,497 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:46:54,497 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:46:54,498 INFO L85 PathProgramCache]: Analyzing trace with hash -178408600, now seen corresponding path program 46 times [2022-04-28 07:46:54,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:46:54,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161359449] [2022-04-28 07:46:54,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:46:54,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:46:54,513 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:46:54,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [85696497] [2022-04-28 07:46:54,513 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:46:54,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:46:54,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:46:54,514 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:46:54,538 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:46:55,104 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:46:55,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:46:55,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-28 07:46:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:46:55,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:46:56,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {18594#true} call ULTIMATE.init(); {18594#true} is VALID [2022-04-28 07:46:56,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {18594#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); {18594#true} is VALID [2022-04-28 07:46:56,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18594#true} {18594#true} #60#return; {18594#true} is VALID [2022-04-28 07:46:56,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {18594#true} call #t~ret5 := main(); {18594#true} is VALID [2022-04-28 07:46:56,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {18594#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; {18594#true} is VALID [2022-04-28 07:46:56,185 INFO L272 TraceCheckUtils]: 6: Hoare triple {18594#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {18594#true} is VALID [2022-04-28 07:46:56,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,185 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18594#true} {18594#true} #52#return; {18594#true} is VALID [2022-04-28 07:46:56,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {18594#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {18632#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:56,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {18632#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {18632#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:56,186 INFO L272 TraceCheckUtils]: 13: Hoare triple {18632#(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)); {18594#true} is VALID [2022-04-28 07:46:56,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,186 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18594#true} {18632#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {18632#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:46:56,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {18632#(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; {18654#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:46:56,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {18654#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {18654#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:46:56,187 INFO L272 TraceCheckUtils]: 20: Hoare triple {18654#(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)); {18594#true} is VALID [2022-04-28 07:46:56,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,188 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {18594#true} {18654#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {18654#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:46:56,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {18654#(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; {18676#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:46:56,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {18676#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !false; {18676#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:46:56,189 INFO L272 TraceCheckUtils]: 27: Hoare triple {18676#(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)); {18594#true} is VALID [2022-04-28 07:46:56,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,189 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18594#true} {18676#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #54#return; {18676#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:46:56,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {18676#(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; {18698#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:46:56,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {18698#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !false; {18698#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:46:56,190 INFO L272 TraceCheckUtils]: 34: Hoare triple {18698#(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)); {18594#true} is VALID [2022-04-28 07:46:56,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,190 INFO L290 TraceCheckUtils]: 36: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,190 INFO L290 TraceCheckUtils]: 37: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,191 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {18594#true} {18698#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #54#return; {18698#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:46:56,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {18698#(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; {18720#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 3)) 1))} is VALID [2022-04-28 07:46:56,192 INFO L290 TraceCheckUtils]: 40: Hoare triple {18720#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 3)) 1))} assume !false; {18720#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 3)) 1))} is VALID [2022-04-28 07:46:56,192 INFO L272 TraceCheckUtils]: 41: Hoare triple {18720#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 3)) 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)); {18594#true} is VALID [2022-04-28 07:46:56,192 INFO L290 TraceCheckUtils]: 42: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,192 INFO L290 TraceCheckUtils]: 43: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,192 INFO L290 TraceCheckUtils]: 44: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,192 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {18594#true} {18720#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 3)) 1))} #54#return; {18720#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 3)) 1))} is VALID [2022-04-28 07:46:56,193 INFO L290 TraceCheckUtils]: 46: Hoare triple {18720#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 3)) 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; {18742#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-28 07:46:56,193 INFO L290 TraceCheckUtils]: 47: Hoare triple {18742#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} assume !false; {18742#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-28 07:46:56,193 INFO L272 TraceCheckUtils]: 48: Hoare triple {18742#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18594#true} is VALID [2022-04-28 07:46:56,193 INFO L290 TraceCheckUtils]: 49: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,193 INFO L290 TraceCheckUtils]: 50: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,194 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18594#true} {18742#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} #54#return; {18742#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-28 07:46:56,194 INFO L290 TraceCheckUtils]: 53: Hoare triple {18742#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18764#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:46:56,194 INFO L290 TraceCheckUtils]: 54: Hoare triple {18764#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {18764#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:46:56,195 INFO L272 TraceCheckUtils]: 55: Hoare triple {18764#(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)); {18594#true} is VALID [2022-04-28 07:46:56,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,195 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18594#true} {18764#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {18764#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:46:56,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {18764#(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; {18786#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:56,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {18786#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {18786#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:56,196 INFO L272 TraceCheckUtils]: 62: Hoare triple {18786#(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)); {18594#true} is VALID [2022-04-28 07:46:56,196 INFO L290 TraceCheckUtils]: 63: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,196 INFO L290 TraceCheckUtils]: 64: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,196 INFO L290 TraceCheckUtils]: 65: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,197 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18594#true} {18786#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {18786#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:56,197 INFO L290 TraceCheckUtils]: 67: Hoare triple {18786#(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; {18808#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:46:56,197 INFO L290 TraceCheckUtils]: 68: Hoare triple {18808#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {18808#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:46:56,197 INFO L272 TraceCheckUtils]: 69: Hoare triple {18808#(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)); {18594#true} is VALID [2022-04-28 07:46:56,197 INFO L290 TraceCheckUtils]: 70: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,198 INFO L290 TraceCheckUtils]: 71: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,198 INFO L290 TraceCheckUtils]: 72: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,198 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {18594#true} {18808#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {18808#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:46:56,198 INFO L290 TraceCheckUtils]: 74: Hoare triple {18808#(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; {18830#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:56,199 INFO L290 TraceCheckUtils]: 75: Hoare triple {18830#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !false; {18830#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:56,199 INFO L272 TraceCheckUtils]: 76: Hoare triple {18830#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18594#true} is VALID [2022-04-28 07:46:56,199 INFO L290 TraceCheckUtils]: 77: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,199 INFO L290 TraceCheckUtils]: 78: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,199 INFO L290 TraceCheckUtils]: 79: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,199 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18594#true} {18830#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} #54#return; {18830#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:46:56,200 INFO L290 TraceCheckUtils]: 81: Hoare triple {18830#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18852#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-28 07:46:56,200 INFO L290 TraceCheckUtils]: 82: Hoare triple {18852#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !false; {18852#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-28 07:46:56,200 INFO L272 TraceCheckUtils]: 83: Hoare triple {18852#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18594#true} is VALID [2022-04-28 07:46:56,200 INFO L290 TraceCheckUtils]: 84: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,200 INFO L290 TraceCheckUtils]: 85: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,201 INFO L290 TraceCheckUtils]: 86: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,201 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {18594#true} {18852#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} #54#return; {18852#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-28 07:46:56,201 INFO L290 TraceCheckUtils]: 88: Hoare triple {18852#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18874#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-28 07:46:56,202 INFO L290 TraceCheckUtils]: 89: Hoare triple {18874#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} assume !false; {18874#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-28 07:46:56,202 INFO L272 TraceCheckUtils]: 90: Hoare triple {18874#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18594#true} is VALID [2022-04-28 07:46:56,202 INFO L290 TraceCheckUtils]: 91: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,202 INFO L290 TraceCheckUtils]: 92: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,202 INFO L290 TraceCheckUtils]: 93: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,202 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {18594#true} {18874#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} #54#return; {18874#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-28 07:46:56,203 INFO L290 TraceCheckUtils]: 95: Hoare triple {18874#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18896#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:46:56,203 INFO L290 TraceCheckUtils]: 96: Hoare triple {18896#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {18896#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:46:56,203 INFO L272 TraceCheckUtils]: 97: Hoare triple {18896#(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)); {18594#true} is VALID [2022-04-28 07:46:56,203 INFO L290 TraceCheckUtils]: 98: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,203 INFO L290 TraceCheckUtils]: 99: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,203 INFO L290 TraceCheckUtils]: 100: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,204 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {18594#true} {18896#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {18896#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:46:56,204 INFO L290 TraceCheckUtils]: 102: Hoare triple {18896#(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; {18918#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:56,205 INFO L290 TraceCheckUtils]: 103: Hoare triple {18918#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {18918#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:56,205 INFO L272 TraceCheckUtils]: 104: Hoare triple {18918#(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)); {18594#true} is VALID [2022-04-28 07:46:56,205 INFO L290 TraceCheckUtils]: 105: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,205 INFO L290 TraceCheckUtils]: 106: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,205 INFO L290 TraceCheckUtils]: 107: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,205 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18594#true} {18918#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {18918#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:56,206 INFO L290 TraceCheckUtils]: 109: Hoare triple {18918#(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; {18940#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:46:56,206 INFO L290 TraceCheckUtils]: 110: Hoare triple {18940#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {18940#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:46:56,206 INFO L272 TraceCheckUtils]: 111: Hoare triple {18940#(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)); {18594#true} is VALID [2022-04-28 07:46:56,206 INFO L290 TraceCheckUtils]: 112: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,206 INFO L290 TraceCheckUtils]: 113: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,206 INFO L290 TraceCheckUtils]: 114: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,207 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {18594#true} {18940#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #54#return; {18940#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:46:56,207 INFO L290 TraceCheckUtils]: 116: Hoare triple {18940#(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; {18962#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:56,207 INFO L290 TraceCheckUtils]: 117: Hoare triple {18962#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {18962#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:56,208 INFO L272 TraceCheckUtils]: 118: Hoare triple {18962#(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)); {18594#true} is VALID [2022-04-28 07:46:56,208 INFO L290 TraceCheckUtils]: 119: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,208 INFO L290 TraceCheckUtils]: 120: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,208 INFO L290 TraceCheckUtils]: 121: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,208 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {18594#true} {18962#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {18962#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:56,209 INFO L290 TraceCheckUtils]: 123: Hoare triple {18962#(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; {18984#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:46:56,209 INFO L290 TraceCheckUtils]: 124: Hoare triple {18984#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {18984#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:46:56,209 INFO L272 TraceCheckUtils]: 125: Hoare triple {18984#(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)); {18594#true} is VALID [2022-04-28 07:46:56,209 INFO L290 TraceCheckUtils]: 126: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,209 INFO L290 TraceCheckUtils]: 127: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,209 INFO L290 TraceCheckUtils]: 128: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,210 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {18594#true} {18984#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {18984#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:46:56,210 INFO L290 TraceCheckUtils]: 130: Hoare triple {18984#(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; {19006#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:46:56,210 INFO L290 TraceCheckUtils]: 131: Hoare triple {19006#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {19006#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:46:56,210 INFO L272 TraceCheckUtils]: 132: Hoare triple {19006#(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)); {18594#true} is VALID [2022-04-28 07:46:56,210 INFO L290 TraceCheckUtils]: 133: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,211 INFO L290 TraceCheckUtils]: 134: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,211 INFO L290 TraceCheckUtils]: 135: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,211 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {18594#true} {19006#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #54#return; {19006#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:46:56,211 INFO L290 TraceCheckUtils]: 137: Hoare triple {19006#(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; {19028#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:46:56,212 INFO L290 TraceCheckUtils]: 138: Hoare triple {19028#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} assume !false; {19028#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:46:56,212 INFO L272 TraceCheckUtils]: 139: Hoare triple {19028#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18594#true} is VALID [2022-04-28 07:46:56,212 INFO L290 TraceCheckUtils]: 140: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,212 INFO L290 TraceCheckUtils]: 141: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,212 INFO L290 TraceCheckUtils]: 142: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,212 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {18594#true} {19028#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} #54#return; {19028#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:46:56,213 INFO L290 TraceCheckUtils]: 144: Hoare triple {19028#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19050#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-28 07:46:56,213 INFO L290 TraceCheckUtils]: 145: Hoare triple {19050#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !false; {19050#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-28 07:46:56,213 INFO L272 TraceCheckUtils]: 146: Hoare triple {19050#(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)); {18594#true} is VALID [2022-04-28 07:46:56,213 INFO L290 TraceCheckUtils]: 147: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,213 INFO L290 TraceCheckUtils]: 148: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,214 INFO L290 TraceCheckUtils]: 149: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,214 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {18594#true} {19050#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} #54#return; {19050#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-28 07:46:56,214 INFO L290 TraceCheckUtils]: 151: Hoare triple {19050#(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; {19072#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-28 07:46:56,215 INFO L290 TraceCheckUtils]: 152: Hoare triple {19072#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !false; {19072#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-28 07:46:56,215 INFO L272 TraceCheckUtils]: 153: Hoare triple {19072#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18594#true} is VALID [2022-04-28 07:46:56,215 INFO L290 TraceCheckUtils]: 154: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,215 INFO L290 TraceCheckUtils]: 155: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,215 INFO L290 TraceCheckUtils]: 156: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,215 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {18594#true} {19072#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} #54#return; {19072#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-28 07:46:56,216 INFO L290 TraceCheckUtils]: 158: Hoare triple {19072#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19094#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:56,216 INFO L290 TraceCheckUtils]: 159: Hoare triple {19094#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} assume !false; {19094#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:56,216 INFO L272 TraceCheckUtils]: 160: Hoare triple {19094#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18594#true} is VALID [2022-04-28 07:46:56,216 INFO L290 TraceCheckUtils]: 161: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,216 INFO L290 TraceCheckUtils]: 162: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,216 INFO L290 TraceCheckUtils]: 163: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,217 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {18594#true} {19094#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} #54#return; {19094#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:46:56,217 INFO L290 TraceCheckUtils]: 165: Hoare triple {19094#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19116#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-28 07:46:56,218 INFO L290 TraceCheckUtils]: 166: Hoare triple {19116#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} assume !false; {19116#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-28 07:46:56,218 INFO L272 TraceCheckUtils]: 167: Hoare triple {19116#(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)); {18594#true} is VALID [2022-04-28 07:46:56,218 INFO L290 TraceCheckUtils]: 168: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,218 INFO L290 TraceCheckUtils]: 169: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,218 INFO L290 TraceCheckUtils]: 170: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,218 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {18594#true} {19116#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} #54#return; {19116#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-28 07:46:56,219 INFO L290 TraceCheckUtils]: 172: Hoare triple {19116#(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; {19138#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} is VALID [2022-04-28 07:46:56,219 INFO L290 TraceCheckUtils]: 173: Hoare triple {19138#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} assume !false; {19138#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} is VALID [2022-04-28 07:46:56,219 INFO L272 TraceCheckUtils]: 174: Hoare triple {19138#(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)); {18594#true} is VALID [2022-04-28 07:46:56,219 INFO L290 TraceCheckUtils]: 175: Hoare triple {18594#true} ~cond := #in~cond; {18594#true} is VALID [2022-04-28 07:46:56,220 INFO L290 TraceCheckUtils]: 176: Hoare triple {18594#true} assume !(0 == ~cond); {18594#true} is VALID [2022-04-28 07:46:56,220 INFO L290 TraceCheckUtils]: 177: Hoare triple {18594#true} assume true; {18594#true} is VALID [2022-04-28 07:46:56,220 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {18594#true} {19138#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} #54#return; {19138#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} is VALID [2022-04-28 07:46:56,222 INFO L290 TraceCheckUtils]: 179: Hoare triple {19138#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} assume !(~c~0 < ~k~0); {19160#(and (< 22 main_~k~0) (<= main_~k~0 23) (= (+ main_~y~0 (- 3)) 20))} is VALID [2022-04-28 07:46:56,223 INFO L272 TraceCheckUtils]: 180: Hoare triple {19160#(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)); {19164#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:46:56,223 INFO L290 TraceCheckUtils]: 181: Hoare triple {19164#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19168#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:46:56,224 INFO L290 TraceCheckUtils]: 182: Hoare triple {19168#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18595#false} is VALID [2022-04-28 07:46:56,224 INFO L290 TraceCheckUtils]: 183: Hoare triple {18595#false} assume !false; {18595#false} is VALID [2022-04-28 07:46:56,225 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:46:56,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:46:56,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:46:56,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161359449] [2022-04-28 07:46:56,584 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:46:56,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85696497] [2022-04-28 07:46:56,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85696497] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:46:56,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:46:56,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2022-04-28 07:46:56,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:46:56,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2119809641] [2022-04-28 07:46:56,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2119809641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:46:56,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:46:56,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 07:46:56,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121016457] [2022-04-28 07:46:56,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:46:56,585 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:46:56,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:46:56,586 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:46:56,835 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:46:56,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 07:46:56,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:46:56,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 07:46:56,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2022-04-28 07:46:56,837 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:07,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:07,450 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2022-04-28 07:47:07,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 07:47:07,450 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:07,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:47:07,451 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:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2022-04-28 07:47:07,453 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:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2022-04-28 07:47:07,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 124 transitions. [2022-04-28 07:47:07,747 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:07,748 INFO L225 Difference]: With dead ends: 105 [2022-04-28 07:47:07,748 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 07:47:07,749 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:07,749 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s 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, 5.3s IncrementalHoareTripleChecker+Time [2022-04-28 07:47:07,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1193 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-28 07:47:07,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 07:47:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-28 07:47:07,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:47:07,863 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:07,863 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:07,863 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:07,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:07,866 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-28 07:47:07,866 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-28 07:47:07,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:47:07,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:47:07,867 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:07,867 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:07,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:07,868 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-28 07:47:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-28 07:47:07,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:47:07,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:47:07,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:47:07,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:47:07,869 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:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2022-04-28 07:47:07,871 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 184 [2022-04-28 07:47:07,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:47:07,871 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2022-04-28 07:47:07,871 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:07,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 123 transitions. [2022-04-28 07:47:08,261 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:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-28 07:47:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-04-28 07:47:08,262 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:47:08,262 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:08,268 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:08,462 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:08,463 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:47:08,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:47:08,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1007212713, now seen corresponding path program 47 times [2022-04-28 07:47:08,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:47:08,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1237251748] [2022-04-28 07:47:08,539 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:08,539 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:47:08,539 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:47:08,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1007212713, now seen corresponding path program 48 times [2022-04-28 07:47:08,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:47:08,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498637504] [2022-04-28 07:47:08,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:47:08,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:47:08,553 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:47:08,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723424112] [2022-04-28 07:47:08,553 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:47:08,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:47:08,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:47:08,554 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:08,555 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:10,112 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-28 07:47:10,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:47:10,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-28 07:47:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:47:10,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:47:11,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {19830#true} call ULTIMATE.init(); {19830#true} is VALID [2022-04-28 07:47:11,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {19830#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); {19830#true} is VALID [2022-04-28 07:47:11,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19830#true} {19830#true} #60#return; {19830#true} is VALID [2022-04-28 07:47:11,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {19830#true} call #t~ret5 := main(); {19830#true} is VALID [2022-04-28 07:47:11,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {19830#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; {19830#true} is VALID [2022-04-28 07:47:11,208 INFO L272 TraceCheckUtils]: 6: Hoare triple {19830#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {19830#true} is VALID [2022-04-28 07:47:11,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,208 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19830#true} {19830#true} #52#return; {19830#true} is VALID [2022-04-28 07:47:11,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {19830#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {19868#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:11,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {19868#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {19868#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:11,209 INFO L272 TraceCheckUtils]: 13: Hoare triple {19868#(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)); {19830#true} is VALID [2022-04-28 07:47:11,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,210 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19830#true} {19868#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {19868#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:11,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {19868#(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; {19890#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:47:11,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {19890#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {19890#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:47:11,211 INFO L272 TraceCheckUtils]: 20: Hoare triple {19890#(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)); {19830#true} is VALID [2022-04-28 07:47:11,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,211 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {19830#true} {19890#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {19890#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:47:11,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {19890#(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; {19912#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:47:11,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {19912#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {19912#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:47:11,212 INFO L272 TraceCheckUtils]: 27: Hoare triple {19912#(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)); {19830#true} is VALID [2022-04-28 07:47:11,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,213 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {19830#true} {19912#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {19912#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:47:11,213 INFO L290 TraceCheckUtils]: 32: Hoare triple {19912#(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; {19934#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:47:11,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {19934#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {19934#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:47:11,214 INFO L272 TraceCheckUtils]: 34: Hoare triple {19934#(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)); {19830#true} is VALID [2022-04-28 07:47:11,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,214 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {19830#true} {19934#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {19934#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:47:11,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {19934#(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; {19956#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:47:11,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {19956#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {19956#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:47:11,215 INFO L272 TraceCheckUtils]: 41: Hoare triple {19956#(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)); {19830#true} is VALID [2022-04-28 07:47:11,215 INFO L290 TraceCheckUtils]: 42: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,215 INFO L290 TraceCheckUtils]: 43: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,216 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19830#true} {19956#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {19956#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:47:11,216 INFO L290 TraceCheckUtils]: 46: Hoare triple {19956#(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; {19978#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:47:11,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {19978#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {19978#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:47:11,217 INFO L272 TraceCheckUtils]: 48: Hoare triple {19978#(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)); {19830#true} is VALID [2022-04-28 07:47:11,217 INFO L290 TraceCheckUtils]: 49: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,217 INFO L290 TraceCheckUtils]: 50: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,217 INFO L290 TraceCheckUtils]: 51: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,217 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19830#true} {19978#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {19978#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:47:11,218 INFO L290 TraceCheckUtils]: 53: Hoare triple {19978#(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; {20000#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:47:11,218 INFO L290 TraceCheckUtils]: 54: Hoare triple {20000#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {20000#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:47:11,218 INFO L272 TraceCheckUtils]: 55: Hoare triple {20000#(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)); {19830#true} is VALID [2022-04-28 07:47:11,218 INFO L290 TraceCheckUtils]: 56: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,218 INFO L290 TraceCheckUtils]: 57: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,218 INFO L290 TraceCheckUtils]: 58: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,219 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19830#true} {20000#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {20000#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:47:11,219 INFO L290 TraceCheckUtils]: 60: Hoare triple {20000#(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; {20022#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:11,220 INFO L290 TraceCheckUtils]: 61: Hoare triple {20022#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {20022#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:11,220 INFO L272 TraceCheckUtils]: 62: Hoare triple {20022#(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)); {19830#true} is VALID [2022-04-28 07:47:11,220 INFO L290 TraceCheckUtils]: 63: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,220 INFO L290 TraceCheckUtils]: 64: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,220 INFO L290 TraceCheckUtils]: 65: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,220 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {19830#true} {20022#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {20022#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:11,221 INFO L290 TraceCheckUtils]: 67: Hoare triple {20022#(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; {20044#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:47:11,221 INFO L290 TraceCheckUtils]: 68: Hoare triple {20044#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {20044#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:47:11,221 INFO L272 TraceCheckUtils]: 69: Hoare triple {20044#(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)); {19830#true} is VALID [2022-04-28 07:47:11,221 INFO L290 TraceCheckUtils]: 70: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,221 INFO L290 TraceCheckUtils]: 71: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,221 INFO L290 TraceCheckUtils]: 72: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,222 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {19830#true} {20044#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #54#return; {20044#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:47:11,222 INFO L290 TraceCheckUtils]: 74: Hoare triple {20044#(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; {20066#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-28 07:47:11,223 INFO L290 TraceCheckUtils]: 75: Hoare triple {20066#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !false; {20066#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-28 07:47:11,223 INFO L272 TraceCheckUtils]: 76: Hoare triple {20066#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19830#true} is VALID [2022-04-28 07:47:11,223 INFO L290 TraceCheckUtils]: 77: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,223 INFO L290 TraceCheckUtils]: 78: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,223 INFO L290 TraceCheckUtils]: 79: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,223 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {19830#true} {20066#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} #54#return; {20066#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-28 07:47:11,224 INFO L290 TraceCheckUtils]: 81: Hoare triple {20066#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20088#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:47:11,224 INFO L290 TraceCheckUtils]: 82: Hoare triple {20088#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {20088#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:47:11,224 INFO L272 TraceCheckUtils]: 83: Hoare triple {20088#(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)); {19830#true} is VALID [2022-04-28 07:47:11,224 INFO L290 TraceCheckUtils]: 84: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,224 INFO L290 TraceCheckUtils]: 85: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,224 INFO L290 TraceCheckUtils]: 86: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,225 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {19830#true} {20088#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #54#return; {20088#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:47:11,225 INFO L290 TraceCheckUtils]: 88: Hoare triple {20088#(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; {20110#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:47:11,225 INFO L290 TraceCheckUtils]: 89: Hoare triple {20110#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {20110#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:47:11,226 INFO L272 TraceCheckUtils]: 90: Hoare triple {20110#(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)); {19830#true} is VALID [2022-04-28 07:47:11,226 INFO L290 TraceCheckUtils]: 91: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,226 INFO L290 TraceCheckUtils]: 92: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,226 INFO L290 TraceCheckUtils]: 93: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,226 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {19830#true} {20110#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {20110#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:47:11,227 INFO L290 TraceCheckUtils]: 95: Hoare triple {20110#(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; {20132#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:47:11,227 INFO L290 TraceCheckUtils]: 96: Hoare triple {20132#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !false; {20132#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:47:11,227 INFO L272 TraceCheckUtils]: 97: Hoare triple {20132#(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)); {19830#true} is VALID [2022-04-28 07:47:11,227 INFO L290 TraceCheckUtils]: 98: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,227 INFO L290 TraceCheckUtils]: 99: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,227 INFO L290 TraceCheckUtils]: 100: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,228 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {19830#true} {20132#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #54#return; {20132#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:47:11,228 INFO L290 TraceCheckUtils]: 102: Hoare triple {20132#(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; {20154#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 07:47:11,228 INFO L290 TraceCheckUtils]: 103: Hoare triple {20154#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !false; {20154#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 07:47:11,229 INFO L272 TraceCheckUtils]: 104: Hoare triple {20154#(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)); {19830#true} is VALID [2022-04-28 07:47:11,229 INFO L290 TraceCheckUtils]: 105: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,229 INFO L290 TraceCheckUtils]: 106: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,229 INFO L290 TraceCheckUtils]: 107: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,229 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19830#true} {20154#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #54#return; {20154#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 07:47:11,230 INFO L290 TraceCheckUtils]: 109: Hoare triple {20154#(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; {20176#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:47:11,230 INFO L290 TraceCheckUtils]: 110: Hoare triple {20176#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {20176#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:47:11,230 INFO L272 TraceCheckUtils]: 111: Hoare triple {20176#(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)); {19830#true} is VALID [2022-04-28 07:47:11,230 INFO L290 TraceCheckUtils]: 112: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,230 INFO L290 TraceCheckUtils]: 113: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,230 INFO L290 TraceCheckUtils]: 114: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,231 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {19830#true} {20176#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #54#return; {20176#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:47:11,231 INFO L290 TraceCheckUtils]: 116: Hoare triple {20176#(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; {20198#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:11,231 INFO L290 TraceCheckUtils]: 117: Hoare triple {20198#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} assume !false; {20198#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:11,232 INFO L272 TraceCheckUtils]: 118: Hoare triple {20198#(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)); {19830#true} is VALID [2022-04-28 07:47:11,232 INFO L290 TraceCheckUtils]: 119: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,232 INFO L290 TraceCheckUtils]: 120: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,232 INFO L290 TraceCheckUtils]: 121: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,232 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {19830#true} {20198#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} #54#return; {20198#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:11,233 INFO L290 TraceCheckUtils]: 123: Hoare triple {20198#(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; {20220#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-28 07:47:11,233 INFO L290 TraceCheckUtils]: 124: Hoare triple {20220#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} assume !false; {20220#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-28 07:47:11,233 INFO L272 TraceCheckUtils]: 125: Hoare triple {20220#(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)); {19830#true} is VALID [2022-04-28 07:47:11,233 INFO L290 TraceCheckUtils]: 126: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,233 INFO L290 TraceCheckUtils]: 127: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,233 INFO L290 TraceCheckUtils]: 128: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,234 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {19830#true} {20220#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} #54#return; {20220#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-28 07:47:11,234 INFO L290 TraceCheckUtils]: 130: Hoare triple {20220#(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; {20242#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} is VALID [2022-04-28 07:47:11,234 INFO L290 TraceCheckUtils]: 131: Hoare triple {20242#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} assume !false; {20242#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} is VALID [2022-04-28 07:47:11,234 INFO L272 TraceCheckUtils]: 132: Hoare triple {20242#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19830#true} is VALID [2022-04-28 07:47:11,235 INFO L290 TraceCheckUtils]: 133: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,235 INFO L290 TraceCheckUtils]: 134: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,235 INFO L290 TraceCheckUtils]: 135: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,235 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {19830#true} {20242#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} #54#return; {20242#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} is VALID [2022-04-28 07:47:11,236 INFO L290 TraceCheckUtils]: 137: Hoare triple {20242#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20264#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-28 07:47:11,236 INFO L290 TraceCheckUtils]: 138: Hoare triple {20264#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} assume !false; {20264#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-28 07:47:11,236 INFO L272 TraceCheckUtils]: 139: Hoare triple {20264#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19830#true} is VALID [2022-04-28 07:47:11,236 INFO L290 TraceCheckUtils]: 140: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,236 INFO L290 TraceCheckUtils]: 141: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,236 INFO L290 TraceCheckUtils]: 142: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,237 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {19830#true} {20264#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} #54#return; {20264#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-28 07:47:11,237 INFO L290 TraceCheckUtils]: 144: Hoare triple {20264#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20286#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:47:11,237 INFO L290 TraceCheckUtils]: 145: Hoare triple {20286#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {20286#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:47:11,237 INFO L272 TraceCheckUtils]: 146: Hoare triple {20286#(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)); {19830#true} is VALID [2022-04-28 07:47:11,237 INFO L290 TraceCheckUtils]: 147: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,238 INFO L290 TraceCheckUtils]: 148: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,238 INFO L290 TraceCheckUtils]: 149: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,238 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {19830#true} {20286#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {20286#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:47:11,238 INFO L290 TraceCheckUtils]: 151: Hoare triple {20286#(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; {20308#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:47:11,239 INFO L290 TraceCheckUtils]: 152: Hoare triple {20308#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {20308#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:47:11,239 INFO L272 TraceCheckUtils]: 153: Hoare triple {20308#(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)); {19830#true} is VALID [2022-04-28 07:47:11,239 INFO L290 TraceCheckUtils]: 154: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,239 INFO L290 TraceCheckUtils]: 155: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,239 INFO L290 TraceCheckUtils]: 156: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,239 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {19830#true} {20308#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #54#return; {20308#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:47:11,240 INFO L290 TraceCheckUtils]: 158: Hoare triple {20308#(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; {20330#(and (= 19 (+ (- 2) main_~y~0)) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:11,240 INFO L290 TraceCheckUtils]: 159: Hoare triple {20330#(and (= 19 (+ (- 2) main_~y~0)) (= 19 (+ (- 2) main_~c~0)))} assume !false; {20330#(and (= 19 (+ (- 2) main_~y~0)) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:11,240 INFO L272 TraceCheckUtils]: 160: Hoare triple {20330#(and (= 19 (+ (- 2) main_~y~0)) (= 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)); {19830#true} is VALID [2022-04-28 07:47:11,240 INFO L290 TraceCheckUtils]: 161: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,240 INFO L290 TraceCheckUtils]: 162: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,241 INFO L290 TraceCheckUtils]: 163: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,241 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {19830#true} {20330#(and (= 19 (+ (- 2) main_~y~0)) (= 19 (+ (- 2) main_~c~0)))} #54#return; {20330#(and (= 19 (+ (- 2) main_~y~0)) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:11,241 INFO L290 TraceCheckUtils]: 165: Hoare triple {20330#(and (= 19 (+ (- 2) main_~y~0)) (= 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; {20352#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-28 07:47:11,242 INFO L290 TraceCheckUtils]: 166: Hoare triple {20352#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {20352#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-28 07:47:11,242 INFO L272 TraceCheckUtils]: 167: Hoare triple {20352#(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)); {19830#true} is VALID [2022-04-28 07:47:11,242 INFO L290 TraceCheckUtils]: 168: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,242 INFO L290 TraceCheckUtils]: 169: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,242 INFO L290 TraceCheckUtils]: 170: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,242 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {19830#true} {20352#(and (= main_~y~0 22) (= main_~c~0 22))} #54#return; {20352#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-28 07:47:11,243 INFO L290 TraceCheckUtils]: 172: Hoare triple {20352#(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; {20374#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:47:11,243 INFO L290 TraceCheckUtils]: 173: Hoare triple {20374#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {20374#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:47:11,243 INFO L272 TraceCheckUtils]: 174: Hoare triple {20374#(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)); {19830#true} is VALID [2022-04-28 07:47:11,243 INFO L290 TraceCheckUtils]: 175: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,243 INFO L290 TraceCheckUtils]: 176: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,244 INFO L290 TraceCheckUtils]: 177: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,244 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {19830#true} {20374#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {20374#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:47:11,244 INFO L290 TraceCheckUtils]: 179: Hoare triple {20374#(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; {20396#(and (= 23 (+ (- 1) main_~y~0)) (< 23 main_~k~0) (<= main_~c~0 24))} is VALID [2022-04-28 07:47:11,245 INFO L290 TraceCheckUtils]: 180: Hoare triple {20396#(and (= 23 (+ (- 1) main_~y~0)) (< 23 main_~k~0) (<= main_~c~0 24))} assume !false; {20396#(and (= 23 (+ (- 1) main_~y~0)) (< 23 main_~k~0) (<= main_~c~0 24))} is VALID [2022-04-28 07:47:11,245 INFO L272 TraceCheckUtils]: 181: Hoare triple {20396#(and (= 23 (+ (- 1) main_~y~0)) (< 23 main_~k~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)); {19830#true} is VALID [2022-04-28 07:47:11,245 INFO L290 TraceCheckUtils]: 182: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 07:47:11,245 INFO L290 TraceCheckUtils]: 183: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 07:47:11,245 INFO L290 TraceCheckUtils]: 184: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 07:47:11,246 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {19830#true} {20396#(and (= 23 (+ (- 1) main_~y~0)) (< 23 main_~k~0) (<= main_~c~0 24))} #54#return; {20396#(and (= 23 (+ (- 1) main_~y~0)) (< 23 main_~k~0) (<= main_~c~0 24))} is VALID [2022-04-28 07:47:11,247 INFO L290 TraceCheckUtils]: 186: Hoare triple {20396#(and (= 23 (+ (- 1) main_~y~0)) (< 23 main_~k~0) (<= main_~c~0 24))} assume !(~c~0 < ~k~0); {20418#(and (= 23 (+ (- 1) main_~y~0)) (<= main_~k~0 24) (< 23 main_~k~0))} is VALID [2022-04-28 07:47:11,248 INFO L272 TraceCheckUtils]: 187: Hoare triple {20418#(and (= 23 (+ (- 1) main_~y~0)) (<= main_~k~0 24) (< 23 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20422#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:47:11,248 INFO L290 TraceCheckUtils]: 188: Hoare triple {20422#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20426#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:47:11,248 INFO L290 TraceCheckUtils]: 189: Hoare triple {20426#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19831#false} is VALID [2022-04-28 07:47:11,248 INFO L290 TraceCheckUtils]: 190: Hoare triple {19831#false} assume !false; {19831#false} is VALID [2022-04-28 07:47:11,249 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:47:11,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:47:11,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:47:11,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498637504] [2022-04-28 07:47:11,569 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:47:11,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723424112] [2022-04-28 07:47:11,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723424112] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:47:11,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:47:11,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2022-04-28 07:47:11,569 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:47:11,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1237251748] [2022-04-28 07:47:11,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1237251748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:47:11,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:47:11,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 07:47:11,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991912726] [2022-04-28 07:47:11,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:47:11,570 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:47:11,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:47:11,571 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:47:11,762 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:11,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 07:47:11,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:47:11,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 07:47:11,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 07:47:11,763 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:47:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:24,798 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2022-04-28 07:47:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 07:47:24,798 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:47:24,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:47:24,798 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:47:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 128 transitions. [2022-04-28 07:47:24,800 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:47:24,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 128 transitions. [2022-04-28 07:47:24,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 128 transitions. [2022-04-28 07:47:25,147 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:47:25,148 INFO L225 Difference]: With dead ends: 108 [2022-04-28 07:47:25,148 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 07:47:25,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 07:47:25,149 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 2167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s 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, 6.5s IncrementalHoareTripleChecker+Time [2022-04-28 07:47:25,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1265 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2167 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-04-28 07:47:25,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 07:47:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-28 07:47:25,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:47:25,265 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:47:25,265 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:47:25,265 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:47:25,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:25,267 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-28 07:47:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-28 07:47:25,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:47:25,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:47:25,267 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:47:25,267 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:47:25,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:25,269 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-28 07:47:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-28 07:47:25,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:47:25,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:47:25,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:47:25,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:47:25,270 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:47:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2022-04-28 07:47:25,271 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 191 [2022-04-28 07:47:25,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:47:25,271 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2022-04-28 07:47:25,272 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:47:25,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 127 transitions. [2022-04-28 07:47:25,644 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:47:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-28 07:47:25,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-04-28 07:47:25,645 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:47:25,645 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:47:25,652 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:47:25,846 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:47:25,846 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:47:25,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:47:25,846 INFO L85 PathProgramCache]: Analyzing trace with hash 447117384, now seen corresponding path program 49 times [2022-04-28 07:47:25,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:47:25,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [376574937] [2022-04-28 07:47:25,929 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:25,929 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:47:25,929 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:47:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash 447117384, now seen corresponding path program 50 times [2022-04-28 07:47:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:47:25,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645059371] [2022-04-28 07:47:25,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:47:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:47:25,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:47:25,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046253277] [2022-04-28 07:47:25,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:47:25,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:47:25,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:47:25,945 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:47:25,946 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:47:27,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:47:27,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:47:27,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-28 07:47:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:47:27,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:47:28,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {21106#true} call ULTIMATE.init(); {21106#true} is VALID [2022-04-28 07:47:28,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {21106#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); {21106#true} is VALID [2022-04-28 07:47:28,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21106#true} {21106#true} #60#return; {21106#true} is VALID [2022-04-28 07:47:28,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {21106#true} call #t~ret5 := main(); {21106#true} is VALID [2022-04-28 07:47:28,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {21106#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; {21106#true} is VALID [2022-04-28 07:47:28,385 INFO L272 TraceCheckUtils]: 6: Hoare triple {21106#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {21106#true} is VALID [2022-04-28 07:47:28,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,385 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21106#true} {21106#true} #52#return; {21106#true} is VALID [2022-04-28 07:47:28,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {21106#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {21144#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:28,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {21144#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {21144#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:28,386 INFO L272 TraceCheckUtils]: 13: Hoare triple {21144#(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)); {21106#true} is VALID [2022-04-28 07:47:28,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,387 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21106#true} {21144#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {21144#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:28,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {21144#(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; {21166#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:47:28,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {21166#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {21166#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:47:28,387 INFO L272 TraceCheckUtils]: 20: Hoare triple {21166#(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)); {21106#true} is VALID [2022-04-28 07:47:28,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,388 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {21106#true} {21166#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {21166#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:47:28,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {21166#(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; {21188#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:47:28,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {21188#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {21188#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:47:28,388 INFO L272 TraceCheckUtils]: 27: Hoare triple {21188#(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)); {21106#true} is VALID [2022-04-28 07:47:28,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,389 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21106#true} {21188#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {21188#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:47:28,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {21188#(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; {21210#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:47:28,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {21210#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !false; {21210#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:47:28,390 INFO L272 TraceCheckUtils]: 34: Hoare triple {21210#(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)); {21106#true} is VALID [2022-04-28 07:47:28,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,390 INFO L290 TraceCheckUtils]: 36: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,390 INFO L290 TraceCheckUtils]: 37: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,390 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21106#true} {21210#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #54#return; {21210#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:47:28,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {21210#(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; {21232#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:47:28,391 INFO L290 TraceCheckUtils]: 40: Hoare triple {21232#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !false; {21232#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:47:28,391 INFO L272 TraceCheckUtils]: 41: Hoare triple {21232#(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)); {21106#true} is VALID [2022-04-28 07:47:28,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,391 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {21106#true} {21232#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #54#return; {21232#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:47:28,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {21232#(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; {21254#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:47:28,392 INFO L290 TraceCheckUtils]: 47: Hoare triple {21254#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4))} assume !false; {21254#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:47:28,392 INFO L272 TraceCheckUtils]: 48: Hoare triple {21254#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 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)); {21106#true} is VALID [2022-04-28 07:47:28,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,392 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21106#true} {21254#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4))} #54#return; {21254#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:47:28,393 INFO L290 TraceCheckUtils]: 53: Hoare triple {21254#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 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; {21276#(and (= main_~y~0 6) (= (+ main_~c~0 (- 5)) 1))} is VALID [2022-04-28 07:47:28,393 INFO L290 TraceCheckUtils]: 54: Hoare triple {21276#(and (= main_~y~0 6) (= (+ main_~c~0 (- 5)) 1))} assume !false; {21276#(and (= main_~y~0 6) (= (+ main_~c~0 (- 5)) 1))} is VALID [2022-04-28 07:47:28,393 INFO L272 TraceCheckUtils]: 55: Hoare triple {21276#(and (= main_~y~0 6) (= (+ main_~c~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)); {21106#true} is VALID [2022-04-28 07:47:28,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,393 INFO L290 TraceCheckUtils]: 57: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,393 INFO L290 TraceCheckUtils]: 58: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,393 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21106#true} {21276#(and (= main_~y~0 6) (= (+ main_~c~0 (- 5)) 1))} #54#return; {21276#(and (= main_~y~0 6) (= (+ main_~c~0 (- 5)) 1))} is VALID [2022-04-28 07:47:28,394 INFO L290 TraceCheckUtils]: 60: Hoare triple {21276#(and (= main_~y~0 6) (= (+ main_~c~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; {21298#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:47:28,394 INFO L290 TraceCheckUtils]: 61: Hoare triple {21298#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {21298#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:47:28,394 INFO L272 TraceCheckUtils]: 62: Hoare triple {21298#(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)); {21106#true} is VALID [2022-04-28 07:47:28,394 INFO L290 TraceCheckUtils]: 63: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,394 INFO L290 TraceCheckUtils]: 64: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,394 INFO L290 TraceCheckUtils]: 65: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,394 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {21106#true} {21298#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {21298#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:47:28,395 INFO L290 TraceCheckUtils]: 67: Hoare triple {21298#(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; {21320#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 07:47:28,395 INFO L290 TraceCheckUtils]: 68: Hoare triple {21320#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {21320#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 07:47:28,395 INFO L272 TraceCheckUtils]: 69: Hoare triple {21320#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21106#true} is VALID [2022-04-28 07:47:28,395 INFO L290 TraceCheckUtils]: 70: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,395 INFO L290 TraceCheckUtils]: 71: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,395 INFO L290 TraceCheckUtils]: 72: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,396 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {21106#true} {21320#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #54#return; {21320#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 07:47:28,396 INFO L290 TraceCheckUtils]: 74: Hoare triple {21320#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21342#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:47:28,396 INFO L290 TraceCheckUtils]: 75: Hoare triple {21342#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {21342#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:47:28,396 INFO L272 TraceCheckUtils]: 76: Hoare triple {21342#(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)); {21106#true} is VALID [2022-04-28 07:47:28,396 INFO L290 TraceCheckUtils]: 77: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,396 INFO L290 TraceCheckUtils]: 78: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,396 INFO L290 TraceCheckUtils]: 79: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,397 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {21106#true} {21342#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #54#return; {21342#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:47:28,397 INFO L290 TraceCheckUtils]: 81: Hoare triple {21342#(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; {21364#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:47:28,397 INFO L290 TraceCheckUtils]: 82: Hoare triple {21364#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {21364#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:47:28,397 INFO L272 TraceCheckUtils]: 83: Hoare triple {21364#(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)); {21106#true} is VALID [2022-04-28 07:47:28,397 INFO L290 TraceCheckUtils]: 84: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,397 INFO L290 TraceCheckUtils]: 85: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,397 INFO L290 TraceCheckUtils]: 86: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,398 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {21106#true} {21364#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {21364#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:47:28,398 INFO L290 TraceCheckUtils]: 88: Hoare triple {21364#(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; {21386#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:47:28,398 INFO L290 TraceCheckUtils]: 89: Hoare triple {21386#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {21386#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:47:28,398 INFO L272 TraceCheckUtils]: 90: Hoare triple {21386#(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)); {21106#true} is VALID [2022-04-28 07:47:28,398 INFO L290 TraceCheckUtils]: 91: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,398 INFO L290 TraceCheckUtils]: 92: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,399 INFO L290 TraceCheckUtils]: 93: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,399 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21106#true} {21386#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {21386#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 07:47:28,399 INFO L290 TraceCheckUtils]: 95: Hoare triple {21386#(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; {21408#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:47:28,399 INFO L290 TraceCheckUtils]: 96: Hoare triple {21408#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} assume !false; {21408#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:47:28,399 INFO L272 TraceCheckUtils]: 97: Hoare triple {21408#(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)); {21106#true} is VALID [2022-04-28 07:47:28,400 INFO L290 TraceCheckUtils]: 98: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,400 INFO L290 TraceCheckUtils]: 99: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,400 INFO L290 TraceCheckUtils]: 100: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,400 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {21106#true} {21408#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} #54#return; {21408#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:47:28,400 INFO L290 TraceCheckUtils]: 102: Hoare triple {21408#(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; {21430#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-28 07:47:28,401 INFO L290 TraceCheckUtils]: 103: Hoare triple {21430#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} assume !false; {21430#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-28 07:47:28,401 INFO L272 TraceCheckUtils]: 104: Hoare triple {21430#(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)); {21106#true} is VALID [2022-04-28 07:47:28,401 INFO L290 TraceCheckUtils]: 105: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,401 INFO L290 TraceCheckUtils]: 106: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,401 INFO L290 TraceCheckUtils]: 107: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,401 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {21106#true} {21430#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} #54#return; {21430#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-28 07:47:28,401 INFO L290 TraceCheckUtils]: 109: Hoare triple {21430#(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; {21452#(and (= main_~y~0 14) (= 10 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:47:28,402 INFO L290 TraceCheckUtils]: 110: Hoare triple {21452#(and (= main_~y~0 14) (= 10 (+ main_~c~0 (- 4))))} assume !false; {21452#(and (= main_~y~0 14) (= 10 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:47:28,402 INFO L272 TraceCheckUtils]: 111: Hoare triple {21452#(and (= main_~y~0 14) (= 10 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21106#true} is VALID [2022-04-28 07:47:28,402 INFO L290 TraceCheckUtils]: 112: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,402 INFO L290 TraceCheckUtils]: 113: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,402 INFO L290 TraceCheckUtils]: 114: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,402 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {21106#true} {21452#(and (= main_~y~0 14) (= 10 (+ main_~c~0 (- 4))))} #54#return; {21452#(and (= main_~y~0 14) (= 10 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:47:28,403 INFO L290 TraceCheckUtils]: 116: Hoare triple {21452#(and (= main_~y~0 14) (= 10 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21474#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:47:28,403 INFO L290 TraceCheckUtils]: 117: Hoare triple {21474#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {21474#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:47:28,403 INFO L272 TraceCheckUtils]: 118: Hoare triple {21474#(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)); {21106#true} is VALID [2022-04-28 07:47:28,403 INFO L290 TraceCheckUtils]: 119: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,403 INFO L290 TraceCheckUtils]: 120: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,403 INFO L290 TraceCheckUtils]: 121: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,403 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {21106#true} {21474#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {21474#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:47:28,404 INFO L290 TraceCheckUtils]: 123: Hoare triple {21474#(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; {21496#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:28,404 INFO L290 TraceCheckUtils]: 124: Hoare triple {21496#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {21496#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:28,404 INFO L272 TraceCheckUtils]: 125: Hoare triple {21496#(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)); {21106#true} is VALID [2022-04-28 07:47:28,404 INFO L290 TraceCheckUtils]: 126: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,404 INFO L290 TraceCheckUtils]: 127: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,404 INFO L290 TraceCheckUtils]: 128: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,404 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {21106#true} {21496#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #54#return; {21496#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:28,405 INFO L290 TraceCheckUtils]: 130: Hoare triple {21496#(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; {21518#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-28 07:47:28,405 INFO L290 TraceCheckUtils]: 131: Hoare triple {21518#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !false; {21518#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-28 07:47:28,405 INFO L272 TraceCheckUtils]: 132: Hoare triple {21518#(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)); {21106#true} is VALID [2022-04-28 07:47:28,405 INFO L290 TraceCheckUtils]: 133: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,405 INFO L290 TraceCheckUtils]: 134: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,405 INFO L290 TraceCheckUtils]: 135: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,406 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {21106#true} {21518#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} #54#return; {21518#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-28 07:47:28,406 INFO L290 TraceCheckUtils]: 137: Hoare triple {21518#(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; {21540#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-28 07:47:28,406 INFO L290 TraceCheckUtils]: 138: Hoare triple {21540#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} assume !false; {21540#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-28 07:47:28,406 INFO L272 TraceCheckUtils]: 139: Hoare triple {21540#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21106#true} is VALID [2022-04-28 07:47:28,406 INFO L290 TraceCheckUtils]: 140: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,406 INFO L290 TraceCheckUtils]: 141: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,406 INFO L290 TraceCheckUtils]: 142: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,407 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {21106#true} {21540#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} #54#return; {21540#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-28 07:47:28,407 INFO L290 TraceCheckUtils]: 144: Hoare triple {21540#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21562#(and (= 17 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 15))} is VALID [2022-04-28 07:47:28,407 INFO L290 TraceCheckUtils]: 145: Hoare triple {21562#(and (= 17 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 15))} assume !false; {21562#(and (= 17 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 15))} is VALID [2022-04-28 07:47:28,407 INFO L272 TraceCheckUtils]: 146: Hoare triple {21562#(and (= 17 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 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)); {21106#true} is VALID [2022-04-28 07:47:28,407 INFO L290 TraceCheckUtils]: 147: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,407 INFO L290 TraceCheckUtils]: 148: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,408 INFO L290 TraceCheckUtils]: 149: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,408 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {21106#true} {21562#(and (= 17 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 15))} #54#return; {21562#(and (= 17 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 15))} is VALID [2022-04-28 07:47:28,408 INFO L290 TraceCheckUtils]: 151: Hoare triple {21562#(and (= 17 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 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; {21584#(and (= (+ main_~y~0 (- 5)) 15) (= main_~c~0 20))} is VALID [2022-04-28 07:47:28,409 INFO L290 TraceCheckUtils]: 152: Hoare triple {21584#(and (= (+ main_~y~0 (- 5)) 15) (= main_~c~0 20))} assume !false; {21584#(and (= (+ main_~y~0 (- 5)) 15) (= main_~c~0 20))} is VALID [2022-04-28 07:47:28,409 INFO L272 TraceCheckUtils]: 153: Hoare triple {21584#(and (= (+ main_~y~0 (- 5)) 15) (= 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)); {21106#true} is VALID [2022-04-28 07:47:28,409 INFO L290 TraceCheckUtils]: 154: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,409 INFO L290 TraceCheckUtils]: 155: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,409 INFO L290 TraceCheckUtils]: 156: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,409 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {21106#true} {21584#(and (= (+ main_~y~0 (- 5)) 15) (= main_~c~0 20))} #54#return; {21584#(and (= (+ main_~y~0 (- 5)) 15) (= main_~c~0 20))} is VALID [2022-04-28 07:47:28,409 INFO L290 TraceCheckUtils]: 158: Hoare triple {21584#(and (= (+ main_~y~0 (- 5)) 15) (= 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; {21606#(and (= (+ main_~y~0 (- 6)) 15) (= (+ (- 1) main_~c~0) 20))} is VALID [2022-04-28 07:47:28,410 INFO L290 TraceCheckUtils]: 159: Hoare triple {21606#(and (= (+ main_~y~0 (- 6)) 15) (= (+ (- 1) main_~c~0) 20))} assume !false; {21606#(and (= (+ main_~y~0 (- 6)) 15) (= (+ (- 1) main_~c~0) 20))} is VALID [2022-04-28 07:47:28,410 INFO L272 TraceCheckUtils]: 160: Hoare triple {21606#(and (= (+ main_~y~0 (- 6)) 15) (= (+ (- 1) 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)); {21106#true} is VALID [2022-04-28 07:47:28,410 INFO L290 TraceCheckUtils]: 161: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,410 INFO L290 TraceCheckUtils]: 162: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,410 INFO L290 TraceCheckUtils]: 163: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,410 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {21106#true} {21606#(and (= (+ main_~y~0 (- 6)) 15) (= (+ (- 1) main_~c~0) 20))} #54#return; {21606#(and (= (+ main_~y~0 (- 6)) 15) (= (+ (- 1) main_~c~0) 20))} is VALID [2022-04-28 07:47:28,410 INFO L290 TraceCheckUtils]: 165: Hoare triple {21606#(and (= (+ main_~y~0 (- 6)) 15) (= (+ (- 1) 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; {21628#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:28,411 INFO L290 TraceCheckUtils]: 166: Hoare triple {21628#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} assume !false; {21628#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:28,411 INFO L272 TraceCheckUtils]: 167: Hoare triple {21628#(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)); {21106#true} is VALID [2022-04-28 07:47:28,411 INFO L290 TraceCheckUtils]: 168: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,411 INFO L290 TraceCheckUtils]: 169: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,411 INFO L290 TraceCheckUtils]: 170: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,411 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {21106#true} {21628#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} #54#return; {21628#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:28,412 INFO L290 TraceCheckUtils]: 172: Hoare triple {21628#(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; {21650#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:28,412 INFO L290 TraceCheckUtils]: 173: Hoare triple {21650#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} assume !false; {21650#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:28,412 INFO L272 TraceCheckUtils]: 174: Hoare triple {21650#(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)); {21106#true} is VALID [2022-04-28 07:47:28,412 INFO L290 TraceCheckUtils]: 175: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,412 INFO L290 TraceCheckUtils]: 176: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,412 INFO L290 TraceCheckUtils]: 177: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,412 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {21106#true} {21650#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} #54#return; {21650#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:47:28,413 INFO L290 TraceCheckUtils]: 179: Hoare triple {21650#(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; {21672#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-28 07:47:28,413 INFO L290 TraceCheckUtils]: 180: Hoare triple {21672#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} assume !false; {21672#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-28 07:47:28,413 INFO L272 TraceCheckUtils]: 181: Hoare triple {21672#(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)); {21106#true} is VALID [2022-04-28 07:47:28,413 INFO L290 TraceCheckUtils]: 182: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,413 INFO L290 TraceCheckUtils]: 183: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,413 INFO L290 TraceCheckUtils]: 184: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,418 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {21106#true} {21672#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} #54#return; {21672#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-28 07:47:28,419 INFO L290 TraceCheckUtils]: 186: Hoare triple {21672#(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; {21694#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} is VALID [2022-04-28 07:47:28,419 INFO L290 TraceCheckUtils]: 187: Hoare triple {21694#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} assume !false; {21694#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} is VALID [2022-04-28 07:47:28,419 INFO L272 TraceCheckUtils]: 188: Hoare triple {21694#(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)); {21106#true} is VALID [2022-04-28 07:47:28,419 INFO L290 TraceCheckUtils]: 189: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-28 07:47:28,419 INFO L290 TraceCheckUtils]: 190: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-28 07:47:28,419 INFO L290 TraceCheckUtils]: 191: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-28 07:47:28,419 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {21106#true} {21694#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} #54#return; {21694#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} is VALID [2022-04-28 07:47:28,422 INFO L290 TraceCheckUtils]: 193: Hoare triple {21694#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} assume !(~c~0 < ~k~0); {21716#(and (<= main_~k~0 25) (< 24 main_~k~0) (= main_~y~0 25))} is VALID [2022-04-28 07:47:28,422 INFO L272 TraceCheckUtils]: 194: Hoare triple {21716#(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)); {21720#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:47:28,422 INFO L290 TraceCheckUtils]: 195: Hoare triple {21720#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21724#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:47:28,422 INFO L290 TraceCheckUtils]: 196: Hoare triple {21724#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21107#false} is VALID [2022-04-28 07:47:28,423 INFO L290 TraceCheckUtils]: 197: Hoare triple {21107#false} assume !false; {21107#false} is VALID [2022-04-28 07:47:28,424 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:47:28,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:47:28,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:47:28,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645059371] [2022-04-28 07:47:28,783 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:47:28,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046253277] [2022-04-28 07:47:28,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046253277] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:47:28,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:47:28,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2022-04-28 07:47:28,783 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:47:28,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [376574937] [2022-04-28 07:47:28,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [376574937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:47:28,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:47:28,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 07:47:28,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223129770] [2022-04-28 07:47:28,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:47:28,784 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:47:28,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:47:28,785 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:47:29,102 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:29,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 07:47:29,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:47:29,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 07:47:29,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 07:47:29,104 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:47:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:43,675 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-04-28 07:47:43,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 07:47:43,675 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:47:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:47:43,676 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:47:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 132 transitions. [2022-04-28 07:47:43,678 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:47:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 132 transitions. [2022-04-28 07:47:43,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 132 transitions. [2022-04-28 07:47:44,064 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:47:44,066 INFO L225 Difference]: With dead ends: 111 [2022-04-28 07:47:44,066 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 07:47:44,066 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:47:44,067 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s 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, 7.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:47:44,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1339 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-04-28 07:47:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 07:47:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-04-28 07:47:44,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:47:44,177 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:47:44,177 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:47:44,177 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:47:44,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:44,197 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-04-28 07:47:44,197 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-28 07:47:44,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:47:44,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:47:44,197 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:47:44,198 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:47:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:47:44,199 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-04-28 07:47:44,199 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-28 07:47:44,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:47:44,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:47:44,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:47:44,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:47:44,200 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:47:44,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2022-04-28 07:47:44,202 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 198 [2022-04-28 07:47:44,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:47:44,202 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2022-04-28 07:47:44,202 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:47:44,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 131 transitions. [2022-04-28 07:47:44,609 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:47:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-28 07:47:44,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-04-28 07:47:44,610 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:47:44,610 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:47:44,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 07:47:44,811 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:47:44,811 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:47:44,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:47:44,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1629673417, now seen corresponding path program 51 times [2022-04-28 07:47:44,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:47:44,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1718080556] [2022-04-28 07:47:44,883 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,883 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:47:44,883 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:47:44,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1629673417, now seen corresponding path program 52 times [2022-04-28 07:47:44,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:47:44,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578510559] [2022-04-28 07:47:44,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:47:44,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:47:44,897 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:47:44,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494545923] [2022-04-28 07:47:44,897 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:47:44,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:47:44,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:47:44,920 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:47:44,921 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:47:45,585 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:47:45,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:47:45,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-28 07:47:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:47:45,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:47:46,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {22422#true} call ULTIMATE.init(); {22422#true} is VALID [2022-04-28 07:47:46,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {22422#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); {22422#true} is VALID [2022-04-28 07:47:46,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22422#true} {22422#true} #60#return; {22422#true} is VALID [2022-04-28 07:47:46,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {22422#true} call #t~ret5 := main(); {22422#true} is VALID [2022-04-28 07:47:46,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {22422#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; {22422#true} is VALID [2022-04-28 07:47:46,774 INFO L272 TraceCheckUtils]: 6: Hoare triple {22422#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {22422#true} is VALID [2022-04-28 07:47:46,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,774 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22422#true} {22422#true} #52#return; {22422#true} is VALID [2022-04-28 07:47:46,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {22422#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {22460#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:46,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {22460#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {22460#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:46,775 INFO L272 TraceCheckUtils]: 13: Hoare triple {22460#(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)); {22422#true} is VALID [2022-04-28 07:47:46,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,775 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22422#true} {22460#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {22460#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:47:46,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {22460#(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; {22482#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:47:46,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {22482#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {22482#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:47:46,776 INFO L272 TraceCheckUtils]: 20: Hoare triple {22482#(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)); {22422#true} is VALID [2022-04-28 07:47:46,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,777 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {22422#true} {22482#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {22482#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:47:46,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {22482#(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; {22504#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:46,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {22504#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {22504#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:46,777 INFO L272 TraceCheckUtils]: 27: Hoare triple {22504#(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)); {22422#true} is VALID [2022-04-28 07:47:46,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,778 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22422#true} {22504#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {22504#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:46,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {22504#(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; {22526#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:47:46,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {22526#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {22526#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:47:46,779 INFO L272 TraceCheckUtils]: 34: Hoare triple {22526#(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)); {22422#true} is VALID [2022-04-28 07:47:46,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,779 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22422#true} {22526#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {22526#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:47:46,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {22526#(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; {22548#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-28 07:47:46,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {22548#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} assume !false; {22548#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-28 07:47:46,780 INFO L272 TraceCheckUtils]: 41: Hoare triple {22548#(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)); {22422#true} is VALID [2022-04-28 07:47:46,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,781 INFO L290 TraceCheckUtils]: 44: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,781 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {22422#true} {22548#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} #54#return; {22548#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-28 07:47:46,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {22548#(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; {22570#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:47:46,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {22570#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !false; {22570#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:47:46,782 INFO L272 TraceCheckUtils]: 48: Hoare triple {22570#(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)); {22422#true} is VALID [2022-04-28 07:47:46,782 INFO L290 TraceCheckUtils]: 49: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,782 INFO L290 TraceCheckUtils]: 50: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,782 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22422#true} {22570#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #54#return; {22570#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:47:46,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {22570#(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; {22592#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:47:46,783 INFO L290 TraceCheckUtils]: 54: Hoare triple {22592#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {22592#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:47:46,783 INFO L272 TraceCheckUtils]: 55: Hoare triple {22592#(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)); {22422#true} is VALID [2022-04-28 07:47:46,783 INFO L290 TraceCheckUtils]: 56: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,783 INFO L290 TraceCheckUtils]: 57: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,783 INFO L290 TraceCheckUtils]: 58: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,784 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22422#true} {22592#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {22592#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:47:46,784 INFO L290 TraceCheckUtils]: 60: Hoare triple {22592#(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; {22614#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:47:46,785 INFO L290 TraceCheckUtils]: 61: Hoare triple {22614#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {22614#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:47:46,785 INFO L272 TraceCheckUtils]: 62: Hoare triple {22614#(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)); {22422#true} is VALID [2022-04-28 07:47:46,785 INFO L290 TraceCheckUtils]: 63: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,785 INFO L290 TraceCheckUtils]: 64: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,785 INFO L290 TraceCheckUtils]: 65: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,785 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {22422#true} {22614#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {22614#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:47:46,786 INFO L290 TraceCheckUtils]: 67: Hoare triple {22614#(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; {22636#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:47:46,786 INFO L290 TraceCheckUtils]: 68: Hoare triple {22636#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {22636#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:47:46,786 INFO L272 TraceCheckUtils]: 69: Hoare triple {22636#(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)); {22422#true} is VALID [2022-04-28 07:47:46,786 INFO L290 TraceCheckUtils]: 70: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,786 INFO L290 TraceCheckUtils]: 71: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,786 INFO L290 TraceCheckUtils]: 72: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,787 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {22422#true} {22636#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {22636#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:47:46,787 INFO L290 TraceCheckUtils]: 74: Hoare triple {22636#(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; {22658#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:47:46,787 INFO L290 TraceCheckUtils]: 75: Hoare triple {22658#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {22658#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:47:46,787 INFO L272 TraceCheckUtils]: 76: Hoare triple {22658#(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)); {22422#true} is VALID [2022-04-28 07:47:46,788 INFO L290 TraceCheckUtils]: 77: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,788 INFO L290 TraceCheckUtils]: 78: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,788 INFO L290 TraceCheckUtils]: 79: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,788 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22422#true} {22658#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {22658#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:47:46,788 INFO L290 TraceCheckUtils]: 81: Hoare triple {22658#(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; {22680#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:47:46,789 INFO L290 TraceCheckUtils]: 82: Hoare triple {22680#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {22680#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:47:46,789 INFO L272 TraceCheckUtils]: 83: Hoare triple {22680#(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)); {22422#true} is VALID [2022-04-28 07:47:46,789 INFO L290 TraceCheckUtils]: 84: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,789 INFO L290 TraceCheckUtils]: 85: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,789 INFO L290 TraceCheckUtils]: 86: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,789 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {22422#true} {22680#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #54#return; {22680#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:47:46,790 INFO L290 TraceCheckUtils]: 88: Hoare triple {22680#(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; {22702#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:47:46,790 INFO L290 TraceCheckUtils]: 89: Hoare triple {22702#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {22702#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:47:46,790 INFO L272 TraceCheckUtils]: 90: Hoare triple {22702#(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)); {22422#true} is VALID [2022-04-28 07:47:46,790 INFO L290 TraceCheckUtils]: 91: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,790 INFO L290 TraceCheckUtils]: 92: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,791 INFO L290 TraceCheckUtils]: 93: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,791 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22422#true} {22702#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {22702#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:47:46,791 INFO L290 TraceCheckUtils]: 95: Hoare triple {22702#(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; {22724#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:47:46,792 INFO L290 TraceCheckUtils]: 96: Hoare triple {22724#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {22724#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:47:46,792 INFO L272 TraceCheckUtils]: 97: Hoare triple {22724#(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)); {22422#true} is VALID [2022-04-28 07:47:46,792 INFO L290 TraceCheckUtils]: 98: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,792 INFO L290 TraceCheckUtils]: 99: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,792 INFO L290 TraceCheckUtils]: 100: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,792 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {22422#true} {22724#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {22724#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:47:46,793 INFO L290 TraceCheckUtils]: 102: Hoare triple {22724#(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; {22746#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:47:46,793 INFO L290 TraceCheckUtils]: 103: Hoare triple {22746#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {22746#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:47:46,793 INFO L272 TraceCheckUtils]: 104: Hoare triple {22746#(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)); {22422#true} is VALID [2022-04-28 07:47:46,793 INFO L290 TraceCheckUtils]: 105: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,793 INFO L290 TraceCheckUtils]: 106: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,793 INFO L290 TraceCheckUtils]: 107: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,794 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {22422#true} {22746#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {22746#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:47:46,794 INFO L290 TraceCheckUtils]: 109: Hoare triple {22746#(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; {22768#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:47:46,794 INFO L290 TraceCheckUtils]: 110: Hoare triple {22768#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} assume !false; {22768#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:47:46,795 INFO L272 TraceCheckUtils]: 111: Hoare triple {22768#(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)); {22422#true} is VALID [2022-04-28 07:47:46,795 INFO L290 TraceCheckUtils]: 112: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,795 INFO L290 TraceCheckUtils]: 113: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,795 INFO L290 TraceCheckUtils]: 114: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,795 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {22422#true} {22768#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} #54#return; {22768#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:47:46,796 INFO L290 TraceCheckUtils]: 116: Hoare triple {22768#(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; {22790#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:46,796 INFO L290 TraceCheckUtils]: 117: Hoare triple {22790#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !false; {22790#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:46,796 INFO L272 TraceCheckUtils]: 118: Hoare triple {22790#(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)); {22422#true} is VALID [2022-04-28 07:47:46,796 INFO L290 TraceCheckUtils]: 119: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,796 INFO L290 TraceCheckUtils]: 120: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,796 INFO L290 TraceCheckUtils]: 121: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,797 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {22422#true} {22790#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} #54#return; {22790#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:46,797 INFO L290 TraceCheckUtils]: 123: Hoare triple {22790#(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; {22812#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-28 07:47:46,797 INFO L290 TraceCheckUtils]: 124: Hoare triple {22812#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} assume !false; {22812#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-28 07:47:46,797 INFO L272 TraceCheckUtils]: 125: Hoare triple {22812#(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)); {22422#true} is VALID [2022-04-28 07:47:46,798 INFO L290 TraceCheckUtils]: 126: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,798 INFO L290 TraceCheckUtils]: 127: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,798 INFO L290 TraceCheckUtils]: 128: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,798 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {22422#true} {22812#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} #54#return; {22812#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-28 07:47:46,798 INFO L290 TraceCheckUtils]: 130: Hoare triple {22812#(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; {22834#(and (= 16 (+ (- 1) main_~y~0)) (= 13 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:47:46,799 INFO L290 TraceCheckUtils]: 131: Hoare triple {22834#(and (= 16 (+ (- 1) main_~y~0)) (= 13 (+ main_~c~0 (- 4))))} assume !false; {22834#(and (= 16 (+ (- 1) main_~y~0)) (= 13 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:47:46,799 INFO L272 TraceCheckUtils]: 132: Hoare triple {22834#(and (= 16 (+ (- 1) main_~y~0)) (= 13 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22422#true} is VALID [2022-04-28 07:47:46,799 INFO L290 TraceCheckUtils]: 133: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,799 INFO L290 TraceCheckUtils]: 134: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,799 INFO L290 TraceCheckUtils]: 135: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,800 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {22422#true} {22834#(and (= 16 (+ (- 1) main_~y~0)) (= 13 (+ main_~c~0 (- 4))))} #54#return; {22834#(and (= 16 (+ (- 1) main_~y~0)) (= 13 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 07:47:46,800 INFO L290 TraceCheckUtils]: 137: Hoare triple {22834#(and (= 16 (+ (- 1) main_~y~0)) (= 13 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22856#(and (= (+ main_~c~0 (- 5)) 13) (= (+ (- 2) main_~y~0) 16))} is VALID [2022-04-28 07:47:46,800 INFO L290 TraceCheckUtils]: 138: Hoare triple {22856#(and (= (+ main_~c~0 (- 5)) 13) (= (+ (- 2) main_~y~0) 16))} assume !false; {22856#(and (= (+ main_~c~0 (- 5)) 13) (= (+ (- 2) main_~y~0) 16))} is VALID [2022-04-28 07:47:46,800 INFO L272 TraceCheckUtils]: 139: Hoare triple {22856#(and (= (+ main_~c~0 (- 5)) 13) (= (+ (- 2) 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)); {22422#true} is VALID [2022-04-28 07:47:46,800 INFO L290 TraceCheckUtils]: 140: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,801 INFO L290 TraceCheckUtils]: 141: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,801 INFO L290 TraceCheckUtils]: 142: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,801 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {22422#true} {22856#(and (= (+ main_~c~0 (- 5)) 13) (= (+ (- 2) main_~y~0) 16))} #54#return; {22856#(and (= (+ main_~c~0 (- 5)) 13) (= (+ (- 2) main_~y~0) 16))} is VALID [2022-04-28 07:47:46,801 INFO L290 TraceCheckUtils]: 144: Hoare triple {22856#(and (= (+ main_~c~0 (- 5)) 13) (= (+ (- 2) 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; {22878#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-28 07:47:46,802 INFO L290 TraceCheckUtils]: 145: Hoare triple {22878#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} assume !false; {22878#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-28 07:47:46,802 INFO L272 TraceCheckUtils]: 146: Hoare triple {22878#(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)); {22422#true} is VALID [2022-04-28 07:47:46,802 INFO L290 TraceCheckUtils]: 147: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,802 INFO L290 TraceCheckUtils]: 148: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,802 INFO L290 TraceCheckUtils]: 149: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,802 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {22422#true} {22878#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} #54#return; {22878#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-28 07:47:46,803 INFO L290 TraceCheckUtils]: 151: Hoare triple {22878#(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; {22900#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-28 07:47:46,803 INFO L290 TraceCheckUtils]: 152: Hoare triple {22900#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !false; {22900#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-28 07:47:46,803 INFO L272 TraceCheckUtils]: 153: Hoare triple {22900#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22422#true} is VALID [2022-04-28 07:47:46,803 INFO L290 TraceCheckUtils]: 154: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,803 INFO L290 TraceCheckUtils]: 155: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,803 INFO L290 TraceCheckUtils]: 156: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,804 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {22422#true} {22900#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} #54#return; {22900#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-28 07:47:46,804 INFO L290 TraceCheckUtils]: 158: Hoare triple {22900#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22922#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:46,805 INFO L290 TraceCheckUtils]: 159: Hoare triple {22922#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} assume !false; {22922#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:46,805 INFO L272 TraceCheckUtils]: 160: Hoare triple {22922#(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)); {22422#true} is VALID [2022-04-28 07:47:46,805 INFO L290 TraceCheckUtils]: 161: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,805 INFO L290 TraceCheckUtils]: 162: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,805 INFO L290 TraceCheckUtils]: 163: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,805 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {22422#true} {22922#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} #54#return; {22922#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:47:46,806 INFO L290 TraceCheckUtils]: 165: Hoare triple {22922#(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; {22944#(and (= main_~y~0 22) (= 19 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:47:46,806 INFO L290 TraceCheckUtils]: 166: Hoare triple {22944#(and (= main_~y~0 22) (= 19 (+ main_~c~0 (- 3))))} assume !false; {22944#(and (= main_~y~0 22) (= 19 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:47:46,806 INFO L272 TraceCheckUtils]: 167: Hoare triple {22944#(and (= main_~y~0 22) (= 19 (+ 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)); {22422#true} is VALID [2022-04-28 07:47:46,806 INFO L290 TraceCheckUtils]: 168: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,806 INFO L290 TraceCheckUtils]: 169: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,806 INFO L290 TraceCheckUtils]: 170: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,807 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {22422#true} {22944#(and (= main_~y~0 22) (= 19 (+ main_~c~0 (- 3))))} #54#return; {22944#(and (= main_~y~0 22) (= 19 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:47:46,807 INFO L290 TraceCheckUtils]: 172: Hoare triple {22944#(and (= main_~y~0 22) (= 19 (+ 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; {22966#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:47:46,808 INFO L290 TraceCheckUtils]: 173: Hoare triple {22966#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {22966#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:47:46,808 INFO L272 TraceCheckUtils]: 174: Hoare triple {22966#(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)); {22422#true} is VALID [2022-04-28 07:47:46,808 INFO L290 TraceCheckUtils]: 175: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,808 INFO L290 TraceCheckUtils]: 176: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,808 INFO L290 TraceCheckUtils]: 177: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,808 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {22422#true} {22966#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {22966#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:47:46,809 INFO L290 TraceCheckUtils]: 179: Hoare triple {22966#(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; {22988#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-28 07:47:46,809 INFO L290 TraceCheckUtils]: 180: Hoare triple {22988#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} assume !false; {22988#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-28 07:47:46,809 INFO L272 TraceCheckUtils]: 181: Hoare triple {22988#(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)); {22422#true} is VALID [2022-04-28 07:47:46,809 INFO L290 TraceCheckUtils]: 182: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,809 INFO L290 TraceCheckUtils]: 183: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,809 INFO L290 TraceCheckUtils]: 184: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,810 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {22422#true} {22988#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} #54#return; {22988#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-28 07:47:46,810 INFO L290 TraceCheckUtils]: 186: Hoare triple {22988#(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; {23010#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} is VALID [2022-04-28 07:47:46,811 INFO L290 TraceCheckUtils]: 187: Hoare triple {23010#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} assume !false; {23010#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} is VALID [2022-04-28 07:47:46,811 INFO L272 TraceCheckUtils]: 188: Hoare triple {23010#(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)); {22422#true} is VALID [2022-04-28 07:47:46,811 INFO L290 TraceCheckUtils]: 189: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,811 INFO L290 TraceCheckUtils]: 190: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,811 INFO L290 TraceCheckUtils]: 191: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,811 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {22422#true} {23010#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} #54#return; {23010#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} is VALID [2022-04-28 07:47:46,812 INFO L290 TraceCheckUtils]: 193: Hoare triple {23010#(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; {23032#(and (= 23 (+ main_~y~0 (- 3))) (<= main_~c~0 26) (< 25 main_~k~0))} is VALID [2022-04-28 07:47:46,812 INFO L290 TraceCheckUtils]: 194: Hoare triple {23032#(and (= 23 (+ main_~y~0 (- 3))) (<= main_~c~0 26) (< 25 main_~k~0))} assume !false; {23032#(and (= 23 (+ main_~y~0 (- 3))) (<= main_~c~0 26) (< 25 main_~k~0))} is VALID [2022-04-28 07:47:46,812 INFO L272 TraceCheckUtils]: 195: Hoare triple {23032#(and (= 23 (+ main_~y~0 (- 3))) (<= main_~c~0 26) (< 25 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)); {22422#true} is VALID [2022-04-28 07:47:46,812 INFO L290 TraceCheckUtils]: 196: Hoare triple {22422#true} ~cond := #in~cond; {22422#true} is VALID [2022-04-28 07:47:46,812 INFO L290 TraceCheckUtils]: 197: Hoare triple {22422#true} assume !(0 == ~cond); {22422#true} is VALID [2022-04-28 07:47:46,813 INFO L290 TraceCheckUtils]: 198: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 07:47:46,813 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {22422#true} {23032#(and (= 23 (+ main_~y~0 (- 3))) (<= main_~c~0 26) (< 25 main_~k~0))} #54#return; {23032#(and (= 23 (+ main_~y~0 (- 3))) (<= main_~c~0 26) (< 25 main_~k~0))} is VALID [2022-04-28 07:47:46,816 INFO L290 TraceCheckUtils]: 200: Hoare triple {23032#(and (= 23 (+ main_~y~0 (- 3))) (<= main_~c~0 26) (< 25 main_~k~0))} assume !(~c~0 < ~k~0); {23054#(and (= 23 (+ main_~y~0 (- 3))) (<= main_~k~0 26) (< 25 main_~k~0))} is VALID [2022-04-28 07:47:46,816 INFO L272 TraceCheckUtils]: 201: Hoare triple {23054#(and (= 23 (+ main_~y~0 (- 3))) (<= main_~k~0 26) (< 25 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23058#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:47:46,817 INFO L290 TraceCheckUtils]: 202: Hoare triple {23058#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23062#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:47:46,817 INFO L290 TraceCheckUtils]: 203: Hoare triple {23062#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22423#false} is VALID [2022-04-28 07:47:46,817 INFO L290 TraceCheckUtils]: 204: Hoare triple {22423#false} assume !false; {22423#false} is VALID [2022-04-28 07:47:46,818 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:47:46,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:47:47,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:47:47,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578510559] [2022-04-28 07:47:47,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:47:47,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494545923] [2022-04-28 07:47:47,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494545923] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:47:47,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:47:47,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2022-04-28 07:47:47,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:47:47,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1718080556] [2022-04-28 07:47:47,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1718080556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:47:47,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:47:47,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 07:47:47,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570991214] [2022-04-28 07:47:47,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:47:47,151 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:47:47,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:47:47,151 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:47:47,494 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:47:47,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 07:47:47,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:47:47,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 07:47:47,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 07:47:47,495 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:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:48:05,986 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-28 07:48:05,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 07:48:05,987 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:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:48:05,987 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:05,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 136 transitions. [2022-04-28 07:48:05,989 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:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 136 transitions. [2022-04-28 07:48:05,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 136 transitions. [2022-04-28 07:48:06,428 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:06,430 INFO L225 Difference]: With dead ends: 114 [2022-04-28 07:48:06,430 INFO L226 Difference]: Without dead ends: 109 [2022-04-28 07:48:06,430 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:06,431 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s 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, 9.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:48:06,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1415 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-04-28 07:48:06,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-28 07:48:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-28 07:48:06,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:48:06,554 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:06,554 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:06,555 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:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:48:06,564 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-28 07:48:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-28 07:48:06,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:48:06,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:48:06,576 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:06,577 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:06,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:48:06,579 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-28 07:48:06,579 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-28 07:48:06,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:48:06,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:48:06,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:48:06,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:48:06,579 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:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-28 07:48:06,581 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 205 [2022-04-28 07:48:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:48:06,582 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-28 07:48:06,582 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:06,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 135 transitions. [2022-04-28 07:48:07,072 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:07,073 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-28 07:48:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-04-28 07:48:07,074 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:48:07,074 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:07,090 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:07,274 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:07,274 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:48:07,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:48:07,275 INFO L85 PathProgramCache]: Analyzing trace with hash -12241624, now seen corresponding path program 53 times [2022-04-28 07:48:07,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:48:07,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1466182227] [2022-04-28 07:48:07,372 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:07,372 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:48:07,372 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:48:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash -12241624, now seen corresponding path program 54 times [2022-04-28 07:48:07,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:48:07,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444179369] [2022-04-28 07:48:07,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:48:07,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:48:07,386 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:48:07,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516161615] [2022-04-28 07:48:07,387 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:48:07,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:48:07,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:48:07,388 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:07,389 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:01,154 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-28 07:49:01,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:49:01,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 133 conjunts are in the unsatisfiable core [2022-04-28 07:49:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:49:01,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:49:02,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {23778#true} call ULTIMATE.init(); {23778#true} is VALID [2022-04-28 07:49:02,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {23778#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); {23778#true} is VALID [2022-04-28 07:49:02,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23778#true} {23778#true} #60#return; {23778#true} is VALID [2022-04-28 07:49:02,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {23778#true} call #t~ret5 := main(); {23778#true} is VALID [2022-04-28 07:49:02,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {23778#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; {23778#true} is VALID [2022-04-28 07:49:02,311 INFO L272 TraceCheckUtils]: 6: Hoare triple {23778#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {23778#true} is VALID [2022-04-28 07:49:02,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,311 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23778#true} {23778#true} #52#return; {23778#true} is VALID [2022-04-28 07:49:02,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {23778#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {23816#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:49:02,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {23816#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {23816#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:49:02,312 INFO L272 TraceCheckUtils]: 13: Hoare triple {23816#(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)); {23778#true} is VALID [2022-04-28 07:49:02,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,312 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {23778#true} {23816#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {23816#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:49:02,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {23816#(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; {23838#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:49:02,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {23838#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {23838#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:49:02,313 INFO L272 TraceCheckUtils]: 20: Hoare triple {23838#(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)); {23778#true} is VALID [2022-04-28 07:49:02,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,313 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {23778#true} {23838#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {23838#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:49:02,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {23838#(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; {23860#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:49:02,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {23860#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {23860#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:49:02,314 INFO L272 TraceCheckUtils]: 27: Hoare triple {23860#(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)); {23778#true} is VALID [2022-04-28 07:49:02,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,314 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23778#true} {23860#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {23860#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:49:02,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {23860#(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; {23882#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:49:02,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {23882#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {23882#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:49:02,315 INFO L272 TraceCheckUtils]: 34: Hoare triple {23882#(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)); {23778#true} is VALID [2022-04-28 07:49:02,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,316 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {23778#true} {23882#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #54#return; {23882#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:49:02,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {23882#(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; {23904#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-28 07:49:02,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {23904#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} assume !false; {23904#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-28 07:49:02,316 INFO L272 TraceCheckUtils]: 41: Hoare triple {23904#(and (= (+ main_~y~0 (- 4)) 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)); {23778#true} is VALID [2022-04-28 07:49:02,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,317 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {23778#true} {23904#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} #54#return; {23904#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-28 07:49:02,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {23904#(and (= (+ main_~y~0 (- 4)) 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; {23926#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} is VALID [2022-04-28 07:49:02,319 INFO L290 TraceCheckUtils]: 47: Hoare triple {23926#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} assume !false; {23926#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} is VALID [2022-04-28 07:49:02,319 INFO L272 TraceCheckUtils]: 48: Hoare triple {23926#(and (= (+ main_~y~0 (- 5)) 0) (= 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)); {23778#true} is VALID [2022-04-28 07:49:02,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,319 INFO L290 TraceCheckUtils]: 51: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,319 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {23778#true} {23926#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} #54#return; {23926#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} is VALID [2022-04-28 07:49:02,319 INFO L290 TraceCheckUtils]: 53: Hoare triple {23926#(and (= (+ main_~y~0 (- 5)) 0) (= 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; {23948#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:49:02,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {23948#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {23948#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:49:02,320 INFO L272 TraceCheckUtils]: 55: Hoare triple {23948#(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)); {23778#true} is VALID [2022-04-28 07:49:02,320 INFO L290 TraceCheckUtils]: 56: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,320 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23778#true} {23948#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {23948#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:49:02,320 INFO L290 TraceCheckUtils]: 60: Hoare triple {23948#(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; {23970#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:02,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {23970#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {23970#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:02,321 INFO L272 TraceCheckUtils]: 62: Hoare triple {23970#(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)); {23778#true} is VALID [2022-04-28 07:49:02,321 INFO L290 TraceCheckUtils]: 63: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,321 INFO L290 TraceCheckUtils]: 64: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,321 INFO L290 TraceCheckUtils]: 65: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,321 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {23778#true} {23970#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {23970#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:02,322 INFO L290 TraceCheckUtils]: 67: Hoare triple {23970#(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; {23992#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:49:02,322 INFO L290 TraceCheckUtils]: 68: Hoare triple {23992#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {23992#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:49:02,322 INFO L272 TraceCheckUtils]: 69: Hoare triple {23992#(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)); {23778#true} is VALID [2022-04-28 07:49:02,322 INFO L290 TraceCheckUtils]: 70: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,322 INFO L290 TraceCheckUtils]: 71: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,322 INFO L290 TraceCheckUtils]: 72: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,322 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {23778#true} {23992#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {23992#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:49:02,323 INFO L290 TraceCheckUtils]: 74: Hoare triple {23992#(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; {24014#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:49:02,323 INFO L290 TraceCheckUtils]: 75: Hoare triple {24014#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {24014#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:49:02,323 INFO L272 TraceCheckUtils]: 76: Hoare triple {24014#(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)); {23778#true} is VALID [2022-04-28 07:49:02,323 INFO L290 TraceCheckUtils]: 77: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,323 INFO L290 TraceCheckUtils]: 78: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,323 INFO L290 TraceCheckUtils]: 79: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,323 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {23778#true} {24014#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #54#return; {24014#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:49:02,324 INFO L290 TraceCheckUtils]: 81: Hoare triple {24014#(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; {24036#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-28 07:49:02,324 INFO L290 TraceCheckUtils]: 82: Hoare triple {24036#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !false; {24036#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-28 07:49:02,324 INFO L272 TraceCheckUtils]: 83: Hoare triple {24036#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23778#true} is VALID [2022-04-28 07:49:02,324 INFO L290 TraceCheckUtils]: 84: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,324 INFO L290 TraceCheckUtils]: 85: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,324 INFO L290 TraceCheckUtils]: 86: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,324 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {23778#true} {24036#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} #54#return; {24036#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-28 07:49:02,325 INFO L290 TraceCheckUtils]: 88: Hoare triple {24036#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24058#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-28 07:49:02,325 INFO L290 TraceCheckUtils]: 89: Hoare triple {24058#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} assume !false; {24058#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-28 07:49:02,325 INFO L272 TraceCheckUtils]: 90: Hoare triple {24058#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23778#true} is VALID [2022-04-28 07:49:02,325 INFO L290 TraceCheckUtils]: 91: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,325 INFO L290 TraceCheckUtils]: 92: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,325 INFO L290 TraceCheckUtils]: 93: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,325 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {23778#true} {24058#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} #54#return; {24058#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-28 07:49:02,326 INFO L290 TraceCheckUtils]: 95: Hoare triple {24058#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24080#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:49:02,326 INFO L290 TraceCheckUtils]: 96: Hoare triple {24080#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {24080#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:49:02,326 INFO L272 TraceCheckUtils]: 97: Hoare triple {24080#(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)); {23778#true} is VALID [2022-04-28 07:49:02,326 INFO L290 TraceCheckUtils]: 98: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,326 INFO L290 TraceCheckUtils]: 99: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,326 INFO L290 TraceCheckUtils]: 100: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,327 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {23778#true} {24080#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {24080#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:49:02,327 INFO L290 TraceCheckUtils]: 102: Hoare triple {24080#(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; {24102#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:49:02,327 INFO L290 TraceCheckUtils]: 103: Hoare triple {24102#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {24102#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:49:02,327 INFO L272 TraceCheckUtils]: 104: Hoare triple {24102#(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)); {23778#true} is VALID [2022-04-28 07:49:02,327 INFO L290 TraceCheckUtils]: 105: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,327 INFO L290 TraceCheckUtils]: 106: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,327 INFO L290 TraceCheckUtils]: 107: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,328 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {23778#true} {24102#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {24102#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:49:02,328 INFO L290 TraceCheckUtils]: 109: Hoare triple {24102#(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; {24124#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:49:02,328 INFO L290 TraceCheckUtils]: 110: Hoare triple {24124#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} assume !false; {24124#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:49:02,328 INFO L272 TraceCheckUtils]: 111: Hoare triple {24124#(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)); {23778#true} is VALID [2022-04-28 07:49:02,328 INFO L290 TraceCheckUtils]: 112: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,328 INFO L290 TraceCheckUtils]: 113: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,328 INFO L290 TraceCheckUtils]: 114: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,330 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {23778#true} {24124#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} #54#return; {24124#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:49:02,330 INFO L290 TraceCheckUtils]: 116: Hoare triple {24124#(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; {24146#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:49:02,330 INFO L290 TraceCheckUtils]: 117: Hoare triple {24146#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !false; {24146#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:49:02,330 INFO L272 TraceCheckUtils]: 118: Hoare triple {24146#(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)); {23778#true} is VALID [2022-04-28 07:49:02,330 INFO L290 TraceCheckUtils]: 119: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,331 INFO L290 TraceCheckUtils]: 120: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,331 INFO L290 TraceCheckUtils]: 121: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,355 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23778#true} {24146#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} #54#return; {24146#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:49:02,356 INFO L290 TraceCheckUtils]: 123: Hoare triple {24146#(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; {24168#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:02,356 INFO L290 TraceCheckUtils]: 124: Hoare triple {24168#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {24168#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:02,356 INFO L272 TraceCheckUtils]: 125: Hoare triple {24168#(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)); {23778#true} is VALID [2022-04-28 07:49:02,356 INFO L290 TraceCheckUtils]: 126: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,356 INFO L290 TraceCheckUtils]: 127: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,356 INFO L290 TraceCheckUtils]: 128: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,357 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {23778#true} {24168#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #54#return; {24168#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:02,357 INFO L290 TraceCheckUtils]: 130: Hoare triple {24168#(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; {24190#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-28 07:49:02,357 INFO L290 TraceCheckUtils]: 131: Hoare triple {24190#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !false; {24190#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-28 07:49:02,357 INFO L272 TraceCheckUtils]: 132: Hoare triple {24190#(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)); {23778#true} is VALID [2022-04-28 07:49:02,357 INFO L290 TraceCheckUtils]: 133: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,357 INFO L290 TraceCheckUtils]: 134: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,357 INFO L290 TraceCheckUtils]: 135: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,358 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {23778#true} {24190#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} #54#return; {24190#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-28 07:49:02,358 INFO L290 TraceCheckUtils]: 137: Hoare triple {24190#(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; {24212#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:49:02,358 INFO L290 TraceCheckUtils]: 138: Hoare triple {24212#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !false; {24212#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:49:02,359 INFO L272 TraceCheckUtils]: 139: Hoare triple {24212#(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)); {23778#true} is VALID [2022-04-28 07:49:02,359 INFO L290 TraceCheckUtils]: 140: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,359 INFO L290 TraceCheckUtils]: 141: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,359 INFO L290 TraceCheckUtils]: 142: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,359 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {23778#true} {24212#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} #54#return; {24212#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:49:02,359 INFO L290 TraceCheckUtils]: 144: Hoare triple {24212#(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; {24234#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-28 07:49:02,360 INFO L290 TraceCheckUtils]: 145: Hoare triple {24234#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !false; {24234#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-28 07:49:02,360 INFO L272 TraceCheckUtils]: 146: Hoare triple {24234#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23778#true} is VALID [2022-04-28 07:49:02,360 INFO L290 TraceCheckUtils]: 147: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,360 INFO L290 TraceCheckUtils]: 148: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,360 INFO L290 TraceCheckUtils]: 149: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,360 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {23778#true} {24234#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} #54#return; {24234#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-28 07:49:02,361 INFO L290 TraceCheckUtils]: 151: Hoare triple {24234#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24256#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-28 07:49:02,361 INFO L290 TraceCheckUtils]: 152: Hoare triple {24256#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} assume !false; {24256#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-28 07:49:02,361 INFO L272 TraceCheckUtils]: 153: Hoare triple {24256#(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)); {23778#true} is VALID [2022-04-28 07:49:02,361 INFO L290 TraceCheckUtils]: 154: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,361 INFO L290 TraceCheckUtils]: 155: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,361 INFO L290 TraceCheckUtils]: 156: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,361 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {23778#true} {24256#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} #54#return; {24256#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-28 07:49:02,362 INFO L290 TraceCheckUtils]: 158: Hoare triple {24256#(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; {24278#(and (= (+ (- 1) main_~c~0) 20) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:49:02,362 INFO L290 TraceCheckUtils]: 159: Hoare triple {24278#(and (= (+ (- 1) main_~c~0) 20) (= 19 (+ (- 2) main_~y~0)))} assume !false; {24278#(and (= (+ (- 1) main_~c~0) 20) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:49:02,362 INFO L272 TraceCheckUtils]: 160: Hoare triple {24278#(and (= (+ (- 1) main_~c~0) 20) (= 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)); {23778#true} is VALID [2022-04-28 07:49:02,362 INFO L290 TraceCheckUtils]: 161: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,362 INFO L290 TraceCheckUtils]: 162: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,362 INFO L290 TraceCheckUtils]: 163: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,363 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {23778#true} {24278#(and (= (+ (- 1) main_~c~0) 20) (= 19 (+ (- 2) main_~y~0)))} #54#return; {24278#(and (= (+ (- 1) main_~c~0) 20) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:49:02,363 INFO L290 TraceCheckUtils]: 165: Hoare triple {24278#(and (= (+ (- 1) main_~c~0) 20) (= 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; {24300#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-28 07:49:02,363 INFO L290 TraceCheckUtils]: 166: Hoare triple {24300#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {24300#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-28 07:49:02,363 INFO L272 TraceCheckUtils]: 167: Hoare triple {24300#(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)); {23778#true} is VALID [2022-04-28 07:49:02,363 INFO L290 TraceCheckUtils]: 168: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,364 INFO L290 TraceCheckUtils]: 169: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,364 INFO L290 TraceCheckUtils]: 170: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,364 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {23778#true} {24300#(and (= main_~y~0 22) (= main_~c~0 22))} #54#return; {24300#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-28 07:49:02,364 INFO L290 TraceCheckUtils]: 172: Hoare triple {24300#(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; {24322#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:02,365 INFO L290 TraceCheckUtils]: 173: Hoare triple {24322#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} assume !false; {24322#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:02,365 INFO L272 TraceCheckUtils]: 174: Hoare triple {24322#(and (= (+ (- 1) main_~c~0) 22) (= 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)); {23778#true} is VALID [2022-04-28 07:49:02,365 INFO L290 TraceCheckUtils]: 175: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,365 INFO L290 TraceCheckUtils]: 176: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,365 INFO L290 TraceCheckUtils]: 177: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,365 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {23778#true} {24322#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} #54#return; {24322#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:02,365 INFO L290 TraceCheckUtils]: 179: Hoare triple {24322#(and (= (+ (- 1) main_~c~0) 22) (= 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; {24344#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-28 07:49:02,366 INFO L290 TraceCheckUtils]: 180: Hoare triple {24344#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {24344#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-28 07:49:02,366 INFO L272 TraceCheckUtils]: 181: Hoare triple {24344#(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)); {23778#true} is VALID [2022-04-28 07:49:02,366 INFO L290 TraceCheckUtils]: 182: Hoare triple {23778#true} ~cond := #in~cond; {23778#true} is VALID [2022-04-28 07:49:02,366 INFO L290 TraceCheckUtils]: 183: Hoare triple {23778#true} assume !(0 == ~cond); {23778#true} is VALID [2022-04-28 07:49:02,366 INFO L290 TraceCheckUtils]: 184: Hoare triple {23778#true} assume true; {23778#true} is VALID [2022-04-28 07:49:02,366 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {23778#true} {24344#(and (= main_~c~0 24) (= main_~y~0 24))} #54#return; {24344#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-28 07:49:02,367 INFO L290 TraceCheckUtils]: 186: Hoare triple {24344#(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; {24366#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-28 07:49:02,367 INFO L290 TraceCheckUtils]: 187: Hoare triple {24366#(and (= main_~y~0 25) (= main_~c~0 25))} assume !false; {24366#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-28 07:49:02,367 INFO L272 TraceCheckUtils]: 188: Hoare triple {24366#(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)); {23778#true} is VALID [2022-04-28 07:49:02,367 INFO L290 TraceCheckUtils]: 189: Hoare triple {23778#true} ~cond := #in~cond; {24376#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:49:02,367 INFO L290 TraceCheckUtils]: 190: Hoare triple {24376#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {24380#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:02,368 INFO L290 TraceCheckUtils]: 191: Hoare triple {24380#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {24380#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:02,368 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {24380#(not (= |__VERIFIER_assert_#in~cond| 0))} {24366#(and (= main_~y~0 25) (= main_~c~0 25))} #54#return; {24387#(and (= main_~y~0 25) (= main_~c~0 25) (= (+ (* 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:49:02,369 INFO L290 TraceCheckUtils]: 193: Hoare triple {24387#(and (= main_~y~0 25) (= main_~c~0 25) (= (+ (* 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; {24391#(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:02,369 INFO L290 TraceCheckUtils]: 194: Hoare triple {24391#(and (= main_~c~0 26) (<= (+ 105625 (* main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 26))} assume !false; {24391#(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:02,369 INFO L272 TraceCheckUtils]: 195: Hoare triple {24391#(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)); {23778#true} is VALID [2022-04-28 07:49:02,369 INFO L290 TraceCheckUtils]: 196: Hoare triple {23778#true} ~cond := #in~cond; {24376#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:49:02,369 INFO L290 TraceCheckUtils]: 197: Hoare triple {24376#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {24380#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:02,370 INFO L290 TraceCheckUtils]: 198: Hoare triple {24380#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {24380#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:02,370 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {24380#(not (= |__VERIFIER_assert_#in~cond| 0))} {24391#(and (= main_~c~0 26) (<= (+ 105625 (* main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 26))} #54#return; {24410#(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:02,371 INFO L290 TraceCheckUtils]: 200: Hoare triple {24410#(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; {24414#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0) (<= main_~x~0 (+ (* 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)))))} is VALID [2022-04-28 07:49:02,371 INFO L290 TraceCheckUtils]: 201: Hoare triple {24414#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0) (<= main_~x~0 (+ (* 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)))))} assume !false; {24414#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0) (<= main_~x~0 (+ (* 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)))))} is VALID [2022-04-28 07:49:02,371 INFO L272 TraceCheckUtils]: 202: Hoare triple {24414#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0) (<= main_~x~0 (+ (* 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)))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23778#true} is VALID [2022-04-28 07:49:02,371 INFO L290 TraceCheckUtils]: 203: Hoare triple {23778#true} ~cond := #in~cond; {24376#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:49:02,372 INFO L290 TraceCheckUtils]: 204: Hoare triple {24376#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {24380#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:02,372 INFO L290 TraceCheckUtils]: 205: Hoare triple {24380#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {24380#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:02,372 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {24380#(not (= |__VERIFIER_assert_#in~cond| 0))} {24414#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0) (<= main_~x~0 (+ (* 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)))))} #54#return; {24433#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} is VALID [2022-04-28 07:49:02,373 INFO L290 TraceCheckUtils]: 207: Hoare triple {24433#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} assume !(~c~0 < ~k~0); {24437#(and (= main_~y~0 27) (< 26 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-28 07:49:02,373 INFO L272 TraceCheckUtils]: 208: Hoare triple {24437#(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)); {24441#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:49:02,374 INFO L290 TraceCheckUtils]: 209: Hoare triple {24441#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24445#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:49:02,374 INFO L290 TraceCheckUtils]: 210: Hoare triple {24445#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23779#false} is VALID [2022-04-28 07:49:02,374 INFO L290 TraceCheckUtils]: 211: Hoare triple {23779#false} assume !false; {23779#false} is VALID [2022-04-28 07:49:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2702 backedges. 278 proven. 1137 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2022-04-28 07:49:02,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:49:21,033 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:49:21,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:49:21,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444179369] [2022-04-28 07:49:21,327 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:49:21,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516161615] [2022-04-28 07:49:21,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516161615] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:49:21,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:49:21,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2022-04-28 07:49:21,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:49:21,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1466182227] [2022-04-28 07:49:21,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1466182227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:49:21,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:49:21,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 07:49:21,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072973360] [2022-04-28 07:49:21,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:49:21,328 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 34 states have internal predecessors, (72), 30 states have call successors, (32), 2 states have call predecessors, (32), 2 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:21,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:49:21,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 34 states have internal predecessors, (72), 30 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-28 07:49:21,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:49:21,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 07:49:21,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:49:21,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 07:49:21,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1675, Unknown=1, NotChecked=82, Total=1892 [2022-04-28 07:49:21,786 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 34 states have internal predecessors, (72), 30 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-28 07:49:46,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:49:46,990 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2022-04-28 07:49:46,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 07:49:46,990 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 34 states have internal predecessors, (72), 30 states have call successors, (32), 2 states have call predecessors, (32), 2 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:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:49:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 34 states have internal predecessors, (72), 30 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-28 07:49:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 142 transitions. [2022-04-28 07:49:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 34 states have internal predecessors, (72), 30 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-28 07:49:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 142 transitions. [2022-04-28 07:49:46,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 142 transitions. [2022-04-28 07:49:47,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:49:47,552 INFO L225 Difference]: With dead ends: 121 [2022-04-28 07:49:47,552 INFO L226 Difference]: Without dead ends: 116 [2022-04-28 07:49:47,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=155, Invalid=1918, Unknown=1, NotChecked=88, Total=2162 [2022-04-28 07:49:47,553 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 12 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 3243 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 3248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:49:47,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1508 Invalid, 3248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3243 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2022-04-28 07:49:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-28 07:49:47,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-28 07:49:47,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:49:47,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 33 states have call successors, (33), 7 states have call predecessors, (33), 5 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 07:49:47,694 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 33 states have call successors, (33), 7 states have call predecessors, (33), 5 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 07:49:47,694 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 33 states have call successors, (33), 7 states have call predecessors, (33), 5 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 07:49:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:49:47,696 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-04-28 07:49:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2022-04-28 07:49:47,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:49:47,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:49:47,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 33 states have call successors, (33), 7 states have call predecessors, (33), 5 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 116 states. [2022-04-28 07:49:47,697 INFO L87 Difference]: Start difference. First operand has 116 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 33 states have call successors, (33), 7 states have call predecessors, (33), 5 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 116 states. [2022-04-28 07:49:47,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:49:47,699 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-04-28 07:49:47,699 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2022-04-28 07:49:47,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:49:47,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:49:47,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:49:47,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:49:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 33 states have call successors, (33), 7 states have call predecessors, (33), 5 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 07:49:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2022-04-28 07:49:47,702 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 212 [2022-04-28 07:49:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:49:47,702 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2022-04-28 07:49:47,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 34 states have internal predecessors, (72), 30 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-28 07:49:47,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 142 transitions. [2022-04-28 07:49:48,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:49:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2022-04-28 07:49:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-04-28 07:49:48,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:49:48,314 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:48,354 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:48,515 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:48,515 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:49:48,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:49:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash -255861015, now seen corresponding path program 55 times [2022-04-28 07:49:48,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:49:48,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2088488083] [2022-04-28 07:49:48,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:49:48,603 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:49:48,603 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:49:48,603 INFO L85 PathProgramCache]: Analyzing trace with hash -255861015, now seen corresponding path program 56 times [2022-04-28 07:49:48,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:49:48,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778444435] [2022-04-28 07:49:48,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:49:48,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:49:48,616 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:49:48,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666395903] [2022-04-28 07:49:48,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:49:48,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:49:48,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:49:48,618 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:48,626 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:49,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:49:49,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:49:49,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 139 conjunts are in the unsatisfiable core [2022-04-28 07:49:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:49:49,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:49:51,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {25208#true} call ULTIMATE.init(); {25208#true} is VALID [2022-04-28 07:49:51,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {25208#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); {25208#true} is VALID [2022-04-28 07:49:51,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25208#true} {25208#true} #60#return; {25208#true} is VALID [2022-04-28 07:49:51,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {25208#true} call #t~ret5 := main(); {25208#true} is VALID [2022-04-28 07:49:51,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {25208#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; {25208#true} is VALID [2022-04-28 07:49:51,323 INFO L272 TraceCheckUtils]: 6: Hoare triple {25208#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {25208#true} is VALID [2022-04-28 07:49:51,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,323 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25208#true} {25208#true} #52#return; {25208#true} is VALID [2022-04-28 07:49:51,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {25208#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {25246#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:49:51,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {25246#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {25246#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:49:51,324 INFO L272 TraceCheckUtils]: 13: Hoare triple {25246#(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)); {25208#true} is VALID [2022-04-28 07:49:51,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,324 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25208#true} {25246#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {25246#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:49:51,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {25246#(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; {25268#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:49:51,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {25268#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {25268#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:49:51,325 INFO L272 TraceCheckUtils]: 20: Hoare triple {25268#(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)); {25208#true} is VALID [2022-04-28 07:49:51,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,326 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {25208#true} {25268#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {25268#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:49:51,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {25268#(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; {25290#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:49:51,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {25290#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {25290#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:49:51,327 INFO L272 TraceCheckUtils]: 27: Hoare triple {25290#(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)); {25208#true} is VALID [2022-04-28 07:49:51,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,327 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {25208#true} {25290#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {25290#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:49:51,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {25290#(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; {25312#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:49:51,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {25312#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {25312#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:49:51,328 INFO L272 TraceCheckUtils]: 34: Hoare triple {25312#(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)); {25208#true} is VALID [2022-04-28 07:49:51,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,329 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {25208#true} {25312#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #54#return; {25312#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:49:51,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {25312#(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; {25334#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-28 07:49:51,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {25334#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} assume !false; {25334#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-28 07:49:51,330 INFO L272 TraceCheckUtils]: 41: Hoare triple {25334#(and (= (+ main_~y~0 (- 4)) 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)); {25208#true} is VALID [2022-04-28 07:49:51,330 INFO L290 TraceCheckUtils]: 42: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,330 INFO L290 TraceCheckUtils]: 43: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,330 INFO L290 TraceCheckUtils]: 44: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,331 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25208#true} {25334#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} #54#return; {25334#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-28 07:49:51,331 INFO L290 TraceCheckUtils]: 46: Hoare triple {25334#(and (= (+ main_~y~0 (- 4)) 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; {25356#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:49:51,331 INFO L290 TraceCheckUtils]: 47: Hoare triple {25356#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {25356#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:49:51,332 INFO L272 TraceCheckUtils]: 48: Hoare triple {25356#(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)); {25208#true} is VALID [2022-04-28 07:49:51,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,332 INFO L290 TraceCheckUtils]: 50: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,332 INFO L290 TraceCheckUtils]: 51: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,332 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {25208#true} {25356#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {25356#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:49:51,333 INFO L290 TraceCheckUtils]: 53: Hoare triple {25356#(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; {25378#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:51,333 INFO L290 TraceCheckUtils]: 54: Hoare triple {25378#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {25378#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:51,333 INFO L272 TraceCheckUtils]: 55: Hoare triple {25378#(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)); {25208#true} is VALID [2022-04-28 07:49:51,333 INFO L290 TraceCheckUtils]: 56: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,334 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25208#true} {25378#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #54#return; {25378#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:51,334 INFO L290 TraceCheckUtils]: 60: Hoare triple {25378#(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; {25400#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:49:51,334 INFO L290 TraceCheckUtils]: 61: Hoare triple {25400#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {25400#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:49:51,334 INFO L272 TraceCheckUtils]: 62: Hoare triple {25400#(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)); {25208#true} is VALID [2022-04-28 07:49:51,334 INFO L290 TraceCheckUtils]: 63: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,334 INFO L290 TraceCheckUtils]: 64: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,335 INFO L290 TraceCheckUtils]: 65: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,335 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {25208#true} {25400#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {25400#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:49:51,335 INFO L290 TraceCheckUtils]: 67: Hoare triple {25400#(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; {25422#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:49:51,336 INFO L290 TraceCheckUtils]: 68: Hoare triple {25422#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {25422#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:49:51,336 INFO L272 TraceCheckUtils]: 69: Hoare triple {25422#(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)); {25208#true} is VALID [2022-04-28 07:49:51,336 INFO L290 TraceCheckUtils]: 70: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,336 INFO L290 TraceCheckUtils]: 71: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,336 INFO L290 TraceCheckUtils]: 72: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,336 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {25208#true} {25422#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #54#return; {25422#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:49:51,337 INFO L290 TraceCheckUtils]: 74: Hoare triple {25422#(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; {25444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:49:51,337 INFO L290 TraceCheckUtils]: 75: Hoare triple {25444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !false; {25444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:49:51,337 INFO L272 TraceCheckUtils]: 76: Hoare triple {25444#(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)); {25208#true} is VALID [2022-04-28 07:49:51,337 INFO L290 TraceCheckUtils]: 77: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,337 INFO L290 TraceCheckUtils]: 78: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,337 INFO L290 TraceCheckUtils]: 79: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,338 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {25208#true} {25444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} #54#return; {25444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:49:51,338 INFO L290 TraceCheckUtils]: 81: Hoare triple {25444#(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; {25466#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:49:51,338 INFO L290 TraceCheckUtils]: 82: Hoare triple {25466#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} assume !false; {25466#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:49:51,339 INFO L272 TraceCheckUtils]: 83: Hoare triple {25466#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 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)); {25208#true} is VALID [2022-04-28 07:49:51,339 INFO L290 TraceCheckUtils]: 84: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,339 INFO L290 TraceCheckUtils]: 85: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,339 INFO L290 TraceCheckUtils]: 86: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,339 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {25208#true} {25466#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} #54#return; {25466#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:49:51,340 INFO L290 TraceCheckUtils]: 88: Hoare triple {25466#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 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; {25488#(and (= 9 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-28 07:49:51,340 INFO L290 TraceCheckUtils]: 89: Hoare triple {25488#(and (= 9 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 4))))} assume !false; {25488#(and (= 9 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-28 07:49:51,340 INFO L272 TraceCheckUtils]: 90: Hoare triple {25488#(and (= 9 (+ (- 2) main_~c~0)) (= 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)); {25208#true} is VALID [2022-04-28 07:49:51,340 INFO L290 TraceCheckUtils]: 91: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,340 INFO L290 TraceCheckUtils]: 92: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,340 INFO L290 TraceCheckUtils]: 93: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,341 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25208#true} {25488#(and (= 9 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 4))))} #54#return; {25488#(and (= 9 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-28 07:49:51,341 INFO L290 TraceCheckUtils]: 95: Hoare triple {25488#(and (= 9 (+ (- 2) main_~c~0)) (= 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; {25510#(and (= 9 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 5))))} is VALID [2022-04-28 07:49:51,341 INFO L290 TraceCheckUtils]: 96: Hoare triple {25510#(and (= 9 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 5))))} assume !false; {25510#(and (= 9 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 5))))} is VALID [2022-04-28 07:49:51,341 INFO L272 TraceCheckUtils]: 97: Hoare triple {25510#(and (= 9 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 5))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25208#true} is VALID [2022-04-28 07:49:51,341 INFO L290 TraceCheckUtils]: 98: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,341 INFO L290 TraceCheckUtils]: 99: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,342 INFO L290 TraceCheckUtils]: 100: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,342 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {25208#true} {25510#(and (= 9 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 5))))} #54#return; {25510#(and (= 9 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 5))))} is VALID [2022-04-28 07:49:51,342 INFO L290 TraceCheckUtils]: 102: Hoare triple {25510#(and (= 9 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 5))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25532#(and (= main_~c~0 13) (= (+ main_~y~0 (- 6)) 7))} is VALID [2022-04-28 07:49:51,343 INFO L290 TraceCheckUtils]: 103: Hoare triple {25532#(and (= main_~c~0 13) (= (+ main_~y~0 (- 6)) 7))} assume !false; {25532#(and (= main_~c~0 13) (= (+ main_~y~0 (- 6)) 7))} is VALID [2022-04-28 07:49:51,343 INFO L272 TraceCheckUtils]: 104: Hoare triple {25532#(and (= main_~c~0 13) (= (+ main_~y~0 (- 6)) 7))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25208#true} is VALID [2022-04-28 07:49:51,343 INFO L290 TraceCheckUtils]: 105: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,343 INFO L290 TraceCheckUtils]: 106: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,343 INFO L290 TraceCheckUtils]: 107: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,343 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {25208#true} {25532#(and (= main_~c~0 13) (= (+ main_~y~0 (- 6)) 7))} #54#return; {25532#(and (= main_~c~0 13) (= (+ main_~y~0 (- 6)) 7))} is VALID [2022-04-28 07:49:51,344 INFO L290 TraceCheckUtils]: 109: Hoare triple {25532#(and (= main_~c~0 13) (= (+ main_~y~0 (- 6)) 7))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25554#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:49:51,344 INFO L290 TraceCheckUtils]: 110: Hoare triple {25554#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {25554#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:49:51,344 INFO L272 TraceCheckUtils]: 111: Hoare triple {25554#(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)); {25208#true} is VALID [2022-04-28 07:49:51,344 INFO L290 TraceCheckUtils]: 112: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,344 INFO L290 TraceCheckUtils]: 113: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,344 INFO L290 TraceCheckUtils]: 114: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,345 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {25208#true} {25554#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #54#return; {25554#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:49:51,345 INFO L290 TraceCheckUtils]: 116: Hoare triple {25554#(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; {25576#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:51,345 INFO L290 TraceCheckUtils]: 117: Hoare triple {25576#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {25576#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:51,346 INFO L272 TraceCheckUtils]: 118: Hoare triple {25576#(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)); {25208#true} is VALID [2022-04-28 07:49:51,346 INFO L290 TraceCheckUtils]: 119: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,346 INFO L290 TraceCheckUtils]: 120: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,346 INFO L290 TraceCheckUtils]: 121: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,346 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {25208#true} {25576#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {25576#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:49:51,347 INFO L290 TraceCheckUtils]: 123: Hoare triple {25576#(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; {25598#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:49:51,347 INFO L290 TraceCheckUtils]: 124: Hoare triple {25598#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {25598#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:49:51,347 INFO L272 TraceCheckUtils]: 125: Hoare triple {25598#(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)); {25208#true} is VALID [2022-04-28 07:49:51,347 INFO L290 TraceCheckUtils]: 126: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,347 INFO L290 TraceCheckUtils]: 127: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,347 INFO L290 TraceCheckUtils]: 128: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,348 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {25208#true} {25598#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {25598#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:49:51,348 INFO L290 TraceCheckUtils]: 130: Hoare triple {25598#(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; {25620#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:49:51,348 INFO L290 TraceCheckUtils]: 131: Hoare triple {25620#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {25620#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:49:51,348 INFO L272 TraceCheckUtils]: 132: Hoare triple {25620#(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)); {25208#true} is VALID [2022-04-28 07:49:51,349 INFO L290 TraceCheckUtils]: 133: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,349 INFO L290 TraceCheckUtils]: 134: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,349 INFO L290 TraceCheckUtils]: 135: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,349 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {25208#true} {25620#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #54#return; {25620#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:49:51,349 INFO L290 TraceCheckUtils]: 137: Hoare triple {25620#(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; {25642#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:49:51,350 INFO L290 TraceCheckUtils]: 138: Hoare triple {25642#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} assume !false; {25642#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:49:51,350 INFO L272 TraceCheckUtils]: 139: Hoare triple {25642#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25208#true} is VALID [2022-04-28 07:49:51,350 INFO L290 TraceCheckUtils]: 140: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,350 INFO L290 TraceCheckUtils]: 141: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,350 INFO L290 TraceCheckUtils]: 142: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,350 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {25208#true} {25642#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} #54#return; {25642#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:49:51,351 INFO L290 TraceCheckUtils]: 144: Hoare triple {25642#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25664#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-28 07:49:51,351 INFO L290 TraceCheckUtils]: 145: Hoare triple {25664#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !false; {25664#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-28 07:49:51,351 INFO L272 TraceCheckUtils]: 146: Hoare triple {25664#(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)); {25208#true} is VALID [2022-04-28 07:49:51,351 INFO L290 TraceCheckUtils]: 147: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,351 INFO L290 TraceCheckUtils]: 148: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,351 INFO L290 TraceCheckUtils]: 149: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,352 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {25208#true} {25664#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} #54#return; {25664#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-28 07:49:51,352 INFO L290 TraceCheckUtils]: 151: Hoare triple {25664#(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; {25686#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-28 07:49:51,353 INFO L290 TraceCheckUtils]: 152: Hoare triple {25686#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {25686#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-28 07:49:51,353 INFO L272 TraceCheckUtils]: 153: Hoare triple {25686#(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)); {25208#true} is VALID [2022-04-28 07:49:51,353 INFO L290 TraceCheckUtils]: 154: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,353 INFO L290 TraceCheckUtils]: 155: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,353 INFO L290 TraceCheckUtils]: 156: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,353 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25208#true} {25686#(and (= main_~c~0 20) (= main_~y~0 20))} #54#return; {25686#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-28 07:49:51,354 INFO L290 TraceCheckUtils]: 158: Hoare triple {25686#(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; {25708#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-28 07:49:51,354 INFO L290 TraceCheckUtils]: 159: Hoare triple {25708#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} assume !false; {25708#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-28 07:49:51,354 INFO L272 TraceCheckUtils]: 160: Hoare triple {25708#(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)); {25208#true} is VALID [2022-04-28 07:49:51,354 INFO L290 TraceCheckUtils]: 161: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,354 INFO L290 TraceCheckUtils]: 162: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,354 INFO L290 TraceCheckUtils]: 163: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,355 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {25208#true} {25708#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} #54#return; {25708#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-28 07:49:51,355 INFO L290 TraceCheckUtils]: 165: Hoare triple {25708#(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; {25730#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-28 07:49:51,356 INFO L290 TraceCheckUtils]: 166: Hoare triple {25730#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} assume !false; {25730#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-28 07:49:51,356 INFO L272 TraceCheckUtils]: 167: Hoare triple {25730#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25208#true} is VALID [2022-04-28 07:49:51,356 INFO L290 TraceCheckUtils]: 168: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,356 INFO L290 TraceCheckUtils]: 169: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,356 INFO L290 TraceCheckUtils]: 170: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,357 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {25208#true} {25730#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} #54#return; {25730#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-28 07:49:51,357 INFO L290 TraceCheckUtils]: 172: Hoare triple {25730#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25752#(and (= (+ (- 2) main_~y~0) 21) (= (+ (- 1) main_~c~0) 22))} is VALID [2022-04-28 07:49:51,357 INFO L290 TraceCheckUtils]: 173: Hoare triple {25752#(and (= (+ (- 2) main_~y~0) 21) (= (+ (- 1) main_~c~0) 22))} assume !false; {25752#(and (= (+ (- 2) main_~y~0) 21) (= (+ (- 1) main_~c~0) 22))} is VALID [2022-04-28 07:49:51,358 INFO L272 TraceCheckUtils]: 174: Hoare triple {25752#(and (= (+ (- 2) main_~y~0) 21) (= (+ (- 1) 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)); {25208#true} is VALID [2022-04-28 07:49:51,358 INFO L290 TraceCheckUtils]: 175: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,358 INFO L290 TraceCheckUtils]: 176: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,358 INFO L290 TraceCheckUtils]: 177: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,358 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {25208#true} {25752#(and (= (+ (- 2) main_~y~0) 21) (= (+ (- 1) main_~c~0) 22))} #54#return; {25752#(and (= (+ (- 2) main_~y~0) 21) (= (+ (- 1) main_~c~0) 22))} is VALID [2022-04-28 07:49:51,359 INFO L290 TraceCheckUtils]: 179: Hoare triple {25752#(and (= (+ (- 2) main_~y~0) 21) (= (+ (- 1) 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; {25774#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} is VALID [2022-04-28 07:49:51,359 INFO L290 TraceCheckUtils]: 180: Hoare triple {25774#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} assume !false; {25774#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} is VALID [2022-04-28 07:49:51,359 INFO L272 TraceCheckUtils]: 181: Hoare triple {25774#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25208#true} is VALID [2022-04-28 07:49:51,359 INFO L290 TraceCheckUtils]: 182: Hoare triple {25208#true} ~cond := #in~cond; {25784#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:49:51,360 INFO L290 TraceCheckUtils]: 183: Hoare triple {25784#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25788#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:51,360 INFO L290 TraceCheckUtils]: 184: Hoare triple {25788#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25788#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:51,361 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {25788#(not (= |__VERIFIER_assert_#in~cond| 0))} {25774#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} #54#return; {25795#(and (= 22 (+ (- 2) main_~c~0)) (= 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)))} is VALID [2022-04-28 07:49:51,362 INFO L290 TraceCheckUtils]: 186: Hoare triple {25795#(and (= 22 (+ (- 2) main_~c~0)) (= 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)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25799#(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:51,363 INFO L290 TraceCheckUtils]: 187: Hoare triple {25799#(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; {25799#(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:51,363 INFO L272 TraceCheckUtils]: 188: Hoare triple {25799#(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)); {25208#true} is VALID [2022-04-28 07:49:51,363 INFO L290 TraceCheckUtils]: 189: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,363 INFO L290 TraceCheckUtils]: 190: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,363 INFO L290 TraceCheckUtils]: 191: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,363 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {25208#true} {25799#(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; {25799#(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:51,364 INFO L290 TraceCheckUtils]: 193: Hoare triple {25799#(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; {25821#(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:51,365 INFO L290 TraceCheckUtils]: 194: Hoare triple {25821#(and (= main_~c~0 26) (<= (+ 105625 (* main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 26))} assume !false; {25821#(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:51,365 INFO L272 TraceCheckUtils]: 195: Hoare triple {25821#(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)); {25208#true} is VALID [2022-04-28 07:49:51,365 INFO L290 TraceCheckUtils]: 196: Hoare triple {25208#true} ~cond := #in~cond; {25784#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:49:51,365 INFO L290 TraceCheckUtils]: 197: Hoare triple {25784#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25788#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:51,366 INFO L290 TraceCheckUtils]: 198: Hoare triple {25788#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25788#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:51,366 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {25788#(not (= |__VERIFIER_assert_#in~cond| 0))} {25821#(and (= main_~c~0 26) (<= (+ 105625 (* main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 26))} #54#return; {25840#(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:51,367 INFO L290 TraceCheckUtils]: 200: Hoare triple {25840#(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; {25844#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 123201)) (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:49:51,367 INFO L290 TraceCheckUtils]: 201: Hoare triple {25844#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 123201)) (= main_~y~0 27) (= main_~c~0 27))} assume !false; {25844#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 123201)) (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:49:51,367 INFO L272 TraceCheckUtils]: 202: Hoare triple {25844#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 123201)) (= 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)); {25208#true} is VALID [2022-04-28 07:49:51,368 INFO L290 TraceCheckUtils]: 203: Hoare triple {25208#true} ~cond := #in~cond; {25208#true} is VALID [2022-04-28 07:49:51,368 INFO L290 TraceCheckUtils]: 204: Hoare triple {25208#true} assume !(0 == ~cond); {25208#true} is VALID [2022-04-28 07:49:51,368 INFO L290 TraceCheckUtils]: 205: Hoare triple {25208#true} assume true; {25208#true} is VALID [2022-04-28 07:49:51,368 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {25208#true} {25844#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 123201)) (= main_~y~0 27) (= main_~c~0 27))} #54#return; {25844#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 123201)) (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:49:51,369 INFO L290 TraceCheckUtils]: 207: Hoare triple {25844#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 123201)) (= 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; {25866#(and (<= (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0) (+ 123200 (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2))) (<= main_~c~0 28) (< 27 main_~k~0) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-28 07:49:51,370 INFO L290 TraceCheckUtils]: 208: Hoare triple {25866#(and (<= (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0) (+ 123200 (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2))) (<= main_~c~0 28) (< 27 main_~k~0) (= (+ (- 1) main_~y~0) 27))} assume !false; {25866#(and (<= (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0) (+ 123200 (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2))) (<= main_~c~0 28) (< 27 main_~k~0) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-28 07:49:51,370 INFO L272 TraceCheckUtils]: 209: Hoare triple {25866#(and (<= (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0) (+ 123200 (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2))) (<= 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)); {25208#true} is VALID [2022-04-28 07:49:51,370 INFO L290 TraceCheckUtils]: 210: Hoare triple {25208#true} ~cond := #in~cond; {25784#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:49:51,371 INFO L290 TraceCheckUtils]: 211: Hoare triple {25784#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25788#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:51,371 INFO L290 TraceCheckUtils]: 212: Hoare triple {25788#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25788#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:49:51,372 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {25788#(not (= |__VERIFIER_assert_#in~cond| 0))} {25866#(and (<= (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0) (+ 123200 (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2))) (<= main_~c~0 28) (< 27 main_~k~0) (= (+ (- 1) main_~y~0) 27))} #54#return; {25885#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-28 07:49:51,372 INFO L290 TraceCheckUtils]: 214: Hoare triple {25885#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} assume !(~c~0 < ~k~0); {25889#(and (<= main_~k~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-28 07:49:51,373 INFO L272 TraceCheckUtils]: 215: Hoare triple {25889#(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)); {25893#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:49:51,373 INFO L290 TraceCheckUtils]: 216: Hoare triple {25893#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25897#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:49:51,374 INFO L290 TraceCheckUtils]: 217: Hoare triple {25897#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25209#false} is VALID [2022-04-28 07:49:51,374 INFO L290 TraceCheckUtils]: 218: Hoare triple {25209#false} assume !false; {25209#false} is VALID [2022-04-28 07:49:51,375 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:51,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:50:56,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:50:56,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778444435] [2022-04-28 07:50:56,222 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:50:56,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666395903] [2022-04-28 07:50:56,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666395903] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:50:56,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:50:56,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2022-04-28 07:50:56,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:50:56,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2088488083] [2022-04-28 07:50:56,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2088488083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:50:56,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:50:56,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 07:50:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079599295] [2022-04-28 07:50:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:50:56,223 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:56,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:50:56,224 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:56,726 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:56,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 07:50:56,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:50:56,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 07:50:56,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1739, Unknown=18, NotChecked=0, Total=1892 [2022-04-28 07:50:56,728 INFO L87 Difference]: Start difference. First operand 116 states and 142 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:51:26,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:51:26,486 INFO L93 Difference]: Finished difference Result 124 states and 151 transitions. [2022-04-28 07:51:26,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 07:51:26,491 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:51:26,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:51:26,492 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:51:26,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 144 transitions. [2022-04-28 07:51:26,494 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:51:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 144 transitions. [2022-04-28 07:51:26,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 144 transitions. [2022-04-28 07:51:27,073 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:51:27,074 INFO L225 Difference]: With dead ends: 124 [2022-04-28 07:51:27,074 INFO L226 Difference]: Without dead ends: 119 [2022-04-28 07:51:27,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 47.1s TimeCoverageRelationStatistics Valid=156, Invalid=1988, Unknown=18, NotChecked=0, Total=2162 [2022-04-28 07:51:27,075 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 8 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 3322 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-04-28 07:51:27,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1513 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3322 Invalid, 0 Unknown, 0 Unchecked, 15.6s Time] [2022-04-28 07:51:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-28 07:51:27,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-04-28 07:51:27,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:51:27,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 119 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 states have internal predecessors, (80), 34 states have call successors, (34), 7 states have call predecessors, (34), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 07:51:27,221 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 119 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 states have internal predecessors, (80), 34 states have call successors, (34), 7 states have call predecessors, (34), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 07:51:27,221 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 119 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 states have internal predecessors, (80), 34 states have call successors, (34), 7 states have call predecessors, (34), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 07:51:27,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:51:27,224 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2022-04-28 07:51:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2022-04-28 07:51:27,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:51:27,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:51:27,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 states have internal predecessors, (80), 34 states have call successors, (34), 7 states have call predecessors, (34), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 119 states. [2022-04-28 07:51:27,224 INFO L87 Difference]: Start difference. First operand has 119 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 states have internal predecessors, (80), 34 states have call successors, (34), 7 states have call predecessors, (34), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 119 states. [2022-04-28 07:51:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:51:27,227 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2022-04-28 07:51:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2022-04-28 07:51:27,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:51:27,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:51:27,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:51:27,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:51:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 states have internal predecessors, (80), 34 states have call successors, (34), 7 states have call predecessors, (34), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 07:51:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2022-04-28 07:51:27,230 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 219 [2022-04-28 07:51:27,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:51:27,231 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2022-04-28 07:51:27,231 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:51:27,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 146 transitions. [2022-04-28 07:51:27,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:51:27,895 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2022-04-28 07:51:27,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-04-28 07:51:27,896 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:51:27,896 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:51:27,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-28 07:51:28,096 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:51:28,097 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:51:28,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:51:28,097 INFO L85 PathProgramCache]: Analyzing trace with hash 963111432, now seen corresponding path program 57 times [2022-04-28 07:51:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:51:28,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961735489] [2022-04-28 07:51:28,184 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:28,184 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:51:28,184 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:51:28,185 INFO L85 PathProgramCache]: Analyzing trace with hash 963111432, now seen corresponding path program 58 times [2022-04-28 07:51:28,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:51:28,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240797408] [2022-04-28 07:51:28,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:51:28,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:51:28,203 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:51:28,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1547180072] [2022-04-28 07:51:28,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:51:28,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:51:28,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:51:28,205 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:51:28,207 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:51:29,302 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:51:29,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:51:29,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 124 conjunts are in the unsatisfiable core [2022-04-28 07:51:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:51:29,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:51:30,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {26677#true} call ULTIMATE.init(); {26677#true} is VALID [2022-04-28 07:51:30,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {26677#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); {26677#true} is VALID [2022-04-28 07:51:30,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26677#true} {26677#true} #60#return; {26677#true} is VALID [2022-04-28 07:51:30,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {26677#true} call #t~ret5 := main(); {26677#true} is VALID [2022-04-28 07:51:30,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {26677#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; {26677#true} is VALID [2022-04-28 07:51:30,311 INFO L272 TraceCheckUtils]: 6: Hoare triple {26677#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {26677#true} is VALID [2022-04-28 07:51:30,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26677#true} {26677#true} #52#return; {26677#true} is VALID [2022-04-28 07:51:30,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {26677#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {26715#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:51:30,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {26715#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {26715#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:51:30,312 INFO L272 TraceCheckUtils]: 13: Hoare triple {26715#(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)); {26677#true} is VALID [2022-04-28 07:51:30,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,313 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {26677#true} {26715#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {26715#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:51:30,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {26715#(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; {26737#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:51:30,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {26737#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {26737#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:51:30,314 INFO L272 TraceCheckUtils]: 20: Hoare triple {26737#(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)); {26677#true} is VALID [2022-04-28 07:51:30,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,314 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {26677#true} {26737#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {26737#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:51:30,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {26737#(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; {26759#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:51:30,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {26759#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {26759#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:51:30,315 INFO L272 TraceCheckUtils]: 27: Hoare triple {26759#(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)); {26677#true} is VALID [2022-04-28 07:51:30,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,315 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26677#true} {26759#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {26759#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:51:30,316 INFO L290 TraceCheckUtils]: 32: Hoare triple {26759#(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; {26781#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:51:30,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {26781#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {26781#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:51:30,316 INFO L272 TraceCheckUtils]: 34: Hoare triple {26781#(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)); {26677#true} is VALID [2022-04-28 07:51:30,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,317 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {26677#true} {26781#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {26781#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:51:30,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {26781#(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; {26803#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:51:30,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {26803#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {26803#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:51:30,317 INFO L272 TraceCheckUtils]: 41: Hoare triple {26803#(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)); {26677#true} is VALID [2022-04-28 07:51:30,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,318 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {26677#true} {26803#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {26803#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:51:30,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {26803#(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; {26825#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-28 07:51:30,319 INFO L290 TraceCheckUtils]: 47: Hoare triple {26825#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {26825#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-28 07:51:30,319 INFO L272 TraceCheckUtils]: 48: Hoare triple {26825#(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)); {26677#true} is VALID [2022-04-28 07:51:30,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,319 INFO L290 TraceCheckUtils]: 51: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,319 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {26677#true} {26825#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #54#return; {26825#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-28 07:51:30,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {26825#(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; {26847#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:51:30,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {26847#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {26847#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:51:30,320 INFO L272 TraceCheckUtils]: 55: Hoare triple {26847#(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)); {26677#true} is VALID [2022-04-28 07:51:30,320 INFO L290 TraceCheckUtils]: 56: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,320 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {26677#true} {26847#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {26847#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:51:30,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {26847#(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; {26869#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:51:30,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {26869#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {26869#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:51:30,321 INFO L272 TraceCheckUtils]: 62: Hoare triple {26869#(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)); {26677#true} is VALID [2022-04-28 07:51:30,321 INFO L290 TraceCheckUtils]: 63: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,321 INFO L290 TraceCheckUtils]: 64: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,321 INFO L290 TraceCheckUtils]: 65: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,328 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {26677#true} {26869#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #54#return; {26869#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:51:30,329 INFO L290 TraceCheckUtils]: 67: Hoare triple {26869#(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; {26891#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:51:30,329 INFO L290 TraceCheckUtils]: 68: Hoare triple {26891#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} assume !false; {26891#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:51:30,329 INFO L272 TraceCheckUtils]: 69: Hoare triple {26891#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26677#true} is VALID [2022-04-28 07:51:30,329 INFO L290 TraceCheckUtils]: 70: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,329 INFO L290 TraceCheckUtils]: 71: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,330 INFO L290 TraceCheckUtils]: 72: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,330 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {26677#true} {26891#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} #54#return; {26891#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:51:30,330 INFO L290 TraceCheckUtils]: 74: Hoare triple {26891#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26913#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:51:30,330 INFO L290 TraceCheckUtils]: 75: Hoare triple {26913#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {26913#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:51:30,330 INFO L272 TraceCheckUtils]: 76: Hoare triple {26913#(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)); {26677#true} is VALID [2022-04-28 07:51:30,331 INFO L290 TraceCheckUtils]: 77: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,331 INFO L290 TraceCheckUtils]: 78: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,331 INFO L290 TraceCheckUtils]: 79: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,331 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {26677#true} {26913#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {26913#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:51:30,331 INFO L290 TraceCheckUtils]: 81: Hoare triple {26913#(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; {26935#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:51:30,332 INFO L290 TraceCheckUtils]: 82: Hoare triple {26935#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {26935#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:51:30,332 INFO L272 TraceCheckUtils]: 83: Hoare triple {26935#(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)); {26677#true} is VALID [2022-04-28 07:51:30,332 INFO L290 TraceCheckUtils]: 84: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,332 INFO L290 TraceCheckUtils]: 85: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,332 INFO L290 TraceCheckUtils]: 86: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,332 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {26677#true} {26935#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {26935#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:51:30,333 INFO L290 TraceCheckUtils]: 88: Hoare triple {26935#(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; {26957#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:51:30,333 INFO L290 TraceCheckUtils]: 89: Hoare triple {26957#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !false; {26957#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:51:30,333 INFO L272 TraceCheckUtils]: 90: Hoare triple {26957#(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)); {26677#true} is VALID [2022-04-28 07:51:30,333 INFO L290 TraceCheckUtils]: 91: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,333 INFO L290 TraceCheckUtils]: 92: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,333 INFO L290 TraceCheckUtils]: 93: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,333 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {26677#true} {26957#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} #54#return; {26957#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:51:30,334 INFO L290 TraceCheckUtils]: 95: Hoare triple {26957#(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; {26979#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:51:30,334 INFO L290 TraceCheckUtils]: 96: Hoare triple {26979#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} assume !false; {26979#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:51:30,334 INFO L272 TraceCheckUtils]: 97: Hoare triple {26979#(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)); {26677#true} is VALID [2022-04-28 07:51:30,334 INFO L290 TraceCheckUtils]: 98: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,334 INFO L290 TraceCheckUtils]: 99: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,334 INFO L290 TraceCheckUtils]: 100: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,335 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {26677#true} {26979#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} #54#return; {26979#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:51:30,335 INFO L290 TraceCheckUtils]: 102: Hoare triple {26979#(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; {27001#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:30,335 INFO L290 TraceCheckUtils]: 103: Hoare triple {27001#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} assume !false; {27001#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:30,335 INFO L272 TraceCheckUtils]: 104: Hoare triple {27001#(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)); {26677#true} is VALID [2022-04-28 07:51:30,336 INFO L290 TraceCheckUtils]: 105: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,336 INFO L290 TraceCheckUtils]: 106: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,336 INFO L290 TraceCheckUtils]: 107: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,336 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {26677#true} {27001#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} #54#return; {27001#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:30,336 INFO L290 TraceCheckUtils]: 109: Hoare triple {27001#(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; {27023#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-28 07:51:30,337 INFO L290 TraceCheckUtils]: 110: Hoare triple {27023#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} assume !false; {27023#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-28 07:51:30,337 INFO L272 TraceCheckUtils]: 111: Hoare triple {27023#(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)); {26677#true} is VALID [2022-04-28 07:51:30,337 INFO L290 TraceCheckUtils]: 112: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,337 INFO L290 TraceCheckUtils]: 113: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,337 INFO L290 TraceCheckUtils]: 114: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,337 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {26677#true} {27023#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} #54#return; {27023#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-28 07:51:30,338 INFO L290 TraceCheckUtils]: 116: Hoare triple {27023#(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; {27045#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:51:30,338 INFO L290 TraceCheckUtils]: 117: Hoare triple {27045#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !false; {27045#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:51:30,338 INFO L272 TraceCheckUtils]: 118: Hoare triple {27045#(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)); {26677#true} is VALID [2022-04-28 07:51:30,338 INFO L290 TraceCheckUtils]: 119: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,338 INFO L290 TraceCheckUtils]: 120: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,338 INFO L290 TraceCheckUtils]: 121: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,338 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {26677#true} {27045#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} #54#return; {27045#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-28 07:51:30,339 INFO L290 TraceCheckUtils]: 123: Hoare triple {27045#(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; {27067#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:30,339 INFO L290 TraceCheckUtils]: 124: Hoare triple {27067#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {27067#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:30,339 INFO L272 TraceCheckUtils]: 125: Hoare triple {27067#(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)); {26677#true} is VALID [2022-04-28 07:51:30,339 INFO L290 TraceCheckUtils]: 126: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,339 INFO L290 TraceCheckUtils]: 127: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,339 INFO L290 TraceCheckUtils]: 128: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,340 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {26677#true} {27067#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #54#return; {27067#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:30,340 INFO L290 TraceCheckUtils]: 130: Hoare triple {27067#(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; {27089#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-28 07:51:30,340 INFO L290 TraceCheckUtils]: 131: Hoare triple {27089#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !false; {27089#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-28 07:51:30,340 INFO L272 TraceCheckUtils]: 132: Hoare triple {27089#(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)); {26677#true} is VALID [2022-04-28 07:51:30,340 INFO L290 TraceCheckUtils]: 133: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,341 INFO L290 TraceCheckUtils]: 134: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,341 INFO L290 TraceCheckUtils]: 135: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,341 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {26677#true} {27089#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} #54#return; {27089#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-28 07:51:30,341 INFO L290 TraceCheckUtils]: 137: Hoare triple {27089#(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; {27111#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:51:30,341 INFO L290 TraceCheckUtils]: 138: Hoare triple {27111#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !false; {27111#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:51:30,342 INFO L272 TraceCheckUtils]: 139: Hoare triple {27111#(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)); {26677#true} is VALID [2022-04-28 07:51:30,342 INFO L290 TraceCheckUtils]: 140: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,342 INFO L290 TraceCheckUtils]: 141: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,342 INFO L290 TraceCheckUtils]: 142: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,342 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {26677#true} {27111#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} #54#return; {27111#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-28 07:51:30,342 INFO L290 TraceCheckUtils]: 144: Hoare triple {27111#(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; {27133#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:30,343 INFO L290 TraceCheckUtils]: 145: Hoare triple {27133#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} assume !false; {27133#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:30,343 INFO L272 TraceCheckUtils]: 146: Hoare triple {27133#(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)); {26677#true} is VALID [2022-04-28 07:51:30,343 INFO L290 TraceCheckUtils]: 147: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,343 INFO L290 TraceCheckUtils]: 148: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,343 INFO L290 TraceCheckUtils]: 149: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,343 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {26677#true} {27133#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} #54#return; {27133#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:30,344 INFO L290 TraceCheckUtils]: 151: Hoare triple {27133#(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; {27155#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-28 07:51:30,344 INFO L290 TraceCheckUtils]: 152: Hoare triple {27155#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {27155#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-28 07:51:30,344 INFO L272 TraceCheckUtils]: 153: Hoare triple {27155#(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)); {26677#true} is VALID [2022-04-28 07:51:30,344 INFO L290 TraceCheckUtils]: 154: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,344 INFO L290 TraceCheckUtils]: 155: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,344 INFO L290 TraceCheckUtils]: 156: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,345 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {26677#true} {27155#(and (= main_~c~0 20) (= main_~y~0 20))} #54#return; {27155#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-28 07:51:30,345 INFO L290 TraceCheckUtils]: 158: Hoare triple {27155#(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; {27177#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-28 07:51:30,345 INFO L290 TraceCheckUtils]: 159: Hoare triple {27177#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} assume !false; {27177#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-28 07:51:30,345 INFO L272 TraceCheckUtils]: 160: Hoare triple {27177#(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)); {26677#true} is VALID [2022-04-28 07:51:30,345 INFO L290 TraceCheckUtils]: 161: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,345 INFO L290 TraceCheckUtils]: 162: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,346 INFO L290 TraceCheckUtils]: 163: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,346 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {26677#true} {27177#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} #54#return; {27177#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-28 07:51:30,346 INFO L290 TraceCheckUtils]: 165: Hoare triple {27177#(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; {27199#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-28 07:51:30,346 INFO L290 TraceCheckUtils]: 166: Hoare triple {27199#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {27199#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-28 07:51:30,347 INFO L272 TraceCheckUtils]: 167: Hoare triple {27199#(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)); {26677#true} is VALID [2022-04-28 07:51:30,347 INFO L290 TraceCheckUtils]: 168: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,347 INFO L290 TraceCheckUtils]: 169: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,347 INFO L290 TraceCheckUtils]: 170: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,347 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {26677#true} {27199#(and (= main_~y~0 22) (= main_~c~0 22))} #54#return; {27199#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-28 07:51:30,347 INFO L290 TraceCheckUtils]: 172: Hoare triple {27199#(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; {27221#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:51:30,348 INFO L290 TraceCheckUtils]: 173: Hoare triple {27221#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {27221#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:51:30,348 INFO L272 TraceCheckUtils]: 174: Hoare triple {27221#(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)); {26677#true} is VALID [2022-04-28 07:51:30,348 INFO L290 TraceCheckUtils]: 175: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,348 INFO L290 TraceCheckUtils]: 176: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,348 INFO L290 TraceCheckUtils]: 177: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,348 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {26677#true} {27221#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {27221#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:51:30,349 INFO L290 TraceCheckUtils]: 179: Hoare triple {27221#(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; {27243#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-28 07:51:30,349 INFO L290 TraceCheckUtils]: 180: Hoare triple {27243#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} assume !false; {27243#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-28 07:51:30,349 INFO L272 TraceCheckUtils]: 181: Hoare triple {27243#(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)); {26677#true} is VALID [2022-04-28 07:51:30,349 INFO L290 TraceCheckUtils]: 182: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,349 INFO L290 TraceCheckUtils]: 183: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,349 INFO L290 TraceCheckUtils]: 184: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,349 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {26677#true} {27243#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} #54#return; {27243#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-28 07:51:30,350 INFO L290 TraceCheckUtils]: 186: Hoare triple {27243#(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; {27265#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-28 07:51:30,350 INFO L290 TraceCheckUtils]: 187: Hoare triple {27265#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} assume !false; {27265#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-28 07:51:30,350 INFO L272 TraceCheckUtils]: 188: Hoare triple {27265#(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)); {26677#true} is VALID [2022-04-28 07:51:30,350 INFO L290 TraceCheckUtils]: 189: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,350 INFO L290 TraceCheckUtils]: 190: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,350 INFO L290 TraceCheckUtils]: 191: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,351 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {26677#true} {27265#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} #54#return; {27265#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-28 07:51:30,351 INFO L290 TraceCheckUtils]: 193: Hoare triple {27265#(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; {27287#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:51:30,351 INFO L290 TraceCheckUtils]: 194: Hoare triple {27287#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} assume !false; {27287#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:51:30,351 INFO L272 TraceCheckUtils]: 195: Hoare triple {27287#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26677#true} is VALID [2022-04-28 07:51:30,352 INFO L290 TraceCheckUtils]: 196: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,352 INFO L290 TraceCheckUtils]: 197: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,352 INFO L290 TraceCheckUtils]: 198: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,353 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {26677#true} {27287#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} #54#return; {27287#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:51:30,354 INFO L290 TraceCheckUtils]: 200: Hoare triple {27287#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27309#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} is VALID [2022-04-28 07:51:30,354 INFO L290 TraceCheckUtils]: 201: Hoare triple {27309#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} assume !false; {27309#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} is VALID [2022-04-28 07:51:30,354 INFO L272 TraceCheckUtils]: 202: Hoare triple {27309#(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)); {26677#true} is VALID [2022-04-28 07:51:30,354 INFO L290 TraceCheckUtils]: 203: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,354 INFO L290 TraceCheckUtils]: 204: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,354 INFO L290 TraceCheckUtils]: 205: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,355 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {26677#true} {27309#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} #54#return; {27309#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} is VALID [2022-04-28 07:51:30,355 INFO L290 TraceCheckUtils]: 207: Hoare triple {27309#(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; {27331#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-28 07:51:30,355 INFO L290 TraceCheckUtils]: 208: Hoare triple {27331#(and (= main_~c~0 28) (= main_~y~0 28))} assume !false; {27331#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-28 07:51:30,355 INFO L272 TraceCheckUtils]: 209: Hoare triple {27331#(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)); {26677#true} is VALID [2022-04-28 07:51:30,355 INFO L290 TraceCheckUtils]: 210: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,355 INFO L290 TraceCheckUtils]: 211: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,356 INFO L290 TraceCheckUtils]: 212: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,356 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {26677#true} {27331#(and (= main_~c~0 28) (= main_~y~0 28))} #54#return; {27331#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-28 07:51:30,356 INFO L290 TraceCheckUtils]: 214: Hoare triple {27331#(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; {27353#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:30,356 INFO L290 TraceCheckUtils]: 215: Hoare triple {27353#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} assume !false; {27353#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:30,357 INFO L272 TraceCheckUtils]: 216: Hoare triple {27353#(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)); {26677#true} is VALID [2022-04-28 07:51:30,357 INFO L290 TraceCheckUtils]: 217: Hoare triple {26677#true} ~cond := #in~cond; {26677#true} is VALID [2022-04-28 07:51:30,357 INFO L290 TraceCheckUtils]: 218: Hoare triple {26677#true} assume !(0 == ~cond); {26677#true} is VALID [2022-04-28 07:51:30,357 INFO L290 TraceCheckUtils]: 219: Hoare triple {26677#true} assume true; {26677#true} is VALID [2022-04-28 07:51:30,357 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {26677#true} {27353#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} #54#return; {27353#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:51:30,358 INFO L290 TraceCheckUtils]: 221: Hoare triple {27353#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} assume !(~c~0 < ~k~0); {27375#(and (< 28 main_~k~0) (= 28 (+ (- 1) main_~y~0)) (<= main_~k~0 29))} is VALID [2022-04-28 07:51:30,358 INFO L272 TraceCheckUtils]: 222: Hoare triple {27375#(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)); {27379#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:51:30,358 INFO L290 TraceCheckUtils]: 223: Hoare triple {27379#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27383#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:51:30,359 INFO L290 TraceCheckUtils]: 224: Hoare triple {27383#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26678#false} is VALID [2022-04-28 07:51:30,359 INFO L290 TraceCheckUtils]: 225: Hoare triple {26678#false} assume !false; {26678#false} is VALID [2022-04-28 07:51:30,360 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:51:30,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:51:30,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:51:30,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240797408] [2022-04-28 07:51:30,710 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:51:30,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547180072] [2022-04-28 07:51:30,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547180072] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:51:30,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:51:30,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2022-04-28 07:51:30,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:51:30,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961735489] [2022-04-28 07:51:30,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961735489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:51:30,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:51:30,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 07:51:30,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197607802] [2022-04-28 07:51:30,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:51:30,714 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:30,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:51:30,714 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:51:31,287 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:51:31,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 07:51:31,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:51:31,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 07:51:31,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 07:51:31,292 INFO L87 Difference]: Start difference. First operand 119 states and 146 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:52:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:52:01,456 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2022-04-28 07:52:01,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 07:52:01,457 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:52:01,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:52:01,457 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:52:01,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 148 transitions. [2022-04-28 07:52:01,459 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:52:01,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 148 transitions. [2022-04-28 07:52:01,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 148 transitions. [2022-04-28 07:52:02,131 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:52:02,132 INFO L225 Difference]: With dead ends: 127 [2022-04-28 07:52:02,133 INFO L226 Difference]: Without dead ends: 122 [2022-04-28 07:52:02,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 07:52:02,133 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 3047 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s 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, 16.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:52:02,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1655 Invalid, 3047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3047 Invalid, 0 Unknown, 0 Unchecked, 16.0s Time] [2022-04-28 07:52:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-28 07:52:02,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-04-28 07:52:02,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:52:02,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 122 states, 81 states have (on average 1.0123456790123457) internal successors, (82), 81 states have internal predecessors, (82), 35 states have call successors, (35), 7 states have call predecessors, (35), 5 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 07:52:02,277 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 122 states, 81 states have (on average 1.0123456790123457) internal successors, (82), 81 states have internal predecessors, (82), 35 states have call successors, (35), 7 states have call predecessors, (35), 5 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 07:52:02,277 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 122 states, 81 states have (on average 1.0123456790123457) internal successors, (82), 81 states have internal predecessors, (82), 35 states have call successors, (35), 7 states have call predecessors, (35), 5 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 07:52:02,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:52:02,279 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2022-04-28 07:52:02,279 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 150 transitions. [2022-04-28 07:52:02,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:52:02,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:52:02,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 81 states have (on average 1.0123456790123457) internal successors, (82), 81 states have internal predecessors, (82), 35 states have call successors, (35), 7 states have call predecessors, (35), 5 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 122 states. [2022-04-28 07:52:02,280 INFO L87 Difference]: Start difference. First operand has 122 states, 81 states have (on average 1.0123456790123457) internal successors, (82), 81 states have internal predecessors, (82), 35 states have call successors, (35), 7 states have call predecessors, (35), 5 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 122 states. [2022-04-28 07:52:02,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:52:02,282 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2022-04-28 07:52:02,282 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 150 transitions. [2022-04-28 07:52:02,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:52:02,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:52:02,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:52:02,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:52:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 81 states have (on average 1.0123456790123457) internal successors, (82), 81 states have internal predecessors, (82), 35 states have call successors, (35), 7 states have call predecessors, (35), 5 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 07:52:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 150 transitions. [2022-04-28 07:52:02,285 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 150 transitions. Word has length 226 [2022-04-28 07:52:02,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:52:02,285 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 150 transitions. [2022-04-28 07:52:02,285 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:52:02,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 150 transitions. [2022-04-28 07:52:02,873 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:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 150 transitions. [2022-04-28 07:52:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-04-28 07:52:02,874 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:52:02,874 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:52:02,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-28 07:52:03,074 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:52:03,075 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:52:03,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:52:03,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1527648759, now seen corresponding path program 59 times [2022-04-28 07:52:03,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:52:03,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2119851510] [2022-04-28 07:52:03,147 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:03,147 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:52:03,147 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:52:03,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1527648759, now seen corresponding path program 60 times [2022-04-28 07:52:03,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:52:03,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901123950] [2022-04-28 07:52:03,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:52:03,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:52:03,163 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:52:03,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [305929161] [2022-04-28 07:52:03,164 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:52:03,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:52:03,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:52:03,165 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:52:03,167 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:52:13,653 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-28 07:52:13,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:52:13,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 129 conjunts are in the unsatisfiable core [2022-04-28 07:52:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:52:13,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:52:15,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {28177#true} call ULTIMATE.init(); {28177#true} is VALID [2022-04-28 07:52:15,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {28177#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); {28177#true} is VALID [2022-04-28 07:52:15,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28177#true} {28177#true} #60#return; {28177#true} is VALID [2022-04-28 07:52:15,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {28177#true} call #t~ret5 := main(); {28177#true} is VALID [2022-04-28 07:52:15,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {28177#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; {28177#true} is VALID [2022-04-28 07:52:15,540 INFO L272 TraceCheckUtils]: 6: Hoare triple {28177#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,541 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28177#true} {28177#true} #52#return; {28177#true} is VALID [2022-04-28 07:52:15,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {28177#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {28215#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:52:15,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {28215#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {28215#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:52:15,541 INFO L272 TraceCheckUtils]: 13: Hoare triple {28215#(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)); {28177#true} is VALID [2022-04-28 07:52:15,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,542 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {28177#true} {28215#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {28215#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:52:15,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {28215#(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; {28237#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:52:15,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {28237#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {28237#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:52:15,543 INFO L272 TraceCheckUtils]: 20: Hoare triple {28237#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,544 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {28177#true} {28237#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {28237#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:52:15,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {28237#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28259#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:52:15,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {28259#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !false; {28259#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:52:15,548 INFO L272 TraceCheckUtils]: 27: Hoare triple {28259#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~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)); {28177#true} is VALID [2022-04-28 07:52:15,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,549 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28177#true} {28259#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #54#return; {28259#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:52:15,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {28259#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~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; {28281#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 07:52:15,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {28281#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {28281#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 07:52:15,550 INFO L272 TraceCheckUtils]: 34: Hoare triple {28281#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,551 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {28177#true} {28281#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} #54#return; {28281#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 07:52:15,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {28281#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28303#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:52:15,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {28303#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} assume !false; {28303#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:52:15,552 INFO L272 TraceCheckUtils]: 41: Hoare triple {28303#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,552 INFO L290 TraceCheckUtils]: 44: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,552 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {28177#true} {28303#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} #54#return; {28303#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:52:15,553 INFO L290 TraceCheckUtils]: 46: Hoare triple {28303#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28325#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,553 INFO L290 TraceCheckUtils]: 47: Hoare triple {28325#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {28325#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,553 INFO L272 TraceCheckUtils]: 48: Hoare triple {28325#(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)); {28177#true} is VALID [2022-04-28 07:52:15,553 INFO L290 TraceCheckUtils]: 49: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,553 INFO L290 TraceCheckUtils]: 50: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,553 INFO L290 TraceCheckUtils]: 51: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,554 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {28177#true} {28325#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} #54#return; {28325#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,554 INFO L290 TraceCheckUtils]: 53: Hoare triple {28325#(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; {28347#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,555 INFO L290 TraceCheckUtils]: 54: Hoare triple {28347#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !false; {28347#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,555 INFO L272 TraceCheckUtils]: 55: Hoare triple {28347#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,555 INFO L290 TraceCheckUtils]: 56: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,555 INFO L290 TraceCheckUtils]: 57: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,555 INFO L290 TraceCheckUtils]: 58: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,555 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {28177#true} {28347#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} #54#return; {28347#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {28347#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28369#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,556 INFO L290 TraceCheckUtils]: 61: Hoare triple {28369#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0))} assume !false; {28369#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,556 INFO L272 TraceCheckUtils]: 62: Hoare triple {28369#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,556 INFO L290 TraceCheckUtils]: 63: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,556 INFO L290 TraceCheckUtils]: 64: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,556 INFO L290 TraceCheckUtils]: 65: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,557 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {28177#true} {28369#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0))} #54#return; {28369#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,557 INFO L290 TraceCheckUtils]: 67: Hoare triple {28369#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28391#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,558 INFO L290 TraceCheckUtils]: 68: Hoare triple {28391#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 0 main_~k~0))} assume !false; {28391#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,558 INFO L272 TraceCheckUtils]: 69: Hoare triple {28391#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,558 INFO L290 TraceCheckUtils]: 70: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,558 INFO L290 TraceCheckUtils]: 71: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,558 INFO L290 TraceCheckUtils]: 72: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,558 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {28177#true} {28391#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 0 main_~k~0))} #54#return; {28391#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,559 INFO L290 TraceCheckUtils]: 74: Hoare triple {28391#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28413#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,559 INFO L290 TraceCheckUtils]: 75: Hoare triple {28413#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {28413#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,559 INFO L272 TraceCheckUtils]: 76: Hoare triple {28413#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 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)); {28177#true} is VALID [2022-04-28 07:52:15,559 INFO L290 TraceCheckUtils]: 77: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,559 INFO L290 TraceCheckUtils]: 78: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,559 INFO L290 TraceCheckUtils]: 79: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,560 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {28177#true} {28413#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {28413#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,560 INFO L290 TraceCheckUtils]: 81: Hoare triple {28413#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 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; {28435#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,561 INFO L290 TraceCheckUtils]: 82: Hoare triple {28435#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} assume !false; {28435#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,561 INFO L272 TraceCheckUtils]: 83: Hoare triple {28435#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,561 INFO L290 TraceCheckUtils]: 84: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,561 INFO L290 TraceCheckUtils]: 85: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,561 INFO L290 TraceCheckUtils]: 86: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,561 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {28177#true} {28435#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} #54#return; {28435#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,562 INFO L290 TraceCheckUtils]: 88: Hoare triple {28435#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28457#(and (= main_~y~0 11) (< 0 main_~k~0) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-28 07:52:15,562 INFO L290 TraceCheckUtils]: 89: Hoare triple {28457#(and (= main_~y~0 11) (< 0 main_~k~0) (= 6 (+ main_~c~0 (- 5))))} assume !false; {28457#(and (= main_~y~0 11) (< 0 main_~k~0) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-28 07:52:15,562 INFO L272 TraceCheckUtils]: 90: Hoare triple {28457#(and (= main_~y~0 11) (< 0 main_~k~0) (= 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)); {28177#true} is VALID [2022-04-28 07:52:15,562 INFO L290 TraceCheckUtils]: 91: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,562 INFO L290 TraceCheckUtils]: 92: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,562 INFO L290 TraceCheckUtils]: 93: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,563 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {28177#true} {28457#(and (= main_~y~0 11) (< 0 main_~k~0) (= 6 (+ main_~c~0 (- 5))))} #54#return; {28457#(and (= main_~y~0 11) (< 0 main_~k~0) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-28 07:52:15,563 INFO L290 TraceCheckUtils]: 95: Hoare triple {28457#(and (= main_~y~0 11) (< 0 main_~k~0) (= 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; {28479#(and (= 6 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,564 INFO L290 TraceCheckUtils]: 96: Hoare triple {28479#(and (= 6 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} assume !false; {28479#(and (= 6 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,564 INFO L272 TraceCheckUtils]: 97: Hoare triple {28479#(and (= 6 (+ main_~c~0 (- 6))) (= (+ (- 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)); {28177#true} is VALID [2022-04-28 07:52:15,564 INFO L290 TraceCheckUtils]: 98: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,564 INFO L290 TraceCheckUtils]: 99: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,564 INFO L290 TraceCheckUtils]: 100: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,564 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {28177#true} {28479#(and (= 6 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} #54#return; {28479#(and (= 6 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,565 INFO L290 TraceCheckUtils]: 102: Hoare triple {28479#(and (= 6 (+ main_~c~0 (- 6))) (= (+ (- 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; {28501#(and (= (+ main_~c~0 (- 7)) 6) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,565 INFO L290 TraceCheckUtils]: 103: Hoare triple {28501#(and (= (+ main_~c~0 (- 7)) 6) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} assume !false; {28501#(and (= (+ main_~c~0 (- 7)) 6) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,565 INFO L272 TraceCheckUtils]: 104: Hoare triple {28501#(and (= (+ main_~c~0 (- 7)) 6) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,565 INFO L290 TraceCheckUtils]: 105: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,565 INFO L290 TraceCheckUtils]: 106: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,565 INFO L290 TraceCheckUtils]: 107: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,566 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {28177#true} {28501#(and (= (+ main_~c~0 (- 7)) 6) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} #54#return; {28501#(and (= (+ main_~c~0 (- 7)) 6) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,566 INFO L290 TraceCheckUtils]: 109: Hoare triple {28501#(and (= (+ main_~c~0 (- 7)) 6) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28523#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,567 INFO L290 TraceCheckUtils]: 110: Hoare triple {28523#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14) (< 0 main_~k~0))} assume !false; {28523#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,567 INFO L272 TraceCheckUtils]: 111: Hoare triple {28523#(and (= (+ main_~y~0 (- 3)) 11) (= 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)); {28177#true} is VALID [2022-04-28 07:52:15,567 INFO L290 TraceCheckUtils]: 112: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,567 INFO L290 TraceCheckUtils]: 113: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,567 INFO L290 TraceCheckUtils]: 114: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,567 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {28177#true} {28523#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14) (< 0 main_~k~0))} #54#return; {28523#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,568 INFO L290 TraceCheckUtils]: 116: Hoare triple {28523#(and (= (+ main_~y~0 (- 3)) 11) (= 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; {28545#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,568 INFO L290 TraceCheckUtils]: 117: Hoare triple {28545#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} assume !false; {28545#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,568 INFO L272 TraceCheckUtils]: 118: Hoare triple {28545#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 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)); {28177#true} is VALID [2022-04-28 07:52:15,568 INFO L290 TraceCheckUtils]: 119: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,568 INFO L290 TraceCheckUtils]: 120: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,568 INFO L290 TraceCheckUtils]: 121: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,569 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {28177#true} {28545#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} #54#return; {28545#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,569 INFO L290 TraceCheckUtils]: 123: Hoare triple {28545#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 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; {28567#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,569 INFO L290 TraceCheckUtils]: 124: Hoare triple {28567#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} assume !false; {28567#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,570 INFO L272 TraceCheckUtils]: 125: Hoare triple {28567#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,570 INFO L290 TraceCheckUtils]: 126: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,570 INFO L290 TraceCheckUtils]: 127: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,570 INFO L290 TraceCheckUtils]: 128: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,570 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {28177#true} {28567#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} #54#return; {28567#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,571 INFO L290 TraceCheckUtils]: 130: Hoare triple {28567#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28589#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,571 INFO L290 TraceCheckUtils]: 131: Hoare triple {28589#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {28589#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,571 INFO L272 TraceCheckUtils]: 132: Hoare triple {28589#(and (= main_~c~0 17) (= 16 (+ (- 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)); {28177#true} is VALID [2022-04-28 07:52:15,571 INFO L290 TraceCheckUtils]: 133: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,571 INFO L290 TraceCheckUtils]: 134: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,571 INFO L290 TraceCheckUtils]: 135: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,572 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {28177#true} {28589#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {28589#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,572 INFO L290 TraceCheckUtils]: 137: Hoare triple {28589#(and (= main_~c~0 17) (= 16 (+ (- 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; {28611#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-28 07:52:15,572 INFO L290 TraceCheckUtils]: 138: Hoare triple {28611#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !false; {28611#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-28 07:52:15,573 INFO L272 TraceCheckUtils]: 139: Hoare triple {28611#(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)); {28177#true} is VALID [2022-04-28 07:52:15,573 INFO L290 TraceCheckUtils]: 140: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,573 INFO L290 TraceCheckUtils]: 141: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,573 INFO L290 TraceCheckUtils]: 142: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,573 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {28177#true} {28611#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} #54#return; {28611#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-28 07:52:15,574 INFO L290 TraceCheckUtils]: 144: Hoare triple {28611#(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; {28633#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:52:15,574 INFO L290 TraceCheckUtils]: 145: Hoare triple {28633#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {28633#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:52:15,574 INFO L272 TraceCheckUtils]: 146: Hoare triple {28633#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,574 INFO L290 TraceCheckUtils]: 147: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,574 INFO L290 TraceCheckUtils]: 148: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,574 INFO L290 TraceCheckUtils]: 149: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,575 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {28177#true} {28633#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} #54#return; {28633#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:52:15,575 INFO L290 TraceCheckUtils]: 151: Hoare triple {28633#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28655#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,576 INFO L290 TraceCheckUtils]: 152: Hoare triple {28655#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} assume !false; {28655#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,576 INFO L272 TraceCheckUtils]: 153: Hoare triple {28655#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,576 INFO L290 TraceCheckUtils]: 154: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,576 INFO L290 TraceCheckUtils]: 155: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,576 INFO L290 TraceCheckUtils]: 156: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,576 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {28177#true} {28655#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} #54#return; {28655#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,577 INFO L290 TraceCheckUtils]: 158: Hoare triple {28655#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28677#(and (= main_~c~0 21) (= main_~y~0 21) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,577 INFO L290 TraceCheckUtils]: 159: Hoare triple {28677#(and (= main_~c~0 21) (= main_~y~0 21) (< 0 main_~k~0))} assume !false; {28677#(and (= main_~c~0 21) (= main_~y~0 21) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,577 INFO L272 TraceCheckUtils]: 160: Hoare triple {28677#(and (= main_~c~0 21) (= main_~y~0 21) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,577 INFO L290 TraceCheckUtils]: 161: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,577 INFO L290 TraceCheckUtils]: 162: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,577 INFO L290 TraceCheckUtils]: 163: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,578 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {28177#true} {28677#(and (= main_~c~0 21) (= main_~y~0 21) (< 0 main_~k~0))} #54#return; {28677#(and (= main_~c~0 21) (= main_~y~0 21) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,578 INFO L290 TraceCheckUtils]: 165: Hoare triple {28677#(and (= main_~c~0 21) (= main_~y~0 21) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28699#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,578 INFO L290 TraceCheckUtils]: 166: Hoare triple {28699#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} assume !false; {28699#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,579 INFO L272 TraceCheckUtils]: 167: Hoare triple {28699#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,579 INFO L290 TraceCheckUtils]: 168: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,579 INFO L290 TraceCheckUtils]: 169: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,579 INFO L290 TraceCheckUtils]: 170: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,579 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {28177#true} {28699#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} #54#return; {28699#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,580 INFO L290 TraceCheckUtils]: 172: Hoare triple {28699#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28721#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,580 INFO L290 TraceCheckUtils]: 173: Hoare triple {28721#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} assume !false; {28721#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,580 INFO L272 TraceCheckUtils]: 174: Hoare triple {28721#(and (= 23 main_~y~0) (= 23 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)); {28177#true} is VALID [2022-04-28 07:52:15,580 INFO L290 TraceCheckUtils]: 175: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,580 INFO L290 TraceCheckUtils]: 176: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,580 INFO L290 TraceCheckUtils]: 177: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,581 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {28177#true} {28721#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} #54#return; {28721#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,581 INFO L290 TraceCheckUtils]: 179: Hoare triple {28721#(and (= 23 main_~y~0) (= 23 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; {28743#(and (= main_~c~0 24) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,581 INFO L290 TraceCheckUtils]: 180: Hoare triple {28743#(and (= main_~c~0 24) (= main_~y~0 24) (< 0 main_~k~0))} assume !false; {28743#(and (= main_~c~0 24) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,582 INFO L272 TraceCheckUtils]: 181: Hoare triple {28743#(and (= main_~c~0 24) (= main_~y~0 24) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,582 INFO L290 TraceCheckUtils]: 182: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,582 INFO L290 TraceCheckUtils]: 183: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,582 INFO L290 TraceCheckUtils]: 184: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,582 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {28177#true} {28743#(and (= main_~c~0 24) (= main_~y~0 24) (< 0 main_~k~0))} #54#return; {28743#(and (= main_~c~0 24) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,583 INFO L290 TraceCheckUtils]: 186: Hoare triple {28743#(and (= main_~c~0 24) (= main_~y~0 24) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28765#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,583 INFO L290 TraceCheckUtils]: 187: Hoare triple {28765#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} assume !false; {28765#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,583 INFO L272 TraceCheckUtils]: 188: Hoare triple {28765#(and (= main_~y~0 25) (= main_~c~0 25) (< 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)); {28177#true} is VALID [2022-04-28 07:52:15,583 INFO L290 TraceCheckUtils]: 189: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,583 INFO L290 TraceCheckUtils]: 190: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,583 INFO L290 TraceCheckUtils]: 191: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,584 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {28177#true} {28765#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} #54#return; {28765#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,584 INFO L290 TraceCheckUtils]: 193: Hoare triple {28765#(and (= main_~y~0 25) (= main_~c~0 25) (< 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; {28787#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:52:15,584 INFO L290 TraceCheckUtils]: 194: Hoare triple {28787#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} assume !false; {28787#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:52:15,585 INFO L272 TraceCheckUtils]: 195: Hoare triple {28787#(and (< 0 main_~k~0) (= (+ (- 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)); {28177#true} is VALID [2022-04-28 07:52:15,585 INFO L290 TraceCheckUtils]: 196: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,585 INFO L290 TraceCheckUtils]: 197: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,585 INFO L290 TraceCheckUtils]: 198: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,585 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {28177#true} {28787#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} #54#return; {28787#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:52:15,586 INFO L290 TraceCheckUtils]: 200: Hoare triple {28787#(and (< 0 main_~k~0) (= (+ (- 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; {28809#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,586 INFO L290 TraceCheckUtils]: 201: Hoare triple {28809#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} assume !false; {28809#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,586 INFO L272 TraceCheckUtils]: 202: Hoare triple {28809#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,586 INFO L290 TraceCheckUtils]: 203: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,586 INFO L290 TraceCheckUtils]: 204: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,586 INFO L290 TraceCheckUtils]: 205: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,587 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {28177#true} {28809#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} #54#return; {28809#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,587 INFO L290 TraceCheckUtils]: 207: Hoare triple {28809#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28831#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,588 INFO L290 TraceCheckUtils]: 208: Hoare triple {28831#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} assume !false; {28831#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,588 INFO L272 TraceCheckUtils]: 209: Hoare triple {28831#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,588 INFO L290 TraceCheckUtils]: 210: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,588 INFO L290 TraceCheckUtils]: 211: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,588 INFO L290 TraceCheckUtils]: 212: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,588 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {28177#true} {28831#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} #54#return; {28831#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-28 07:52:15,589 INFO L290 TraceCheckUtils]: 214: Hoare triple {28831#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28853#(and (= 28 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-28 07:52:15,589 INFO L290 TraceCheckUtils]: 215: Hoare triple {28853#(and (= 28 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 28))} assume !false; {28853#(and (= 28 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-28 07:52:15,589 INFO L272 TraceCheckUtils]: 216: Hoare triple {28853#(and (= 28 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28177#true} is VALID [2022-04-28 07:52:15,589 INFO L290 TraceCheckUtils]: 217: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,590 INFO L290 TraceCheckUtils]: 218: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,590 INFO L290 TraceCheckUtils]: 219: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,590 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {28177#true} {28853#(and (= 28 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 28))} #54#return; {28853#(and (= 28 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-28 07:52:15,591 INFO L290 TraceCheckUtils]: 221: Hoare triple {28853#(and (= 28 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 28))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28875#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-28 07:52:15,591 INFO L290 TraceCheckUtils]: 222: Hoare triple {28875#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} assume !false; {28875#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-28 07:52:15,591 INFO L272 TraceCheckUtils]: 223: Hoare triple {28875#(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)); {28177#true} is VALID [2022-04-28 07:52:15,591 INFO L290 TraceCheckUtils]: 224: Hoare triple {28177#true} ~cond := #in~cond; {28177#true} is VALID [2022-04-28 07:52:15,591 INFO L290 TraceCheckUtils]: 225: Hoare triple {28177#true} assume !(0 == ~cond); {28177#true} is VALID [2022-04-28 07:52:15,591 INFO L290 TraceCheckUtils]: 226: Hoare triple {28177#true} assume true; {28177#true} is VALID [2022-04-28 07:52:15,592 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {28177#true} {28875#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} #54#return; {28875#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-28 07:52:15,592 INFO L290 TraceCheckUtils]: 228: Hoare triple {28875#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} assume !(~c~0 < ~k~0); {28897#(and (<= main_~k~0 30) (= 30 main_~y~0) (< 29 main_~k~0))} is VALID [2022-04-28 07:52:15,593 INFO L272 TraceCheckUtils]: 229: Hoare triple {28897#(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)); {28901#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:52:15,593 INFO L290 TraceCheckUtils]: 230: Hoare triple {28901#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28905#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:52:15,594 INFO L290 TraceCheckUtils]: 231: Hoare triple {28905#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28178#false} is VALID [2022-04-28 07:52:15,594 INFO L290 TraceCheckUtils]: 232: Hoare triple {28178#false} assume !false; {28178#false} is VALID [2022-04-28 07:52:15,595 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:52:15,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:52:20,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:52:20,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901123950] [2022-04-28 07:52:20,701 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:52:20,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305929161] [2022-04-28 07:52:20,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305929161] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:52:20,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:52:20,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2022-04-28 07:52:20,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:52:20,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2119851510] [2022-04-28 07:52:20,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2119851510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:52:20,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:52:20,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 07:52:20,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534823124] [2022-04-28 07:52:20,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:52:20,703 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:20,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:52:20,703 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:52:21,388 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:52:21,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 07:52:21,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:52:21,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 07:52:21,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=3516, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 07:52:21,390 INFO L87 Difference]: Start difference. First operand 122 states and 150 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:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:52:59,858 INFO L93 Difference]: Finished difference Result 130 states and 159 transitions. [2022-04-28 07:52:59,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 07:52:59,858 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:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:52:59,858 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:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 152 transitions. [2022-04-28 07:52:59,861 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:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 152 transitions. [2022-04-28 07:52:59,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 152 transitions. [2022-04-28 07:53:00,694 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:53:00,696 INFO L225 Difference]: With dead ends: 130 [2022-04-28 07:53:00,696 INFO L226 Difference]: Without dead ends: 125 [2022-04-28 07:53:00,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1050, Invalid=3780, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 07:53:00,697 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 3270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 3270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2022-04-28 07:53:00,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1710 Invalid, 3270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3270 Invalid, 0 Unknown, 0 Unchecked, 20.3s Time] [2022-04-28 07:53:00,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-28 07:53:00,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-04-28 07:53:00,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:53:00,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 125 states, 83 states have (on average 1.0120481927710843) internal successors, (84), 83 states have internal predecessors, (84), 36 states have call successors, (36), 7 states have call predecessors, (36), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 07:53:00,929 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 125 states, 83 states have (on average 1.0120481927710843) internal successors, (84), 83 states have internal predecessors, (84), 36 states have call successors, (36), 7 states have call predecessors, (36), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 07:53:00,929 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 125 states, 83 states have (on average 1.0120481927710843) internal successors, (84), 83 states have internal predecessors, (84), 36 states have call successors, (36), 7 states have call predecessors, (36), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 07:53:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:53:00,931 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2022-04-28 07:53:00,931 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 154 transitions. [2022-04-28 07:53:00,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:53:00,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:53:00,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 83 states have (on average 1.0120481927710843) internal successors, (84), 83 states have internal predecessors, (84), 36 states have call successors, (36), 7 states have call predecessors, (36), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 125 states. [2022-04-28 07:53:00,932 INFO L87 Difference]: Start difference. First operand has 125 states, 83 states have (on average 1.0120481927710843) internal successors, (84), 83 states have internal predecessors, (84), 36 states have call successors, (36), 7 states have call predecessors, (36), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 125 states. [2022-04-28 07:53:00,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:53:00,934 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2022-04-28 07:53:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 154 transitions. [2022-04-28 07:53:00,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:53:00,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:53:00,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:53:00,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:53:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.0120481927710843) internal successors, (84), 83 states have internal predecessors, (84), 36 states have call successors, (36), 7 states have call predecessors, (36), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 07:53:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 154 transitions. [2022-04-28 07:53:00,937 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 154 transitions. Word has length 233 [2022-04-28 07:53:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:53:00,937 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 154 transitions. [2022-04-28 07:53:00,937 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:53:00,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 154 transitions. [2022-04-28 07:53:01,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:53:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 154 transitions. [2022-04-28 07:53:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-04-28 07:53:01,842 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:53:01,842 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:53:01,851 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:53:02,042 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:53:02,043 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:53:02,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:53:02,043 INFO L85 PathProgramCache]: Analyzing trace with hash -155412760, now seen corresponding path program 61 times [2022-04-28 07:53:02,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:53:02,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1785600815] [2022-04-28 07:53:02,114 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:02,115 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:53:02,115 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:53:02,115 INFO L85 PathProgramCache]: Analyzing trace with hash -155412760, now seen corresponding path program 62 times [2022-04-28 07:53:02,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:53:02,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442269753] [2022-04-28 07:53:02,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:53:02,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:53:02,131 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:53:02,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [761968609] [2022-04-28 07:53:02,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:53:02,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:53:02,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:53:02,133 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:53:02,134 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:53:03,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:53:03,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:53:03,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 149 conjunts are in the unsatisfiable core [2022-04-28 07:53:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:53:03,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:53:04,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {30355#true} call ULTIMATE.init(); {30355#true} is VALID [2022-04-28 07:53:04,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {30355#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); {30355#true} is VALID [2022-04-28 07:53:04,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30355#true} {30355#true} #60#return; {30355#true} is VALID [2022-04-28 07:53:04,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {30355#true} call #t~ret5 := main(); {30355#true} is VALID [2022-04-28 07:53:04,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {30355#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; {30355#true} is VALID [2022-04-28 07:53:04,871 INFO L272 TraceCheckUtils]: 6: Hoare triple {30355#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {30355#true} is VALID [2022-04-28 07:53:04,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,871 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30355#true} {30355#true} #52#return; {30355#true} is VALID [2022-04-28 07:53:04,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {30355#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {30393#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:53:04,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {30393#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {30393#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:53:04,886 INFO L272 TraceCheckUtils]: 13: Hoare triple {30393#(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)); {30355#true} is VALID [2022-04-28 07:53:04,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,886 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {30355#true} {30393#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {30393#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:53:04,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {30393#(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; {30415#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:53:04,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {30415#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {30415#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:53:04,887 INFO L272 TraceCheckUtils]: 20: Hoare triple {30415#(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)); {30355#true} is VALID [2022-04-28 07:53:04,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,888 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {30355#true} {30415#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {30415#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:53:04,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {30415#(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; {30437#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:53:04,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {30437#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {30437#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:53:04,889 INFO L272 TraceCheckUtils]: 27: Hoare triple {30437#(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)); {30355#true} is VALID [2022-04-28 07:53:04,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,889 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {30355#true} {30437#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {30437#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:53:04,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {30437#(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; {30459#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:53:04,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {30459#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {30459#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:53:04,890 INFO L272 TraceCheckUtils]: 34: Hoare triple {30459#(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)); {30355#true} is VALID [2022-04-28 07:53:04,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,890 INFO L290 TraceCheckUtils]: 36: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,890 INFO L290 TraceCheckUtils]: 37: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,891 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {30355#true} {30459#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #54#return; {30459#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:53:04,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {30459#(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; {30481#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:53:04,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {30481#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {30481#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:53:04,891 INFO L272 TraceCheckUtils]: 41: Hoare triple {30481#(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)); {30355#true} is VALID [2022-04-28 07:53:04,891 INFO L290 TraceCheckUtils]: 42: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,891 INFO L290 TraceCheckUtils]: 43: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,892 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {30355#true} {30481#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {30481#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:53:04,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {30481#(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; {30503#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:53:04,893 INFO L290 TraceCheckUtils]: 47: Hoare triple {30503#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {30503#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:53:04,893 INFO L272 TraceCheckUtils]: 48: Hoare triple {30503#(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)); {30355#true} is VALID [2022-04-28 07:53:04,893 INFO L290 TraceCheckUtils]: 49: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,893 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {30355#true} {30503#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {30503#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:53:04,894 INFO L290 TraceCheckUtils]: 53: Hoare triple {30503#(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; {30525#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:04,894 INFO L290 TraceCheckUtils]: 54: Hoare triple {30525#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {30525#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:04,894 INFO L272 TraceCheckUtils]: 55: Hoare triple {30525#(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)); {30355#true} is VALID [2022-04-28 07:53:04,894 INFO L290 TraceCheckUtils]: 56: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,894 INFO L290 TraceCheckUtils]: 57: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,894 INFO L290 TraceCheckUtils]: 58: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,895 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {30355#true} {30525#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {30525#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:04,895 INFO L290 TraceCheckUtils]: 60: Hoare triple {30525#(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; {30547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:53:04,895 INFO L290 TraceCheckUtils]: 61: Hoare triple {30547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {30547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:53:04,896 INFO L272 TraceCheckUtils]: 62: Hoare triple {30547#(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)); {30355#true} is VALID [2022-04-28 07:53:04,896 INFO L290 TraceCheckUtils]: 63: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,896 INFO L290 TraceCheckUtils]: 64: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,896 INFO L290 TraceCheckUtils]: 65: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,896 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {30355#true} {30547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {30547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:53:04,896 INFO L290 TraceCheckUtils]: 67: Hoare triple {30547#(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; {30569#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:53:04,897 INFO L290 TraceCheckUtils]: 68: Hoare triple {30569#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {30569#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:53:04,897 INFO L272 TraceCheckUtils]: 69: Hoare triple {30569#(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)); {30355#true} is VALID [2022-04-28 07:53:04,897 INFO L290 TraceCheckUtils]: 70: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,897 INFO L290 TraceCheckUtils]: 71: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,897 INFO L290 TraceCheckUtils]: 72: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,897 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {30355#true} {30569#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #54#return; {30569#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-28 07:53:04,898 INFO L290 TraceCheckUtils]: 74: Hoare triple {30569#(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; {30591#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:04,898 INFO L290 TraceCheckUtils]: 75: Hoare triple {30591#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} assume !false; {30591#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:04,898 INFO L272 TraceCheckUtils]: 76: Hoare triple {30591#(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)); {30355#true} is VALID [2022-04-28 07:53:04,898 INFO L290 TraceCheckUtils]: 77: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,898 INFO L290 TraceCheckUtils]: 78: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,898 INFO L290 TraceCheckUtils]: 79: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,899 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {30355#true} {30591#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} #54#return; {30591#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:04,899 INFO L290 TraceCheckUtils]: 81: Hoare triple {30591#(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; {30613#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-28 07:53:04,900 INFO L290 TraceCheckUtils]: 82: Hoare triple {30613#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} assume !false; {30613#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-28 07:53:04,900 INFO L272 TraceCheckUtils]: 83: Hoare triple {30613#(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)); {30355#true} is VALID [2022-04-28 07:53:04,900 INFO L290 TraceCheckUtils]: 84: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,900 INFO L290 TraceCheckUtils]: 85: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,900 INFO L290 TraceCheckUtils]: 86: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,900 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {30355#true} {30613#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} #54#return; {30613#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-28 07:53:04,901 INFO L290 TraceCheckUtils]: 88: Hoare triple {30613#(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; {30635#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-28 07:53:04,901 INFO L290 TraceCheckUtils]: 89: Hoare triple {30635#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} assume !false; {30635#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-28 07:53:04,901 INFO L272 TraceCheckUtils]: 90: Hoare triple {30635#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {30355#true} is VALID [2022-04-28 07:53:04,901 INFO L290 TraceCheckUtils]: 91: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,901 INFO L290 TraceCheckUtils]: 92: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,901 INFO L290 TraceCheckUtils]: 93: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,902 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {30355#true} {30635#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} #54#return; {30635#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-28 07:53:04,902 INFO L290 TraceCheckUtils]: 95: Hoare triple {30635#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30657#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:53:04,902 INFO L290 TraceCheckUtils]: 96: Hoare triple {30657#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {30657#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:53:04,903 INFO L272 TraceCheckUtils]: 97: Hoare triple {30657#(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)); {30355#true} is VALID [2022-04-28 07:53:04,903 INFO L290 TraceCheckUtils]: 98: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,903 INFO L290 TraceCheckUtils]: 99: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,903 INFO L290 TraceCheckUtils]: 100: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,903 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {30355#true} {30657#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {30657#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:53:04,904 INFO L290 TraceCheckUtils]: 102: Hoare triple {30657#(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; {30679#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:04,904 INFO L290 TraceCheckUtils]: 103: Hoare triple {30679#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} assume !false; {30679#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:04,904 INFO L272 TraceCheckUtils]: 104: Hoare triple {30679#(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)); {30355#true} is VALID [2022-04-28 07:53:04,904 INFO L290 TraceCheckUtils]: 105: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,904 INFO L290 TraceCheckUtils]: 106: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,904 INFO L290 TraceCheckUtils]: 107: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,905 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {30355#true} {30679#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} #54#return; {30679#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:53:04,905 INFO L290 TraceCheckUtils]: 109: Hoare triple {30679#(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; {30701#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-28 07:53:04,905 INFO L290 TraceCheckUtils]: 110: Hoare triple {30701#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} assume !false; {30701#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-28 07:53:04,905 INFO L272 TraceCheckUtils]: 111: Hoare triple {30701#(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)); {30355#true} is VALID [2022-04-28 07:53:04,905 INFO L290 TraceCheckUtils]: 112: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,905 INFO L290 TraceCheckUtils]: 113: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,905 INFO L290 TraceCheckUtils]: 114: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,906 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {30355#true} {30701#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} #54#return; {30701#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-28 07:53:04,906 INFO L290 TraceCheckUtils]: 116: Hoare triple {30701#(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; {30723#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:53:04,907 INFO L290 TraceCheckUtils]: 117: Hoare triple {30723#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {30723#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:53:04,907 INFO L272 TraceCheckUtils]: 118: Hoare triple {30723#(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)); {30355#true} is VALID [2022-04-28 07:53:04,907 INFO L290 TraceCheckUtils]: 119: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,907 INFO L290 TraceCheckUtils]: 120: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,907 INFO L290 TraceCheckUtils]: 121: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,907 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {30355#true} {30723#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {30723#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:53:04,908 INFO L290 TraceCheckUtils]: 123: Hoare triple {30723#(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; {30745#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 07:53:04,908 INFO L290 TraceCheckUtils]: 124: Hoare triple {30745#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} assume !false; {30745#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 07:53:04,908 INFO L272 TraceCheckUtils]: 125: Hoare triple {30745#(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)); {30355#true} is VALID [2022-04-28 07:53:04,908 INFO L290 TraceCheckUtils]: 126: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,908 INFO L290 TraceCheckUtils]: 127: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,908 INFO L290 TraceCheckUtils]: 128: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,909 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {30355#true} {30745#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} #54#return; {30745#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 07:53:04,909 INFO L290 TraceCheckUtils]: 130: Hoare triple {30745#(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; {30767#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-28 07:53:04,909 INFO L290 TraceCheckUtils]: 131: Hoare triple {30767#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} assume !false; {30767#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-28 07:53:04,909 INFO L272 TraceCheckUtils]: 132: Hoare triple {30767#(and (= 15 (+ (- 2) main_~c~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)); {30355#true} is VALID [2022-04-28 07:53:04,909 INFO L290 TraceCheckUtils]: 133: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,910 INFO L290 TraceCheckUtils]: 134: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,910 INFO L290 TraceCheckUtils]: 135: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,910 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {30355#true} {30767#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} #54#return; {30767#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-28 07:53:04,910 INFO L290 TraceCheckUtils]: 137: Hoare triple {30767#(and (= 15 (+ (- 2) main_~c~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; {30789#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:53:04,911 INFO L290 TraceCheckUtils]: 138: Hoare triple {30789#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {30789#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:53:04,911 INFO L272 TraceCheckUtils]: 139: Hoare triple {30789#(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)); {30355#true} is VALID [2022-04-28 07:53:04,911 INFO L290 TraceCheckUtils]: 140: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,911 INFO L290 TraceCheckUtils]: 141: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,911 INFO L290 TraceCheckUtils]: 142: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,911 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {30355#true} {30789#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #54#return; {30789#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:53:04,912 INFO L290 TraceCheckUtils]: 144: Hoare triple {30789#(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; {30811#(and (= (+ (- 2) main_~y~0) 17) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:53:04,912 INFO L290 TraceCheckUtils]: 145: Hoare triple {30811#(and (= (+ (- 2) main_~y~0) 17) (= (+ (- 1) main_~c~0) 18))} assume !false; {30811#(and (= (+ (- 2) main_~y~0) 17) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:53:04,912 INFO L272 TraceCheckUtils]: 146: Hoare triple {30811#(and (= (+ (- 2) main_~y~0) 17) (= (+ (- 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)); {30355#true} is VALID [2022-04-28 07:53:04,912 INFO L290 TraceCheckUtils]: 147: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,912 INFO L290 TraceCheckUtils]: 148: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,912 INFO L290 TraceCheckUtils]: 149: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,913 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {30355#true} {30811#(and (= (+ (- 2) main_~y~0) 17) (= (+ (- 1) main_~c~0) 18))} #54#return; {30811#(and (= (+ (- 2) main_~y~0) 17) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:53:04,913 INFO L290 TraceCheckUtils]: 151: Hoare triple {30811#(and (= (+ (- 2) main_~y~0) 17) (= (+ (- 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; {30833#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-28 07:53:04,913 INFO L290 TraceCheckUtils]: 152: Hoare triple {30833#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {30833#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-28 07:53:04,914 INFO L272 TraceCheckUtils]: 153: Hoare triple {30833#(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)); {30355#true} is VALID [2022-04-28 07:53:04,914 INFO L290 TraceCheckUtils]: 154: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,914 INFO L290 TraceCheckUtils]: 155: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,914 INFO L290 TraceCheckUtils]: 156: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,914 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {30355#true} {30833#(and (= main_~c~0 20) (= main_~y~0 20))} #54#return; {30833#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-28 07:53:04,914 INFO L290 TraceCheckUtils]: 158: Hoare triple {30833#(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; {30855#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-28 07:53:04,915 INFO L290 TraceCheckUtils]: 159: Hoare triple {30855#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {30855#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-28 07:53:04,915 INFO L272 TraceCheckUtils]: 160: Hoare triple {30855#(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)); {30355#true} is VALID [2022-04-28 07:53:04,915 INFO L290 TraceCheckUtils]: 161: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,915 INFO L290 TraceCheckUtils]: 162: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,915 INFO L290 TraceCheckUtils]: 163: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,915 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {30355#true} {30855#(and (= main_~c~0 21) (= main_~y~0 21))} #54#return; {30855#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-28 07:53:04,916 INFO L290 TraceCheckUtils]: 165: Hoare triple {30855#(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; {30877#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:53:04,916 INFO L290 TraceCheckUtils]: 166: Hoare triple {30877#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} assume !false; {30877#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:53:04,916 INFO L272 TraceCheckUtils]: 167: Hoare triple {30877#(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)); {30355#true} is VALID [2022-04-28 07:53:04,916 INFO L290 TraceCheckUtils]: 168: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,916 INFO L290 TraceCheckUtils]: 169: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,916 INFO L290 TraceCheckUtils]: 170: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,917 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {30355#true} {30877#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} #54#return; {30877#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-28 07:53:04,917 INFO L290 TraceCheckUtils]: 172: Hoare triple {30877#(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; {30899#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:53:04,918 INFO L290 TraceCheckUtils]: 173: Hoare triple {30899#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {30899#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:53:04,918 INFO L272 TraceCheckUtils]: 174: Hoare triple {30899#(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)); {30355#true} is VALID [2022-04-28 07:53:04,918 INFO L290 TraceCheckUtils]: 175: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,918 INFO L290 TraceCheckUtils]: 176: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,918 INFO L290 TraceCheckUtils]: 177: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,918 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {30355#true} {30899#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {30899#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-28 07:53:04,919 INFO L290 TraceCheckUtils]: 179: Hoare triple {30899#(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; {30921#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-28 07:53:04,919 INFO L290 TraceCheckUtils]: 180: Hoare triple {30921#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} assume !false; {30921#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-28 07:53:04,919 INFO L272 TraceCheckUtils]: 181: Hoare triple {30921#(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)); {30355#true} is VALID [2022-04-28 07:53:04,919 INFO L290 TraceCheckUtils]: 182: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,919 INFO L290 TraceCheckUtils]: 183: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,919 INFO L290 TraceCheckUtils]: 184: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,920 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {30355#true} {30921#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} #54#return; {30921#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-28 07:53:04,920 INFO L290 TraceCheckUtils]: 186: Hoare triple {30921#(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; {30943#(and (= 23 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-28 07:53:04,920 INFO L290 TraceCheckUtils]: 187: Hoare triple {30943#(and (= 23 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 24))} assume !false; {30943#(and (= 23 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-28 07:53:04,920 INFO L272 TraceCheckUtils]: 188: Hoare triple {30943#(and (= 23 (+ (- 2) main_~y~0)) (= (+ (- 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)); {30355#true} is VALID [2022-04-28 07:53:04,920 INFO L290 TraceCheckUtils]: 189: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,921 INFO L290 TraceCheckUtils]: 190: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,921 INFO L290 TraceCheckUtils]: 191: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,921 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {30355#true} {30943#(and (= 23 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 24))} #54#return; {30943#(and (= 23 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-28 07:53:04,921 INFO L290 TraceCheckUtils]: 193: Hoare triple {30943#(and (= 23 (+ (- 2) main_~y~0)) (= (+ (- 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; {30965#(and (= 23 (+ main_~y~0 (- 3))) (= (+ (- 2) main_~c~0) 24))} is VALID [2022-04-28 07:53:04,922 INFO L290 TraceCheckUtils]: 194: Hoare triple {30965#(and (= 23 (+ main_~y~0 (- 3))) (= (+ (- 2) main_~c~0) 24))} assume !false; {30965#(and (= 23 (+ main_~y~0 (- 3))) (= (+ (- 2) main_~c~0) 24))} is VALID [2022-04-28 07:53:04,922 INFO L272 TraceCheckUtils]: 195: Hoare triple {30965#(and (= 23 (+ main_~y~0 (- 3))) (= (+ (- 2) 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)); {30355#true} is VALID [2022-04-28 07:53:04,922 INFO L290 TraceCheckUtils]: 196: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,922 INFO L290 TraceCheckUtils]: 197: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,922 INFO L290 TraceCheckUtils]: 198: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,923 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {30355#true} {30965#(and (= 23 (+ main_~y~0 (- 3))) (= (+ (- 2) main_~c~0) 24))} #54#return; {30965#(and (= 23 (+ main_~y~0 (- 3))) (= (+ (- 2) main_~c~0) 24))} is VALID [2022-04-28 07:53:04,923 INFO L290 TraceCheckUtils]: 200: Hoare triple {30965#(and (= 23 (+ main_~y~0 (- 3))) (= (+ (- 2) 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; {30987#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27))} is VALID [2022-04-28 07:53:04,923 INFO L290 TraceCheckUtils]: 201: Hoare triple {30987#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27))} assume !false; {30987#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27))} is VALID [2022-04-28 07:53:04,923 INFO L272 TraceCheckUtils]: 202: Hoare triple {30987#(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)); {30355#true} is VALID [2022-04-28 07:53:04,924 INFO L290 TraceCheckUtils]: 203: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,924 INFO L290 TraceCheckUtils]: 204: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,924 INFO L290 TraceCheckUtils]: 205: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,924 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {30355#true} {30987#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27))} #54#return; {30987#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27))} is VALID [2022-04-28 07:53:04,925 INFO L290 TraceCheckUtils]: 207: Hoare triple {30987#(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; {31009#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 24))} is VALID [2022-04-28 07:53:04,925 INFO L290 TraceCheckUtils]: 208: Hoare triple {31009#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 24))} assume !false; {31009#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 24))} is VALID [2022-04-28 07:53:04,925 INFO L272 TraceCheckUtils]: 209: Hoare triple {31009#(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)); {30355#true} is VALID [2022-04-28 07:53:04,925 INFO L290 TraceCheckUtils]: 210: Hoare triple {30355#true} ~cond := #in~cond; {30355#true} is VALID [2022-04-28 07:53:04,925 INFO L290 TraceCheckUtils]: 211: Hoare triple {30355#true} assume !(0 == ~cond); {30355#true} is VALID [2022-04-28 07:53:04,925 INFO L290 TraceCheckUtils]: 212: Hoare triple {30355#true} assume true; {30355#true} is VALID [2022-04-28 07:53:04,926 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {30355#true} {31009#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 24))} #54#return; {31009#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 24))} is VALID [2022-04-28 07:53:04,926 INFO L290 TraceCheckUtils]: 214: Hoare triple {31009#(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; {31031#(and (= (+ (- 2) main_~y~0) 27) (= 29 main_~c~0))} is VALID [2022-04-28 07:53:04,926 INFO L290 TraceCheckUtils]: 215: Hoare triple {31031#(and (= (+ (- 2) main_~y~0) 27) (= 29 main_~c~0))} assume !false; {31031#(and (= (+ (- 2) main_~y~0) 27) (= 29 main_~c~0))} is VALID [2022-04-28 07:53:04,927 INFO L272 TraceCheckUtils]: 216: Hoare triple {31031#(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)); {30355#true} is VALID [2022-04-28 07:53:04,927 INFO L290 TraceCheckUtils]: 217: Hoare triple {30355#true} ~cond := #in~cond; {31041#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:53:04,927 INFO L290 TraceCheckUtils]: 218: Hoare triple {31041#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {31045#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:53:04,927 INFO L290 TraceCheckUtils]: 219: Hoare triple {31045#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {31045#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:53:04,928 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {31045#(not (= |__VERIFIER_assert_#in~cond| 0))} {31031#(and (= (+ (- 2) main_~y~0) 27) (= 29 main_~c~0))} #54#return; {31052#(and (= (+ (- 2) main_~y~0) 27) (= 29 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:53:04,929 INFO L290 TraceCheckUtils]: 221: Hoare triple {31052#(and (= (+ (- 2) main_~y~0) 27) (= 29 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; {31056#(and (= 30 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 189225) main_~x~0) (= 30 main_~c~0))} is VALID [2022-04-28 07:53:04,929 INFO L290 TraceCheckUtils]: 222: Hoare triple {31056#(and (= 30 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 189225) main_~x~0) (= 30 main_~c~0))} assume !false; {31056#(and (= 30 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 189225) main_~x~0) (= 30 main_~c~0))} is VALID [2022-04-28 07:53:04,929 INFO L272 TraceCheckUtils]: 223: Hoare triple {31056#(and (= 30 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 189225) main_~x~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)); {30355#true} is VALID [2022-04-28 07:53:04,929 INFO L290 TraceCheckUtils]: 224: Hoare triple {30355#true} ~cond := #in~cond; {31041#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:53:04,930 INFO L290 TraceCheckUtils]: 225: Hoare triple {31041#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {31045#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:53:04,930 INFO L290 TraceCheckUtils]: 226: Hoare triple {31045#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {31045#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:53:04,931 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {31045#(not (= |__VERIFIER_assert_#in~cond| 0))} {31056#(and (= 30 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 189225) main_~x~0) (= 30 main_~c~0))} #54#return; {31075#(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:53:04,931 INFO L290 TraceCheckUtils]: 228: Hoare triple {31075#(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; {31079#(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:53:04,932 INFO L290 TraceCheckUtils]: 229: Hoare triple {31079#(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; {31079#(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:53:04,932 INFO L272 TraceCheckUtils]: 230: Hoare triple {31079#(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)); {30355#true} is VALID [2022-04-28 07:53:04,932 INFO L290 TraceCheckUtils]: 231: Hoare triple {30355#true} ~cond := #in~cond; {31041#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:53:04,932 INFO L290 TraceCheckUtils]: 232: Hoare triple {31041#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {31045#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:53:04,933 INFO L290 TraceCheckUtils]: 233: Hoare triple {31045#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {31045#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:53:04,934 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {31045#(not (= |__VERIFIER_assert_#in~cond| 0))} {31079#(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; {31098#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} is VALID [2022-04-28 07:53:04,934 INFO L290 TraceCheckUtils]: 235: Hoare triple {31098#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} assume !(~c~0 < ~k~0); {31102#(and (= main_~y~0 31) (< 30 main_~k~0) (<= main_~k~0 31))} is VALID [2022-04-28 07:53:04,935 INFO L272 TraceCheckUtils]: 236: Hoare triple {31102#(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)); {31106#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:53:04,935 INFO L290 TraceCheckUtils]: 237: Hoare triple {31106#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31110#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:53:04,935 INFO L290 TraceCheckUtils]: 238: Hoare triple {31110#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {30356#false} is VALID [2022-04-28 07:53:04,936 INFO L290 TraceCheckUtils]: 239: Hoare triple {30356#false} assume !false; {30356#false} is VALID [2022-04-28 07:53:04,937 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:53:04,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:54:00,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:54:00,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442269753] [2022-04-28 07:54:00,289 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:54:00,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761968609] [2022-04-28 07:54:00,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761968609] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:54:00,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:54:00,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2022-04-28 07:54:00,290 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:54:00,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1785600815] [2022-04-28 07:54:00,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1785600815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:54:00,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:54:00,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 07:54:00,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234321592] [2022-04-28 07:54:00,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:54:00,291 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:54:00,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:54:00,291 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:54:00,966 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:54:00,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 07:54:00,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:54:00,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 07:54:00,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2064, Unknown=12, NotChecked=0, Total=2256 [2022-04-28 07:54:00,967 INFO L87 Difference]: Start difference. First operand 125 states and 154 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:54:48,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:54:48,490 INFO L93 Difference]: Finished difference Result 137 states and 166 transitions. [2022-04-28 07:54:48,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 07:54:48,490 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:54:48,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:54:48,490 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:54:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 158 transitions. [2022-04-28 07:54:48,493 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:54:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 158 transitions. [2022-04-28 07:54:48,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 158 transitions. [2022-04-28 07:54:49,405 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:54:49,407 INFO L225 Difference]: With dead ends: 137 [2022-04-28 07:54:49,407 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 07:54:49,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=201, Invalid=2337, Unknown=12, NotChecked=0, Total=2550 [2022-04-28 07:54:49,409 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 14 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 3982 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 3988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2022-04-28 07:54:49,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1792 Invalid, 3988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3982 Invalid, 0 Unknown, 0 Unchecked, 25.6s Time] [2022-04-28 07:54:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 07:54:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-28 07:54:49,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:54:49,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 37 states have call successors, (37), 8 states have call predecessors, (37), 6 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 07:54:49,584 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 37 states have call successors, (37), 8 states have call predecessors, (37), 6 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 07:54:49,584 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 37 states have call successors, (37), 8 states have call predecessors, (37), 6 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 07:54:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:54:49,586 INFO L93 Difference]: Finished difference Result 132 states and 161 transitions. [2022-04-28 07:54:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2022-04-28 07:54:49,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:54:49,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:54:49,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 37 states have call successors, (37), 8 states have call predecessors, (37), 6 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 132 states. [2022-04-28 07:54:49,587 INFO L87 Difference]: Start difference. First operand has 132 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 37 states have call successors, (37), 8 states have call predecessors, (37), 6 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 132 states. [2022-04-28 07:54:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:54:49,589 INFO L93 Difference]: Finished difference Result 132 states and 161 transitions. [2022-04-28 07:54:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2022-04-28 07:54:49,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:54:49,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:54:49,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:54:49,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:54:49,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 37 states have call successors, (37), 8 states have call predecessors, (37), 6 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 07:54:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2022-04-28 07:54:49,592 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 240 [2022-04-28 07:54:49,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:54:49,592 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2022-04-28 07:54:49,592 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:54:49,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 161 transitions. [2022-04-28 07:54:50,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:54:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2022-04-28 07:54:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-04-28 07:54:50,381 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:54:50,381 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:54:50,388 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:54:50,581 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:54:50,582 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:54:50,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:54:50,582 INFO L85 PathProgramCache]: Analyzing trace with hash 810222889, now seen corresponding path program 63 times [2022-04-28 07:54:50,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:54:50,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2101453582] [2022-04-28 07:54:50,707 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:50,708 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:54:50,708 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:54:50,708 INFO L85 PathProgramCache]: Analyzing trace with hash 810222889, now seen corresponding path program 64 times [2022-04-28 07:54:50,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:54:50,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004980502] [2022-04-28 07:54:50,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:54:50,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:54:50,723 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:54:50,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744349425] [2022-04-28 07:54:50,723 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:54:50,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:54:50,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:54:50,725 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:54:50,725 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:54:52,213 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:54:52,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:54:52,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 136 conjunts are in the unsatisfiable core [2022-04-28 07:54:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:54:52,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:54:53,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {31969#true} call ULTIMATE.init(); {31969#true} is VALID [2022-04-28 07:54:53,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {31969#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); {31969#true} is VALID [2022-04-28 07:54:53,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31969#true} {31969#true} #60#return; {31969#true} is VALID [2022-04-28 07:54:53,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {31969#true} call #t~ret5 := main(); {31969#true} is VALID [2022-04-28 07:54:53,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {31969#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; {31969#true} is VALID [2022-04-28 07:54:53,767 INFO L272 TraceCheckUtils]: 6: Hoare triple {31969#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {31969#true} is VALID [2022-04-28 07:54:53,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,767 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31969#true} {31969#true} #52#return; {31969#true} is VALID [2022-04-28 07:54:53,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {31969#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32007#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:54:53,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {32007#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {32007#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:54:53,768 INFO L272 TraceCheckUtils]: 13: Hoare triple {32007#(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)); {31969#true} is VALID [2022-04-28 07:54:53,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,769 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {31969#true} {32007#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {32007#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:54:53,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {32007#(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; {32029#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:54:53,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {32029#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {32029#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:54:53,769 INFO L272 TraceCheckUtils]: 20: Hoare triple {32029#(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)); {31969#true} is VALID [2022-04-28 07:54:53,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,770 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {31969#true} {32029#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {32029#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:54:53,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {32029#(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; {32051#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:54:53,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {32051#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {32051#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:54:53,771 INFO L272 TraceCheckUtils]: 27: Hoare triple {32051#(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)); {31969#true} is VALID [2022-04-28 07:54:53,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,771 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31969#true} {32051#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {32051#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:54:53,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {32051#(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; {32073#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:54:53,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {32073#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {32073#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:54:53,772 INFO L272 TraceCheckUtils]: 34: Hoare triple {32073#(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)); {31969#true} is VALID [2022-04-28 07:54:53,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,772 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {31969#true} {32073#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {32073#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:54:53,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {32073#(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; {32095#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:53,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {32095#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {32095#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:53,773 INFO L272 TraceCheckUtils]: 41: Hoare triple {32095#(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)); {31969#true} is VALID [2022-04-28 07:54:53,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,774 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {31969#true} {32095#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {32095#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:53,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {32095#(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; {32117#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:54:53,774 INFO L290 TraceCheckUtils]: 47: Hoare triple {32117#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {32117#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:54:53,774 INFO L272 TraceCheckUtils]: 48: Hoare triple {32117#(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)); {31969#true} is VALID [2022-04-28 07:54:53,774 INFO L290 TraceCheckUtils]: 49: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,775 INFO L290 TraceCheckUtils]: 50: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,775 INFO L290 TraceCheckUtils]: 51: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,775 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {31969#true} {32117#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {32117#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:54:53,775 INFO L290 TraceCheckUtils]: 53: Hoare triple {32117#(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; {32139#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:54:53,776 INFO L290 TraceCheckUtils]: 54: Hoare triple {32139#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {32139#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:54:53,776 INFO L272 TraceCheckUtils]: 55: Hoare triple {32139#(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)); {31969#true} is VALID [2022-04-28 07:54:53,776 INFO L290 TraceCheckUtils]: 56: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,776 INFO L290 TraceCheckUtils]: 57: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,776 INFO L290 TraceCheckUtils]: 58: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,776 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {31969#true} {32139#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {32139#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:54:53,776 INFO L290 TraceCheckUtils]: 60: Hoare triple {32139#(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; {32161#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:54:53,777 INFO L290 TraceCheckUtils]: 61: Hoare triple {32161#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {32161#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:54:53,777 INFO L272 TraceCheckUtils]: 62: Hoare triple {32161#(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)); {31969#true} is VALID [2022-04-28 07:54:53,777 INFO L290 TraceCheckUtils]: 63: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,777 INFO L290 TraceCheckUtils]: 64: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,777 INFO L290 TraceCheckUtils]: 65: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,777 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {31969#true} {32161#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {32161#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:54:53,778 INFO L290 TraceCheckUtils]: 67: Hoare triple {32161#(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; {32183#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:54:53,778 INFO L290 TraceCheckUtils]: 68: Hoare triple {32183#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {32183#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:54:53,778 INFO L272 TraceCheckUtils]: 69: Hoare triple {32183#(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)); {31969#true} is VALID [2022-04-28 07:54:53,778 INFO L290 TraceCheckUtils]: 70: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,778 INFO L290 TraceCheckUtils]: 71: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,778 INFO L290 TraceCheckUtils]: 72: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,779 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {31969#true} {32183#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {32183#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:54:53,779 INFO L290 TraceCheckUtils]: 74: Hoare triple {32183#(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; {32205#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:54:53,779 INFO L290 TraceCheckUtils]: 75: Hoare triple {32205#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {32205#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:54:53,779 INFO L272 TraceCheckUtils]: 76: Hoare triple {32205#(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)); {31969#true} is VALID [2022-04-28 07:54:53,779 INFO L290 TraceCheckUtils]: 77: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,779 INFO L290 TraceCheckUtils]: 78: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,779 INFO L290 TraceCheckUtils]: 79: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,780 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {31969#true} {32205#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #54#return; {32205#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:54:53,780 INFO L290 TraceCheckUtils]: 81: Hoare triple {32205#(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; {32227#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:54:53,780 INFO L290 TraceCheckUtils]: 82: Hoare triple {32227#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {32227#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:54:53,781 INFO L272 TraceCheckUtils]: 83: Hoare triple {32227#(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)); {31969#true} is VALID [2022-04-28 07:54:53,781 INFO L290 TraceCheckUtils]: 84: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,781 INFO L290 TraceCheckUtils]: 85: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,781 INFO L290 TraceCheckUtils]: 86: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,781 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31969#true} {32227#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {32227#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:54:53,781 INFO L290 TraceCheckUtils]: 88: Hoare triple {32227#(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; {32249#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:54:53,782 INFO L290 TraceCheckUtils]: 89: Hoare triple {32249#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {32249#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:54:53,782 INFO L272 TraceCheckUtils]: 90: Hoare triple {32249#(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)); {31969#true} is VALID [2022-04-28 07:54:53,782 INFO L290 TraceCheckUtils]: 91: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,782 INFO L290 TraceCheckUtils]: 92: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,782 INFO L290 TraceCheckUtils]: 93: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,782 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {31969#true} {32249#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #54#return; {32249#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:54:53,783 INFO L290 TraceCheckUtils]: 95: Hoare triple {32249#(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; {32271#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:54:53,783 INFO L290 TraceCheckUtils]: 96: Hoare triple {32271#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {32271#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:54:53,783 INFO L272 TraceCheckUtils]: 97: Hoare triple {32271#(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)); {31969#true} is VALID [2022-04-28 07:54:53,783 INFO L290 TraceCheckUtils]: 98: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,783 INFO L290 TraceCheckUtils]: 99: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,783 INFO L290 TraceCheckUtils]: 100: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,784 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {31969#true} {32271#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {32271#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:54:53,784 INFO L290 TraceCheckUtils]: 102: Hoare triple {32271#(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; {32293#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:53,784 INFO L290 TraceCheckUtils]: 103: Hoare triple {32293#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {32293#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:53,784 INFO L272 TraceCheckUtils]: 104: Hoare triple {32293#(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)); {31969#true} is VALID [2022-04-28 07:54:53,784 INFO L290 TraceCheckUtils]: 105: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,785 INFO L290 TraceCheckUtils]: 106: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,785 INFO L290 TraceCheckUtils]: 107: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,785 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {31969#true} {32293#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {32293#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:53,785 INFO L290 TraceCheckUtils]: 109: Hoare triple {32293#(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; {32315#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:54:53,786 INFO L290 TraceCheckUtils]: 110: Hoare triple {32315#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} assume !false; {32315#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:54:53,786 INFO L272 TraceCheckUtils]: 111: Hoare triple {32315#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 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)); {31969#true} is VALID [2022-04-28 07:54:53,786 INFO L290 TraceCheckUtils]: 112: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,786 INFO L290 TraceCheckUtils]: 113: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,786 INFO L290 TraceCheckUtils]: 114: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,786 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {31969#true} {32315#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} #54#return; {32315#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:54:53,787 INFO L290 TraceCheckUtils]: 116: Hoare triple {32315#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 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; {32337#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:54:53,787 INFO L290 TraceCheckUtils]: 117: Hoare triple {32337#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {32337#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:54:53,787 INFO L272 TraceCheckUtils]: 118: Hoare triple {32337#(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)); {31969#true} is VALID [2022-04-28 07:54:53,787 INFO L290 TraceCheckUtils]: 119: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,787 INFO L290 TraceCheckUtils]: 120: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,787 INFO L290 TraceCheckUtils]: 121: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,788 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {31969#true} {32337#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {32337#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:54:53,788 INFO L290 TraceCheckUtils]: 123: Hoare triple {32337#(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; {32359#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 07:54:53,788 INFO L290 TraceCheckUtils]: 124: Hoare triple {32359#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !false; {32359#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 07:54:53,788 INFO L272 TraceCheckUtils]: 125: Hoare triple {32359#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31969#true} is VALID [2022-04-28 07:54:53,788 INFO L290 TraceCheckUtils]: 126: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,789 INFO L290 TraceCheckUtils]: 127: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,789 INFO L290 TraceCheckUtils]: 128: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,789 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {31969#true} {32359#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} #54#return; {32359#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 07:54:53,789 INFO L290 TraceCheckUtils]: 130: Hoare triple {32359#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32381#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-28 07:54:53,790 INFO L290 TraceCheckUtils]: 131: Hoare triple {32381#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} assume !false; {32381#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-28 07:54:53,790 INFO L272 TraceCheckUtils]: 132: Hoare triple {32381#(and (= 15 (+ (- 2) main_~c~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)); {31969#true} is VALID [2022-04-28 07:54:53,790 INFO L290 TraceCheckUtils]: 133: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,790 INFO L290 TraceCheckUtils]: 134: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,790 INFO L290 TraceCheckUtils]: 135: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,790 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {31969#true} {32381#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} #54#return; {32381#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-28 07:54:53,791 INFO L290 TraceCheckUtils]: 137: Hoare triple {32381#(and (= 15 (+ (- 2) main_~c~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; {32403#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:54:53,791 INFO L290 TraceCheckUtils]: 138: Hoare triple {32403#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {32403#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:54:53,791 INFO L272 TraceCheckUtils]: 139: Hoare triple {32403#(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)); {31969#true} is VALID [2022-04-28 07:54:53,791 INFO L290 TraceCheckUtils]: 140: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,791 INFO L290 TraceCheckUtils]: 141: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,791 INFO L290 TraceCheckUtils]: 142: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,791 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {31969#true} {32403#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #54#return; {32403#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:54:53,792 INFO L290 TraceCheckUtils]: 144: Hoare triple {32403#(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; {32425#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-28 07:54:53,792 INFO L290 TraceCheckUtils]: 145: Hoare triple {32425#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !false; {32425#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-28 07:54:53,792 INFO L272 TraceCheckUtils]: 146: Hoare triple {32425#(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)); {31969#true} is VALID [2022-04-28 07:54:53,792 INFO L290 TraceCheckUtils]: 147: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,792 INFO L290 TraceCheckUtils]: 148: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,792 INFO L290 TraceCheckUtils]: 149: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,793 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {31969#true} {32425#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} #54#return; {32425#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-28 07:54:53,793 INFO L290 TraceCheckUtils]: 151: Hoare triple {32425#(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; {32447#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17))} is VALID [2022-04-28 07:54:53,793 INFO L290 TraceCheckUtils]: 152: Hoare triple {32447#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17))} assume !false; {32447#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17))} is VALID [2022-04-28 07:54:53,794 INFO L272 TraceCheckUtils]: 153: Hoare triple {32447#(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)); {31969#true} is VALID [2022-04-28 07:54:53,794 INFO L290 TraceCheckUtils]: 154: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,794 INFO L290 TraceCheckUtils]: 155: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,794 INFO L290 TraceCheckUtils]: 156: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,794 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {31969#true} {32447#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17))} #54#return; {32447#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17))} is VALID [2022-04-28 07:54:53,794 INFO L290 TraceCheckUtils]: 158: Hoare triple {32447#(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; {32469#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} is VALID [2022-04-28 07:54:53,795 INFO L290 TraceCheckUtils]: 159: Hoare triple {32469#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} assume !false; {32469#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} is VALID [2022-04-28 07:54:53,795 INFO L272 TraceCheckUtils]: 160: Hoare triple {32469#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31969#true} is VALID [2022-04-28 07:54:53,795 INFO L290 TraceCheckUtils]: 161: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,795 INFO L290 TraceCheckUtils]: 162: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,795 INFO L290 TraceCheckUtils]: 163: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,795 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {31969#true} {32469#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} #54#return; {32469#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} is VALID [2022-04-28 07:54:53,796 INFO L290 TraceCheckUtils]: 165: Hoare triple {32469#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32491#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-28 07:54:53,796 INFO L290 TraceCheckUtils]: 166: Hoare triple {32491#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {32491#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-28 07:54:53,796 INFO L272 TraceCheckUtils]: 167: Hoare triple {32491#(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)); {31969#true} is VALID [2022-04-28 07:54:53,796 INFO L290 TraceCheckUtils]: 168: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,796 INFO L290 TraceCheckUtils]: 169: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,796 INFO L290 TraceCheckUtils]: 170: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,797 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {31969#true} {32491#(and (= main_~y~0 22) (= main_~c~0 22))} #54#return; {32491#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-28 07:54:53,797 INFO L290 TraceCheckUtils]: 172: Hoare triple {32491#(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; {32513#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:53,797 INFO L290 TraceCheckUtils]: 173: Hoare triple {32513#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} assume !false; {32513#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:53,798 INFO L272 TraceCheckUtils]: 174: Hoare triple {32513#(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)); {31969#true} is VALID [2022-04-28 07:54:53,798 INFO L290 TraceCheckUtils]: 175: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,798 INFO L290 TraceCheckUtils]: 176: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,798 INFO L290 TraceCheckUtils]: 177: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,798 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {31969#true} {32513#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} #54#return; {32513#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:53,798 INFO L290 TraceCheckUtils]: 179: Hoare triple {32513#(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; {32535#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:54:53,799 INFO L290 TraceCheckUtils]: 180: Hoare triple {32535#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} assume !false; {32535#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:54:53,799 INFO L272 TraceCheckUtils]: 181: Hoare triple {32535#(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)); {31969#true} is VALID [2022-04-28 07:54:53,799 INFO L290 TraceCheckUtils]: 182: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,799 INFO L290 TraceCheckUtils]: 183: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,799 INFO L290 TraceCheckUtils]: 184: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,799 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {31969#true} {32535#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} #54#return; {32535#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:54:53,800 INFO L290 TraceCheckUtils]: 186: Hoare triple {32535#(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; {32557#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-28 07:54:53,800 INFO L290 TraceCheckUtils]: 187: Hoare triple {32557#(and (= main_~y~0 25) (= main_~c~0 25))} assume !false; {32557#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-28 07:54:53,800 INFO L272 TraceCheckUtils]: 188: Hoare triple {32557#(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)); {31969#true} is VALID [2022-04-28 07:54:53,800 INFO L290 TraceCheckUtils]: 189: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,800 INFO L290 TraceCheckUtils]: 190: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,800 INFO L290 TraceCheckUtils]: 191: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,801 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {31969#true} {32557#(and (= main_~y~0 25) (= main_~c~0 25))} #54#return; {32557#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-28 07:54:53,801 INFO L290 TraceCheckUtils]: 193: Hoare triple {32557#(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; {32579#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:54:53,801 INFO L290 TraceCheckUtils]: 194: Hoare triple {32579#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} assume !false; {32579#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:54:53,801 INFO L272 TraceCheckUtils]: 195: Hoare triple {32579#(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)); {31969#true} is VALID [2022-04-28 07:54:53,801 INFO L290 TraceCheckUtils]: 196: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,801 INFO L290 TraceCheckUtils]: 197: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,801 INFO L290 TraceCheckUtils]: 198: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,802 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {31969#true} {32579#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} #54#return; {32579#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-28 07:54:53,802 INFO L290 TraceCheckUtils]: 200: Hoare triple {32579#(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; {32601#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-28 07:54:53,802 INFO L290 TraceCheckUtils]: 201: Hoare triple {32601#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} assume !false; {32601#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-28 07:54:53,803 INFO L272 TraceCheckUtils]: 202: Hoare triple {32601#(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)); {31969#true} is VALID [2022-04-28 07:54:53,803 INFO L290 TraceCheckUtils]: 203: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,803 INFO L290 TraceCheckUtils]: 204: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,803 INFO L290 TraceCheckUtils]: 205: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,803 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {31969#true} {32601#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} #54#return; {32601#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-28 07:54:53,803 INFO L290 TraceCheckUtils]: 207: Hoare triple {32601#(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; {32623#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-28 07:54:53,804 INFO L290 TraceCheckUtils]: 208: Hoare triple {32623#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} assume !false; {32623#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-28 07:54:53,804 INFO L272 TraceCheckUtils]: 209: Hoare triple {32623#(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)); {31969#true} is VALID [2022-04-28 07:54:53,804 INFO L290 TraceCheckUtils]: 210: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,804 INFO L290 TraceCheckUtils]: 211: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,804 INFO L290 TraceCheckUtils]: 212: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,804 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {31969#true} {32623#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} #54#return; {32623#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-28 07:54:53,805 INFO L290 TraceCheckUtils]: 214: Hoare triple {32623#(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; {32645#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:54:53,805 INFO L290 TraceCheckUtils]: 215: Hoare triple {32645#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} assume !false; {32645#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:54:53,805 INFO L272 TraceCheckUtils]: 216: Hoare triple {32645#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31969#true} is VALID [2022-04-28 07:54:53,805 INFO L290 TraceCheckUtils]: 217: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,805 INFO L290 TraceCheckUtils]: 218: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,805 INFO L290 TraceCheckUtils]: 219: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,806 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {31969#true} {32645#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} #54#return; {32645#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:54:53,806 INFO L290 TraceCheckUtils]: 221: Hoare triple {32645#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32667#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:53,807 INFO L290 TraceCheckUtils]: 222: Hoare triple {32667#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} assume !false; {32667#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:53,807 INFO L272 TraceCheckUtils]: 223: Hoare triple {32667#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31969#true} is VALID [2022-04-28 07:54:53,807 INFO L290 TraceCheckUtils]: 224: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,807 INFO L290 TraceCheckUtils]: 225: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,807 INFO L290 TraceCheckUtils]: 226: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,807 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {31969#true} {32667#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} #54#return; {32667#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:54:53,808 INFO L290 TraceCheckUtils]: 228: Hoare triple {32667#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32689#(and (= main_~y~0 31) (= (+ main_~c~0 (- 4)) 27))} is VALID [2022-04-28 07:54:53,808 INFO L290 TraceCheckUtils]: 229: Hoare triple {32689#(and (= main_~y~0 31) (= (+ main_~c~0 (- 4)) 27))} assume !false; {32689#(and (= main_~y~0 31) (= (+ main_~c~0 (- 4)) 27))} is VALID [2022-04-28 07:54:53,808 INFO L272 TraceCheckUtils]: 230: Hoare triple {32689#(and (= main_~y~0 31) (= (+ main_~c~0 (- 4)) 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)); {31969#true} is VALID [2022-04-28 07:54:53,808 INFO L290 TraceCheckUtils]: 231: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,808 INFO L290 TraceCheckUtils]: 232: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,808 INFO L290 TraceCheckUtils]: 233: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,809 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {31969#true} {32689#(and (= main_~y~0 31) (= (+ main_~c~0 (- 4)) 27))} #54#return; {32689#(and (= main_~y~0 31) (= (+ main_~c~0 (- 4)) 27))} is VALID [2022-04-28 07:54:53,809 INFO L290 TraceCheckUtils]: 235: Hoare triple {32689#(and (= main_~y~0 31) (= (+ main_~c~0 (- 4)) 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; {32711#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-28 07:54:53,809 INFO L290 TraceCheckUtils]: 236: Hoare triple {32711#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} assume !false; {32711#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-28 07:54:53,809 INFO L272 TraceCheckUtils]: 237: Hoare triple {32711#(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)); {31969#true} is VALID [2022-04-28 07:54:53,810 INFO L290 TraceCheckUtils]: 238: Hoare triple {31969#true} ~cond := #in~cond; {31969#true} is VALID [2022-04-28 07:54:53,810 INFO L290 TraceCheckUtils]: 239: Hoare triple {31969#true} assume !(0 == ~cond); {31969#true} is VALID [2022-04-28 07:54:53,810 INFO L290 TraceCheckUtils]: 240: Hoare triple {31969#true} assume true; {31969#true} is VALID [2022-04-28 07:54:53,810 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {31969#true} {32711#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} #54#return; {32711#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-28 07:54:53,815 INFO L290 TraceCheckUtils]: 242: Hoare triple {32711#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} assume !(~c~0 < ~k~0); {32733#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~k~0 32))} is VALID [2022-04-28 07:54:53,815 INFO L272 TraceCheckUtils]: 243: Hoare triple {32733#(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)); {32737#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:54:53,816 INFO L290 TraceCheckUtils]: 244: Hoare triple {32737#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32741#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:54:53,816 INFO L290 TraceCheckUtils]: 245: Hoare triple {32741#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31970#false} is VALID [2022-04-28 07:54:53,816 INFO L290 TraceCheckUtils]: 246: Hoare triple {31970#false} assume !false; {31970#false} is VALID [2022-04-28 07:54:53,817 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:54:53,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:54:54,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:54:54,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004980502] [2022-04-28 07:54:54,283 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:54:54,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744349425] [2022-04-28 07:54:54,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744349425] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:54:54,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:54:54,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2022-04-28 07:54:54,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:54:54,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2101453582] [2022-04-28 07:54:54,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2101453582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:54:54,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:54:54,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 07:54:54,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088739938] [2022-04-28 07:54:54,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:54:54,285 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:54:54,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:54:54,285 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:54:55,231 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:54:55,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 07:54:55,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:54:55,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 07:54:55,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 07:54:55,232 INFO L87 Difference]: Start difference. First operand 132 states and 161 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:55:48,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:55:48,364 INFO L93 Difference]: Finished difference Result 140 states and 170 transitions. [2022-04-28 07:55:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 07:55:48,365 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:55:48,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:55:48,365 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:55:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 160 transitions. [2022-04-28 07:55:48,367 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:55:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 160 transitions. [2022-04-28 07:55:48,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 160 transitions. [2022-04-28 07:55:49,426 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:55:49,428 INFO L225 Difference]: With dead ends: 140 [2022-04-28 07:55:49,428 INFO L226 Difference]: Without dead ends: 135 [2022-04-28 07:55:49,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=127, Invalid=1679, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 07:55:49,429 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 3647 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.7s 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, 28.7s IncrementalHoareTripleChecker+Time [2022-04-28 07:55:49,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1913 Invalid, 3647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3647 Invalid, 0 Unknown, 0 Unchecked, 28.7s Time] [2022-04-28 07:55:49,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-28 07:55:49,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-04-28 07:55:49,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:55:49,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 135 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 38 states have call successors, (38), 8 states have call predecessors, (38), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-28 07:55:49,597 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 135 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 38 states have call successors, (38), 8 states have call predecessors, (38), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-28 07:55:49,597 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 135 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 38 states have call successors, (38), 8 states have call predecessors, (38), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-28 07:55:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:55:49,599 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2022-04-28 07:55:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 165 transitions. [2022-04-28 07:55:49,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:55:49,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:55:49,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 38 states have call successors, (38), 8 states have call predecessors, (38), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 135 states. [2022-04-28 07:55:49,600 INFO L87 Difference]: Start difference. First operand has 135 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 38 states have call successors, (38), 8 states have call predecessors, (38), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 135 states. [2022-04-28 07:55:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:55:49,602 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2022-04-28 07:55:49,602 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 165 transitions. [2022-04-28 07:55:49,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:55:49,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:55:49,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:55:49,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:55:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 38 states have call successors, (38), 8 states have call predecessors, (38), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-28 07:55:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 165 transitions. [2022-04-28 07:55:49,605 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 165 transitions. Word has length 247 [2022-04-28 07:55:49,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:55:49,605 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 165 transitions. [2022-04-28 07:55:49,605 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:55:49,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 165 transitions. [2022-04-28 07:55:50,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:55:50,736 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 165 transitions. [2022-04-28 07:55:50,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-04-28 07:55:50,737 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:55:50,737 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:55:50,744 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:55:50,938 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:55:50,938 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:55:50,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:55:50,938 INFO L85 PathProgramCache]: Analyzing trace with hash -596558904, now seen corresponding path program 65 times [2022-04-28 07:55:50,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:55:50,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1803065876] [2022-04-28 07:55:51,014 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:51,015 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:55:51,015 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:55:51,015 INFO L85 PathProgramCache]: Analyzing trace with hash -596558904, now seen corresponding path program 66 times [2022-04-28 07:55:51,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:55:51,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782424802] [2022-04-28 07:55:51,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:55:51,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:55:51,055 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:55:51,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [25579250] [2022-04-28 07:55:51,056 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:55:51,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:55:51,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:55:51,057 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:55:51,074 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:56:24,524 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2022-04-28 07:56:24,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:56:24,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 140 conjunts are in the unsatisfiable core [2022-04-28 07:56:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:24,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:56:26,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {33613#true} call ULTIMATE.init(); {33613#true} is VALID [2022-04-28 07:56:26,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {33613#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); {33613#true} is VALID [2022-04-28 07:56:26,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33613#true} {33613#true} #60#return; {33613#true} is VALID [2022-04-28 07:56:26,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {33613#true} call #t~ret5 := main(); {33613#true} is VALID [2022-04-28 07:56:26,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {33613#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; {33613#true} is VALID [2022-04-28 07:56:26,057 INFO L272 TraceCheckUtils]: 6: Hoare triple {33613#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {33613#true} is VALID [2022-04-28 07:56:26,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,058 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33613#true} {33613#true} #52#return; {33613#true} is VALID [2022-04-28 07:56:26,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {33613#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33651#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:56:26,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {33651#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {33651#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:56:26,058 INFO L272 TraceCheckUtils]: 13: Hoare triple {33651#(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)); {33613#true} is VALID [2022-04-28 07:56:26,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,059 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {33613#true} {33651#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {33651#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:56:26,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {33651#(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; {33673#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:56:26,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {33673#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {33673#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:56:26,060 INFO L272 TraceCheckUtils]: 20: Hoare triple {33673#(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)); {33613#true} is VALID [2022-04-28 07:56:26,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,060 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {33613#true} {33673#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {33673#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:56:26,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {33673#(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; {33695#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:56:26,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {33695#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {33695#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:56:26,061 INFO L272 TraceCheckUtils]: 27: Hoare triple {33695#(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)); {33613#true} is VALID [2022-04-28 07:56:26,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,062 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {33613#true} {33695#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {33695#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:56:26,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {33695#(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; {33717#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 07:56:26,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {33717#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} assume !false; {33717#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 07:56:26,063 INFO L272 TraceCheckUtils]: 34: Hoare triple {33717#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33613#true} is VALID [2022-04-28 07:56:26,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,063 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {33613#true} {33717#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} #54#return; {33717#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 07:56:26,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {33717#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33739#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:56:26,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {33739#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {33739#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:56:26,064 INFO L272 TraceCheckUtils]: 41: Hoare triple {33739#(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)); {33613#true} is VALID [2022-04-28 07:56:26,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,064 INFO L290 TraceCheckUtils]: 43: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,064 INFO L290 TraceCheckUtils]: 44: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,065 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {33613#true} {33739#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {33739#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:56:26,065 INFO L290 TraceCheckUtils]: 46: Hoare triple {33739#(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; {33761#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:56:26,065 INFO L290 TraceCheckUtils]: 47: Hoare triple {33761#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {33761#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:56:26,065 INFO L272 TraceCheckUtils]: 48: Hoare triple {33761#(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)); {33613#true} is VALID [2022-04-28 07:56:26,066 INFO L290 TraceCheckUtils]: 49: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,066 INFO L290 TraceCheckUtils]: 51: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,066 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {33613#true} {33761#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {33761#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:56:26,066 INFO L290 TraceCheckUtils]: 53: Hoare triple {33761#(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; {33783#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:56:26,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {33783#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} assume !false; {33783#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:56:26,067 INFO L272 TraceCheckUtils]: 55: Hoare triple {33783#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33613#true} is VALID [2022-04-28 07:56:26,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,067 INFO L290 TraceCheckUtils]: 57: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,067 INFO L290 TraceCheckUtils]: 58: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,068 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {33613#true} {33783#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} #54#return; {33783#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:56:26,068 INFO L290 TraceCheckUtils]: 60: Hoare triple {33783#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33805#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 07:56:26,068 INFO L290 TraceCheckUtils]: 61: Hoare triple {33805#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 3)) 4))} assume !false; {33805#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 07:56:26,068 INFO L272 TraceCheckUtils]: 62: Hoare triple {33805#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~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)); {33613#true} is VALID [2022-04-28 07:56:26,068 INFO L290 TraceCheckUtils]: 63: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,068 INFO L290 TraceCheckUtils]: 64: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,069 INFO L290 TraceCheckUtils]: 65: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,069 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {33613#true} {33805#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 3)) 4))} #54#return; {33805#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 07:56:26,069 INFO L290 TraceCheckUtils]: 67: Hoare triple {33805#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~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; {33827#(and (= 6 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 4))} is VALID [2022-04-28 07:56:26,070 INFO L290 TraceCheckUtils]: 68: Hoare triple {33827#(and (= 6 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 4))} assume !false; {33827#(and (= 6 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 4))} is VALID [2022-04-28 07:56:26,070 INFO L272 TraceCheckUtils]: 69: Hoare triple {33827#(and (= 6 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 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)); {33613#true} is VALID [2022-04-28 07:56:26,070 INFO L290 TraceCheckUtils]: 70: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,070 INFO L290 TraceCheckUtils]: 71: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,070 INFO L290 TraceCheckUtils]: 72: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,070 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {33613#true} {33827#(and (= 6 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 4))} #54#return; {33827#(and (= 6 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 4))} is VALID [2022-04-28 07:56:26,071 INFO L290 TraceCheckUtils]: 74: Hoare triple {33827#(and (= 6 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 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; {33849#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9))} is VALID [2022-04-28 07:56:26,071 INFO L290 TraceCheckUtils]: 75: Hoare triple {33849#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9))} assume !false; {33849#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9))} is VALID [2022-04-28 07:56:26,071 INFO L272 TraceCheckUtils]: 76: Hoare triple {33849#(and (= (+ main_~y~0 (- 5)) 4) (= 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)); {33613#true} is VALID [2022-04-28 07:56:26,071 INFO L290 TraceCheckUtils]: 77: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,071 INFO L290 TraceCheckUtils]: 78: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,071 INFO L290 TraceCheckUtils]: 79: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,072 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {33613#true} {33849#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9))} #54#return; {33849#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9))} is VALID [2022-04-28 07:56:26,072 INFO L290 TraceCheckUtils]: 81: Hoare triple {33849#(and (= (+ main_~y~0 (- 5)) 4) (= 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; {33871#(and (= (+ main_~y~0 (- 6)) 4) (= main_~c~0 10))} is VALID [2022-04-28 07:56:26,073 INFO L290 TraceCheckUtils]: 82: Hoare triple {33871#(and (= (+ main_~y~0 (- 6)) 4) (= main_~c~0 10))} assume !false; {33871#(and (= (+ main_~y~0 (- 6)) 4) (= main_~c~0 10))} is VALID [2022-04-28 07:56:26,073 INFO L272 TraceCheckUtils]: 83: Hoare triple {33871#(and (= (+ main_~y~0 (- 6)) 4) (= 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)); {33613#true} is VALID [2022-04-28 07:56:26,073 INFO L290 TraceCheckUtils]: 84: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,073 INFO L290 TraceCheckUtils]: 85: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,073 INFO L290 TraceCheckUtils]: 86: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,073 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {33613#true} {33871#(and (= (+ main_~y~0 (- 6)) 4) (= main_~c~0 10))} #54#return; {33871#(and (= (+ main_~y~0 (- 6)) 4) (= main_~c~0 10))} is VALID [2022-04-28 07:56:26,074 INFO L290 TraceCheckUtils]: 88: Hoare triple {33871#(and (= (+ main_~y~0 (- 6)) 4) (= 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; {33893#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 7)) 4))} is VALID [2022-04-28 07:56:26,074 INFO L290 TraceCheckUtils]: 89: Hoare triple {33893#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 7)) 4))} assume !false; {33893#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 7)) 4))} is VALID [2022-04-28 07:56:26,074 INFO L272 TraceCheckUtils]: 90: Hoare triple {33893#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 7)) 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)); {33613#true} is VALID [2022-04-28 07:56:26,074 INFO L290 TraceCheckUtils]: 91: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,074 INFO L290 TraceCheckUtils]: 92: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,074 INFO L290 TraceCheckUtils]: 93: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,075 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {33613#true} {33893#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 7)) 4))} #54#return; {33893#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 7)) 4))} is VALID [2022-04-28 07:56:26,075 INFO L290 TraceCheckUtils]: 95: Hoare triple {33893#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 7)) 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; {33915#(and (= 4 (+ main_~y~0 (- 8))) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:56:26,075 INFO L290 TraceCheckUtils]: 96: Hoare triple {33915#(and (= 4 (+ main_~y~0 (- 8))) (= 10 (+ (- 2) main_~c~0)))} assume !false; {33915#(and (= 4 (+ main_~y~0 (- 8))) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:56:26,076 INFO L272 TraceCheckUtils]: 97: Hoare triple {33915#(and (= 4 (+ main_~y~0 (- 8))) (= 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)); {33613#true} is VALID [2022-04-28 07:56:26,076 INFO L290 TraceCheckUtils]: 98: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,076 INFO L290 TraceCheckUtils]: 99: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,076 INFO L290 TraceCheckUtils]: 100: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,076 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {33613#true} {33915#(and (= 4 (+ main_~y~0 (- 8))) (= 10 (+ (- 2) main_~c~0)))} #54#return; {33915#(and (= 4 (+ main_~y~0 (- 8))) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:56:26,077 INFO L290 TraceCheckUtils]: 102: Hoare triple {33915#(and (= 4 (+ main_~y~0 (- 8))) (= 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; {33937#(and (= (+ (- 9) main_~y~0) 4) (= main_~c~0 13))} is VALID [2022-04-28 07:56:26,077 INFO L290 TraceCheckUtils]: 103: Hoare triple {33937#(and (= (+ (- 9) main_~y~0) 4) (= main_~c~0 13))} assume !false; {33937#(and (= (+ (- 9) main_~y~0) 4) (= main_~c~0 13))} is VALID [2022-04-28 07:56:26,077 INFO L272 TraceCheckUtils]: 104: Hoare triple {33937#(and (= (+ (- 9) main_~y~0) 4) (= 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)); {33613#true} is VALID [2022-04-28 07:56:26,077 INFO L290 TraceCheckUtils]: 105: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,077 INFO L290 TraceCheckUtils]: 106: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,077 INFO L290 TraceCheckUtils]: 107: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,078 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {33613#true} {33937#(and (= (+ (- 9) main_~y~0) 4) (= main_~c~0 13))} #54#return; {33937#(and (= (+ (- 9) main_~y~0) 4) (= main_~c~0 13))} is VALID [2022-04-28 07:56:26,078 INFO L290 TraceCheckUtils]: 109: Hoare triple {33937#(and (= (+ (- 9) main_~y~0) 4) (= 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; {33959#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:56:26,078 INFO L290 TraceCheckUtils]: 110: Hoare triple {33959#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {33959#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:56:26,078 INFO L272 TraceCheckUtils]: 111: Hoare triple {33959#(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)); {33613#true} is VALID [2022-04-28 07:56:26,078 INFO L290 TraceCheckUtils]: 112: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,078 INFO L290 TraceCheckUtils]: 113: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,079 INFO L290 TraceCheckUtils]: 114: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,079 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {33613#true} {33959#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {33959#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:56:26,079 INFO L290 TraceCheckUtils]: 116: Hoare triple {33959#(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; {33981#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:56:26,080 INFO L290 TraceCheckUtils]: 117: Hoare triple {33981#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {33981#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:56:26,080 INFO L272 TraceCheckUtils]: 118: Hoare triple {33981#(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)); {33613#true} is VALID [2022-04-28 07:56:26,080 INFO L290 TraceCheckUtils]: 119: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,080 INFO L290 TraceCheckUtils]: 120: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,080 INFO L290 TraceCheckUtils]: 121: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,080 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {33613#true} {33981#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {33981#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 07:56:26,081 INFO L290 TraceCheckUtils]: 123: Hoare triple {33981#(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; {34003#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:56:26,081 INFO L290 TraceCheckUtils]: 124: Hoare triple {34003#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {34003#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:56:26,081 INFO L272 TraceCheckUtils]: 125: Hoare triple {34003#(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)); {33613#true} is VALID [2022-04-28 07:56:26,081 INFO L290 TraceCheckUtils]: 126: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,081 INFO L290 TraceCheckUtils]: 127: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,081 INFO L290 TraceCheckUtils]: 128: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,082 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {33613#true} {34003#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #54#return; {34003#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:56:26,082 INFO L290 TraceCheckUtils]: 130: Hoare triple {34003#(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; {34025#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:56:26,082 INFO L290 TraceCheckUtils]: 131: Hoare triple {34025#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {34025#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:56:26,083 INFO L272 TraceCheckUtils]: 132: Hoare triple {34025#(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)); {33613#true} is VALID [2022-04-28 07:56:26,083 INFO L290 TraceCheckUtils]: 133: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,083 INFO L290 TraceCheckUtils]: 134: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,083 INFO L290 TraceCheckUtils]: 135: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,083 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {33613#true} {34025#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {34025#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-28 07:56:26,084 INFO L290 TraceCheckUtils]: 137: Hoare triple {34025#(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; {34047#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:56:26,084 INFO L290 TraceCheckUtils]: 138: Hoare triple {34047#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {34047#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:56:26,084 INFO L272 TraceCheckUtils]: 139: Hoare triple {34047#(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)); {33613#true} is VALID [2022-04-28 07:56:26,084 INFO L290 TraceCheckUtils]: 140: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,084 INFO L290 TraceCheckUtils]: 141: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,084 INFO L290 TraceCheckUtils]: 142: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,085 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {33613#true} {34047#(and (= main_~c~0 18) (= main_~y~0 18))} #54#return; {34047#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:56:26,085 INFO L290 TraceCheckUtils]: 144: Hoare triple {34047#(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; {34069#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:56:26,085 INFO L290 TraceCheckUtils]: 145: Hoare triple {34069#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {34069#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:56:26,085 INFO L272 TraceCheckUtils]: 146: Hoare triple {34069#(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)); {33613#true} is VALID [2022-04-28 07:56:26,085 INFO L290 TraceCheckUtils]: 147: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,086 INFO L290 TraceCheckUtils]: 148: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,086 INFO L290 TraceCheckUtils]: 149: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,086 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {33613#true} {34069#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {34069#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-28 07:56:26,086 INFO L290 TraceCheckUtils]: 151: Hoare triple {34069#(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; {34091#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-28 07:56:26,087 INFO L290 TraceCheckUtils]: 152: Hoare triple {34091#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} assume !false; {34091#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-28 07:56:26,087 INFO L272 TraceCheckUtils]: 153: Hoare triple {34091#(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)); {33613#true} is VALID [2022-04-28 07:56:26,087 INFO L290 TraceCheckUtils]: 154: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,087 INFO L290 TraceCheckUtils]: 155: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,087 INFO L290 TraceCheckUtils]: 156: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,087 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {33613#true} {34091#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} #54#return; {34091#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-28 07:56:26,088 INFO L290 TraceCheckUtils]: 158: Hoare triple {34091#(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; {34113#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:56:26,088 INFO L290 TraceCheckUtils]: 159: Hoare triple {34113#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !false; {34113#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:56:26,088 INFO L272 TraceCheckUtils]: 160: Hoare triple {34113#(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)); {33613#true} is VALID [2022-04-28 07:56:26,088 INFO L290 TraceCheckUtils]: 161: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,088 INFO L290 TraceCheckUtils]: 162: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,088 INFO L290 TraceCheckUtils]: 163: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,089 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {33613#true} {34113#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} #54#return; {34113#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-28 07:56:26,089 INFO L290 TraceCheckUtils]: 165: Hoare triple {34113#(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; {34135#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-28 07:56:26,090 INFO L290 TraceCheckUtils]: 166: Hoare triple {34135#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} assume !false; {34135#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-28 07:56:26,090 INFO L272 TraceCheckUtils]: 167: Hoare triple {34135#(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)); {33613#true} is VALID [2022-04-28 07:56:26,090 INFO L290 TraceCheckUtils]: 168: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,090 INFO L290 TraceCheckUtils]: 169: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,090 INFO L290 TraceCheckUtils]: 170: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,090 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {33613#true} {34135#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} #54#return; {34135#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-28 07:56:26,091 INFO L290 TraceCheckUtils]: 172: Hoare triple {34135#(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; {34157#(and (= 19 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 22))} is VALID [2022-04-28 07:56:26,091 INFO L290 TraceCheckUtils]: 173: Hoare triple {34157#(and (= 19 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 22))} assume !false; {34157#(and (= 19 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 22))} is VALID [2022-04-28 07:56:26,091 INFO L272 TraceCheckUtils]: 174: Hoare triple {34157#(and (= 19 (+ main_~y~0 (- 4))) (= (+ (- 1) 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)); {33613#true} is VALID [2022-04-28 07:56:26,091 INFO L290 TraceCheckUtils]: 175: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,091 INFO L290 TraceCheckUtils]: 176: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,091 INFO L290 TraceCheckUtils]: 177: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,092 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {33613#true} {34157#(and (= 19 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 22))} #54#return; {34157#(and (= 19 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 22))} is VALID [2022-04-28 07:56:26,092 INFO L290 TraceCheckUtils]: 179: Hoare triple {34157#(and (= 19 (+ main_~y~0 (- 4))) (= (+ (- 1) 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; {34179#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-28 07:56:26,093 INFO L290 TraceCheckUtils]: 180: Hoare triple {34179#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {34179#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-28 07:56:26,093 INFO L272 TraceCheckUtils]: 181: Hoare triple {34179#(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)); {33613#true} is VALID [2022-04-28 07:56:26,093 INFO L290 TraceCheckUtils]: 182: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,093 INFO L290 TraceCheckUtils]: 183: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,093 INFO L290 TraceCheckUtils]: 184: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,093 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {33613#true} {34179#(and (= main_~c~0 24) (= main_~y~0 24))} #54#return; {34179#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-28 07:56:26,094 INFO L290 TraceCheckUtils]: 186: Hoare triple {34179#(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; {34201#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-28 07:56:26,094 INFO L290 TraceCheckUtils]: 187: Hoare triple {34201#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !false; {34201#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-28 07:56:26,094 INFO L272 TraceCheckUtils]: 188: Hoare triple {34201#(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)); {33613#true} is VALID [2022-04-28 07:56:26,094 INFO L290 TraceCheckUtils]: 189: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,094 INFO L290 TraceCheckUtils]: 190: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,094 INFO L290 TraceCheckUtils]: 191: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,095 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {33613#true} {34201#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} #54#return; {34201#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-28 07:56:26,095 INFO L290 TraceCheckUtils]: 193: Hoare triple {34201#(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; {34223#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} is VALID [2022-04-28 07:56:26,096 INFO L290 TraceCheckUtils]: 194: Hoare triple {34223#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} assume !false; {34223#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} is VALID [2022-04-28 07:56:26,096 INFO L272 TraceCheckUtils]: 195: Hoare triple {34223#(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)); {33613#true} is VALID [2022-04-28 07:56:26,096 INFO L290 TraceCheckUtils]: 196: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,096 INFO L290 TraceCheckUtils]: 197: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,096 INFO L290 TraceCheckUtils]: 198: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,096 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {33613#true} {34223#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} #54#return; {34223#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} is VALID [2022-04-28 07:56:26,097 INFO L290 TraceCheckUtils]: 200: Hoare triple {34223#(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; {34245#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:56:26,097 INFO L290 TraceCheckUtils]: 201: Hoare triple {34245#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {34245#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:56:26,097 INFO L272 TraceCheckUtils]: 202: Hoare triple {34245#(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)); {33613#true} is VALID [2022-04-28 07:56:26,097 INFO L290 TraceCheckUtils]: 203: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,097 INFO L290 TraceCheckUtils]: 204: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,097 INFO L290 TraceCheckUtils]: 205: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,098 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {33613#true} {34245#(and (= main_~y~0 27) (= main_~c~0 27))} #54#return; {34245#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-28 07:56:26,098 INFO L290 TraceCheckUtils]: 207: Hoare triple {34245#(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; {34267#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-28 07:56:26,099 INFO L290 TraceCheckUtils]: 208: Hoare triple {34267#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} assume !false; {34267#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-28 07:56:26,099 INFO L272 TraceCheckUtils]: 209: Hoare triple {34267#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33613#true} is VALID [2022-04-28 07:56:26,099 INFO L290 TraceCheckUtils]: 210: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,099 INFO L290 TraceCheckUtils]: 211: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,099 INFO L290 TraceCheckUtils]: 212: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,100 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {33613#true} {34267#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} #54#return; {34267#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-28 07:56:26,100 INFO L290 TraceCheckUtils]: 214: Hoare triple {34267#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34289#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:56:26,100 INFO L290 TraceCheckUtils]: 215: Hoare triple {34289#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} assume !false; {34289#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:56:26,100 INFO L272 TraceCheckUtils]: 216: Hoare triple {34289#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33613#true} is VALID [2022-04-28 07:56:26,101 INFO L290 TraceCheckUtils]: 217: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,101 INFO L290 TraceCheckUtils]: 218: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,101 INFO L290 TraceCheckUtils]: 219: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,101 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {33613#true} {34289#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} #54#return; {34289#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:56:26,102 INFO L290 TraceCheckUtils]: 221: Hoare triple {34289#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34311#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-28 07:56:26,102 INFO L290 TraceCheckUtils]: 222: Hoare triple {34311#(and (= 30 main_~y~0) (= 30 main_~c~0))} assume !false; {34311#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-28 07:56:26,102 INFO L272 TraceCheckUtils]: 223: Hoare triple {34311#(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)); {33613#true} is VALID [2022-04-28 07:56:26,102 INFO L290 TraceCheckUtils]: 224: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,102 INFO L290 TraceCheckUtils]: 225: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,102 INFO L290 TraceCheckUtils]: 226: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,103 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {33613#true} {34311#(and (= 30 main_~y~0) (= 30 main_~c~0))} #54#return; {34311#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-28 07:56:26,103 INFO L290 TraceCheckUtils]: 228: Hoare triple {34311#(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; {34333#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} is VALID [2022-04-28 07:56:26,104 INFO L290 TraceCheckUtils]: 229: Hoare triple {34333#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} assume !false; {34333#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} is VALID [2022-04-28 07:56:26,104 INFO L272 TraceCheckUtils]: 230: Hoare triple {34333#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33613#true} is VALID [2022-04-28 07:56:26,104 INFO L290 TraceCheckUtils]: 231: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,104 INFO L290 TraceCheckUtils]: 232: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,104 INFO L290 TraceCheckUtils]: 233: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,104 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {33613#true} {34333#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} #54#return; {34333#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} is VALID [2022-04-28 07:56:26,105 INFO L290 TraceCheckUtils]: 235: Hoare triple {34333#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34355#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} is VALID [2022-04-28 07:56:26,105 INFO L290 TraceCheckUtils]: 236: Hoare triple {34355#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} assume !false; {34355#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} is VALID [2022-04-28 07:56:26,105 INFO L272 TraceCheckUtils]: 237: Hoare triple {34355#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33613#true} is VALID [2022-04-28 07:56:26,105 INFO L290 TraceCheckUtils]: 238: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,105 INFO L290 TraceCheckUtils]: 239: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,105 INFO L290 TraceCheckUtils]: 240: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,106 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {33613#true} {34355#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} #54#return; {34355#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} is VALID [2022-04-28 07:56:26,106 INFO L290 TraceCheckUtils]: 242: Hoare triple {34355#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34377#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-28 07:56:26,106 INFO L290 TraceCheckUtils]: 243: Hoare triple {34377#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} assume !false; {34377#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-28 07:56:26,107 INFO L272 TraceCheckUtils]: 244: Hoare triple {34377#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33613#true} is VALID [2022-04-28 07:56:26,107 INFO L290 TraceCheckUtils]: 245: Hoare triple {33613#true} ~cond := #in~cond; {33613#true} is VALID [2022-04-28 07:56:26,107 INFO L290 TraceCheckUtils]: 246: Hoare triple {33613#true} assume !(0 == ~cond); {33613#true} is VALID [2022-04-28 07:56:26,107 INFO L290 TraceCheckUtils]: 247: Hoare triple {33613#true} assume true; {33613#true} is VALID [2022-04-28 07:56:26,107 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {33613#true} {34377#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} #54#return; {34377#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-28 07:56:26,108 INFO L290 TraceCheckUtils]: 249: Hoare triple {34377#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} assume !(~c~0 < ~k~0); {34399#(and (= main_~y~0 33) (<= main_~k~0 33) (< 32 main_~k~0))} is VALID [2022-04-28 07:56:26,108 INFO L272 TraceCheckUtils]: 250: Hoare triple {34399#(and (= main_~y~0 33) (<= main_~k~0 33) (< 32 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34403#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:56:26,109 INFO L290 TraceCheckUtils]: 251: Hoare triple {34403#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34407#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:56:26,109 INFO L290 TraceCheckUtils]: 252: Hoare triple {34407#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33614#false} is VALID [2022-04-28 07:56:26,109 INFO L290 TraceCheckUtils]: 253: Hoare triple {33614#false} assume !false; {33614#false} is VALID [2022-04-28 07:56:26,111 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:56:26,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:56:26,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:56:26,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782424802] [2022-04-28 07:56:26,632 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:56:26,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25579250] [2022-04-28 07:56:26,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25579250] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:56:26,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:56:26,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2022-04-28 07:56:26,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:56:26,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1803065876] [2022-04-28 07:56:26,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1803065876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:26,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:26,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 07:56:26,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869966099] [2022-04-28 07:56:26,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:56:26,633 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:56:26,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:56:26,633 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:56:27,689 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:56:27,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 07:56:27,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:27,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 07:56:27,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 07:56:27,690 INFO L87 Difference]: Start difference. First operand 135 states and 165 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)