/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_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:42:55,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:42:55,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:42:55,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:42:55,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:42:55,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:42:55,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:42:55,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:42:55,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:42:55,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:42:55,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:42:55,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:42:55,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:42:55,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:42:55,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:42:55,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:42:55,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:42:55,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:42:55,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:42:56,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:42:56,002 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:42:56,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:42:56,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:42:56,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:42:56,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:42:56,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:42:56,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:42:56,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:42:56,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:42:56,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:42:56,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:42:56,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:42:56,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:42:56,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:42:56,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:42:56,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:42:56,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:42:56,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:42:56,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:42:56,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:42:56,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:42:56,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:42:56,018 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:56,026 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:42:56,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:42:56,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:42:56,027 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:42:56,027 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:42:56,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:42:56,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:42:56,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:42:56,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:42:56,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:42:56,029 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:42:56,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:42:56,029 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:42:56,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:42:56,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:42:56,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:42:56,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:42:56,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:42:56,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:42:56,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:42:56,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:42:56,030 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:42:56,030 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:42:56,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:42:56,030 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:42:56,030 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:56,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:42:56,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:42:56,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:42:56,208 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:42:56,209 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:42:56,209 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound20.c [2022-04-28 07:42:56,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7045e1dab/766689ba2da74111a16da53ef7d43584/FLAG34401d2a2 [2022-04-28 07:42:56,602 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:42:56,603 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound20.c [2022-04-28 07:42:56,606 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7045e1dab/766689ba2da74111a16da53ef7d43584/FLAG34401d2a2 [2022-04-28 07:42:56,616 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7045e1dab/766689ba2da74111a16da53ef7d43584 [2022-04-28 07:42:56,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:42:56,618 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:42:56,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:42:56,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:42:56,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:42:56,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:42:56" (1/1) ... [2022-04-28 07:42:56,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53dda574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:56, skipping insertion in model container [2022-04-28 07:42:56,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:42:56" (1/1) ... [2022-04-28 07:42:56,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:42:56,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:42:56,772 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_valuebound20.c[458,471] [2022-04-28 07:42:56,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:42:56,798 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:42:56,805 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_valuebound20.c[458,471] [2022-04-28 07:42:56,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:42:56,816 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:42:56,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:56 WrapperNode [2022-04-28 07:42:56,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:42:56,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:42:56,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:42:56,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:42:56,824 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:56" (1/1) ... [2022-04-28 07:42:56,824 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:56" (1/1) ... [2022-04-28 07:42:56,828 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:56" (1/1) ... [2022-04-28 07:42:56,828 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:56" (1/1) ... [2022-04-28 07:42:56,831 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:56" (1/1) ... [2022-04-28 07:42:56,834 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:56" (1/1) ... [2022-04-28 07:42:56,835 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:56" (1/1) ... [2022-04-28 07:42:56,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:42:56,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:42:56,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:42:56,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:42:56,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:56" (1/1) ... [2022-04-28 07:42:56,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:42:56,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:56,867 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:56,872 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:56,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:42:56,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:42:56,892 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:42:56,892 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:42:56,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:42:56,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:42:56,893 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:42:56,893 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:42:56,893 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:42:56,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:42:56,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 07:42:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:42:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:42:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:42:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:42:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:42:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:42:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:42:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:42:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:42:56,939 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:42:56,940 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:42:57,057 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:42:57,061 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:42:57,061 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:42:57,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:42:57 BoogieIcfgContainer [2022-04-28 07:42:57,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:42:57,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:42:57,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:42:57,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:42:57,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:42:56" (1/3) ... [2022-04-28 07:42:57,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a7f229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:42:57, skipping insertion in model container [2022-04-28 07:42:57,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:56" (2/3) ... [2022-04-28 07:42:57,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a7f229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:42:57, skipping insertion in model container [2022-04-28 07:42:57,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:42:57" (3/3) ... [2022-04-28 07:42:57,075 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound20.c [2022-04-28 07:42:57,084 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:42:57,085 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:42:57,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:42:57,118 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@46551e6c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@602d8d0a [2022-04-28 07:42:57,118 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:42:57,123 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:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 07:42:57,127 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:57,128 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:57,128 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:57,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:57,131 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-28 07:42:57,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:57,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1617341797] [2022-04-28 07:42:57,143 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:42:57,143 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 2 times [2022-04-28 07:42:57,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:57,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720297134] [2022-04-28 07:42:57,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:57,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:57,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:42:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:57,255 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:57,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 07:42:57,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-28 07:42:57,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:42:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:57,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-28 07:42:57,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-28 07:42:57,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-28 07:42:57,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-28 07:42:57,264 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:57,265 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:57,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 07:42:57,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-28 07:42:57,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-28 07:42:57,265 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:57,266 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {31#true} is VALID [2022-04-28 07:42:57,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-28 07:42:57,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-28 07:42:57,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-28 07:42:57,270 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-28 07:42:57,270 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:57,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-28 07:42:57,270 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:57,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-28 07:42:57,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-28 07:42:57,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-28 07:42:57,271 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:57,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:57,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720297134] [2022-04-28 07:42:57,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720297134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:57,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:57,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:42:57,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:57,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1617341797] [2022-04-28 07:42:57,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1617341797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:57,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:57,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:42:57,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482437705] [2022-04-28 07:42:57,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:57,279 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:57,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:57,282 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:57,298 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:57,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:42:57,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:57,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:42:57,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:42:57,314 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:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:57,387 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-28 07:42:57,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:42:57,388 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:57,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:57,389 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:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-28 07:42:57,395 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:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-28 07:42:57,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-28 07:42:57,455 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:57,460 INFO L225 Difference]: With dead ends: 47 [2022-04-28 07:42:57,460 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 07:42:57,462 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:57,464 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:57,465 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:57,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 07:42:57,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 07:42:57,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:57,486 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:57,486 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:57,487 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:57,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:57,489 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 07:42:57,489 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 07:42:57,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:57,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:57,490 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:57,491 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:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:57,493 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 07:42:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 07:42:57,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:57,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:57,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:57,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:57,494 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:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-28 07:42:57,496 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-28 07:42:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:57,497 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-28 07:42:57,497 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:57,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-28 07:42:57,521 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:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 07:42:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 07:42:57,522 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:57,522 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:57,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:42:57,522 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:57,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:57,523 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-28 07:42:57,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:57,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2009445700] [2022-04-28 07:42:57,524 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:42:57,524 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 2 times [2022-04-28 07:42:57,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:57,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51263500] [2022-04-28 07:42:57,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:57,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:57,546 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:57,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810199349] [2022-04-28 07:42:57,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:57,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:57,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:57,554 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:57,555 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:57,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:42:57,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:57,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:42:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:57,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:57,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-28 07:42:57,727 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:57,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-28 07:42:57,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #60#return; {229#true} is VALID [2022-04-28 07:42:57,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-28 07:42:57,728 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:57,728 INFO L272 TraceCheckUtils]: 6: Hoare triple {229#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {229#true} is VALID [2022-04-28 07:42:57,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-28 07:42:57,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-28 07:42:57,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-28 07:42:57,729 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {229#true} {229#true} #52#return; {229#true} is VALID [2022-04-28 07:42:57,729 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:57,730 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:57,731 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:57,731 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:57,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-28 07:42:57,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-28 07:42:57,741 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:57,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:42:57,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:57,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51263500] [2022-04-28 07:42:57,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:57,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810199349] [2022-04-28 07:42:57,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810199349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:57,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:57,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:42:57,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:57,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2009445700] [2022-04-28 07:42:57,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2009445700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:57,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:57,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:42:57,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881043168] [2022-04-28 07:42:57,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:57,745 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:57,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:57,746 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:57,758 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:57,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:42:57,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:57,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:42:57,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:42:57,761 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:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:57,874 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 07:42:57,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:42:57,875 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:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:57,876 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:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 07:42:57,887 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:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 07:42:57,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-28 07:42:57,916 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:57,917 INFO L225 Difference]: With dead ends: 34 [2022-04-28 07:42:57,917 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 07:42:57,918 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:57,920 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:57,922 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:57,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 07:42:57,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 07:42:57,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:57,943 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:57,944 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:57,944 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:57,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:57,946 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 07:42:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 07:42:57,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:57,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:57,946 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:57,947 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:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:57,948 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 07:42:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 07:42:57,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:57,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:57,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:57,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:57,949 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:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-28 07:42:57,959 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-28 07:42:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:57,959 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-28 07:42:57,960 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:57,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-28 07:42:57,988 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:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 07:42:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 07:42:57,992 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:57,995 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:58,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 07:42:58,207 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:58,208 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:58,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-28 07:42:58,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:58,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [305807346] [2022-04-28 07:42:58,400 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:58,400 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:58,401 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:58,401 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 2 times [2022-04-28 07:42:58,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:58,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834957502] [2022-04-28 07:42:58,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:58,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:58,413 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:58,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177812421] [2022-04-28 07:42:58,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:58,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:58,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:58,414 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:58,415 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:58,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:42:58,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:58,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:42:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:58,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:58,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-28 07:42:58,558 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:58,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:42:58,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-28 07:42:58,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-28 07:42:58,559 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:58,559 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {474#true} is VALID [2022-04-28 07:42:58,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 07:42:58,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 07:42:58,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:42:58,559 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-28 07:42:58,563 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:58,563 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:58,563 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:58,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 07:42:58,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 07:42:58,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:42:58,565 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:58,565 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:58,566 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:58,566 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:58,567 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:58,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-28 07:42:58,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-28 07:42:58,567 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:58,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:59,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-28 07:42:59,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-28 07:42:59,307 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:59,307 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:59,308 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:59,316 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:59,316 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:59,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:42:59,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 07:42:59,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 07:42:59,317 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:59,317 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:59,318 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:59,318 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-28 07:42:59,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:42:59,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 07:42:59,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 07:42:59,318 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {474#true} is VALID [2022-04-28 07:42:59,318 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:59,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-28 07:42:59,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-28 07:42:59,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 07:42:59,319 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:59,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-28 07:42:59,319 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:59,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:59,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834957502] [2022-04-28 07:42:59,319 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:59,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177812421] [2022-04-28 07:42:59,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177812421] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:59,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:59,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 07:42:59,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:59,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [305807346] [2022-04-28 07:42:59,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [305807346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:59,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:59,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:42:59,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357989757] [2022-04-28 07:42:59,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:59,321 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:59,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:59,322 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:59,344 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:59,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:42:59,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:59,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:42:59,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 07:42:59,345 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:59,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:59,446 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-28 07:42:59,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:42:59,446 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:59,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:59,447 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:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 07:42:59,448 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:59,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 07:42:59,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-28 07:42:59,481 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:59,481 INFO L225 Difference]: With dead ends: 36 [2022-04-28 07:42:59,481 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 07:42:59,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:42:59,482 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:59,483 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:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 07:42:59,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 07:42:59,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:59,493 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:59,493 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:59,493 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:59,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:59,494 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 07:42:59,494 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 07:42:59,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:59,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:59,495 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:59,495 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:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:59,496 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 07:42:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 07:42:59,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:59,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:59,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:59,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:59,497 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:59,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 07:42:59,498 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-28 07:42:59,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:59,498 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 07:42:59,498 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:59,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 07:42:59,530 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:59,530 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 07:42:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 07:42:59,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:59,530 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:59,546 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:59,738 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:59,739 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:59,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:59,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-28 07:42:59,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:59,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [764678778] [2022-04-28 07:42:59,837 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,837 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:59,837 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:59,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 2 times [2022-04-28 07:42:59,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:59,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299276910] [2022-04-28 07:42:59,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:59,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:59,847 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:59,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1123330882] [2022-04-28 07:42:59,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:59,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:59,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:59,849 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:59,850 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:59,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:42:59,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:59,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 07:42:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:59,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:00,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2022-04-28 07:43:00,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {822#true} is VALID [2022-04-28 07:43:00,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 07:43:00,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #60#return; {822#true} is VALID [2022-04-28 07:43:00,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret5 := main(); {822#true} is VALID [2022-04-28 07:43:00,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {822#true} is VALID [2022-04-28 07:43:00,093 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {822#true} is VALID [2022-04-28 07:43:00,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 07:43:00,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 07:43:00,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 07:43:00,094 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #52#return; {822#true} is VALID [2022-04-28 07:43:00,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:00,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:00,095 INFO L272 TraceCheckUtils]: 13: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {822#true} is VALID [2022-04-28 07:43:00,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 07:43:00,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 07:43:00,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 07:43:00,096 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {822#true} {860#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:00,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:43:00,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:43:00,097 INFO L272 TraceCheckUtils]: 20: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {822#true} is VALID [2022-04-28 07:43:00,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 07:43:00,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 07:43:00,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 07:43:00,098 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {822#true} {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:43:00,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:00,100 INFO L272 TraceCheckUtils]: 26: Hoare triple {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:00,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:00,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {823#false} is VALID [2022-04-28 07:43:00,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-28 07:43:00,101 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:43:00,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:00,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:00,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299276910] [2022-04-28 07:43:00,364 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:00,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123330882] [2022-04-28 07:43:00,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123330882] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:00,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:00,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 07:43:00,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:00,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [764678778] [2022-04-28 07:43:00,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [764678778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:00,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:00,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:43:00,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108410585] [2022-04-28 07:43:00,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:00,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-28 07:43:00,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:00,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:43:00,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:00,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:43:00,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:00,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:43:00,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:43:00,384 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:43:00,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:00,579 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-28 07:43:00,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 07:43:00,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-28 07:43:00,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:43:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-28 07:43:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:43:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-28 07:43:00,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-28 07:43:00,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:00,609 INFO L225 Difference]: With dead ends: 39 [2022-04-28 07:43:00,609 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 07:43:00,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:43:00,610 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:43:00,610 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:43:00,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 07:43:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 07:43:00,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:00,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:43:00,626 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:43:00,626 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:43:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:00,627 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 07:43:00,627 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 07:43:00,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:00,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:00,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 07:43:00,628 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 07:43:00,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:00,629 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 07:43:00,629 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 07:43:00,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:00,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:00,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:00,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:00,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:43:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-28 07:43:00,631 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-28 07:43:00,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:00,631 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-28 07:43:00,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:43:00,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-28 07:43:00,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:00,666 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 07:43:00,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 07:43:00,667 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:00,667 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:00,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:00,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:00,885 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:00,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:00,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 3 times [2022-04-28 07:43:00,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:00,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2068133024] [2022-04-28 07:43:00,965 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:00,965 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:00,965 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:00,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 4 times [2022-04-28 07:43:00,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:00,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400841995] [2022-04-28 07:43:00,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:00,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:00,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:00,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [614860590] [2022-04-28 07:43:00,975 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:43:00,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:00,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:00,976 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:00,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 07:43:01,007 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:43:01,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:01,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 07:43:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:01,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:01,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1178#true} is VALID [2022-04-28 07:43:01,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {1178#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1178#true} is VALID [2022-04-28 07:43:01,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 07:43:01,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #60#return; {1178#true} is VALID [2022-04-28 07:43:01,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret5 := main(); {1178#true} is VALID [2022-04-28 07:43:01,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {1178#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1178#true} is VALID [2022-04-28 07:43:01,258 INFO L272 TraceCheckUtils]: 6: Hoare triple {1178#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1178#true} is VALID [2022-04-28 07:43:01,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 07:43:01,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 07:43:01,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 07:43:01,259 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1178#true} {1178#true} #52#return; {1178#true} is VALID [2022-04-28 07:43:01,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:01,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:01,279 INFO L272 TraceCheckUtils]: 13: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-28 07:43:01,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 07:43:01,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 07:43:01,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 07:43:01,280 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1178#true} {1216#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:01,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:01,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:01,281 INFO L272 TraceCheckUtils]: 20: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-28 07:43:01,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 07:43:01,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 07:43:01,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 07:43:01,281 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1178#true} {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:01,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 07:43:01,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !false; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 07:43:01,282 INFO L272 TraceCheckUtils]: 27: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-28 07:43:01,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 07:43:01,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 07:43:01,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 07:43:01,283 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1178#true} {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #54#return; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 07:43:01,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1282#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-28 07:43:01,284 INFO L272 TraceCheckUtils]: 33: Hoare triple {1282#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1286#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:01,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {1286#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1290#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:01,285 INFO L290 TraceCheckUtils]: 35: Hoare triple {1290#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1179#false} is VALID [2022-04-28 07:43:01,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-28 07:43:01,285 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:43:01,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:01,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:01,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400841995] [2022-04-28 07:43:01,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:01,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614860590] [2022-04-28 07:43:01,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614860590] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:01,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:01,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 07:43:01,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:01,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2068133024] [2022-04-28 07:43:01,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2068133024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:01,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:01,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:43:01,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012735216] [2022-04-28 07:43:01,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:01,545 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-28 07:43:01,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:01,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:43:01,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:01,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:43:01,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:01,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:43:01,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 07:43:01,569 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:43:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:01,790 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-28 07:43:01,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:43:01,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-28 07:43:01,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:43:01,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-28 07:43:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:43:01,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-28 07:43:01,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-28 07:43:01,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:01,820 INFO L225 Difference]: With dead ends: 42 [2022-04-28 07:43:01,820 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 07:43:01,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:43:01,821 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:01,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:43:01,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 07:43:01,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 07:43:01,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:01,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:43:01,837 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:43:01,837 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:43:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:01,839 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 07:43:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 07:43:01,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:01,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:01,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-28 07:43:01,839 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-28 07:43:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:01,840 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 07:43:01,840 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 07:43:01,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:01,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:01,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:01,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:43:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-28 07:43:01,842 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 37 [2022-04-28 07:43:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:01,842 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-28 07:43:01,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:43:01,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-28 07:43:01,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 07:43:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 07:43:01,885 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:01,886 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:01,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:02,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:02,091 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:02,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:02,092 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 5 times [2022-04-28 07:43:02,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:02,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1268426704] [2022-04-28 07:43:02,202 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,202 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:02,202 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:02,202 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 6 times [2022-04-28 07:43:02,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:02,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799133884] [2022-04-28 07:43:02,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:02,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:02,216 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:02,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332930039] [2022-04-28 07:43:02,217 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:43:02,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:02,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:02,218 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:02,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 07:43:02,278 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 07:43:02,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:02,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 07:43:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:02,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:02,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1574#true} is VALID [2022-04-28 07:43:02,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1574#true} is VALID [2022-04-28 07:43:02,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:43:02,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #60#return; {1574#true} is VALID [2022-04-28 07:43:02,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret5 := main(); {1574#true} is VALID [2022-04-28 07:43:02,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {1574#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1574#true} is VALID [2022-04-28 07:43:02,552 INFO L272 TraceCheckUtils]: 6: Hoare triple {1574#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1574#true} is VALID [2022-04-28 07:43:02,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 07:43:02,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 07:43:02,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:43:02,552 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1574#true} {1574#true} #52#return; {1574#true} is VALID [2022-04-28 07:43:02,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {1574#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:02,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {1612#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:02,553 INFO L272 TraceCheckUtils]: 13: Hoare triple {1612#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1574#true} is VALID [2022-04-28 07:43:02,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 07:43:02,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 07:43:02,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:43:02,554 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1574#true} {1612#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:02,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {1612#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:02,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:02,555 INFO L272 TraceCheckUtils]: 20: Hoare triple {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1574#true} is VALID [2022-04-28 07:43:02,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 07:43:02,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 07:43:02,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:43:02,556 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1574#true} {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:02,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:02,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:02,557 INFO L272 TraceCheckUtils]: 27: Hoare triple {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1574#true} is VALID [2022-04-28 07:43:02,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 07:43:02,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 07:43:02,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:43:02,557 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1574#true} {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:02,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:02,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:02,558 INFO L272 TraceCheckUtils]: 34: Hoare triple {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1574#true} is VALID [2022-04-28 07:43:02,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 07:43:02,558 INFO L290 TraceCheckUtils]: 36: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 07:43:02,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 07:43:02,559 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1574#true} {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #54#return; {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:02,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1700#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:02,560 INFO L272 TraceCheckUtils]: 40: Hoare triple {1700#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:02,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1708#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:02,561 INFO L290 TraceCheckUtils]: 42: Hoare triple {1708#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1575#false} is VALID [2022-04-28 07:43:02,561 INFO L290 TraceCheckUtils]: 43: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-04-28 07:43:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 07:43:02,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:02,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:02,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799133884] [2022-04-28 07:43:02,812 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:02,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332930039] [2022-04-28 07:43:02,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332930039] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:02,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:02,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 07:43:02,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:02,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1268426704] [2022-04-28 07:43:02,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1268426704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:02,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:02,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:43:02,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508528765] [2022-04-28 07:43:02,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:02,813 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-28 07:43:02,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:02,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:43:02,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:02,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:43:02,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:02,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:43:02,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:43:02,851 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:43:03,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:03,156 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-28 07:43:03,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 07:43:03,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-28 07:43:03,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:43:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 07:43:03,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:43:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 07:43:03,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-28 07:43:03,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:03,191 INFO L225 Difference]: With dead ends: 45 [2022-04-28 07:43:03,191 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 07:43:03,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:43:03,192 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:03,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:43:03,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 07:43:03,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-28 07:43:03,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:03,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:43:03,209 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:43:03,210 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:43:03,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:03,214 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-28 07:43:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 07:43:03,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:03,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:03,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-28 07:43:03,215 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-28 07:43:03,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:03,218 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-28 07:43:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 07:43:03,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:03,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:03,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:03,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:43:03,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-28 07:43:03,221 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 44 [2022-04-28 07:43:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:03,222 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-28 07:43:03,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:43:03,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-28 07:43:03,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 07:43:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 07:43:03,270 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:03,270 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:03,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:03,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:03,479 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:03,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:03,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 7 times [2022-04-28 07:43:03,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:03,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [543547680] [2022-04-28 07:43:03,569 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:03,569 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:03,569 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:03,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 8 times [2022-04-28 07:43:03,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:03,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556280729] [2022-04-28 07:43:03,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:03,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:03,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:03,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [995728321] [2022-04-28 07:43:03,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:43:03,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:03,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:03,594 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:03,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 07:43:03,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:43:03,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:03,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 07:43:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:03,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:03,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {2010#true} call ULTIMATE.init(); {2010#true} is VALID [2022-04-28 07:43:03,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {2010#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2010#true} is VALID [2022-04-28 07:43:03,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:43:03,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2010#true} {2010#true} #60#return; {2010#true} is VALID [2022-04-28 07:43:03,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {2010#true} call #t~ret5 := main(); {2010#true} is VALID [2022-04-28 07:43:03,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {2010#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2010#true} is VALID [2022-04-28 07:43:03,965 INFO L272 TraceCheckUtils]: 6: Hoare triple {2010#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2010#true} is VALID [2022-04-28 07:43:03,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:43:03,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:43:03,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:43:03,966 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2010#true} {2010#true} #52#return; {2010#true} is VALID [2022-04-28 07:43:03,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {2010#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:03,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {2048#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:03,966 INFO L272 TraceCheckUtils]: 13: Hoare triple {2048#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2010#true} is VALID [2022-04-28 07:43:03,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:43:03,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:43:03,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:43:03,967 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2010#true} {2048#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:03,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {2048#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:03,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:03,968 INFO L272 TraceCheckUtils]: 20: Hoare triple {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2010#true} is VALID [2022-04-28 07:43:03,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:43:03,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:43:03,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:43:03,969 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2010#true} {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:03,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:03,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:03,970 INFO L272 TraceCheckUtils]: 27: Hoare triple {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2010#true} is VALID [2022-04-28 07:43:03,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:43:03,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:43:03,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:43:03,971 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2010#true} {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:03,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:43:03,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:43:03,972 INFO L272 TraceCheckUtils]: 34: Hoare triple {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2010#true} is VALID [2022-04-28 07:43:03,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:43:03,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:43:03,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:43:03,972 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2010#true} {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #54#return; {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:43:03,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:43:03,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:43:03,974 INFO L272 TraceCheckUtils]: 41: Hoare triple {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2010#true} is VALID [2022-04-28 07:43:03,978 INFO L290 TraceCheckUtils]: 42: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 07:43:03,978 INFO L290 TraceCheckUtils]: 43: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 07:43:03,978 INFO L290 TraceCheckUtils]: 44: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 07:43:03,979 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2010#true} {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #54#return; {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:43:03,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2158#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 07:43:03,982 INFO L272 TraceCheckUtils]: 47: Hoare triple {2158#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:03,983 INFO L290 TraceCheckUtils]: 48: Hoare triple {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2166#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:03,984 INFO L290 TraceCheckUtils]: 49: Hoare triple {2166#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2011#false} is VALID [2022-04-28 07:43:03,984 INFO L290 TraceCheckUtils]: 50: Hoare triple {2011#false} assume !false; {2011#false} is VALID [2022-04-28 07:43:03,984 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 07:43:03,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:04,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:04,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556280729] [2022-04-28 07:43:04,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:04,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995728321] [2022-04-28 07:43:04,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995728321] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:04,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:04,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 07:43:04,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:04,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [543547680] [2022-04-28 07:43:04,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [543547680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:04,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:04,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:43:04,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425511968] [2022-04-28 07:43:04,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:04,253 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-28 07:43:04,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:04,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:43:04,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:04,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:43:04,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:04,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:43:04,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:43:04,281 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:43:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:04,639 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-28 07:43:04,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:43:04,639 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-28 07:43:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:43:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-28 07:43:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:43:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-28 07:43:04,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-28 07:43:04,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:04,674 INFO L225 Difference]: With dead ends: 48 [2022-04-28 07:43:04,674 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 07:43:04,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-28 07:43:04,675 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:43:04,675 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:43:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 07:43:04,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 07:43:04,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:04,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:43:04,695 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:43:04,695 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:43:04,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:04,696 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-28 07:43:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 07:43:04,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:04,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:04,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 43 states. [2022-04-28 07:43:04,697 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 43 states. [2022-04-28 07:43:04,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:04,698 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-28 07:43:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 07:43:04,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:04,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:04,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:04,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:04,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:43:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-28 07:43:04,699 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 51 [2022-04-28 07:43:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:04,700 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-28 07:43:04,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:43:04,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-28 07:43:04,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 07:43:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 07:43:04,749 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:04,749 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:04,767 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:43:04,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:04,966 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:04,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:04,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 9 times [2022-04-28 07:43:04,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:04,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [335088667] [2022-04-28 07:43:05,036 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:05,036 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:05,036 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:05,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 10 times [2022-04-28 07:43:05,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:05,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223395144] [2022-04-28 07:43:05,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:05,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:05,058 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:05,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1379842497] [2022-04-28 07:43:05,058 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:43:05,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:05,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:05,060 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:05,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 07:43:05,153 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:43:05,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:05,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 07:43:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:05,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:05,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2022-04-28 07:43:05,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2486#true} is VALID [2022-04-28 07:43:05,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:43:05,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2486#true} {2486#true} #60#return; {2486#true} is VALID [2022-04-28 07:43:05,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {2486#true} call #t~ret5 := main(); {2486#true} is VALID [2022-04-28 07:43:05,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {2486#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2486#true} is VALID [2022-04-28 07:43:05,491 INFO L272 TraceCheckUtils]: 6: Hoare triple {2486#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2486#true} is VALID [2022-04-28 07:43:05,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:43:05,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:43:05,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:43:05,492 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2486#true} {2486#true} #52#return; {2486#true} is VALID [2022-04-28 07:43:05,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {2486#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:05,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {2524#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:05,493 INFO L272 TraceCheckUtils]: 13: Hoare triple {2524#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2486#true} is VALID [2022-04-28 07:43:05,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:43:05,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:43:05,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:43:05,494 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2486#true} {2524#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:05,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {2524#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2546#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:05,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {2546#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {2546#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:05,495 INFO L272 TraceCheckUtils]: 20: Hoare triple {2546#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2486#true} is VALID [2022-04-28 07:43:05,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:43:05,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:43:05,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:43:05,496 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2486#true} {2546#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {2546#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:05,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {2546#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2568#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:05,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {2568#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {2568#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:05,497 INFO L272 TraceCheckUtils]: 27: Hoare triple {2568#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2486#true} is VALID [2022-04-28 07:43:05,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:43:05,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:43:05,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:43:05,497 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2486#true} {2568#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {2568#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:05,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {2568#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:43:05,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:43:05,498 INFO L272 TraceCheckUtils]: 34: Hoare triple {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2486#true} is VALID [2022-04-28 07:43:05,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:43:05,498 INFO L290 TraceCheckUtils]: 36: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:43:05,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:43:05,499 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2486#true} {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:43:05,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:43:05,500 INFO L290 TraceCheckUtils]: 40: Hoare triple {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:43:05,500 INFO L272 TraceCheckUtils]: 41: Hoare triple {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2486#true} is VALID [2022-04-28 07:43:05,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:43:05,500 INFO L290 TraceCheckUtils]: 43: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:43:05,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:43:05,501 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2486#true} {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:43:05,501 INFO L290 TraceCheckUtils]: 46: Hoare triple {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 07:43:05,502 INFO L290 TraceCheckUtils]: 47: Hoare triple {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 07:43:05,502 INFO L272 TraceCheckUtils]: 48: Hoare triple {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2486#true} is VALID [2022-04-28 07:43:05,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 07:43:05,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 07:43:05,502 INFO L290 TraceCheckUtils]: 51: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 07:43:05,503 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2486#true} {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #54#return; {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 07:43:05,503 INFO L290 TraceCheckUtils]: 53: Hoare triple {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2656#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 07:43:05,504 INFO L272 TraceCheckUtils]: 54: Hoare triple {2656#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2660#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:05,504 INFO L290 TraceCheckUtils]: 55: Hoare triple {2660#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2664#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:05,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {2664#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2487#false} is VALID [2022-04-28 07:43:05,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-04-28 07:43:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 07:43:05,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:05,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:05,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223395144] [2022-04-28 07:43:05,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:05,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379842497] [2022-04-28 07:43:05,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379842497] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:05,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:05,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 07:43:05,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:05,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [335088667] [2022-04-28 07:43:05,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [335088667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:05,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:05,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:43:05,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174997404] [2022-04-28 07:43:05,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:05,746 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-28 07:43:05,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:05,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:43:05,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:05,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:43:05,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:05,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:43:05,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:43:05,776 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:43:06,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:06,198 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-28 07:43:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 07:43:06,198 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-28 07:43:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:43:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-28 07:43:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:43:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-28 07:43:06,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-28 07:43:06,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:06,236 INFO L225 Difference]: With dead ends: 51 [2022-04-28 07:43:06,236 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 07:43:06,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:43:06,237 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:06,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 239 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:43:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 07:43:06,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 07:43:06,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:06,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:43:06,276 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:43:06,276 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:43:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:06,278 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 07:43:06,278 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 07:43:06,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:06,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:06,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-04-28 07:43:06,278 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-04-28 07:43:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:06,279 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 07:43:06,279 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 07:43:06,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:06,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:06,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:06,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:06,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:43:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-28 07:43:06,281 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 58 [2022-04-28 07:43:06,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:06,281 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-28 07:43:06,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:43:06,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 51 transitions. [2022-04-28 07:43:06,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:06,339 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 07:43:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 07:43:06,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:06,340 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:06,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:06,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:06,540 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:06,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:06,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 11 times [2022-04-28 07:43:06,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:06,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2119086772] [2022-04-28 07:43:06,612 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:06,613 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:06,613 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 12 times [2022-04-28 07:43:06,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:06,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567203567] [2022-04-28 07:43:06,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:06,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:06,621 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:06,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [12906532] [2022-04-28 07:43:06,621 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:43:06,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:06,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:06,622 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:06,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 07:43:06,757 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 07:43:06,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:06,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 07:43:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:06,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:07,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {3002#true} call ULTIMATE.init(); {3002#true} is VALID [2022-04-28 07:43:07,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {3002#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {3002#true} is VALID [2022-04-28 07:43:07,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:07,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3002#true} {3002#true} #60#return; {3002#true} is VALID [2022-04-28 07:43:07,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {3002#true} call #t~ret5 := main(); {3002#true} is VALID [2022-04-28 07:43:07,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {3002#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3002#true} is VALID [2022-04-28 07:43:07,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {3002#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3002#true} is VALID [2022-04-28 07:43:07,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:43:07,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:43:07,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:07,125 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3002#true} {3002#true} #52#return; {3002#true} is VALID [2022-04-28 07:43:07,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {3002#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:07,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {3040#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:07,126 INFO L272 TraceCheckUtils]: 13: Hoare triple {3040#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#true} is VALID [2022-04-28 07:43:07,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:43:07,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:43:07,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:07,127 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3002#true} {3040#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:07,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {3040#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:43:07,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:43:07,128 INFO L272 TraceCheckUtils]: 20: Hoare triple {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#true} is VALID [2022-04-28 07:43:07,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:43:07,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:43:07,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:07,131 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3002#true} {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:43:07,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3084#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:07,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {3084#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {3084#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:07,131 INFO L272 TraceCheckUtils]: 27: Hoare triple {3084#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#true} is VALID [2022-04-28 07:43:07,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:43:07,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:43:07,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:07,132 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3002#true} {3084#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {3084#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:07,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {3084#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:07,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:07,133 INFO L272 TraceCheckUtils]: 34: Hoare triple {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#true} is VALID [2022-04-28 07:43:07,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:43:07,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:43:07,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:07,134 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3002#true} {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #54#return; {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:07,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:43:07,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:43:07,135 INFO L272 TraceCheckUtils]: 41: Hoare triple {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#true} is VALID [2022-04-28 07:43:07,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:43:07,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:43:07,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:07,135 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3002#true} {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:43:07,136 INFO L290 TraceCheckUtils]: 46: Hoare triple {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:07,136 INFO L290 TraceCheckUtils]: 47: Hoare triple {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:07,136 INFO L272 TraceCheckUtils]: 48: Hoare triple {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#true} is VALID [2022-04-28 07:43:07,136 INFO L290 TraceCheckUtils]: 49: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:43:07,136 INFO L290 TraceCheckUtils]: 50: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:43:07,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:07,137 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3002#true} {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:07,137 INFO L290 TraceCheckUtils]: 53: Hoare triple {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:07,138 INFO L290 TraceCheckUtils]: 54: Hoare triple {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:07,138 INFO L272 TraceCheckUtils]: 55: Hoare triple {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#true} is VALID [2022-04-28 07:43:07,138 INFO L290 TraceCheckUtils]: 56: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 07:43:07,138 INFO L290 TraceCheckUtils]: 57: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 07:43:07,138 INFO L290 TraceCheckUtils]: 58: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 07:43:07,138 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3002#true} {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:07,139 INFO L290 TraceCheckUtils]: 60: Hoare triple {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !(~c~0 < ~k~0); {3194#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:07,140 INFO L272 TraceCheckUtils]: 61: Hoare triple {3194#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:07,140 INFO L290 TraceCheckUtils]: 62: Hoare triple {3198#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:07,141 INFO L290 TraceCheckUtils]: 63: Hoare triple {3202#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3003#false} is VALID [2022-04-28 07:43:07,141 INFO L290 TraceCheckUtils]: 64: Hoare triple {3003#false} assume !false; {3003#false} is VALID [2022-04-28 07:43:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 14 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 07:43:07,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:07,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:07,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567203567] [2022-04-28 07:43:07,501 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:07,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12906532] [2022-04-28 07:43:07,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12906532] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:07,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:07,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 07:43:07,502 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:07,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2119086772] [2022-04-28 07:43:07,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2119086772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:07,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:07,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:43:07,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042336837] [2022-04-28 07:43:07,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:07,503 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-28 07:43:07,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:07,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:43:07,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:07,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:43:07,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:07,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:43:07,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 07:43:07,545 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:43:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:08,068 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-28 07:43:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:43:08,069 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-28 07:43:08,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:43:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-28 07:43:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:43:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-28 07:43:08,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-28 07:43:08,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:08,112 INFO L225 Difference]: With dead ends: 54 [2022-04-28 07:43:08,112 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 07:43:08,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-28 07:43:08,113 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:08,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:43:08,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 07:43:08,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-28 07:43:08,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:08,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:43:08,141 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:43:08,141 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:43:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:08,143 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-28 07:43:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-28 07:43:08,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:08,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:08,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 49 states. [2022-04-28 07:43:08,144 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 49 states. [2022-04-28 07:43:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:08,145 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-28 07:43:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-28 07:43:08,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:08,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:08,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:08,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:43:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-04-28 07:43:08,146 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 65 [2022-04-28 07:43:08,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:08,147 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-04-28 07:43:08,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:43:08,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 55 transitions. [2022-04-28 07:43:08,210 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:08,210 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-28 07:43:08,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 07:43:08,211 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:08,212 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:08,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:08,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 07:43:08,416 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:08,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:08,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 13 times [2022-04-28 07:43:08,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:08,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1791884078] [2022-04-28 07:43:08,515 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:08,515 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:08,515 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:08,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 14 times [2022-04-28 07:43:08,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:08,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94506059] [2022-04-28 07:43:08,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:08,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:08,534 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:08,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [51859379] [2022-04-28 07:43:08,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:43:08,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:08,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:08,536 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:08,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 07:43:08,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:43:08,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:08,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 07:43:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:08,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:09,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {3558#true} call ULTIMATE.init(); {3558#true} is VALID [2022-04-28 07:43:09,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {3558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {3558#true} is VALID [2022-04-28 07:43:09,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:09,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3558#true} {3558#true} #60#return; {3558#true} is VALID [2022-04-28 07:43:09,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {3558#true} call #t~ret5 := main(); {3558#true} is VALID [2022-04-28 07:43:09,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {3558#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3558#true} is VALID [2022-04-28 07:43:09,093 INFO L272 TraceCheckUtils]: 6: Hoare triple {3558#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3558#true} is VALID [2022-04-28 07:43:09,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:09,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:09,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:09,094 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3558#true} {3558#true} #52#return; {3558#true} is VALID [2022-04-28 07:43:09,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {3558#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3596#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:09,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {3596#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3596#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:09,099 INFO L272 TraceCheckUtils]: 13: Hoare triple {3596#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-28 07:43:09,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:09,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:09,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:09,100 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3558#true} {3596#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3596#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:09,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {3596#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3618#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:09,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {3618#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {3618#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:09,100 INFO L272 TraceCheckUtils]: 20: Hoare triple {3618#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-28 07:43:09,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:09,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:09,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:09,101 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3558#true} {3618#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {3618#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:09,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {3618#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:43:09,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:43:09,102 INFO L272 TraceCheckUtils]: 27: Hoare triple {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-28 07:43:09,102 INFO L290 TraceCheckUtils]: 28: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:09,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:09,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:09,105 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3558#true} {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:43:09,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:43:09,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:43:09,105 INFO L272 TraceCheckUtils]: 34: Hoare triple {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-28 07:43:09,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:09,106 INFO L290 TraceCheckUtils]: 36: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:09,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:09,106 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3558#true} {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #54#return; {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:43:09,114 INFO L290 TraceCheckUtils]: 39: Hoare triple {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:43:09,115 INFO L290 TraceCheckUtils]: 40: Hoare triple {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:43:09,115 INFO L272 TraceCheckUtils]: 41: Hoare triple {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-28 07:43:09,115 INFO L290 TraceCheckUtils]: 42: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:09,115 INFO L290 TraceCheckUtils]: 43: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:09,115 INFO L290 TraceCheckUtils]: 44: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:09,116 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3558#true} {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:43:09,116 INFO L290 TraceCheckUtils]: 46: Hoare triple {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:43:09,116 INFO L290 TraceCheckUtils]: 47: Hoare triple {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !false; {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:43:09,117 INFO L272 TraceCheckUtils]: 48: Hoare triple {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-28 07:43:09,117 INFO L290 TraceCheckUtils]: 49: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:09,117 INFO L290 TraceCheckUtils]: 50: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:09,117 INFO L290 TraceCheckUtils]: 51: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:09,117 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3558#true} {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #54#return; {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:43:09,118 INFO L290 TraceCheckUtils]: 53: Hoare triple {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:09,118 INFO L290 TraceCheckUtils]: 54: Hoare triple {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:09,118 INFO L272 TraceCheckUtils]: 55: Hoare triple {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-28 07:43:09,118 INFO L290 TraceCheckUtils]: 56: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:09,118 INFO L290 TraceCheckUtils]: 57: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:09,118 INFO L290 TraceCheckUtils]: 58: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:09,119 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3558#true} {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:09,119 INFO L290 TraceCheckUtils]: 60: Hoare triple {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:43:09,120 INFO L290 TraceCheckUtils]: 61: Hoare triple {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:43:09,120 INFO L272 TraceCheckUtils]: 62: Hoare triple {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-28 07:43:09,120 INFO L290 TraceCheckUtils]: 63: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 07:43:09,120 INFO L290 TraceCheckUtils]: 64: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 07:43:09,120 INFO L290 TraceCheckUtils]: 65: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 07:43:09,121 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3558#true} {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #54#return; {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:43:09,122 INFO L290 TraceCheckUtils]: 67: Hoare triple {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3772#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:43:09,122 INFO L272 TraceCheckUtils]: 68: Hoare triple {3772#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:09,123 INFO L290 TraceCheckUtils]: 69: Hoare triple {3776#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:09,123 INFO L290 TraceCheckUtils]: 70: Hoare triple {3780#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3559#false} is VALID [2022-04-28 07:43:09,123 INFO L290 TraceCheckUtils]: 71: Hoare triple {3559#false} assume !false; {3559#false} is VALID [2022-04-28 07:43:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 07:43:09,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:09,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:09,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94506059] [2022-04-28 07:43:09,471 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:09,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51859379] [2022-04-28 07:43:09,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51859379] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:09,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:09,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 07:43:09,471 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:09,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1791884078] [2022-04-28 07:43:09,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1791884078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:09,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:09,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:43:09,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916829913] [2022-04-28 07:43:09,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:09,472 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 72 [2022-04-28 07:43:09,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:09,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:43:09,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:09,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:43:09,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:09,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:43:09,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:43:09,504 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:43:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:10,131 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-28 07:43:10,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 07:43:10,131 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 72 [2022-04-28 07:43:10,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:43:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 07:43:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:43:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 07:43:10,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-28 07:43:10,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:10,184 INFO L225 Difference]: With dead ends: 57 [2022-04-28 07:43:10,184 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 07:43:10,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:43:10,185 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:10,185 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.2s Time] [2022-04-28 07:43:10,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 07:43:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 07:43:10,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:10,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:43:10,217 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:43:10,217 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:43:10,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:10,218 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-28 07:43:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-28 07:43:10,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:10,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:10,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-28 07:43:10,219 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-28 07:43:10,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:10,220 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-28 07:43:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-28 07:43:10,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:10,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:10,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:10,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:43:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-28 07:43:10,221 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 72 [2022-04-28 07:43:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:10,221 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-28 07:43:10,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:43:10,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 59 transitions. [2022-04-28 07:43:10,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-28 07:43:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 07:43:10,286 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:10,286 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:43:10,292 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:43:10,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 07:43:10,487 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:10,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:10,487 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 15 times [2022-04-28 07:43:10,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:10,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [795967493] [2022-04-28 07:43:10,560 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:10,560 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:10,560 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:10,560 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 16 times [2022-04-28 07:43:10,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:10,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115074008] [2022-04-28 07:43:10,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:10,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:10,578 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:10,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140559894] [2022-04-28 07:43:10,579 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:43:10,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:10,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:10,583 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:10,587 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:11,008 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:43:11,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:11,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 07:43:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:11,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:11,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {4154#true} call ULTIMATE.init(); {4154#true} is VALID [2022-04-28 07:43:11,408 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:11,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:11,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4154#true} {4154#true} #60#return; {4154#true} is VALID [2022-04-28 07:43:11,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {4154#true} call #t~ret5 := main(); {4154#true} is VALID [2022-04-28 07:43:11,409 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:11,409 INFO L272 TraceCheckUtils]: 6: Hoare triple {4154#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {4154#true} is VALID [2022-04-28 07:43:11,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:11,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:11,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:11,409 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4154#true} {4154#true} #52#return; {4154#true} is VALID [2022-04-28 07:43:11,409 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:11,410 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:11,410 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:11,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:11,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:11,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:11,411 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:11,411 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:11,411 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:11,411 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:11,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:11,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:11,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:11,413 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:11,413 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:11,414 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:11,414 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:11,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:11,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:11,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:11,414 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:11,415 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:11,415 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:11,415 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:11,415 INFO L290 TraceCheckUtils]: 35: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:11,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:11,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:11,416 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:11,416 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:11,417 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:11,417 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:11,417 INFO L290 TraceCheckUtils]: 42: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:11,417 INFO L290 TraceCheckUtils]: 43: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:11,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:11,417 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:11,418 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:11,418 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:11,418 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:11,418 INFO L290 TraceCheckUtils]: 49: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:11,418 INFO L290 TraceCheckUtils]: 50: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:11,418 INFO L290 TraceCheckUtils]: 51: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:11,419 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:11,419 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:11,419 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:11,420 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:11,420 INFO L290 TraceCheckUtils]: 56: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:11,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:11,420 INFO L290 TraceCheckUtils]: 58: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:11,420 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:11,422 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:11,422 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:11,422 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:11,422 INFO L290 TraceCheckUtils]: 63: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:11,422 INFO L290 TraceCheckUtils]: 64: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:11,422 INFO L290 TraceCheckUtils]: 65: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:11,425 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:11,426 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:11,426 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:11,426 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:11,426 INFO L290 TraceCheckUtils]: 70: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 07:43:11,426 INFO L290 TraceCheckUtils]: 71: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 07:43:11,426 INFO L290 TraceCheckUtils]: 72: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 07:43:11,427 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:11,427 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:11,428 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:11,428 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:11,429 INFO L290 TraceCheckUtils]: 77: Hoare triple {4398#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4155#false} is VALID [2022-04-28 07:43:11,429 INFO L290 TraceCheckUtils]: 78: Hoare triple {4155#false} assume !false; {4155#false} is VALID [2022-04-28 07:43:11,429 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:11,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:11,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:11,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115074008] [2022-04-28 07:43:11,687 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:11,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140559894] [2022-04-28 07:43:11,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140559894] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:11,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:11,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 07:43:11,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:11,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [795967493] [2022-04-28 07:43:11,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [795967493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:11,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:11,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 07:43:11,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654366908] [2022-04-28 07:43:11,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:11,689 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:11,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:11,689 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:11,722 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:11,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 07:43:11,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:11,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 07:43:11,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 07:43:11,723 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:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:12,483 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-28 07:43:12,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:43:12,483 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:12,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:12,484 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:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-28 07:43:12,486 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:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-28 07:43:12,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-28 07:43:12,527 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:12,528 INFO L225 Difference]: With dead ends: 60 [2022-04-28 07:43:12,528 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 07:43:12,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:43:12,532 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:12,532 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:12,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 07:43:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 07:43:12,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:12,569 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:12,570 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:12,570 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:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:12,571 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-28 07:43:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-28 07:43:12,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:12,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:12,572 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:12,572 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:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:12,573 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-28 07:43:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-28 07:43:12,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:12,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:12,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:12,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:12,574 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:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-04-28 07:43:12,575 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 79 [2022-04-28 07:43:12,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:12,575 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-04-28 07:43:12,575 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:12,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 63 transitions. [2022-04-28 07:43:12,657 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:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-28 07:43:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 07:43:12,658 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:12,658 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:12,662 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:12,858 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:12,858 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:12,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:12,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 17 times [2022-04-28 07:43:12,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:12,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [530092308] [2022-04-28 07:43:12,928 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:12,928 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:12,928 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:12,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 18 times [2022-04-28 07:43:12,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:12,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857362424] [2022-04-28 07:43:12,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:12,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:12,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:12,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401723322] [2022-04-28 07:43:12,938 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:43:12,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:12,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:12,939 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:12,940 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:13,156 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 07:43:13,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:13,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 07:43:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:13,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:13,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {4790#true} call ULTIMATE.init(); {4790#true} is VALID [2022-04-28 07:43:13,723 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:13,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:13,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4790#true} {4790#true} #60#return; {4790#true} is VALID [2022-04-28 07:43:13,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {4790#true} call #t~ret5 := main(); {4790#true} is VALID [2022-04-28 07:43:13,724 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:13,724 INFO L272 TraceCheckUtils]: 6: Hoare triple {4790#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {4790#true} is VALID [2022-04-28 07:43:13,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:13,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:13,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:13,724 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4790#true} {4790#true} #52#return; {4790#true} is VALID [2022-04-28 07:43:13,724 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:13,725 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:13,725 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:13,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:13,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:13,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:13,726 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:13,726 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:13,726 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:13,726 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:13,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:13,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:13,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:13,727 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:13,727 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:13,728 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:13,728 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:13,728 INFO L290 TraceCheckUtils]: 28: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:13,728 INFO L290 TraceCheckUtils]: 29: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:13,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:13,728 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:13,729 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) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:43:13,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:43:13,729 INFO L272 TraceCheckUtils]: 34: Hoare triple {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< 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)); {4790#true} is VALID [2022-04-28 07:43:13,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:13,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:13,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:13,731 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4790#true} {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:43:13,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< 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; {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:43:13,732 INFO L290 TraceCheckUtils]: 40: Hoare triple {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} assume !false; {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:43:13,732 INFO L272 TraceCheckUtils]: 41: Hoare triple {4916#(and (= main_~c~0 4) (< 2 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)); {4790#true} is VALID [2022-04-28 07:43:13,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:13,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:13,732 INFO L290 TraceCheckUtils]: 44: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:13,733 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4790#true} {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} #54#return; {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:43:13,733 INFO L290 TraceCheckUtils]: 46: Hoare triple {4916#(and (= main_~c~0 4) (< 2 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; {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:13,733 INFO L290 TraceCheckUtils]: 47: Hoare triple {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} assume !false; {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:13,733 INFO L272 TraceCheckUtils]: 48: Hoare triple {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 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)); {4790#true} is VALID [2022-04-28 07:43:13,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:13,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:13,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:13,734 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4790#true} {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} #54#return; {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:13,735 INFO L290 TraceCheckUtils]: 53: Hoare triple {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 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; {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:13,735 INFO L290 TraceCheckUtils]: 54: Hoare triple {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !false; {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:13,735 INFO L272 TraceCheckUtils]: 55: Hoare triple {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 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)); {4790#true} is VALID [2022-04-28 07:43:13,735 INFO L290 TraceCheckUtils]: 56: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:13,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:13,735 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:13,736 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4790#true} {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} #54#return; {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:13,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 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; {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:13,736 INFO L290 TraceCheckUtils]: 61: Hoare triple {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} assume !false; {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:13,737 INFO L272 TraceCheckUtils]: 62: Hoare triple {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 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)); {4790#true} is VALID [2022-04-28 07:43:13,737 INFO L290 TraceCheckUtils]: 63: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:13,737 INFO L290 TraceCheckUtils]: 64: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:13,737 INFO L290 TraceCheckUtils]: 65: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:13,737 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4790#true} {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} #54#return; {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:13,738 INFO L290 TraceCheckUtils]: 67: Hoare triple {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 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; {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:13,738 INFO L290 TraceCheckUtils]: 68: Hoare triple {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} assume !false; {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:13,738 INFO L272 TraceCheckUtils]: 69: Hoare triple {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 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)); {4790#true} is VALID [2022-04-28 07:43:13,738 INFO L290 TraceCheckUtils]: 70: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:13,738 INFO L290 TraceCheckUtils]: 71: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:13,738 INFO L290 TraceCheckUtils]: 72: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:13,739 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4790#true} {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} #54#return; {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} is VALID [2022-04-28 07:43:13,739 INFO L290 TraceCheckUtils]: 74: Hoare triple {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 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; {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:43:13,739 INFO L290 TraceCheckUtils]: 75: Hoare triple {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:43:13,740 INFO L272 TraceCheckUtils]: 76: Hoare triple {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4790#true} is VALID [2022-04-28 07:43:13,740 INFO L290 TraceCheckUtils]: 77: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 07:43:13,740 INFO L290 TraceCheckUtils]: 78: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 07:43:13,740 INFO L290 TraceCheckUtils]: 79: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 07:43:13,740 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {4790#true} {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #54#return; {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:43:13,741 INFO L290 TraceCheckUtils]: 81: Hoare triple {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5048#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 07:43:13,741 INFO L272 TraceCheckUtils]: 82: Hoare triple {5048#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5052#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:13,742 INFO L290 TraceCheckUtils]: 83: Hoare triple {5052#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5056#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:13,742 INFO L290 TraceCheckUtils]: 84: Hoare triple {5056#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4791#false} is VALID [2022-04-28 07:43:13,742 INFO L290 TraceCheckUtils]: 85: Hoare triple {4791#false} assume !false; {4791#false} is VALID [2022-04-28 07:43:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 07:43:13,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:14,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:14,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857362424] [2022-04-28 07:43:14,497 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:14,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401723322] [2022-04-28 07:43:14,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401723322] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:14,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:14,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-28 07:43:14,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:14,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [530092308] [2022-04-28 07:43:14,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [530092308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:14,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:14,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 07:43:14,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551991162] [2022-04-28 07:43:14,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:14,498 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 86 [2022-04-28 07:43:14,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:14,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:43:14,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:43:14,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 07:43:14,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:14,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 07:43:14,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-28 07:43:14,538 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:43:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:15,487 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-28 07:43:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 07:43:15,487 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 86 [2022-04-28 07:43:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:43:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-28 07:43:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:43:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-28 07:43:15,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 68 transitions. [2022-04-28 07:43:15,537 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:15,543 INFO L225 Difference]: With dead ends: 63 [2022-04-28 07:43:15,543 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 07:43:15,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-28 07:43:15,546 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:15,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 389 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 07:43:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 07:43:15,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-28 07:43:15,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:15,587 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:15,588 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:15,588 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:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:15,589 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-28 07:43:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 07:43:15,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:15,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:15,589 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:15,590 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:15,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:15,591 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-28 07:43:15,591 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 07:43:15,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:15,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:15,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:15,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:15,591 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:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-28 07:43:15,592 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 86 [2022-04-28 07:43:15,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:15,592 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-28 07:43:15,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:43:15,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 67 transitions. [2022-04-28 07:43:15,668 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:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 07:43:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 07:43:15,669 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:15,669 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:15,676 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:15,874 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:15,874 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:15,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 19 times [2022-04-28 07:43:15,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:15,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [431306382] [2022-04-28 07:43:15,949 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:15,949 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:15,950 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 20 times [2022-04-28 07:43:15,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:15,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924958906] [2022-04-28 07:43:15,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:15,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:15,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:15,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476969307] [2022-04-28 07:43:15,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:43:15,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:15,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:15,964 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:15,965 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:16,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:43:16,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:16,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 07:43:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:16,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:17,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {5598#true} call ULTIMATE.init(); {5598#true} is VALID [2022-04-28 07:43:17,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {5598#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); {5598#true} is VALID [2022-04-28 07:43:17,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 07:43:17,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5598#true} {5598#true} #60#return; {5598#true} is VALID [2022-04-28 07:43:17,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {5598#true} call #t~ret5 := main(); {5598#true} is VALID [2022-04-28 07:43:17,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {5598#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; {5598#true} is VALID [2022-04-28 07:43:17,044 INFO L272 TraceCheckUtils]: 6: Hoare triple {5598#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {5598#true} is VALID [2022-04-28 07:43:17,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 07:43:17,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 07:43:17,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 07:43:17,045 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5598#true} {5598#true} #52#return; {5598#true} is VALID [2022-04-28 07:43:17,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {5598#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:17,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {5636#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:17,045 INFO L272 TraceCheckUtils]: 13: Hoare triple {5636#(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)); {5598#true} is VALID [2022-04-28 07:43:17,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 07:43:17,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 07:43:17,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 07:43:17,046 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5598#true} {5636#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {5636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:17,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {5636#(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; {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:17,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:17,047 INFO L272 TraceCheckUtils]: 20: Hoare triple {5658#(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)); {5598#true} is VALID [2022-04-28 07:43:17,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 07:43:17,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 07:43:17,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 07:43:17,047 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5598#true} {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:17,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {5658#(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; {5680#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:17,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {5680#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {5680#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:17,048 INFO L272 TraceCheckUtils]: 27: Hoare triple {5680#(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)); {5598#true} is VALID [2022-04-28 07:43:17,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 07:43:17,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 07:43:17,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 07:43:17,049 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5598#true} {5680#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {5680#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:17,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {5680#(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; {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:17,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:17,050 INFO L272 TraceCheckUtils]: 34: Hoare triple {5702#(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)); {5598#true} is VALID [2022-04-28 07:43:17,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 07:43:17,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 07:43:17,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 07:43:17,052 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5598#true} {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #54#return; {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:43:17,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {5702#(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; {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:43:17,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} assume !false; {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:43:17,053 INFO L272 TraceCheckUtils]: 41: Hoare triple {5724#(and (= 2 (+ (- 2) main_~c~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)); {5598#true} is VALID [2022-04-28 07:43:17,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 07:43:17,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 07:43:17,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 07:43:17,054 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5598#true} {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} #54#return; {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:43:17,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {5724#(and (= 2 (+ (- 2) main_~c~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; {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:17,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:17,054 INFO L272 TraceCheckUtils]: 48: Hoare triple {5746#(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)); {5598#true} is VALID [2022-04-28 07:43:17,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 07:43:17,055 INFO L290 TraceCheckUtils]: 50: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 07:43:17,055 INFO L290 TraceCheckUtils]: 51: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 07:43:17,057 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5598#true} {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #54#return; {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:17,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {5746#(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; {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:17,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} assume !false; {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:17,058 INFO L272 TraceCheckUtils]: 55: Hoare triple {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 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)); {5598#true} is VALID [2022-04-28 07:43:17,058 INFO L290 TraceCheckUtils]: 56: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 07:43:17,058 INFO L290 TraceCheckUtils]: 57: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 07:43:17,058 INFO L290 TraceCheckUtils]: 58: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 07:43:17,058 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5598#true} {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} #54#return; {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:17,059 INFO L290 TraceCheckUtils]: 60: Hoare triple {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 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; {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-28 07:43:17,059 INFO L290 TraceCheckUtils]: 61: Hoare triple {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-28 07:43:17,059 INFO L272 TraceCheckUtils]: 62: Hoare triple {5790#(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)); {5598#true} is VALID [2022-04-28 07:43:17,059 INFO L290 TraceCheckUtils]: 63: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 07:43:17,059 INFO L290 TraceCheckUtils]: 64: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 07:43:17,059 INFO L290 TraceCheckUtils]: 65: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 07:43:17,064 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5598#true} {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #54#return; {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-28 07:43:17,064 INFO L290 TraceCheckUtils]: 67: Hoare triple {5790#(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; {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 07:43:17,065 INFO L290 TraceCheckUtils]: 68: Hoare triple {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !false; {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 07:43:17,065 INFO L272 TraceCheckUtils]: 69: Hoare triple {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5598#true} is VALID [2022-04-28 07:43:17,065 INFO L290 TraceCheckUtils]: 70: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 07:43:17,065 INFO L290 TraceCheckUtils]: 71: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 07:43:17,065 INFO L290 TraceCheckUtils]: 72: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 07:43:17,065 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5598#true} {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #54#return; {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 07:43:17,066 INFO L290 TraceCheckUtils]: 74: Hoare triple {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} is VALID [2022-04-28 07:43:17,066 INFO L290 TraceCheckUtils]: 75: Hoare triple {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} assume !false; {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} is VALID [2022-04-28 07:43:17,066 INFO L272 TraceCheckUtils]: 76: Hoare triple {5834#(and (= 5 (+ main_~y~0 (- 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)); {5598#true} is VALID [2022-04-28 07:43:17,066 INFO L290 TraceCheckUtils]: 77: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 07:43:17,066 INFO L290 TraceCheckUtils]: 78: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 07:43:17,066 INFO L290 TraceCheckUtils]: 79: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 07:43:17,067 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5598#true} {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} #54#return; {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} is VALID [2022-04-28 07:43:17,067 INFO L290 TraceCheckUtils]: 81: Hoare triple {5834#(and (= 5 (+ main_~y~0 (- 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; {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:43:17,067 INFO L290 TraceCheckUtils]: 82: Hoare triple {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !false; {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:43:17,068 INFO L272 TraceCheckUtils]: 83: Hoare triple {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5598#true} is VALID [2022-04-28 07:43:17,068 INFO L290 TraceCheckUtils]: 84: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 07:43:17,068 INFO L290 TraceCheckUtils]: 85: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 07:43:17,068 INFO L290 TraceCheckUtils]: 86: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 07:43:17,068 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {5598#true} {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} #54#return; {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:43:17,069 INFO L290 TraceCheckUtils]: 88: Hoare triple {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {5878#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:43:17,069 INFO L272 TraceCheckUtils]: 89: Hoare triple {5878#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:17,070 INFO L290 TraceCheckUtils]: 90: Hoare triple {5882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:17,070 INFO L290 TraceCheckUtils]: 91: Hoare triple {5886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5599#false} is VALID [2022-04-28 07:43:17,070 INFO L290 TraceCheckUtils]: 92: Hoare triple {5599#false} assume !false; {5599#false} is VALID [2022-04-28 07:43:17,071 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:17,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:17,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:17,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924958906] [2022-04-28 07:43:17,294 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:17,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476969307] [2022-04-28 07:43:17,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476969307] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:17,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:17,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 07:43:17,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:17,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [431306382] [2022-04-28 07:43:17,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [431306382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:17,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:17,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 07:43:17,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680158007] [2022-04-28 07:43:17,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:17,296 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:17,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:17,296 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:17,336 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:17,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 07:43:17,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:17,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 07:43:17,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:43:17,337 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:18,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:18,407 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-28 07:43:18,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 07:43:18,408 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:18,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:18,408 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:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-28 07:43:18,409 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:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-28 07:43:18,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 72 transitions. [2022-04-28 07:43:18,465 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:18,466 INFO L225 Difference]: With dead ends: 66 [2022-04-28 07:43:18,466 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 07:43:18,466 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:18,466 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:18,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 07:43:18,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 07:43:18,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 07:43:18,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:18,509 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:18,509 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:18,509 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:18,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:18,511 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-28 07:43:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-28 07:43:18,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:18,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:18,511 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:18,511 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:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:18,512 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-28 07:43:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-28 07:43:18,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:18,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:18,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:18,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:18,514 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:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-04-28 07:43:18,515 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 93 [2022-04-28 07:43:18,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:18,515 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-04-28 07:43:18,516 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:18,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 71 transitions. [2022-04-28 07:43:18,599 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:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-28 07:43:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 07:43:18,600 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:18,600 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:18,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:18,805 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:18,805 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:18,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:18,806 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 21 times [2022-04-28 07:43:18,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:18,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1899162297] [2022-04-28 07:43:18,872 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:18,873 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:18,873 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:18,873 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 22 times [2022-04-28 07:43:18,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:18,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744371998] [2022-04-28 07:43:18,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:18,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:18,888 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:18,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454457536] [2022-04-28 07:43:18,889 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:43:18,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:18,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:18,895 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:18,896 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:19,933 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:43:19,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:19,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 07:43:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:19,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:20,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {6314#true} call ULTIMATE.init(); {6314#true} is VALID [2022-04-28 07:43:20,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {6314#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); {6314#true} is VALID [2022-04-28 07:43:20,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 07:43:20,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6314#true} {6314#true} #60#return; {6314#true} is VALID [2022-04-28 07:43:20,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {6314#true} call #t~ret5 := main(); {6314#true} is VALID [2022-04-28 07:43:20,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {6314#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; {6314#true} is VALID [2022-04-28 07:43:20,436 INFO L272 TraceCheckUtils]: 6: Hoare triple {6314#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {6314#true} is VALID [2022-04-28 07:43:20,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 07:43:20,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 07:43:20,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 07:43:20,436 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6314#true} {6314#true} #52#return; {6314#true} is VALID [2022-04-28 07:43:20,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {6314#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6352#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:20,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {6352#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6352#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:20,437 INFO L272 TraceCheckUtils]: 13: Hoare triple {6352#(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)); {6314#true} is VALID [2022-04-28 07:43:20,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 07:43:20,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 07:43:20,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 07:43:20,437 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6314#true} {6352#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {6352#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:20,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {6352#(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; {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:20,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:20,438 INFO L272 TraceCheckUtils]: 20: Hoare triple {6374#(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)); {6314#true} is VALID [2022-04-28 07:43:20,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 07:43:20,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 07:43:20,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 07:43:20,439 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6314#true} {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:20,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {6374#(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; {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:20,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:20,439 INFO L272 TraceCheckUtils]: 27: Hoare triple {6396#(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)); {6314#true} is VALID [2022-04-28 07:43:20,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 07:43:20,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 07:43:20,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 07:43:20,441 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6314#true} {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:20,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {6396#(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; {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:43:20,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:43:20,442 INFO L272 TraceCheckUtils]: 34: Hoare triple {6418#(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)); {6314#true} is VALID [2022-04-28 07:43:20,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 07:43:20,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 07:43:20,442 INFO L290 TraceCheckUtils]: 37: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 07:43:20,442 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6314#true} {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #54#return; {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:43:20,443 INFO L290 TraceCheckUtils]: 39: Hoare triple {6418#(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; {6440#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:43:20,443 INFO L290 TraceCheckUtils]: 40: Hoare triple {6440#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {6440#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:43:20,443 INFO L272 TraceCheckUtils]: 41: Hoare triple {6440#(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)); {6314#true} is VALID [2022-04-28 07:43:20,443 INFO L290 TraceCheckUtils]: 42: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 07:43:20,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 07:43:20,443 INFO L290 TraceCheckUtils]: 44: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 07:43:20,444 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6314#true} {6440#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {6440#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:43:20,444 INFO L290 TraceCheckUtils]: 46: Hoare triple {6440#(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; {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:20,445 INFO L290 TraceCheckUtils]: 47: Hoare triple {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:20,445 INFO L272 TraceCheckUtils]: 48: Hoare triple {6462#(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)); {6314#true} is VALID [2022-04-28 07:43:20,445 INFO L290 TraceCheckUtils]: 49: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 07:43:20,445 INFO L290 TraceCheckUtils]: 50: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 07:43:20,445 INFO L290 TraceCheckUtils]: 51: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 07:43:20,445 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6314#true} {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:20,446 INFO L290 TraceCheckUtils]: 53: Hoare triple {6462#(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; {6484#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:43:20,446 INFO L290 TraceCheckUtils]: 54: Hoare triple {6484#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {6484#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:43:20,446 INFO L272 TraceCheckUtils]: 55: Hoare triple {6484#(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)); {6314#true} is VALID [2022-04-28 07:43:20,446 INFO L290 TraceCheckUtils]: 56: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 07:43:20,446 INFO L290 TraceCheckUtils]: 57: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 07:43:20,446 INFO L290 TraceCheckUtils]: 58: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 07:43:20,447 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6314#true} {6484#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {6484#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:43:20,447 INFO L290 TraceCheckUtils]: 60: Hoare triple {6484#(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; {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:43:20,447 INFO L290 TraceCheckUtils]: 61: Hoare triple {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:43:20,447 INFO L272 TraceCheckUtils]: 62: Hoare triple {6506#(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)); {6314#true} is VALID [2022-04-28 07:43:20,448 INFO L290 TraceCheckUtils]: 63: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 07:43:20,448 INFO L290 TraceCheckUtils]: 64: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 07:43:20,448 INFO L290 TraceCheckUtils]: 65: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 07:43:20,448 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6314#true} {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:43:20,448 INFO L290 TraceCheckUtils]: 67: Hoare triple {6506#(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; {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 07:43:20,449 INFO L290 TraceCheckUtils]: 68: Hoare triple {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 07:43:20,449 INFO L272 TraceCheckUtils]: 69: Hoare triple {6528#(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)); {6314#true} is VALID [2022-04-28 07:43:20,449 INFO L290 TraceCheckUtils]: 70: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 07:43:20,449 INFO L290 TraceCheckUtils]: 71: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 07:43:20,449 INFO L290 TraceCheckUtils]: 72: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 07:43:20,449 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6314#true} {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #54#return; {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 07:43:20,450 INFO L290 TraceCheckUtils]: 74: Hoare triple {6528#(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; {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:43:20,450 INFO L290 TraceCheckUtils]: 75: Hoare triple {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !false; {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:43:20,450 INFO L272 TraceCheckUtils]: 76: Hoare triple {6550#(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)); {6314#true} is VALID [2022-04-28 07:43:20,450 INFO L290 TraceCheckUtils]: 77: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 07:43:20,450 INFO L290 TraceCheckUtils]: 78: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 07:43:20,450 INFO L290 TraceCheckUtils]: 79: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 07:43:20,451 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6314#true} {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #54#return; {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:43:20,451 INFO L290 TraceCheckUtils]: 81: Hoare triple {6550#(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; {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-28 07:43:20,452 INFO L290 TraceCheckUtils]: 82: Hoare triple {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !false; {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-28 07:43:20,452 INFO L272 TraceCheckUtils]: 83: Hoare triple {6572#(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)); {6314#true} is VALID [2022-04-28 07:43:20,452 INFO L290 TraceCheckUtils]: 84: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 07:43:20,452 INFO L290 TraceCheckUtils]: 85: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 07:43:20,452 INFO L290 TraceCheckUtils]: 86: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 07:43:20,452 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {6314#true} {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} #54#return; {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-28 07:43:20,453 INFO L290 TraceCheckUtils]: 88: Hoare triple {6572#(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; {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-28 07:43:20,453 INFO L290 TraceCheckUtils]: 89: Hoare triple {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !false; {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-28 07:43:20,453 INFO L272 TraceCheckUtils]: 90: Hoare triple {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6314#true} is VALID [2022-04-28 07:43:20,453 INFO L290 TraceCheckUtils]: 91: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 07:43:20,453 INFO L290 TraceCheckUtils]: 92: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 07:43:20,453 INFO L290 TraceCheckUtils]: 93: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 07:43:20,454 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6314#true} {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} #54#return; {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-28 07:43:20,454 INFO L290 TraceCheckUtils]: 95: Hoare triple {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !(~c~0 < ~k~0); {6616#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} is VALID [2022-04-28 07:43:20,455 INFO L272 TraceCheckUtils]: 96: Hoare triple {6616#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:20,455 INFO L290 TraceCheckUtils]: 97: Hoare triple {6620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:20,455 INFO L290 TraceCheckUtils]: 98: Hoare triple {6624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6315#false} is VALID [2022-04-28 07:43:20,456 INFO L290 TraceCheckUtils]: 99: Hoare triple {6315#false} assume !false; {6315#false} is VALID [2022-04-28 07:43:20,456 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:20,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:20,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:20,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744371998] [2022-04-28 07:43:20,695 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:20,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454457536] [2022-04-28 07:43:20,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454457536] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:20,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:20,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-28 07:43:20,695 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:20,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1899162297] [2022-04-28 07:43:20,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1899162297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:20,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:20,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 07:43:20,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746816557] [2022-04-28 07:43:20,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:20,696 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:20,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:20,696 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:20,738 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:20,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 07:43:20,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:20,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 07:43:20,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:43:20,738 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:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:21,956 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-28 07:43:21,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 07:43:21,957 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:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:21,957 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:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-28 07:43:21,958 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:21,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-28 07:43:21,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 76 transitions. [2022-04-28 07:43:22,008 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:22,008 INFO L225 Difference]: With dead ends: 69 [2022-04-28 07:43:22,008 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 07:43:22,009 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:22,009 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:22,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 485 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 07:43:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 07:43:22,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-28 07:43:22,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:22,058 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:22,058 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:22,058 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:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:22,059 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-28 07:43:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-28 07:43:22,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:22,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:22,065 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:22,065 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:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:22,067 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-28 07:43:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-28 07:43:22,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:22,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:22,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:22,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:22,067 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:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-04-28 07:43:22,068 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 100 [2022-04-28 07:43:22,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:22,069 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-04-28 07:43:22,069 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:22,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 75 transitions. [2022-04-28 07:43:22,160 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:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-28 07:43:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 07:43:22,161 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:22,161 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:22,168 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:22,361 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:22,361 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:22,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:22,362 INFO L85 PathProgramCache]: Analyzing trace with hash 893158889, now seen corresponding path program 23 times [2022-04-28 07:43:22,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:22,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [349618844] [2022-04-28 07:43:22,431 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:22,432 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:22,432 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:22,432 INFO L85 PathProgramCache]: Analyzing trace with hash 893158889, now seen corresponding path program 24 times [2022-04-28 07:43:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:22,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385301231] [2022-04-28 07:43:22,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:22,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:22,449 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:22,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [922770966] [2022-04-28 07:43:22,450 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:43:22,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:22,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:22,451 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:43:22,451 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:22,661 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 07:43:22,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:22,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 07:43:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:22,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:23,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {7070#true} call ULTIMATE.init(); {7070#true} is VALID [2022-04-28 07:43:23,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {7070#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); {7070#true} is VALID [2022-04-28 07:43:23,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 07:43:23,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7070#true} {7070#true} #60#return; {7070#true} is VALID [2022-04-28 07:43:23,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {7070#true} call #t~ret5 := main(); {7070#true} is VALID [2022-04-28 07:43:23,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {7070#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; {7070#true} is VALID [2022-04-28 07:43:23,265 INFO L272 TraceCheckUtils]: 6: Hoare triple {7070#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {7070#true} is VALID [2022-04-28 07:43:23,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 07:43:23,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 07:43:23,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 07:43:23,265 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7070#true} {7070#true} #52#return; {7070#true} is VALID [2022-04-28 07:43:23,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {7070#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:23,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {7108#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:23,266 INFO L272 TraceCheckUtils]: 13: Hoare triple {7108#(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)); {7070#true} is VALID [2022-04-28 07:43:23,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 07:43:23,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 07:43:23,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 07:43:23,266 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7070#true} {7108#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {7108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:23,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {7108#(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; {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:43:23,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:43:23,267 INFO L272 TraceCheckUtils]: 20: Hoare triple {7130#(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)); {7070#true} is VALID [2022-04-28 07:43:23,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 07:43:23,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 07:43:23,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 07:43:23,268 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7070#true} {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:43:23,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {7130#(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; {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:43:23,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:43:23,269 INFO L272 TraceCheckUtils]: 27: Hoare triple {7152#(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)); {7070#true} is VALID [2022-04-28 07:43:23,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 07:43:23,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 07:43:23,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 07:43:23,275 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7070#true} {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 07:43:23,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {7152#(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; {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:43:23,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:43:23,276 INFO L272 TraceCheckUtils]: 34: Hoare triple {7174#(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)); {7070#true} is VALID [2022-04-28 07:43:23,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 07:43:23,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 07:43:23,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 07:43:23,277 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7070#true} {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #54#return; {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:43:23,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {7174#(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; {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:43:23,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:43:23,278 INFO L272 TraceCheckUtils]: 41: Hoare triple {7196#(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)); {7070#true} is VALID [2022-04-28 07:43:23,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 07:43:23,278 INFO L290 TraceCheckUtils]: 43: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 07:43:23,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 07:43:23,279 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7070#true} {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:43:23,279 INFO L290 TraceCheckUtils]: 46: Hoare triple {7196#(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; {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:23,280 INFO L290 TraceCheckUtils]: 47: Hoare triple {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:23,280 INFO L272 TraceCheckUtils]: 48: Hoare triple {7218#(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)); {7070#true} is VALID [2022-04-28 07:43:23,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 07:43:23,280 INFO L290 TraceCheckUtils]: 50: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 07:43:23,280 INFO L290 TraceCheckUtils]: 51: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 07:43:23,280 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7070#true} {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:23,281 INFO L290 TraceCheckUtils]: 53: Hoare triple {7218#(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; {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:23,281 INFO L290 TraceCheckUtils]: 54: Hoare triple {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !false; {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:23,281 INFO L272 TraceCheckUtils]: 55: Hoare triple {7240#(and (= main_~c~0 6) (< 5 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)); {7070#true} is VALID [2022-04-28 07:43:23,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 07:43:23,282 INFO L290 TraceCheckUtils]: 57: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 07:43:23,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 07:43:23,282 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7070#true} {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} #54#return; {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:23,283 INFO L290 TraceCheckUtils]: 60: Hoare triple {7240#(and (= main_~c~0 6) (< 5 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; {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} is VALID [2022-04-28 07:43:23,283 INFO L290 TraceCheckUtils]: 61: Hoare triple {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} assume !false; {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} is VALID [2022-04-28 07:43:23,283 INFO L272 TraceCheckUtils]: 62: Hoare triple {7262#(and (= 7 main_~y~0) (= (+ (- 1) 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)); {7070#true} is VALID [2022-04-28 07:43:23,283 INFO L290 TraceCheckUtils]: 63: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 07:43:23,283 INFO L290 TraceCheckUtils]: 64: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 07:43:23,283 INFO L290 TraceCheckUtils]: 65: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 07:43:23,284 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7070#true} {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} #54#return; {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} is VALID [2022-04-28 07:43:23,284 INFO L290 TraceCheckUtils]: 67: Hoare triple {7262#(and (= 7 main_~y~0) (= (+ (- 1) 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; {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} is VALID [2022-04-28 07:43:23,285 INFO L290 TraceCheckUtils]: 68: Hoare triple {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} assume !false; {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} is VALID [2022-04-28 07:43:23,285 INFO L272 TraceCheckUtils]: 69: Hoare triple {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 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)); {7070#true} is VALID [2022-04-28 07:43:23,285 INFO L290 TraceCheckUtils]: 70: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 07:43:23,285 INFO L290 TraceCheckUtils]: 71: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 07:43:23,285 INFO L290 TraceCheckUtils]: 72: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 07:43:23,286 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7070#true} {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} #54#return; {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} is VALID [2022-04-28 07:43:23,286 INFO L290 TraceCheckUtils]: 74: Hoare triple {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 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; {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-28 07:43:23,286 INFO L290 TraceCheckUtils]: 75: Hoare triple {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} assume !false; {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-28 07:43:23,286 INFO L272 TraceCheckUtils]: 76: Hoare triple {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7070#true} is VALID [2022-04-28 07:43:23,286 INFO L290 TraceCheckUtils]: 77: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 07:43:23,287 INFO L290 TraceCheckUtils]: 78: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 07:43:23,287 INFO L290 TraceCheckUtils]: 79: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 07:43:23,287 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7070#true} {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} #54#return; {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-28 07:43:23,288 INFO L290 TraceCheckUtils]: 81: Hoare triple {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-28 07:43:23,288 INFO L290 TraceCheckUtils]: 82: Hoare triple {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} assume !false; {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-28 07:43:23,288 INFO L272 TraceCheckUtils]: 83: Hoare triple {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7070#true} is VALID [2022-04-28 07:43:23,288 INFO L290 TraceCheckUtils]: 84: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 07:43:23,288 INFO L290 TraceCheckUtils]: 85: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 07:43:23,288 INFO L290 TraceCheckUtils]: 86: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 07:43:23,289 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {7070#true} {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} #54#return; {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-28 07:43:23,289 INFO L290 TraceCheckUtils]: 88: Hoare triple {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-28 07:43:23,290 INFO L290 TraceCheckUtils]: 89: Hoare triple {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} assume !false; {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-28 07:43:23,290 INFO L272 TraceCheckUtils]: 90: Hoare triple {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7070#true} is VALID [2022-04-28 07:43:23,290 INFO L290 TraceCheckUtils]: 91: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 07:43:23,290 INFO L290 TraceCheckUtils]: 92: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 07:43:23,290 INFO L290 TraceCheckUtils]: 93: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 07:43:23,290 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7070#true} {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} #54#return; {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-28 07:43:23,291 INFO L290 TraceCheckUtils]: 95: Hoare triple {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 07:43:23,291 INFO L290 TraceCheckUtils]: 96: Hoare triple {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !false; {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 07:43:23,291 INFO L272 TraceCheckUtils]: 97: Hoare triple {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 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)); {7070#true} is VALID [2022-04-28 07:43:23,291 INFO L290 TraceCheckUtils]: 98: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 07:43:23,291 INFO L290 TraceCheckUtils]: 99: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 07:43:23,292 INFO L290 TraceCheckUtils]: 100: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 07:43:23,292 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {7070#true} {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #54#return; {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 07:43:23,292 INFO L290 TraceCheckUtils]: 102: Hoare triple {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {7394#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-28 07:43:23,293 INFO L272 TraceCheckUtils]: 103: Hoare triple {7394#(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)); {7398#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:23,293 INFO L290 TraceCheckUtils]: 104: Hoare triple {7398#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7402#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:23,294 INFO L290 TraceCheckUtils]: 105: Hoare triple {7402#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7071#false} is VALID [2022-04-28 07:43:23,294 INFO L290 TraceCheckUtils]: 106: Hoare triple {7071#false} assume !false; {7071#false} is VALID [2022-04-28 07:43:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 26 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 07:43:23,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:24,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:24,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385301231] [2022-04-28 07:43:24,077 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:24,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922770966] [2022-04-28 07:43:24,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922770966] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:24,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:24,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-28 07:43:24,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:24,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [349618844] [2022-04-28 07:43:24,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [349618844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:24,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:24,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 07:43:24,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061307505] [2022-04-28 07:43:24,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:24,079 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 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:43:24,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:24,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 07:43:24,126 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:24,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 07:43:24,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:24,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 07:43:24,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2022-04-28 07:43:24,127 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 07:43:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:25,914 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-28 07:43:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 07:43:25,914 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 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:43:25,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 07:43:25,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-28 07:43:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 07:43:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-28 07:43:25,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 80 transitions. [2022-04-28 07:43:25,976 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:43:25,977 INFO L225 Difference]: With dead ends: 72 [2022-04-28 07:43:25,977 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 07:43:25,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2022-04-28 07:43:25,978 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:25,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 527 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 07:43:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 07:43:26,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 07:43:26,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:26,036 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:43:26,036 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:43:26,036 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:43:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:26,037 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-28 07:43:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-28 07:43:26,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:26,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:26,038 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:43:26,038 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:43:26,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:26,039 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-28 07:43:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-28 07:43:26,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:26,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:26,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:26,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:26,040 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:43:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-04-28 07:43:26,041 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 107 [2022-04-28 07:43:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:26,041 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-04-28 07:43:26,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 07:43:26,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 79 transitions. [2022-04-28 07:43:26,137 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:43:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-28 07:43:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-28 07:43:26,138 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:26,138 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:43:26,144 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:43:26,338 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:43:26,338 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:26,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:26,339 INFO L85 PathProgramCache]: Analyzing trace with hash 363946760, now seen corresponding path program 25 times [2022-04-28 07:43:26,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:26,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1720331075] [2022-04-28 07:43:26,408 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:26,408 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:26,408 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:26,409 INFO L85 PathProgramCache]: Analyzing trace with hash 363946760, now seen corresponding path program 26 times [2022-04-28 07:43:26,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:26,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547515388] [2022-04-28 07:43:26,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:26,418 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:26,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1526239749] [2022-04-28 07:43:26,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:43:26,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:26,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:26,420 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:43:26,420 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:43:27,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:43:27,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:27,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 07:43:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:27,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:27,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {7998#true} call ULTIMATE.init(); {7998#true} is VALID [2022-04-28 07:43:27,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {7998#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); {7998#true} is VALID [2022-04-28 07:43:27,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 07:43:27,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7998#true} {7998#true} #60#return; {7998#true} is VALID [2022-04-28 07:43:27,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {7998#true} call #t~ret5 := main(); {7998#true} is VALID [2022-04-28 07:43:27,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {7998#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; {7998#true} is VALID [2022-04-28 07:43:27,751 INFO L272 TraceCheckUtils]: 6: Hoare triple {7998#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {7998#true} is VALID [2022-04-28 07:43:27,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 07:43:27,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 07:43:27,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 07:43:27,751 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7998#true} {7998#true} #52#return; {7998#true} is VALID [2022-04-28 07:43:27,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {7998#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:27,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {8036#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {8036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:27,752 INFO L272 TraceCheckUtils]: 13: Hoare triple {8036#(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)); {7998#true} is VALID [2022-04-28 07:43:27,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 07:43:27,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 07:43:27,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 07:43:27,752 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7998#true} {8036#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {8036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:27,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {8036#(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; {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:27,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:27,753 INFO L272 TraceCheckUtils]: 20: Hoare triple {8058#(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)); {7998#true} is VALID [2022-04-28 07:43:27,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 07:43:27,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 07:43:27,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 07:43:27,754 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7998#true} {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:43:27,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {8058#(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; {8080#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:27,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {8080#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {8080#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:27,755 INFO L272 TraceCheckUtils]: 27: Hoare triple {8080#(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)); {7998#true} is VALID [2022-04-28 07:43:27,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 07:43:27,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 07:43:27,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 07:43:27,755 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7998#true} {8080#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {8080#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:43:27,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {8080#(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; {8102#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:43:27,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {8102#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {8102#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:43:27,756 INFO L272 TraceCheckUtils]: 34: Hoare triple {8102#(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)); {7998#true} is VALID [2022-04-28 07:43:27,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 07:43:27,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 07:43:27,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 07:43:27,757 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7998#true} {8102#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {8102#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:43:27,757 INFO L290 TraceCheckUtils]: 39: Hoare triple {8102#(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; {8124#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:43:27,757 INFO L290 TraceCheckUtils]: 40: Hoare triple {8124#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {8124#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:43:27,757 INFO L272 TraceCheckUtils]: 41: Hoare triple {8124#(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)); {7998#true} is VALID [2022-04-28 07:43:27,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 07:43:27,758 INFO L290 TraceCheckUtils]: 43: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 07:43:27,758 INFO L290 TraceCheckUtils]: 44: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 07:43:27,758 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7998#true} {8124#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {8124#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:43:27,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {8124#(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; {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:43:27,759 INFO L290 TraceCheckUtils]: 47: Hoare triple {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:43:27,759 INFO L272 TraceCheckUtils]: 48: Hoare triple {8146#(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)); {7998#true} is VALID [2022-04-28 07:43:27,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 07:43:27,759 INFO L290 TraceCheckUtils]: 50: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 07:43:27,759 INFO L290 TraceCheckUtils]: 51: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 07:43:27,759 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7998#true} {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #54#return; {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:43:27,760 INFO L290 TraceCheckUtils]: 53: Hoare triple {8146#(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; {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:27,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:27,760 INFO L272 TraceCheckUtils]: 55: Hoare triple {8168#(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)); {7998#true} is VALID [2022-04-28 07:43:27,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 07:43:27,760 INFO L290 TraceCheckUtils]: 57: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 07:43:27,760 INFO L290 TraceCheckUtils]: 58: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 07:43:27,761 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7998#true} {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:27,761 INFO L290 TraceCheckUtils]: 60: Hoare triple {8168#(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; {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 07:43:27,762 INFO L290 TraceCheckUtils]: 61: Hoare triple {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !false; {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 07:43:27,762 INFO L272 TraceCheckUtils]: 62: Hoare triple {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7998#true} is VALID [2022-04-28 07:43:27,762 INFO L290 TraceCheckUtils]: 63: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 07:43:27,762 INFO L290 TraceCheckUtils]: 64: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 07:43:27,762 INFO L290 TraceCheckUtils]: 65: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 07:43:27,762 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7998#true} {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #54#return; {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 07:43:27,763 INFO L290 TraceCheckUtils]: 67: Hoare triple {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8212#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:43:27,763 INFO L290 TraceCheckUtils]: 68: Hoare triple {8212#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {8212#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:43:27,763 INFO L272 TraceCheckUtils]: 69: Hoare triple {8212#(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)); {7998#true} is VALID [2022-04-28 07:43:27,763 INFO L290 TraceCheckUtils]: 70: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 07:43:27,763 INFO L290 TraceCheckUtils]: 71: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 07:43:27,763 INFO L290 TraceCheckUtils]: 72: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 07:43:27,764 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7998#true} {8212#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {8212#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:43:27,764 INFO L290 TraceCheckUtils]: 74: Hoare triple {8212#(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; {8234#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:43:27,764 INFO L290 TraceCheckUtils]: 75: Hoare triple {8234#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {8234#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:43:27,764 INFO L272 TraceCheckUtils]: 76: Hoare triple {8234#(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)); {7998#true} is VALID [2022-04-28 07:43:27,764 INFO L290 TraceCheckUtils]: 77: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 07:43:27,765 INFO L290 TraceCheckUtils]: 78: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 07:43:27,765 INFO L290 TraceCheckUtils]: 79: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 07:43:27,766 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7998#true} {8234#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {8234#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:43:27,766 INFO L290 TraceCheckUtils]: 81: Hoare triple {8234#(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; {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:43:27,766 INFO L290 TraceCheckUtils]: 82: Hoare triple {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:43:27,767 INFO L272 TraceCheckUtils]: 83: Hoare triple {8256#(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)); {7998#true} is VALID [2022-04-28 07:43:27,767 INFO L290 TraceCheckUtils]: 84: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 07:43:27,767 INFO L290 TraceCheckUtils]: 85: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 07:43:27,767 INFO L290 TraceCheckUtils]: 86: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 07:43:27,767 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {7998#true} {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #54#return; {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:43:27,768 INFO L290 TraceCheckUtils]: 88: Hoare triple {8256#(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; {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:27,768 INFO L290 TraceCheckUtils]: 89: Hoare triple {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} assume !false; {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:27,768 INFO L272 TraceCheckUtils]: 90: Hoare triple {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 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)); {7998#true} is VALID [2022-04-28 07:43:27,768 INFO L290 TraceCheckUtils]: 91: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 07:43:27,768 INFO L290 TraceCheckUtils]: 92: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 07:43:27,768 INFO L290 TraceCheckUtils]: 93: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 07:43:27,783 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7998#true} {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} #54#return; {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:27,784 INFO L290 TraceCheckUtils]: 95: Hoare triple {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 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; {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:43:27,784 INFO L290 TraceCheckUtils]: 96: Hoare triple {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} assume !false; {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:43:27,785 INFO L272 TraceCheckUtils]: 97: Hoare triple {8300#(and (= main_~y~0 12) (= 9 (+ 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)); {7998#true} is VALID [2022-04-28 07:43:27,785 INFO L290 TraceCheckUtils]: 98: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 07:43:27,786 INFO L290 TraceCheckUtils]: 99: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 07:43:27,786 INFO L290 TraceCheckUtils]: 100: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 07:43:27,786 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {7998#true} {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} #54#return; {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 07:43:27,787 INFO L290 TraceCheckUtils]: 102: Hoare triple {8300#(and (= main_~y~0 12) (= 9 (+ 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; {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:43:27,788 INFO L290 TraceCheckUtils]: 103: Hoare triple {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !false; {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:43:27,788 INFO L272 TraceCheckUtils]: 104: Hoare triple {8322#(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)); {7998#true} is VALID [2022-04-28 07:43:27,788 INFO L290 TraceCheckUtils]: 105: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 07:43:27,788 INFO L290 TraceCheckUtils]: 106: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 07:43:27,788 INFO L290 TraceCheckUtils]: 107: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 07:43:27,789 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {7998#true} {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #54#return; {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:43:27,789 INFO L290 TraceCheckUtils]: 109: Hoare triple {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !(~c~0 < ~k~0); {8344#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:43:27,790 INFO L272 TraceCheckUtils]: 110: Hoare triple {8344#(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)); {8348#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:27,790 INFO L290 TraceCheckUtils]: 111: Hoare triple {8348#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8352#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:27,791 INFO L290 TraceCheckUtils]: 112: Hoare triple {8352#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7999#false} is VALID [2022-04-28 07:43:27,791 INFO L290 TraceCheckUtils]: 113: Hoare triple {7999#false} assume !false; {7999#false} is VALID [2022-04-28 07:43:27,791 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:43:27,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:28,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:28,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547515388] [2022-04-28 07:43:28,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:28,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526239749] [2022-04-28 07:43:28,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526239749] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:28,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:28,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-28 07:43:28,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:28,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1720331075] [2022-04-28 07:43:28,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1720331075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:28,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:28,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 07:43:28,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278583386] [2022-04-28 07:43:28,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:28,025 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:43:28,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:28,026 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:43:28,075 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:28,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 07:43:28,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:28,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 07:43:28,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-28 07:43:28,076 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:43:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:29,698 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-04-28 07:43:29,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 07:43:29,698 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:43:29,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:29,698 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:43:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 84 transitions. [2022-04-28 07:43:29,699 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:43:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 84 transitions. [2022-04-28 07:43:29,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 84 transitions. [2022-04-28 07:43:29,767 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:43:29,768 INFO L225 Difference]: With dead ends: 75 [2022-04-28 07:43:29,768 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 07:43:29,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-04-28 07:43:29,769 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:43:29,769 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:43:29,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 07:43:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 07:43:29,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:29,831 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:43:29,831 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:43:29,831 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:43:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:29,833 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-28 07:43:29,833 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 07:43:29,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:29,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:29,833 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:43:29,833 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:43:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:29,834 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-28 07:43:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 07:43:29,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:29,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:29,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:29,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:29,835 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:43:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-04-28 07:43:29,836 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 114 [2022-04-28 07:43:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:29,836 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-04-28 07:43:29,837 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:43:29,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 83 transitions. [2022-04-28 07:43:29,940 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:43:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 07:43:29,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 07:43:29,941 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:29,941 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:43:29,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:30,146 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:43:30,146 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2101455607, now seen corresponding path program 27 times [2022-04-28 07:43:30,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:30,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1624014989] [2022-04-28 07:43:30,239 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:30,240 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:30,240 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:30,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2101455607, now seen corresponding path program 28 times [2022-04-28 07:43:30,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:30,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659769680] [2022-04-28 07:43:30,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:30,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:30,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:30,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2034790049] [2022-04-28 07:43:30,265 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:43:30,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:30,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:30,266 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:43:30,267 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:43:31,140 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:43:31,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:31,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-28 07:43:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:31,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:31,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {8834#true} call ULTIMATE.init(); {8834#true} is VALID [2022-04-28 07:43:31,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {8834#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); {8834#true} is VALID [2022-04-28 07:43:31,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8834#true} {8834#true} #60#return; {8834#true} is VALID [2022-04-28 07:43:31,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {8834#true} call #t~ret5 := main(); {8834#true} is VALID [2022-04-28 07:43:31,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {8834#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; {8834#true} is VALID [2022-04-28 07:43:31,722 INFO L272 TraceCheckUtils]: 6: Hoare triple {8834#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {8834#true} is VALID [2022-04-28 07:43:31,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 07:43:31,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 07:43:31,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,723 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8834#true} {8834#true} #52#return; {8834#true} is VALID [2022-04-28 07:43:31,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {8834#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8872#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:31,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {8872#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {8872#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:31,723 INFO L272 TraceCheckUtils]: 13: Hoare triple {8872#(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)); {8834#true} is VALID [2022-04-28 07:43:31,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 07:43:31,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 07:43:31,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,724 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8834#true} {8872#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {8872#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:31,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {8872#(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; {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:31,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:31,725 INFO L272 TraceCheckUtils]: 20: Hoare triple {8894#(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)); {8834#true} is VALID [2022-04-28 07:43:31,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 07:43:31,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 07:43:31,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,725 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8834#true} {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:31,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {8894#(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; {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:31,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:31,726 INFO L272 TraceCheckUtils]: 27: Hoare triple {8916#(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)); {8834#true} is VALID [2022-04-28 07:43:31,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 07:43:31,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 07:43:31,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,727 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8834#true} {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:31,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {8916#(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; {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 07:43:31,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !false; {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 07:43:31,728 INFO L272 TraceCheckUtils]: 34: Hoare triple {8938#(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)); {8834#true} is VALID [2022-04-28 07:43:31,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 07:43:31,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 07:43:31,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,728 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8834#true} {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} #54#return; {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 07:43:31,729 INFO L290 TraceCheckUtils]: 39: Hoare triple {8938#(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; {8960#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:43:31,729 INFO L290 TraceCheckUtils]: 40: Hoare triple {8960#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {8960#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:43:31,729 INFO L272 TraceCheckUtils]: 41: Hoare triple {8960#(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)); {8834#true} is VALID [2022-04-28 07:43:31,729 INFO L290 TraceCheckUtils]: 42: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 07:43:31,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 07:43:31,729 INFO L290 TraceCheckUtils]: 44: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,730 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8834#true} {8960#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {8960#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:43:31,730 INFO L290 TraceCheckUtils]: 46: Hoare triple {8960#(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; {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:31,731 INFO L290 TraceCheckUtils]: 47: Hoare triple {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:31,731 INFO L272 TraceCheckUtils]: 48: Hoare triple {8982#(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)); {8834#true} is VALID [2022-04-28 07:43:31,731 INFO L290 TraceCheckUtils]: 49: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 07:43:31,731 INFO L290 TraceCheckUtils]: 50: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 07:43:31,731 INFO L290 TraceCheckUtils]: 51: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,731 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8834#true} {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:43:31,732 INFO L290 TraceCheckUtils]: 53: Hoare triple {8982#(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; {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:31,732 INFO L290 TraceCheckUtils]: 54: Hoare triple {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:31,732 INFO L272 TraceCheckUtils]: 55: Hoare triple {9004#(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)); {8834#true} is VALID [2022-04-28 07:43:31,732 INFO L290 TraceCheckUtils]: 56: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 07:43:31,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 07:43:31,733 INFO L290 TraceCheckUtils]: 58: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,733 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8834#true} {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:31,734 INFO L290 TraceCheckUtils]: 60: Hoare triple {9004#(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; {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:43:31,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:43:31,734 INFO L272 TraceCheckUtils]: 62: Hoare triple {9026#(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)); {8834#true} is VALID [2022-04-28 07:43:31,734 INFO L290 TraceCheckUtils]: 63: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 07:43:31,734 INFO L290 TraceCheckUtils]: 64: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 07:43:31,734 INFO L290 TraceCheckUtils]: 65: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,735 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8834#true} {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:43:31,735 INFO L290 TraceCheckUtils]: 67: Hoare triple {9026#(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; {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:31,735 INFO L290 TraceCheckUtils]: 68: Hoare triple {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !false; {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:31,736 INFO L272 TraceCheckUtils]: 69: Hoare triple {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-28 07:43:31,736 INFO L290 TraceCheckUtils]: 70: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 07:43:31,736 INFO L290 TraceCheckUtils]: 71: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 07:43:31,736 INFO L290 TraceCheckUtils]: 72: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,736 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8834#true} {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #54#return; {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:31,737 INFO L290 TraceCheckUtils]: 74: Hoare triple {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-28 07:43:31,737 INFO L290 TraceCheckUtils]: 75: Hoare triple {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !false; {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-28 07:43:31,737 INFO L272 TraceCheckUtils]: 76: Hoare triple {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-28 07:43:31,737 INFO L290 TraceCheckUtils]: 77: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 07:43:31,737 INFO L290 TraceCheckUtils]: 78: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 07:43:31,737 INFO L290 TraceCheckUtils]: 79: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,738 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {8834#true} {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} #54#return; {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-28 07:43:31,738 INFO L290 TraceCheckUtils]: 81: Hoare triple {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:43:31,739 INFO L290 TraceCheckUtils]: 82: Hoare triple {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:43:31,739 INFO L272 TraceCheckUtils]: 83: Hoare triple {9092#(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)); {8834#true} is VALID [2022-04-28 07:43:31,739 INFO L290 TraceCheckUtils]: 84: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 07:43:31,739 INFO L290 TraceCheckUtils]: 85: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 07:43:31,739 INFO L290 TraceCheckUtils]: 86: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,740 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {8834#true} {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:43:31,740 INFO L290 TraceCheckUtils]: 88: Hoare triple {9092#(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; {9114#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:43:31,740 INFO L290 TraceCheckUtils]: 89: Hoare triple {9114#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {9114#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:43:31,740 INFO L272 TraceCheckUtils]: 90: Hoare triple {9114#(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)); {8834#true} is VALID [2022-04-28 07:43:31,740 INFO L290 TraceCheckUtils]: 91: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 07:43:31,741 INFO L290 TraceCheckUtils]: 92: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 07:43:31,741 INFO L290 TraceCheckUtils]: 93: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,741 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8834#true} {9114#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {9114#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:43:31,741 INFO L290 TraceCheckUtils]: 95: Hoare triple {9114#(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; {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:43:31,742 INFO L290 TraceCheckUtils]: 96: Hoare triple {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:43:31,742 INFO L272 TraceCheckUtils]: 97: Hoare triple {9136#(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)); {8834#true} is VALID [2022-04-28 07:43:31,742 INFO L290 TraceCheckUtils]: 98: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 07:43:31,742 INFO L290 TraceCheckUtils]: 99: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 07:43:31,742 INFO L290 TraceCheckUtils]: 100: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,743 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {8834#true} {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:43:31,743 INFO L290 TraceCheckUtils]: 102: Hoare triple {9136#(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; {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:31,743 INFO L290 TraceCheckUtils]: 103: Hoare triple {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} assume !false; {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:31,743 INFO L272 TraceCheckUtils]: 104: Hoare triple {9158#(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)); {8834#true} is VALID [2022-04-28 07:43:31,744 INFO L290 TraceCheckUtils]: 105: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 07:43:31,744 INFO L290 TraceCheckUtils]: 106: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 07:43:31,744 INFO L290 TraceCheckUtils]: 107: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,744 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {8834#true} {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} #54#return; {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:31,744 INFO L290 TraceCheckUtils]: 109: Hoare triple {9158#(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; {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-28 07:43:31,745 INFO L290 TraceCheckUtils]: 110: Hoare triple {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !false; {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-28 07:43:31,745 INFO L272 TraceCheckUtils]: 111: Hoare triple {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8834#true} is VALID [2022-04-28 07:43:31,745 INFO L290 TraceCheckUtils]: 112: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 07:43:31,745 INFO L290 TraceCheckUtils]: 113: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 07:43:31,745 INFO L290 TraceCheckUtils]: 114: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 07:43:31,746 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {8834#true} {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} #54#return; {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-28 07:43:31,746 INFO L290 TraceCheckUtils]: 116: Hoare triple {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {9202#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-28 07:43:31,747 INFO L272 TraceCheckUtils]: 117: Hoare triple {9202#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9206#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:31,747 INFO L290 TraceCheckUtils]: 118: Hoare triple {9206#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9210#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:31,748 INFO L290 TraceCheckUtils]: 119: Hoare triple {9210#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8835#false} is VALID [2022-04-28 07:43:31,748 INFO L290 TraceCheckUtils]: 120: Hoare triple {8835#false} assume !false; {8835#false} is VALID [2022-04-28 07:43:31,748 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:43:31,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:32,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:32,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659769680] [2022-04-28 07:43:32,018 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:32,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034790049] [2022-04-28 07:43:32,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034790049] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:32,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:32,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-28 07:43:32,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:32,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1624014989] [2022-04-28 07:43:32,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1624014989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:32,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:32,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 07:43:32,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551165619] [2022-04-28 07:43:32,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:32,019 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:43:32,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:32,020 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:43:32,072 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:43:32,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 07:43:32,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:32,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 07:43:32,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-28 07:43:32,073 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:43:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:33,848 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2022-04-28 07:43:33,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 07:43:33,849 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:43:33,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:33,849 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:43:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-28 07:43:33,850 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:43:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-28 07:43:33,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 88 transitions. [2022-04-28 07:43:33,932 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:43:33,933 INFO L225 Difference]: With dead ends: 78 [2022-04-28 07:43:33,933 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 07:43:33,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-28 07:43:33,934 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:43:33,934 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:43:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 07:43:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-28 07:43:33,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:33,992 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:43:33,992 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:43:33,993 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:43:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:33,994 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-28 07:43:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-28 07:43:33,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:33,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:33,994 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:43:33,995 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:43:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:33,996 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-28 07:43:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-28 07:43:33,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:33,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:33,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:33,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:33,996 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:43:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2022-04-28 07:43:33,998 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 121 [2022-04-28 07:43:33,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:33,998 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2022-04-28 07:43:33,998 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:43:33,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 87 transitions. [2022-04-28 07:43:34,124 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:43:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-28 07:43:34,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-28 07:43:34,125 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:34,125 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:43:34,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 07:43:34,330 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:43:34,330 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:34,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:34,330 INFO L85 PathProgramCache]: Analyzing trace with hash -729919512, now seen corresponding path program 29 times [2022-04-28 07:43:34,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:34,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [717628155] [2022-04-28 07:43:34,398 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:34,398 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:34,399 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:34,399 INFO L85 PathProgramCache]: Analyzing trace with hash -729919512, now seen corresponding path program 30 times [2022-04-28 07:43:34,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:34,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828127890] [2022-04-28 07:43:34,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:34,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:34,416 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:34,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [126044994] [2022-04-28 07:43:34,416 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:43:34,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:34,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:34,417 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:43:34,418 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:43:34,725 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 07:43:34,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:34,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-28 07:43:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:34,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:35,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {9710#true} call ULTIMATE.init(); {9710#true} is VALID [2022-04-28 07:43:35,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {9710#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); {9710#true} is VALID [2022-04-28 07:43:35,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9710#true} {9710#true} #60#return; {9710#true} is VALID [2022-04-28 07:43:35,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {9710#true} call #t~ret5 := main(); {9710#true} is VALID [2022-04-28 07:43:35,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {9710#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; {9710#true} is VALID [2022-04-28 07:43:35,361 INFO L272 TraceCheckUtils]: 6: Hoare triple {9710#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {9710#true} is VALID [2022-04-28 07:43:35,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,361 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9710#true} {9710#true} #52#return; {9710#true} is VALID [2022-04-28 07:43:35,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {9710#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9748#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:35,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {9748#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {9748#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:35,362 INFO L272 TraceCheckUtils]: 13: Hoare triple {9748#(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)); {9710#true} is VALID [2022-04-28 07:43:35,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,363 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9710#true} {9748#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {9748#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:35,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {9748#(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; {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:35,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:35,364 INFO L272 TraceCheckUtils]: 20: Hoare triple {9770#(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)); {9710#true} is VALID [2022-04-28 07:43:35,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,364 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9710#true} {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:43:35,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {9770#(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; {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:35,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:35,365 INFO L272 TraceCheckUtils]: 27: Hoare triple {9792#(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)); {9710#true} is VALID [2022-04-28 07:43:35,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,366 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9710#true} {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:35,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {9792#(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; {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 07:43:35,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !false; {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 07:43:35,366 INFO L272 TraceCheckUtils]: 34: Hoare triple {9814#(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)); {9710#true} is VALID [2022-04-28 07:43:35,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,366 INFO L290 TraceCheckUtils]: 36: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,367 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9710#true} {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} #54#return; {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 07:43:35,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {9814#(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; {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:43:35,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} assume !false; {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:43:35,368 INFO L272 TraceCheckUtils]: 41: Hoare triple {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-28 07:43:35,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,368 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9710#true} {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} #54#return; {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:43:35,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} is VALID [2022-04-28 07:43:35,369 INFO L290 TraceCheckUtils]: 47: Hoare triple {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} assume !false; {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} is VALID [2022-04-28 07:43:35,369 INFO L272 TraceCheckUtils]: 48: Hoare triple {9858#(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)); {9710#true} is VALID [2022-04-28 07:43:35,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,370 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9710#true} {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} #54#return; {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} is VALID [2022-04-28 07:43:35,370 INFO L290 TraceCheckUtils]: 53: Hoare triple {9858#(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; {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:43:35,370 INFO L290 TraceCheckUtils]: 54: Hoare triple {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:43:35,370 INFO L272 TraceCheckUtils]: 55: Hoare triple {9880#(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)); {9710#true} is VALID [2022-04-28 07:43:35,371 INFO L290 TraceCheckUtils]: 56: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,371 INFO L290 TraceCheckUtils]: 57: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,371 INFO L290 TraceCheckUtils]: 58: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,371 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9710#true} {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:43:35,371 INFO L290 TraceCheckUtils]: 60: Hoare triple {9880#(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; {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:35,372 INFO L290 TraceCheckUtils]: 61: Hoare triple {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:35,372 INFO L272 TraceCheckUtils]: 62: Hoare triple {9902#(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)); {9710#true} is VALID [2022-04-28 07:43:35,372 INFO L290 TraceCheckUtils]: 63: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,372 INFO L290 TraceCheckUtils]: 64: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,372 INFO L290 TraceCheckUtils]: 65: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,372 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9710#true} {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:35,373 INFO L290 TraceCheckUtils]: 67: Hoare triple {9902#(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; {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:43:35,373 INFO L290 TraceCheckUtils]: 68: Hoare triple {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:43:35,373 INFO L272 TraceCheckUtils]: 69: Hoare triple {9924#(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)); {9710#true} is VALID [2022-04-28 07:43:35,373 INFO L290 TraceCheckUtils]: 70: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,373 INFO L290 TraceCheckUtils]: 71: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,373 INFO L290 TraceCheckUtils]: 72: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,374 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9710#true} {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:43:35,374 INFO L290 TraceCheckUtils]: 74: Hoare triple {9924#(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; {9946#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:43:35,375 INFO L290 TraceCheckUtils]: 75: Hoare triple {9946#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {9946#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:43:35,375 INFO L272 TraceCheckUtils]: 76: Hoare triple {9946#(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)); {9710#true} is VALID [2022-04-28 07:43:35,375 INFO L290 TraceCheckUtils]: 77: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,375 INFO L290 TraceCheckUtils]: 78: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,375 INFO L290 TraceCheckUtils]: 79: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,375 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9710#true} {9946#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {9946#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:43:35,376 INFO L290 TraceCheckUtils]: 81: Hoare triple {9946#(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; {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:43:35,376 INFO L290 TraceCheckUtils]: 82: Hoare triple {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:43:35,376 INFO L272 TraceCheckUtils]: 83: Hoare triple {9968#(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)); {9710#true} is VALID [2022-04-28 07:43:35,376 INFO L290 TraceCheckUtils]: 84: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,376 INFO L290 TraceCheckUtils]: 85: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,376 INFO L290 TraceCheckUtils]: 86: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,377 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {9710#true} {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:43:35,377 INFO L290 TraceCheckUtils]: 88: Hoare triple {9968#(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; {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:43:35,377 INFO L290 TraceCheckUtils]: 89: Hoare triple {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} assume !false; {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:43:35,377 INFO L272 TraceCheckUtils]: 90: Hoare triple {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-28 07:43:35,377 INFO L290 TraceCheckUtils]: 91: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,378 INFO L290 TraceCheckUtils]: 92: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,378 INFO L290 TraceCheckUtils]: 93: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,378 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {9710#true} {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} #54#return; {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:43:35,378 INFO L290 TraceCheckUtils]: 95: Hoare triple {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-28 07:43:35,379 INFO L290 TraceCheckUtils]: 96: Hoare triple {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} assume !false; {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-28 07:43:35,379 INFO L272 TraceCheckUtils]: 97: Hoare triple {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-28 07:43:35,379 INFO L290 TraceCheckUtils]: 98: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,379 INFO L290 TraceCheckUtils]: 99: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,379 INFO L290 TraceCheckUtils]: 100: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,379 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9710#true} {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} #54#return; {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-28 07:43:35,380 INFO L290 TraceCheckUtils]: 102: Hoare triple {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-28 07:43:35,380 INFO L290 TraceCheckUtils]: 103: Hoare triple {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} assume !false; {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-28 07:43:35,380 INFO L272 TraceCheckUtils]: 104: Hoare triple {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9710#true} is VALID [2022-04-28 07:43:35,380 INFO L290 TraceCheckUtils]: 105: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,380 INFO L290 TraceCheckUtils]: 106: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,380 INFO L290 TraceCheckUtils]: 107: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,381 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9710#true} {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} #54#return; {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-28 07:43:35,381 INFO L290 TraceCheckUtils]: 109: Hoare triple {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} is VALID [2022-04-28 07:43:35,381 INFO L290 TraceCheckUtils]: 110: Hoare triple {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} assume !false; {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} is VALID [2022-04-28 07:43:35,382 INFO L272 TraceCheckUtils]: 111: Hoare triple {10056#(and (= 9 (+ main_~y~0 (- 5))) (= 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)); {9710#true} is VALID [2022-04-28 07:43:35,382 INFO L290 TraceCheckUtils]: 112: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,382 INFO L290 TraceCheckUtils]: 113: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,382 INFO L290 TraceCheckUtils]: 114: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,382 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {9710#true} {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} #54#return; {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} is VALID [2022-04-28 07:43:35,383 INFO L290 TraceCheckUtils]: 116: Hoare triple {10056#(and (= 9 (+ main_~y~0 (- 5))) (= 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; {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-28 07:43:35,383 INFO L290 TraceCheckUtils]: 117: Hoare triple {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} assume !false; {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-28 07:43:35,383 INFO L272 TraceCheckUtils]: 118: Hoare triple {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 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)); {9710#true} is VALID [2022-04-28 07:43:35,383 INFO L290 TraceCheckUtils]: 119: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 07:43:35,383 INFO L290 TraceCheckUtils]: 120: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 07:43:35,383 INFO L290 TraceCheckUtils]: 121: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 07:43:35,384 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9710#true} {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} #54#return; {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-28 07:43:35,384 INFO L290 TraceCheckUtils]: 123: Hoare triple {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} assume !(~c~0 < ~k~0); {10100#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-28 07:43:35,385 INFO L272 TraceCheckUtils]: 124: Hoare triple {10100#(and (= (+ main_~y~0 (- 6)) 9) (< 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)); {10104#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:35,385 INFO L290 TraceCheckUtils]: 125: Hoare triple {10104#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10108#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:35,385 INFO L290 TraceCheckUtils]: 126: Hoare triple {10108#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9711#false} is VALID [2022-04-28 07:43:35,385 INFO L290 TraceCheckUtils]: 127: Hoare triple {9711#false} assume !false; {9711#false} is VALID [2022-04-28 07:43:35,386 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:43:35,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:35,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:35,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828127890] [2022-04-28 07:43:35,629 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:35,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126044994] [2022-04-28 07:43:35,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126044994] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:35,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:35,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-28 07:43:35,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:35,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [717628155] [2022-04-28 07:43:35,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [717628155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:35,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:35,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 07:43:35,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327386360] [2022-04-28 07:43:35,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:35,631 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:43:35,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:35,631 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:43:35,689 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:43:35,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 07:43:35,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:35,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 07:43:35,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-04-28 07:43:35,690 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:43:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:37,682 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2022-04-28 07:43:37,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 07:43:37,682 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:43:37,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:37,683 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:43:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-28 07:43:37,684 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:43:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-28 07:43:37,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 92 transitions. [2022-04-28 07:43:37,762 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:43:37,772 INFO L225 Difference]: With dead ends: 81 [2022-04-28 07:43:37,772 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 07:43:37,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2022-04-28 07:43:37,773 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:37,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 689 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 07:43:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 07:43:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 07:43:37,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:37,833 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:43:37,834 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:43:37,834 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:43:37,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:37,835 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-28 07:43:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-28 07:43:37,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:37,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:37,835 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:43:37,836 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:43:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:37,837 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-28 07:43:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-28 07:43:37,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:37,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:37,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:37,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:37,837 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:43:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2022-04-28 07:43:37,839 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 128 [2022-04-28 07:43:37,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:37,839 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2022-04-28 07:43:37,839 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:43:37,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 91 transitions. [2022-04-28 07:43:37,955 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:43:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-28 07:43:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 07:43:37,955 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:37,956 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:43:37,963 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:43:38,156 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:43:38,156 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:38,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:38,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843369, now seen corresponding path program 31 times [2022-04-28 07:43:38,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:38,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [952313589] [2022-04-28 07:43:38,233 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:38,233 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:38,233 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:38,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843369, now seen corresponding path program 32 times [2022-04-28 07:43:38,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:38,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355373018] [2022-04-28 07:43:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:38,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:38,244 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:38,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911814191] [2022-04-28 07:43:38,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:43:38,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:38,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:38,245 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:43:38,246 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:43:38,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:43:38,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:38,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-28 07:43:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:38,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:39,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {10626#true} call ULTIMATE.init(); {10626#true} is VALID [2022-04-28 07:43:39,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {10626#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); {10626#true} is VALID [2022-04-28 07:43:39,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10626#true} {10626#true} #60#return; {10626#true} is VALID [2022-04-28 07:43:39,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {10626#true} call #t~ret5 := main(); {10626#true} is VALID [2022-04-28 07:43:39,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {10626#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; {10626#true} is VALID [2022-04-28 07:43:39,767 INFO L272 TraceCheckUtils]: 6: Hoare triple {10626#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {10626#true} is VALID [2022-04-28 07:43:39,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,767 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10626#true} {10626#true} #52#return; {10626#true} is VALID [2022-04-28 07:43:39,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {10626#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10664#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:39,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {10664#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {10664#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:39,768 INFO L272 TraceCheckUtils]: 13: Hoare triple {10664#(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)); {10626#true} is VALID [2022-04-28 07:43:39,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,769 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10626#true} {10664#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {10664#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:39,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {10664#(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; {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:43:39,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:43:39,769 INFO L272 TraceCheckUtils]: 20: Hoare triple {10686#(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)); {10626#true} is VALID [2022-04-28 07:43:39,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,770 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10626#true} {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #54#return; {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:43:39,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} assume !false; {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,771 INFO L272 TraceCheckUtils]: 27: Hoare triple {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-28 07:43:39,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,771 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10626#true} {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} #54#return; {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} assume !false; {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,772 INFO L272 TraceCheckUtils]: 34: Hoare triple {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-28 07:43:39,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,773 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10626#true} {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} #54#return; {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} assume !false; {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,774 INFO L272 TraceCheckUtils]: 41: Hoare triple {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~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)); {10626#true} is VALID [2022-04-28 07:43:39,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,799 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10626#true} {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} #54#return; {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,799 INFO L290 TraceCheckUtils]: 46: Hoare triple {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~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; {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} assume !false; {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,800 INFO L272 TraceCheckUtils]: 48: Hoare triple {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~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)); {10626#true} is VALID [2022-04-28 07:43:39,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,800 INFO L290 TraceCheckUtils]: 50: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,800 INFO L290 TraceCheckUtils]: 51: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,801 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10626#true} {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} #54#return; {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,801 INFO L290 TraceCheckUtils]: 53: Hoare triple {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~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; {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,801 INFO L290 TraceCheckUtils]: 54: Hoare triple {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !false; {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,801 INFO L272 TraceCheckUtils]: 55: Hoare triple {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-28 07:43:39,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,802 INFO L290 TraceCheckUtils]: 58: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,802 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10626#true} {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #54#return; {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,802 INFO L290 TraceCheckUtils]: 60: Hoare triple {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,803 INFO L290 TraceCheckUtils]: 61: Hoare triple {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,803 INFO L272 TraceCheckUtils]: 62: Hoare triple {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-28 07:43:39,803 INFO L290 TraceCheckUtils]: 63: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,803 INFO L290 TraceCheckUtils]: 64: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,803 INFO L290 TraceCheckUtils]: 65: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,803 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10626#true} {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,804 INFO L290 TraceCheckUtils]: 67: Hoare triple {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,804 INFO L290 TraceCheckUtils]: 68: Hoare triple {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,804 INFO L272 TraceCheckUtils]: 69: Hoare triple {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-28 07:43:39,804 INFO L290 TraceCheckUtils]: 70: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,804 INFO L290 TraceCheckUtils]: 71: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,805 INFO L290 TraceCheckUtils]: 72: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,805 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10626#true} {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} #54#return; {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,805 INFO L290 TraceCheckUtils]: 74: Hoare triple {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,806 INFO L290 TraceCheckUtils]: 75: Hoare triple {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} assume !false; {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,806 INFO L272 TraceCheckUtils]: 76: Hoare triple {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-28 07:43:39,806 INFO L290 TraceCheckUtils]: 77: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,806 INFO L290 TraceCheckUtils]: 78: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,806 INFO L290 TraceCheckUtils]: 79: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,806 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10626#true} {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} #54#return; {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,807 INFO L290 TraceCheckUtils]: 81: Hoare triple {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,807 INFO L290 TraceCheckUtils]: 82: Hoare triple {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,807 INFO L272 TraceCheckUtils]: 83: Hoare triple {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-28 07:43:39,807 INFO L290 TraceCheckUtils]: 84: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,807 INFO L290 TraceCheckUtils]: 85: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,807 INFO L290 TraceCheckUtils]: 86: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,808 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {10626#true} {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #54#return; {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,808 INFO L290 TraceCheckUtils]: 88: Hoare triple {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,809 INFO L290 TraceCheckUtils]: 89: Hoare triple {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !false; {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,809 INFO L272 TraceCheckUtils]: 90: Hoare triple {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-28 07:43:39,809 INFO L290 TraceCheckUtils]: 91: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,809 INFO L290 TraceCheckUtils]: 92: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,809 INFO L290 TraceCheckUtils]: 93: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,809 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {10626#true} {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} #54#return; {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,810 INFO L290 TraceCheckUtils]: 95: Hoare triple {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,810 INFO L290 TraceCheckUtils]: 96: Hoare triple {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} assume !false; {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,810 INFO L272 TraceCheckUtils]: 97: Hoare triple {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-28 07:43:39,810 INFO L290 TraceCheckUtils]: 98: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,810 INFO L290 TraceCheckUtils]: 99: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,810 INFO L290 TraceCheckUtils]: 100: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,811 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10626#true} {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} #54#return; {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:43:39,811 INFO L290 TraceCheckUtils]: 102: Hoare triple {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-28 07:43:39,811 INFO L290 TraceCheckUtils]: 103: Hoare triple {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-28 07:43:39,812 INFO L272 TraceCheckUtils]: 104: Hoare triple {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-28 07:43:39,812 INFO L290 TraceCheckUtils]: 105: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,812 INFO L290 TraceCheckUtils]: 106: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,812 INFO L290 TraceCheckUtils]: 107: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,812 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {10626#true} {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} #54#return; {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-28 07:43:39,813 INFO L290 TraceCheckUtils]: 109: Hoare triple {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:43:39,813 INFO L290 TraceCheckUtils]: 110: Hoare triple {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !false; {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:43:39,813 INFO L272 TraceCheckUtils]: 111: Hoare triple {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-28 07:43:39,813 INFO L290 TraceCheckUtils]: 112: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,813 INFO L290 TraceCheckUtils]: 113: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,813 INFO L290 TraceCheckUtils]: 114: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,814 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {10626#true} {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} #54#return; {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:43:39,814 INFO L290 TraceCheckUtils]: 116: Hoare triple {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:39,814 INFO L290 TraceCheckUtils]: 117: Hoare triple {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} assume !false; {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:39,814 INFO L272 TraceCheckUtils]: 118: Hoare triple {10994#(and (= main_~y~0 15) (< 0 main_~k~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)); {10626#true} is VALID [2022-04-28 07:43:39,814 INFO L290 TraceCheckUtils]: 119: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,815 INFO L290 TraceCheckUtils]: 120: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,815 INFO L290 TraceCheckUtils]: 121: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,815 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {10626#true} {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} #54#return; {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:39,815 INFO L290 TraceCheckUtils]: 123: Hoare triple {10994#(and (= main_~y~0 15) (< 0 main_~k~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; {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-28 07:43:39,816 INFO L290 TraceCheckUtils]: 124: Hoare triple {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !false; {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-28 07:43:39,816 INFO L272 TraceCheckUtils]: 125: Hoare triple {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10626#true} is VALID [2022-04-28 07:43:39,816 INFO L290 TraceCheckUtils]: 126: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 07:43:39,816 INFO L290 TraceCheckUtils]: 127: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 07:43:39,816 INFO L290 TraceCheckUtils]: 128: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 07:43:39,816 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {10626#true} {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} #54#return; {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-28 07:43:39,817 INFO L290 TraceCheckUtils]: 130: Hoare triple {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !(~c~0 < ~k~0); {11038#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} is VALID [2022-04-28 07:43:39,818 INFO L272 TraceCheckUtils]: 131: Hoare triple {11038#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11042#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:39,818 INFO L290 TraceCheckUtils]: 132: Hoare triple {11042#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11046#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:39,819 INFO L290 TraceCheckUtils]: 133: Hoare triple {11046#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10627#false} is VALID [2022-04-28 07:43:39,819 INFO L290 TraceCheckUtils]: 134: Hoare triple {10627#false} assume !false; {10627#false} is VALID [2022-04-28 07:43:39,819 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:43:39,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:41,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:41,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355373018] [2022-04-28 07:43:41,373 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:41,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911814191] [2022-04-28 07:43:41,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911814191] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:41,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:41,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-28 07:43:41,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:41,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [952313589] [2022-04-28 07:43:41,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [952313589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:41,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:41,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 07:43:41,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425439698] [2022-04-28 07:43:41,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:41,374 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:43:41,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:41,375 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:43:41,439 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:43:41,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 07:43:41,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:41,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 07:43:41,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1220, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 07:43:41,440 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:43:43,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:43,985 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-04-28 07:43:43,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 07:43:43,985 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:43:43,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:43,985 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:43:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2022-04-28 07:43:43,987 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:43:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2022-04-28 07:43:43,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 96 transitions. [2022-04-28 07:43:44,081 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:43:44,082 INFO L225 Difference]: With dead ends: 84 [2022-04-28 07:43:44,082 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 07:43:44,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=350, Invalid=1372, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 07:43:44,083 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:44,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 730 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 07:43:44,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 07:43:44,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-28 07:43:44,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:44,194 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:43:44,194 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:43:44,194 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:43:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:44,195 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-28 07:43:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-28 07:43:44,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:44,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:44,196 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:43:44,196 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:43:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:44,197 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-28 07:43:44,197 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-28 07:43:44,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:44,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:44,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:44,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:44,198 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:43:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-28 07:43:44,199 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 135 [2022-04-28 07:43:44,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:44,199 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-28 07:43:44,200 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:43:44,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 95 transitions. [2022-04-28 07:43:44,351 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:43:44,351 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-28 07:43:44,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-04-28 07:43:44,352 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:44,352 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:43:44,362 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:43:44,557 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:43:44,557 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:44,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:44,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1539623736, now seen corresponding path program 33 times [2022-04-28 07:43:44,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:44,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1540653555] [2022-04-28 07:43:44,630 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:44,630 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:44,630 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:44,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1539623736, now seen corresponding path program 34 times [2022-04-28 07:43:44,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:44,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019196683] [2022-04-28 07:43:44,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:44,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:44,642 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:44,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954611893] [2022-04-28 07:43:44,642 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:43:44,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:44,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:44,643 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:43:44,661 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:43:45,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:43:45,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:45,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-28 07:43:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:45,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:45,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {11912#true} call ULTIMATE.init(); {11912#true} is VALID [2022-04-28 07:43:45,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {11912#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); {11912#true} is VALID [2022-04-28 07:43:45,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11912#true} {11912#true} #60#return; {11912#true} is VALID [2022-04-28 07:43:45,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {11912#true} call #t~ret5 := main(); {11912#true} is VALID [2022-04-28 07:43:45,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {11912#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; {11912#true} is VALID [2022-04-28 07:43:45,848 INFO L272 TraceCheckUtils]: 6: Hoare triple {11912#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {11912#true} is VALID [2022-04-28 07:43:45,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,848 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11912#true} {11912#true} #52#return; {11912#true} is VALID [2022-04-28 07:43:45,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {11912#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11950#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:45,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {11950#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {11950#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:45,849 INFO L272 TraceCheckUtils]: 13: Hoare triple {11950#(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)); {11912#true} is VALID [2022-04-28 07:43:45,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,850 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11912#true} {11950#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {11950#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:45,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {11950#(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; {11972#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:45,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {11972#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {11972#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:45,850 INFO L272 TraceCheckUtils]: 20: Hoare triple {11972#(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)); {11912#true} is VALID [2022-04-28 07:43:45,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,851 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11912#true} {11972#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {11972#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:43:45,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {11972#(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; {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:43:45,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !false; {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:43:45,852 INFO L272 TraceCheckUtils]: 27: Hoare triple {11994#(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)); {11912#true} is VALID [2022-04-28 07:43:45,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,852 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11912#true} {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #54#return; {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:43:45,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {11994#(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; {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:43:45,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:43:45,853 INFO L272 TraceCheckUtils]: 34: Hoare triple {12016#(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)); {11912#true} is VALID [2022-04-28 07:43:45,853 INFO L290 TraceCheckUtils]: 35: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,854 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11912#true} {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:43:45,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {12016#(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; {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 07:43:45,854 INFO L290 TraceCheckUtils]: 40: Hoare triple {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !false; {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 07:43:45,854 INFO L272 TraceCheckUtils]: 41: Hoare triple {12038#(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)); {11912#true} is VALID [2022-04-28 07:43:45,854 INFO L290 TraceCheckUtils]: 42: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,855 INFO L290 TraceCheckUtils]: 43: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,855 INFO L290 TraceCheckUtils]: 44: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,855 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11912#true} {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #54#return; {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 07:43:45,855 INFO L290 TraceCheckUtils]: 46: Hoare triple {12038#(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; {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:43:45,856 INFO L290 TraceCheckUtils]: 47: Hoare triple {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} assume !false; {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:43:45,856 INFO L272 TraceCheckUtils]: 48: Hoare triple {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 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)); {11912#true} is VALID [2022-04-28 07:43:45,856 INFO L290 TraceCheckUtils]: 49: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,856 INFO L290 TraceCheckUtils]: 50: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,856 INFO L290 TraceCheckUtils]: 51: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,856 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11912#true} {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} #54#return; {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:43:45,857 INFO L290 TraceCheckUtils]: 53: Hoare triple {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 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; {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:45,857 INFO L290 TraceCheckUtils]: 54: Hoare triple {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:45,857 INFO L272 TraceCheckUtils]: 55: Hoare triple {12082#(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)); {11912#true} is VALID [2022-04-28 07:43:45,857 INFO L290 TraceCheckUtils]: 56: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,857 INFO L290 TraceCheckUtils]: 57: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,857 INFO L290 TraceCheckUtils]: 58: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,858 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11912#true} {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:45,858 INFO L290 TraceCheckUtils]: 60: Hoare triple {12082#(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; {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:45,858 INFO L290 TraceCheckUtils]: 61: Hoare triple {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:45,859 INFO L272 TraceCheckUtils]: 62: Hoare triple {12104#(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)); {11912#true} is VALID [2022-04-28 07:43:45,859 INFO L290 TraceCheckUtils]: 63: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,859 INFO L290 TraceCheckUtils]: 64: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,859 INFO L290 TraceCheckUtils]: 65: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,859 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11912#true} {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:43:45,860 INFO L290 TraceCheckUtils]: 67: Hoare triple {12104#(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; {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:43:45,860 INFO L290 TraceCheckUtils]: 68: Hoare triple {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:43:45,860 INFO L272 TraceCheckUtils]: 69: Hoare triple {12126#(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)); {11912#true} is VALID [2022-04-28 07:43:45,860 INFO L290 TraceCheckUtils]: 70: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,860 INFO L290 TraceCheckUtils]: 71: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,860 INFO L290 TraceCheckUtils]: 72: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,860 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11912#true} {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #54#return; {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 07:43:45,861 INFO L290 TraceCheckUtils]: 74: Hoare triple {12126#(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; {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-28 07:43:45,861 INFO L290 TraceCheckUtils]: 75: Hoare triple {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !false; {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-28 07:43:45,861 INFO L272 TraceCheckUtils]: 76: Hoare triple {12148#(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)); {11912#true} is VALID [2022-04-28 07:43:45,861 INFO L290 TraceCheckUtils]: 77: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,861 INFO L290 TraceCheckUtils]: 78: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,862 INFO L290 TraceCheckUtils]: 79: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,862 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {11912#true} {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} #54#return; {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-28 07:43:45,862 INFO L290 TraceCheckUtils]: 81: Hoare triple {12148#(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; {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:43:45,863 INFO L290 TraceCheckUtils]: 82: Hoare triple {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:43:45,863 INFO L272 TraceCheckUtils]: 83: Hoare triple {12170#(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)); {11912#true} is VALID [2022-04-28 07:43:45,863 INFO L290 TraceCheckUtils]: 84: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,863 INFO L290 TraceCheckUtils]: 85: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,863 INFO L290 TraceCheckUtils]: 86: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,863 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {11912#true} {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #54#return; {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:43:45,864 INFO L290 TraceCheckUtils]: 88: Hoare triple {12170#(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; {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-28 07:43:45,864 INFO L290 TraceCheckUtils]: 89: Hoare triple {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-28 07:43:45,864 INFO L272 TraceCheckUtils]: 90: Hoare triple {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-28 07:43:45,864 INFO L290 TraceCheckUtils]: 91: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,864 INFO L290 TraceCheckUtils]: 92: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,864 INFO L290 TraceCheckUtils]: 93: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,865 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {11912#true} {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #54#return; {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-28 07:43:45,865 INFO L290 TraceCheckUtils]: 95: Hoare triple {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:43:45,865 INFO L290 TraceCheckUtils]: 96: Hoare triple {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !false; {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:43:45,865 INFO L272 TraceCheckUtils]: 97: Hoare triple {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11912#true} is VALID [2022-04-28 07:43:45,866 INFO L290 TraceCheckUtils]: 98: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,866 INFO L290 TraceCheckUtils]: 99: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,866 INFO L290 TraceCheckUtils]: 100: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,866 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11912#true} {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} #54#return; {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 07:43:45,866 INFO L290 TraceCheckUtils]: 102: Hoare triple {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12236#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:43:45,867 INFO L290 TraceCheckUtils]: 103: Hoare triple {12236#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {12236#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:43:45,867 INFO L272 TraceCheckUtils]: 104: Hoare triple {12236#(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)); {11912#true} is VALID [2022-04-28 07:43:45,867 INFO L290 TraceCheckUtils]: 105: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,867 INFO L290 TraceCheckUtils]: 106: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,867 INFO L290 TraceCheckUtils]: 107: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,867 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {11912#true} {12236#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {12236#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 07:43:45,868 INFO L290 TraceCheckUtils]: 109: Hoare triple {12236#(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; {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:43:45,868 INFO L290 TraceCheckUtils]: 110: Hoare triple {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:43:45,868 INFO L272 TraceCheckUtils]: 111: Hoare triple {12258#(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)); {11912#true} is VALID [2022-04-28 07:43:45,868 INFO L290 TraceCheckUtils]: 112: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,868 INFO L290 TraceCheckUtils]: 113: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,868 INFO L290 TraceCheckUtils]: 114: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,869 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {11912#true} {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #54#return; {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:43:45,869 INFO L290 TraceCheckUtils]: 116: Hoare triple {12258#(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; {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:45,869 INFO L290 TraceCheckUtils]: 117: Hoare triple {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !false; {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:45,870 INFO L272 TraceCheckUtils]: 118: Hoare triple {12280#(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)); {11912#true} is VALID [2022-04-28 07:43:45,870 INFO L290 TraceCheckUtils]: 119: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,870 INFO L290 TraceCheckUtils]: 120: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,870 INFO L290 TraceCheckUtils]: 121: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,870 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {11912#true} {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} #54#return; {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:43:45,871 INFO L290 TraceCheckUtils]: 123: Hoare triple {12280#(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; {12302#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:43:45,871 INFO L290 TraceCheckUtils]: 124: Hoare triple {12302#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {12302#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:43:45,871 INFO L272 TraceCheckUtils]: 125: Hoare triple {12302#(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)); {11912#true} is VALID [2022-04-28 07:43:45,871 INFO L290 TraceCheckUtils]: 126: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,871 INFO L290 TraceCheckUtils]: 127: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,871 INFO L290 TraceCheckUtils]: 128: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,872 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {11912#true} {12302#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {12302#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 07:43:45,872 INFO L290 TraceCheckUtils]: 130: Hoare triple {12302#(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; {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} is VALID [2022-04-28 07:43:45,872 INFO L290 TraceCheckUtils]: 131: Hoare triple {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} assume !false; {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} is VALID [2022-04-28 07:43:45,872 INFO L272 TraceCheckUtils]: 132: Hoare triple {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 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)); {11912#true} is VALID [2022-04-28 07:43:45,872 INFO L290 TraceCheckUtils]: 133: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 07:43:45,872 INFO L290 TraceCheckUtils]: 134: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 07:43:45,873 INFO L290 TraceCheckUtils]: 135: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 07:43:45,873 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {11912#true} {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} #54#return; {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} is VALID [2022-04-28 07:43:45,873 INFO L290 TraceCheckUtils]: 137: Hoare triple {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} assume !(~c~0 < ~k~0); {12346#(and (<= main_~k~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} is VALID [2022-04-28 07:43:45,874 INFO L272 TraceCheckUtils]: 138: Hoare triple {12346#(and (<= main_~k~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12350#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:45,875 INFO L290 TraceCheckUtils]: 139: Hoare triple {12350#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12354#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:43:45,875 INFO L290 TraceCheckUtils]: 140: Hoare triple {12354#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11913#false} is VALID [2022-04-28 07:43:45,875 INFO L290 TraceCheckUtils]: 141: Hoare triple {11913#false} assume !false; {11913#false} is VALID [2022-04-28 07:43:45,876 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:43:45,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:46,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:46,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019196683] [2022-04-28 07:43:46,167 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:46,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954611893] [2022-04-28 07:43:46,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954611893] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:46,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:46,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-28 07:43:46,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:46,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1540653555] [2022-04-28 07:43:46,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1540653555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:46,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:46,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 07:43:46,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032858610] [2022-04-28 07:43:46,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:46,168 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:43:46,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:46,168 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:43:46,237 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:43:46,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 07:43:46,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:46,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 07:43:46,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-28 07:43:46,238 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:43:48,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:48,861 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-04-28 07:43:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 07:43:48,862 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:43:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:48,862 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:43:48,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-28 07:43:48,863 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:43:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-28 07:43:48,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 100 transitions. [2022-04-28 07:43:48,955 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:43:48,956 INFO L225 Difference]: With dead ends: 87 [2022-04-28 07:43:48,956 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 07:43:48,956 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:43:48,957 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:48,957 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.2s Time] [2022-04-28 07:43:48,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 07:43:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-28 07:43:49,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:49,032 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:43:49,032 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:43:49,032 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:43:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:49,033 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-28 07:43:49,033 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-28 07:43:49,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:49,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:49,034 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:43:49,034 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:43:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:49,035 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-28 07:43:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-28 07:43:49,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:49,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:49,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:49,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:49,036 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:43:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-04-28 07:43:49,037 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 142 [2022-04-28 07:43:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:49,037 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-04-28 07:43:49,037 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:43:49,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 99 transitions. [2022-04-28 07:43:49,193 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:43:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-28 07:43:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-28 07:43:49,194 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:49,194 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:43:49,199 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:43:49,394 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:43:49,394 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:49,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:49,395 INFO L85 PathProgramCache]: Analyzing trace with hash -157742263, now seen corresponding path program 35 times [2022-04-28 07:43:49,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:49,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [3963956] [2022-04-28 07:43:49,466 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:49,467 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:49,467 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:49,467 INFO L85 PathProgramCache]: Analyzing trace with hash -157742263, now seen corresponding path program 36 times [2022-04-28 07:43:49,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:49,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2770006] [2022-04-28 07:43:49,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:49,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:49,506 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:49,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [577855621] [2022-04-28 07:43:49,506 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:43:49,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:49,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:49,515 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:43:49,531 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:44:00,105 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 07:44:00,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:44:00,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-28 07:44:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:44:00,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:44:00,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-28 07:44:00,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {12908#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); {12908#true} is VALID [2022-04-28 07:44:00,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12908#true} {12908#true} #60#return; {12908#true} is VALID [2022-04-28 07:44:00,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {12908#true} call #t~ret5 := main(); {12908#true} is VALID [2022-04-28 07:44:00,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {12908#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; {12908#true} is VALID [2022-04-28 07:44:00,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {12908#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {12908#true} is VALID [2022-04-28 07:44:00,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,828 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12908#true} {12908#true} #52#return; {12908#true} is VALID [2022-04-28 07:44:00,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {12908#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12946#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:00,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {12946#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {12946#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:00,829 INFO L272 TraceCheckUtils]: 13: Hoare triple {12946#(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)); {12908#true} is VALID [2022-04-28 07:44:00,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,830 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12908#true} {12946#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {12946#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:00,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {12946#(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; {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:44:00,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:44:00,830 INFO L272 TraceCheckUtils]: 20: Hoare triple {12968#(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)); {12908#true} is VALID [2022-04-28 07:44:00,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,831 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {12908#true} {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:44:00,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {12968#(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; {12990#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:44:00,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {12990#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {12990#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:44:00,832 INFO L272 TraceCheckUtils]: 27: Hoare triple {12990#(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)); {12908#true} is VALID [2022-04-28 07:44:00,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,832 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12908#true} {12990#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {12990#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:44:00,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {12990#(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; {13012#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:44:00,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {13012#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {13012#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:44:00,833 INFO L272 TraceCheckUtils]: 34: Hoare triple {13012#(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)); {12908#true} is VALID [2022-04-28 07:44:00,833 INFO L290 TraceCheckUtils]: 35: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,833 INFO L290 TraceCheckUtils]: 36: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,833 INFO L290 TraceCheckUtils]: 37: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,834 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12908#true} {13012#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {13012#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:44:00,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {13012#(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; {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:00,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:00,834 INFO L272 TraceCheckUtils]: 41: Hoare triple {13034#(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)); {12908#true} is VALID [2022-04-28 07:44:00,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,835 INFO L290 TraceCheckUtils]: 43: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,835 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12908#true} {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:00,835 INFO L290 TraceCheckUtils]: 46: Hoare triple {13034#(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; {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:44:00,836 INFO L290 TraceCheckUtils]: 47: Hoare triple {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !false; {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:44:00,836 INFO L272 TraceCheckUtils]: 48: Hoare triple {13056#(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)); {12908#true} is VALID [2022-04-28 07:44:00,836 INFO L290 TraceCheckUtils]: 49: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,836 INFO L290 TraceCheckUtils]: 50: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,836 INFO L290 TraceCheckUtils]: 51: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,836 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12908#true} {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #54#return; {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:44:00,837 INFO L290 TraceCheckUtils]: 53: Hoare triple {13056#(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; {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-28 07:44:00,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !false; {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-28 07:44:00,837 INFO L272 TraceCheckUtils]: 55: Hoare triple {13078#(and (= main_~y~0 6) (= (+ main_~c~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)); {12908#true} is VALID [2022-04-28 07:44:00,837 INFO L290 TraceCheckUtils]: 56: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,837 INFO L290 TraceCheckUtils]: 57: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,837 INFO L290 TraceCheckUtils]: 58: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,838 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12908#true} {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #54#return; {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-28 07:44:00,838 INFO L290 TraceCheckUtils]: 60: Hoare triple {13078#(and (= main_~y~0 6) (= (+ main_~c~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; {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-28 07:44:00,838 INFO L290 TraceCheckUtils]: 61: Hoare triple {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} assume !false; {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-28 07:44:00,839 INFO L272 TraceCheckUtils]: 62: Hoare triple {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 07:44:00,839 INFO L290 TraceCheckUtils]: 63: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,839 INFO L290 TraceCheckUtils]: 64: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,839 INFO L290 TraceCheckUtils]: 65: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,839 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12908#true} {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} #54#return; {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-28 07:44:00,839 INFO L290 TraceCheckUtils]: 67: Hoare triple {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:00,840 INFO L290 TraceCheckUtils]: 68: Hoare triple {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} assume !false; {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:00,840 INFO L272 TraceCheckUtils]: 69: Hoare triple {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 07:44:00,840 INFO L290 TraceCheckUtils]: 70: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,840 INFO L290 TraceCheckUtils]: 71: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,840 INFO L290 TraceCheckUtils]: 72: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,840 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12908#true} {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} #54#return; {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:00,841 INFO L290 TraceCheckUtils]: 74: Hoare triple {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:44:00,841 INFO L290 TraceCheckUtils]: 75: Hoare triple {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !false; {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:44:00,841 INFO L272 TraceCheckUtils]: 76: Hoare triple {13144#(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)); {12908#true} is VALID [2022-04-28 07:44:00,841 INFO L290 TraceCheckUtils]: 77: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,841 INFO L290 TraceCheckUtils]: 78: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,841 INFO L290 TraceCheckUtils]: 79: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,842 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12908#true} {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} #54#return; {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:44:00,842 INFO L290 TraceCheckUtils]: 81: Hoare triple {13144#(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; {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:44:00,843 INFO L290 TraceCheckUtils]: 82: Hoare triple {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:44:00,843 INFO L272 TraceCheckUtils]: 83: Hoare triple {13166#(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)); {12908#true} is VALID [2022-04-28 07:44:00,843 INFO L290 TraceCheckUtils]: 84: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,843 INFO L290 TraceCheckUtils]: 85: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,843 INFO L290 TraceCheckUtils]: 86: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,843 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {12908#true} {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #54#return; {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:44:00,844 INFO L290 TraceCheckUtils]: 88: Hoare triple {13166#(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; {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-28 07:44:00,844 INFO L290 TraceCheckUtils]: 89: Hoare triple {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-28 07:44:00,844 INFO L272 TraceCheckUtils]: 90: Hoare triple {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 07:44:00,844 INFO L290 TraceCheckUtils]: 91: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,844 INFO L290 TraceCheckUtils]: 92: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,844 INFO L290 TraceCheckUtils]: 93: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,845 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {12908#true} {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #54#return; {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-28 07:44:00,845 INFO L290 TraceCheckUtils]: 95: Hoare triple {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13210#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:44:00,845 INFO L290 TraceCheckUtils]: 96: Hoare triple {13210#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {13210#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:44:00,845 INFO L272 TraceCheckUtils]: 97: Hoare triple {13210#(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)); {12908#true} is VALID [2022-04-28 07:44:00,845 INFO L290 TraceCheckUtils]: 98: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,845 INFO L290 TraceCheckUtils]: 99: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,845 INFO L290 TraceCheckUtils]: 100: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,846 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {12908#true} {13210#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {13210#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:44:00,846 INFO L290 TraceCheckUtils]: 102: Hoare triple {13210#(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; {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:00,847 INFO L290 TraceCheckUtils]: 103: Hoare triple {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:00,847 INFO L272 TraceCheckUtils]: 104: Hoare triple {13232#(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)); {12908#true} is VALID [2022-04-28 07:44:00,847 INFO L290 TraceCheckUtils]: 105: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,847 INFO L290 TraceCheckUtils]: 106: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,847 INFO L290 TraceCheckUtils]: 107: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,847 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {12908#true} {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:00,848 INFO L290 TraceCheckUtils]: 109: Hoare triple {13232#(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; {13254#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:44:00,848 INFO L290 TraceCheckUtils]: 110: Hoare triple {13254#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {13254#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:44:00,848 INFO L272 TraceCheckUtils]: 111: Hoare triple {13254#(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)); {12908#true} is VALID [2022-04-28 07:44:00,848 INFO L290 TraceCheckUtils]: 112: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,848 INFO L290 TraceCheckUtils]: 113: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,848 INFO L290 TraceCheckUtils]: 114: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,848 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {12908#true} {13254#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {13254#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 07:44:00,849 INFO L290 TraceCheckUtils]: 116: Hoare triple {13254#(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; {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:00,849 INFO L290 TraceCheckUtils]: 117: Hoare triple {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:00,849 INFO L272 TraceCheckUtils]: 118: Hoare triple {13276#(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)); {12908#true} is VALID [2022-04-28 07:44:00,849 INFO L290 TraceCheckUtils]: 119: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,849 INFO L290 TraceCheckUtils]: 120: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,849 INFO L290 TraceCheckUtils]: 121: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,850 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12908#true} {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:00,850 INFO L290 TraceCheckUtils]: 123: Hoare triple {13276#(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; {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 07:44:00,851 INFO L290 TraceCheckUtils]: 124: Hoare triple {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !false; {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 07:44:00,851 INFO L272 TraceCheckUtils]: 125: Hoare triple {13298#(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)); {12908#true} is VALID [2022-04-28 07:44:00,851 INFO L290 TraceCheckUtils]: 126: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,851 INFO L290 TraceCheckUtils]: 127: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,851 INFO L290 TraceCheckUtils]: 128: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,851 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {12908#true} {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} #54#return; {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 07:44:00,852 INFO L290 TraceCheckUtils]: 130: Hoare triple {13298#(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; {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-28 07:44:00,852 INFO L290 TraceCheckUtils]: 131: Hoare triple {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} assume !false; {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-28 07:44:00,852 INFO L272 TraceCheckUtils]: 132: Hoare triple {13320#(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)); {12908#true} is VALID [2022-04-28 07:44:00,852 INFO L290 TraceCheckUtils]: 133: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,852 INFO L290 TraceCheckUtils]: 134: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,852 INFO L290 TraceCheckUtils]: 135: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,853 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {12908#true} {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} #54#return; {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-28 07:44:00,853 INFO L290 TraceCheckUtils]: 137: Hoare triple {13320#(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; {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:44:00,853 INFO L290 TraceCheckUtils]: 138: Hoare triple {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:44:00,853 INFO L272 TraceCheckUtils]: 139: Hoare triple {13342#(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)); {12908#true} is VALID [2022-04-28 07:44:00,853 INFO L290 TraceCheckUtils]: 140: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:44:00,854 INFO L290 TraceCheckUtils]: 141: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:44:00,854 INFO L290 TraceCheckUtils]: 142: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:44:00,854 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {12908#true} {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #54#return; {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:44:00,855 INFO L290 TraceCheckUtils]: 144: Hoare triple {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !(~c~0 < ~k~0); {13364#(and (< 17 main_~k~0) (<= main_~k~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 07:44:00,855 INFO L272 TraceCheckUtils]: 145: Hoare triple {13364#(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)); {13368#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:44:00,855 INFO L290 TraceCheckUtils]: 146: Hoare triple {13368#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13372#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:44:00,856 INFO L290 TraceCheckUtils]: 147: Hoare triple {13372#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12909#false} is VALID [2022-04-28 07:44:00,856 INFO L290 TraceCheckUtils]: 148: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-28 07:44:00,856 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:44:00,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:44:01,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:44:01,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2770006] [2022-04-28 07:44:01,136 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:44:01,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577855621] [2022-04-28 07:44:01,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577855621] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:44:01,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:44:01,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2022-04-28 07:44:01,137 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:44:01,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [3963956] [2022-04-28 07:44:01,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [3963956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:44:01,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:44:01,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 07:44:01,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768570656] [2022-04-28 07:44:01,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:44:01,137 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:44:01,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:44:01,138 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:44:01,225 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:44:01,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 07:44:01,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:01,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 07:44:01,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-04-28 07:44:01,226 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:44:04,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:04,116 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2022-04-28 07:44:04,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 07:44:04,116 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:44:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:44:04,117 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:44:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-28 07:44:04,118 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:44:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-28 07:44:04,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 104 transitions. [2022-04-28 07:44:04,230 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:44:04,231 INFO L225 Difference]: With dead ends: 90 [2022-04-28 07:44:04,231 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 07:44:04,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2022-04-28 07:44:04,232 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:44:04,232 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.4s Time] [2022-04-28 07:44:04,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 07:44:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-28 07:44:04,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:44:04,314 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:44:04,315 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:44:04,315 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:44:04,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:04,316 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-28 07:44:04,316 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-28 07:44:04,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:04,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:04,317 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:44:04,317 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:44:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:04,318 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-28 07:44:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-28 07:44:04,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:04,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:04,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:44:04,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:44:04,319 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:44:04,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-04-28 07:44:04,320 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 149 [2022-04-28 07:44:04,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:44:04,320 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-04-28 07:44:04,321 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:44:04,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 103 transitions. [2022-04-28 07:44:04,465 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:44:04,465 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-28 07:44:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-28 07:44:04,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:44:04,466 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:44:04,474 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:44:04,672 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:44:04,672 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:44:04,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:44:04,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1167462824, now seen corresponding path program 37 times [2022-04-28 07:44:04,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:04,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1028017907] [2022-04-28 07:44:04,737 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:44:04,737 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:44:04,737 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:44:04,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1167462824, now seen corresponding path program 38 times [2022-04-28 07:44:04,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:44:04,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555485565] [2022-04-28 07:44:04,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:44:04,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:44:04,750 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:44:04,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [476992728] [2022-04-28 07:44:04,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:44:04,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:44:04,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:44:04,752 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:44:04,752 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:44:05,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:44:05,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:44:05,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-28 07:44:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:44:05,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:44:06,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {13944#true} call ULTIMATE.init(); {13944#true} is VALID [2022-04-28 07:44:06,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {13944#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); {13944#true} is VALID [2022-04-28 07:44:06,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13944#true} {13944#true} #60#return; {13944#true} is VALID [2022-04-28 07:44:06,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {13944#true} call #t~ret5 := main(); {13944#true} is VALID [2022-04-28 07:44:06,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {13944#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; {13944#true} is VALID [2022-04-28 07:44:06,277 INFO L272 TraceCheckUtils]: 6: Hoare triple {13944#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {13944#true} is VALID [2022-04-28 07:44:06,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,277 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13944#true} {13944#true} #52#return; {13944#true} is VALID [2022-04-28 07:44:06,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {13944#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13982#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:06,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {13982#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {13982#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:06,278 INFO L272 TraceCheckUtils]: 13: Hoare triple {13982#(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)); {13944#true} is VALID [2022-04-28 07:44:06,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,278 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13944#true} {13982#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {13982#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:06,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {13982#(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; {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:44:06,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:44:06,279 INFO L272 TraceCheckUtils]: 20: Hoare triple {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-28 07:44:06,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,280 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {13944#true} {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #54#return; {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:44:06,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !false; {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,281 INFO L272 TraceCheckUtils]: 27: Hoare triple {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-28 07:44:06,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,281 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13944#true} {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} #54#return; {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,282 INFO L290 TraceCheckUtils]: 32: Hoare triple {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,282 INFO L290 TraceCheckUtils]: 33: Hoare triple {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} assume !false; {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,282 INFO L272 TraceCheckUtils]: 34: Hoare triple {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-28 07:44:06,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,282 INFO L290 TraceCheckUtils]: 36: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,282 INFO L290 TraceCheckUtils]: 37: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,283 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13944#true} {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} #54#return; {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,283 INFO L290 TraceCheckUtils]: 39: Hoare triple {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:44:06,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} assume !false; {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:44:06,284 INFO L272 TraceCheckUtils]: 41: Hoare triple {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 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)); {13944#true} is VALID [2022-04-28 07:44:06,284 INFO L290 TraceCheckUtils]: 42: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,284 INFO L290 TraceCheckUtils]: 43: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,284 INFO L290 TraceCheckUtils]: 44: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,284 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13944#true} {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} #54#return; {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:44:06,285 INFO L290 TraceCheckUtils]: 46: Hoare triple {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 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; {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,285 INFO L290 TraceCheckUtils]: 47: Hoare triple {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} assume !false; {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,285 INFO L272 TraceCheckUtils]: 48: Hoare triple {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 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)); {13944#true} is VALID [2022-04-28 07:44:06,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,285 INFO L290 TraceCheckUtils]: 50: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,285 INFO L290 TraceCheckUtils]: 51: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,288 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13944#true} {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} #54#return; {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,288 INFO L290 TraceCheckUtils]: 53: Hoare triple {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 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; {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,289 INFO L290 TraceCheckUtils]: 54: Hoare triple {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} assume !false; {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,289 INFO L272 TraceCheckUtils]: 55: Hoare triple {14114#(and (= (+ main_~y~0 (- 4)) 2) (= 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)); {13944#true} is VALID [2022-04-28 07:44:06,289 INFO L290 TraceCheckUtils]: 56: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,289 INFO L290 TraceCheckUtils]: 57: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,289 INFO L290 TraceCheckUtils]: 58: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,289 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13944#true} {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} #54#return; {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,290 INFO L290 TraceCheckUtils]: 60: Hoare triple {14114#(and (= (+ main_~y~0 (- 4)) 2) (= 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; {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,290 INFO L290 TraceCheckUtils]: 61: Hoare triple {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} assume !false; {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,290 INFO L272 TraceCheckUtils]: 62: Hoare triple {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-28 07:44:06,290 INFO L290 TraceCheckUtils]: 63: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,290 INFO L290 TraceCheckUtils]: 64: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,290 INFO L290 TraceCheckUtils]: 65: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,291 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13944#true} {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} #54#return; {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,291 INFO L290 TraceCheckUtils]: 67: Hoare triple {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,292 INFO L290 TraceCheckUtils]: 68: Hoare triple {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,292 INFO L272 TraceCheckUtils]: 69: Hoare triple {14158#(and (= (+ main_~y~0 (- 6)) 2) (= 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)); {13944#true} is VALID [2022-04-28 07:44:06,292 INFO L290 TraceCheckUtils]: 70: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,292 INFO L290 TraceCheckUtils]: 71: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,292 INFO L290 TraceCheckUtils]: 72: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,292 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13944#true} {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} #54#return; {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,293 INFO L290 TraceCheckUtils]: 74: Hoare triple {14158#(and (= (+ main_~y~0 (- 6)) 2) (= 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; {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,293 INFO L290 TraceCheckUtils]: 75: Hoare triple {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,293 INFO L272 TraceCheckUtils]: 76: Hoare triple {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-28 07:44:06,293 INFO L290 TraceCheckUtils]: 77: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,293 INFO L290 TraceCheckUtils]: 78: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,293 INFO L290 TraceCheckUtils]: 79: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,294 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13944#true} {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} #54#return; {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,294 INFO L290 TraceCheckUtils]: 81: Hoare triple {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,295 INFO L290 TraceCheckUtils]: 82: Hoare triple {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} assume !false; {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,295 INFO L272 TraceCheckUtils]: 83: Hoare triple {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-28 07:44:06,295 INFO L290 TraceCheckUtils]: 84: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,295 INFO L290 TraceCheckUtils]: 85: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,295 INFO L290 TraceCheckUtils]: 86: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,299 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13944#true} {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} #54#return; {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,300 INFO L290 TraceCheckUtils]: 88: Hoare triple {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,300 INFO L290 TraceCheckUtils]: 89: Hoare triple {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !false; {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,300 INFO L272 TraceCheckUtils]: 90: Hoare triple {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-28 07:44:06,300 INFO L290 TraceCheckUtils]: 91: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,300 INFO L290 TraceCheckUtils]: 92: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,300 INFO L290 TraceCheckUtils]: 93: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,301 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {13944#true} {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} #54#return; {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,301 INFO L290 TraceCheckUtils]: 95: Hoare triple {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,302 INFO L290 TraceCheckUtils]: 96: Hoare triple {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} assume !false; {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,302 INFO L272 TraceCheckUtils]: 97: Hoare triple {14246#(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)); {13944#true} is VALID [2022-04-28 07:44:06,302 INFO L290 TraceCheckUtils]: 98: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,302 INFO L290 TraceCheckUtils]: 99: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,302 INFO L290 TraceCheckUtils]: 100: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,303 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13944#true} {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} #54#return; {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,303 INFO L290 TraceCheckUtils]: 102: Hoare triple {14246#(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; {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-28 07:44:06,303 INFO L290 TraceCheckUtils]: 103: Hoare triple {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-28 07:44:06,304 INFO L272 TraceCheckUtils]: 104: Hoare triple {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-28 07:44:06,304 INFO L290 TraceCheckUtils]: 105: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,304 INFO L290 TraceCheckUtils]: 106: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,304 INFO L290 TraceCheckUtils]: 107: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,304 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {13944#true} {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} #54#return; {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-28 07:44:06,305 INFO L290 TraceCheckUtils]: 109: Hoare triple {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:44:06,305 INFO L290 TraceCheckUtils]: 110: Hoare triple {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !false; {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:44:06,305 INFO L272 TraceCheckUtils]: 111: Hoare triple {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-28 07:44:06,305 INFO L290 TraceCheckUtils]: 112: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,305 INFO L290 TraceCheckUtils]: 113: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,305 INFO L290 TraceCheckUtils]: 114: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,306 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {13944#true} {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} #54#return; {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 07:44:06,306 INFO L290 TraceCheckUtils]: 116: Hoare triple {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:44:06,307 INFO L290 TraceCheckUtils]: 117: Hoare triple {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} assume !false; {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:44:06,307 INFO L272 TraceCheckUtils]: 118: Hoare triple {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~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)); {13944#true} is VALID [2022-04-28 07:44:06,307 INFO L290 TraceCheckUtils]: 119: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,307 INFO L290 TraceCheckUtils]: 120: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,307 INFO L290 TraceCheckUtils]: 121: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,308 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13944#true} {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} #54#return; {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:44:06,308 INFO L290 TraceCheckUtils]: 123: Hoare triple {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~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; {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,309 INFO L290 TraceCheckUtils]: 124: Hoare triple {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} assume !false; {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,309 INFO L272 TraceCheckUtils]: 125: Hoare triple {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 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)); {13944#true} is VALID [2022-04-28 07:44:06,309 INFO L290 TraceCheckUtils]: 126: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,309 INFO L290 TraceCheckUtils]: 127: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,309 INFO L290 TraceCheckUtils]: 128: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,309 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {13944#true} {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} #54#return; {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-28 07:44:06,310 INFO L290 TraceCheckUtils]: 130: Hoare triple {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 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; {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-28 07:44:06,310 INFO L290 TraceCheckUtils]: 131: Hoare triple {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !false; {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-28 07:44:06,311 INFO L272 TraceCheckUtils]: 132: Hoare triple {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13944#true} is VALID [2022-04-28 07:44:06,311 INFO L290 TraceCheckUtils]: 133: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,311 INFO L290 TraceCheckUtils]: 134: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,311 INFO L290 TraceCheckUtils]: 135: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,311 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {13944#true} {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} #54#return; {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-28 07:44:06,312 INFO L290 TraceCheckUtils]: 137: Hoare triple {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-28 07:44:06,312 INFO L290 TraceCheckUtils]: 138: Hoare triple {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !false; {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-28 07:44:06,312 INFO L272 TraceCheckUtils]: 139: Hoare triple {14378#(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)); {13944#true} is VALID [2022-04-28 07:44:06,312 INFO L290 TraceCheckUtils]: 140: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,312 INFO L290 TraceCheckUtils]: 141: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,312 INFO L290 TraceCheckUtils]: 142: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,313 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {13944#true} {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} #54#return; {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-28 07:44:06,313 INFO L290 TraceCheckUtils]: 144: Hoare triple {14378#(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; {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-28 07:44:06,313 INFO L290 TraceCheckUtils]: 145: Hoare triple {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} assume !false; {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-28 07:44:06,313 INFO L272 TraceCheckUtils]: 146: Hoare triple {14400#(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)); {13944#true} is VALID [2022-04-28 07:44:06,313 INFO L290 TraceCheckUtils]: 147: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 07:44:06,313 INFO L290 TraceCheckUtils]: 148: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 07:44:06,314 INFO L290 TraceCheckUtils]: 149: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 07:44:06,314 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {13944#true} {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} #54#return; {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-28 07:44:06,315 INFO L290 TraceCheckUtils]: 151: Hoare triple {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} assume !(~c~0 < ~k~0); {14422#(and (< 18 main_~k~0) (<= main_~k~0 19) (= 19 main_~y~0))} is VALID [2022-04-28 07:44:06,316 INFO L272 TraceCheckUtils]: 152: Hoare triple {14422#(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)); {14426#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:44:06,316 INFO L290 TraceCheckUtils]: 153: Hoare triple {14426#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14430#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:44:06,316 INFO L290 TraceCheckUtils]: 154: Hoare triple {14430#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13945#false} is VALID [2022-04-28 07:44:06,316 INFO L290 TraceCheckUtils]: 155: Hoare triple {13945#false} assume !false; {13945#false} is VALID [2022-04-28 07:44:06,317 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:44:06,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:44:08,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:44:08,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555485565] [2022-04-28 07:44:08,445 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:44:08,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476992728] [2022-04-28 07:44:08,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476992728] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:44:08,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:44:08,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-04-28 07:44:08,446 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:44:08,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1028017907] [2022-04-28 07:44:08,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1028017907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:44:08,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:44:08,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 07:44:08,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839936961] [2022-04-28 07:44:08,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:44:08,446 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:44:08,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:44:08,447 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:44:08,527 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:44:08,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 07:44:08,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:08,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 07:44:08,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1613, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 07:44:08,528 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:44:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:12,348 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-04-28 07:44:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 07:44:12,348 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:44:12,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:44:12,348 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:44:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-28 07:44:12,350 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:44:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-28 07:44:12,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 108 transitions. [2022-04-28 07:44:12,515 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:44:12,516 INFO L225 Difference]: With dead ends: 93 [2022-04-28 07:44:12,516 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 07:44:12,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=467, Invalid=1789, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 07:44:12,517 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 07:44:12,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 907 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 07:44:12,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 07:44:12,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-28 07:44:12,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:44:12,614 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:44:12,614 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:44:12,614 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:44:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:12,615 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-28 07:44:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-28 07:44:12,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:12,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:12,616 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:44:12,616 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:44:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:12,618 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-28 07:44:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-28 07:44:12,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:12,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:12,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:44:12,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:44:12,618 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:44:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-04-28 07:44:12,620 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 156 [2022-04-28 07:44:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:44:12,620 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-04-28 07:44:12,620 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:44:12,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 107 transitions. [2022-04-28 07:44:12,846 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:44:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-28 07:44:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-28 07:44:12,846 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:44:12,847 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:44:12,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 07:44:13,051 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:44:13,052 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:44:13,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:44:13,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1670771305, now seen corresponding path program 39 times [2022-04-28 07:44:13,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:13,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1132752718] [2022-04-28 07:44:13,129 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:44:13,129 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:44:13,129 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:44:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1670771305, now seen corresponding path program 40 times [2022-04-28 07:44:13,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:44:13,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853595601] [2022-04-28 07:44:13,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:44:13,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:44:13,154 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:44:13,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [149894834] [2022-04-28 07:44:13,155 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:44:13,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:44:13,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:44:13,156 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:44:13,156 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:44:13,653 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:44:13,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:44:13,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-28 07:44:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:44:13,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:44:14,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {15416#true} call ULTIMATE.init(); {15416#true} is VALID [2022-04-28 07:44:14,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {15416#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); {15416#true} is VALID [2022-04-28 07:44:14,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15416#true} {15416#true} #60#return; {15416#true} is VALID [2022-04-28 07:44:14,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {15416#true} call #t~ret5 := main(); {15416#true} is VALID [2022-04-28 07:44:14,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {15416#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; {15416#true} is VALID [2022-04-28 07:44:14,529 INFO L272 TraceCheckUtils]: 6: Hoare triple {15416#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {15416#true} is VALID [2022-04-28 07:44:14,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,530 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15416#true} {15416#true} #52#return; {15416#true} is VALID [2022-04-28 07:44:14,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {15416#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15454#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:14,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {15454#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {15454#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:14,530 INFO L272 TraceCheckUtils]: 13: Hoare triple {15454#(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)); {15416#true} is VALID [2022-04-28 07:44:14,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,531 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15416#true} {15454#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {15454#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:14,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {15454#(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; {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:44:14,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:44:14,532 INFO L272 TraceCheckUtils]: 20: Hoare triple {15476#(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)); {15416#true} is VALID [2022-04-28 07:44:14,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,532 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {15416#true} {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:44:14,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {15476#(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; {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:44:14,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:44:14,533 INFO L272 TraceCheckUtils]: 27: Hoare triple {15498#(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)); {15416#true} is VALID [2022-04-28 07:44:14,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,534 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15416#true} {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:44:14,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {15498#(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; {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:44:14,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:44:14,535 INFO L272 TraceCheckUtils]: 34: Hoare triple {15520#(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)); {15416#true} is VALID [2022-04-28 07:44:14,535 INFO L290 TraceCheckUtils]: 35: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,535 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15416#true} {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:44:14,536 INFO L290 TraceCheckUtils]: 39: Hoare triple {15520#(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; {15542#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:44:14,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {15542#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {15542#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:44:14,536 INFO L272 TraceCheckUtils]: 41: Hoare triple {15542#(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)); {15416#true} is VALID [2022-04-28 07:44:14,536 INFO L290 TraceCheckUtils]: 42: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,536 INFO L290 TraceCheckUtils]: 43: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,536 INFO L290 TraceCheckUtils]: 44: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,536 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15416#true} {15542#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {15542#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:44:14,537 INFO L290 TraceCheckUtils]: 46: Hoare triple {15542#(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; {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:44:14,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:44:14,537 INFO L272 TraceCheckUtils]: 48: Hoare triple {15564#(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)); {15416#true} is VALID [2022-04-28 07:44:14,537 INFO L290 TraceCheckUtils]: 49: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,538 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15416#true} {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:44:14,538 INFO L290 TraceCheckUtils]: 53: Hoare triple {15564#(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; {15586#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:44:14,539 INFO L290 TraceCheckUtils]: 54: Hoare triple {15586#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {15586#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:44:14,539 INFO L272 TraceCheckUtils]: 55: Hoare triple {15586#(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)); {15416#true} is VALID [2022-04-28 07:44:14,539 INFO L290 TraceCheckUtils]: 56: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,539 INFO L290 TraceCheckUtils]: 57: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,539 INFO L290 TraceCheckUtils]: 58: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,547 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15416#true} {15586#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {15586#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:44:14,548 INFO L290 TraceCheckUtils]: 60: Hoare triple {15586#(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; {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:44:14,548 INFO L290 TraceCheckUtils]: 61: Hoare triple {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:44:14,549 INFO L272 TraceCheckUtils]: 62: Hoare triple {15608#(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)); {15416#true} is VALID [2022-04-28 07:44:14,549 INFO L290 TraceCheckUtils]: 63: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,549 INFO L290 TraceCheckUtils]: 64: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,549 INFO L290 TraceCheckUtils]: 65: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,549 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15416#true} {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:44:14,550 INFO L290 TraceCheckUtils]: 67: Hoare triple {15608#(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; {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:14,550 INFO L290 TraceCheckUtils]: 68: Hoare triple {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !false; {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:14,550 INFO L272 TraceCheckUtils]: 69: Hoare triple {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-28 07:44:14,550 INFO L290 TraceCheckUtils]: 70: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,550 INFO L290 TraceCheckUtils]: 71: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,550 INFO L290 TraceCheckUtils]: 72: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,551 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15416#true} {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #54#return; {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:14,551 INFO L290 TraceCheckUtils]: 74: Hoare triple {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:44:14,552 INFO L290 TraceCheckUtils]: 75: Hoare triple {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !false; {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:44:14,552 INFO L272 TraceCheckUtils]: 76: Hoare triple {15652#(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)); {15416#true} is VALID [2022-04-28 07:44:14,552 INFO L290 TraceCheckUtils]: 77: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,552 INFO L290 TraceCheckUtils]: 78: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,552 INFO L290 TraceCheckUtils]: 79: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,552 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15416#true} {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} #54#return; {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 07:44:14,553 INFO L290 TraceCheckUtils]: 81: Hoare triple {15652#(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; {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:44:14,553 INFO L290 TraceCheckUtils]: 82: Hoare triple {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} assume !false; {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:44:14,553 INFO L272 TraceCheckUtils]: 83: Hoare triple {15674#(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)); {15416#true} is VALID [2022-04-28 07:44:14,553 INFO L290 TraceCheckUtils]: 84: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,554 INFO L290 TraceCheckUtils]: 85: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,554 INFO L290 TraceCheckUtils]: 86: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,554 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {15416#true} {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} #54#return; {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:44:14,555 INFO L290 TraceCheckUtils]: 88: Hoare triple {15674#(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; {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-28 07:44:14,555 INFO L290 TraceCheckUtils]: 89: Hoare triple {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} assume !false; {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-28 07:44:14,555 INFO L272 TraceCheckUtils]: 90: Hoare triple {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-28 07:44:14,555 INFO L290 TraceCheckUtils]: 91: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,555 INFO L290 TraceCheckUtils]: 92: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,555 INFO L290 TraceCheckUtils]: 93: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,556 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {15416#true} {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} #54#return; {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-28 07:44:14,556 INFO L290 TraceCheckUtils]: 95: Hoare triple {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15718#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:44:14,557 INFO L290 TraceCheckUtils]: 96: Hoare triple {15718#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {15718#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:44:14,557 INFO L272 TraceCheckUtils]: 97: Hoare triple {15718#(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)); {15416#true} is VALID [2022-04-28 07:44:14,557 INFO L290 TraceCheckUtils]: 98: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,557 INFO L290 TraceCheckUtils]: 99: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,557 INFO L290 TraceCheckUtils]: 100: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,557 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15416#true} {15718#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {15718#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 07:44:14,558 INFO L290 TraceCheckUtils]: 102: Hoare triple {15718#(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; {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:14,558 INFO L290 TraceCheckUtils]: 103: Hoare triple {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:14,558 INFO L272 TraceCheckUtils]: 104: Hoare triple {15740#(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)); {15416#true} is VALID [2022-04-28 07:44:14,558 INFO L290 TraceCheckUtils]: 105: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,558 INFO L290 TraceCheckUtils]: 106: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,558 INFO L290 TraceCheckUtils]: 107: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,559 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15416#true} {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:14,559 INFO L290 TraceCheckUtils]: 109: Hoare triple {15740#(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; {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:44:14,560 INFO L290 TraceCheckUtils]: 110: Hoare triple {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:44:14,560 INFO L272 TraceCheckUtils]: 111: Hoare triple {15762#(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)); {15416#true} is VALID [2022-04-28 07:44:14,560 INFO L290 TraceCheckUtils]: 112: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,560 INFO L290 TraceCheckUtils]: 113: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,560 INFO L290 TraceCheckUtils]: 114: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,560 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {15416#true} {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #54#return; {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 07:44:14,561 INFO L290 TraceCheckUtils]: 116: Hoare triple {15762#(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; {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:14,561 INFO L290 TraceCheckUtils]: 117: Hoare triple {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:14,561 INFO L272 TraceCheckUtils]: 118: Hoare triple {15784#(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)); {15416#true} is VALID [2022-04-28 07:44:14,561 INFO L290 TraceCheckUtils]: 119: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,561 INFO L290 TraceCheckUtils]: 120: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,561 INFO L290 TraceCheckUtils]: 121: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,562 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {15416#true} {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:44:14,562 INFO L290 TraceCheckUtils]: 123: Hoare triple {15784#(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; {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-28 07:44:14,562 INFO L290 TraceCheckUtils]: 124: Hoare triple {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} assume !false; {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-28 07:44:14,563 INFO L272 TraceCheckUtils]: 125: Hoare triple {15806#(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)); {15416#true} is VALID [2022-04-28 07:44:14,563 INFO L290 TraceCheckUtils]: 126: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,563 INFO L290 TraceCheckUtils]: 127: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,563 INFO L290 TraceCheckUtils]: 128: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,563 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {15416#true} {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} #54#return; {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-28 07:44:14,564 INFO L290 TraceCheckUtils]: 130: Hoare triple {15806#(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; {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:44:14,564 INFO L290 TraceCheckUtils]: 131: Hoare triple {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:44:14,564 INFO L272 TraceCheckUtils]: 132: Hoare triple {15828#(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)); {15416#true} is VALID [2022-04-28 07:44:14,564 INFO L290 TraceCheckUtils]: 133: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,564 INFO L290 TraceCheckUtils]: 134: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,564 INFO L290 TraceCheckUtils]: 135: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,565 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {15416#true} {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #54#return; {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 07:44:14,565 INFO L290 TraceCheckUtils]: 137: Hoare triple {15828#(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; {15850#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:44:14,565 INFO L290 TraceCheckUtils]: 138: Hoare triple {15850#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {15850#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:44:14,565 INFO L272 TraceCheckUtils]: 139: Hoare triple {15850#(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)); {15416#true} is VALID [2022-04-28 07:44:14,565 INFO L290 TraceCheckUtils]: 140: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,565 INFO L290 TraceCheckUtils]: 141: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,566 INFO L290 TraceCheckUtils]: 142: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,566 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {15416#true} {15850#(and (= main_~c~0 18) (= main_~y~0 18))} #54#return; {15850#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 07:44:14,566 INFO L290 TraceCheckUtils]: 144: Hoare triple {15850#(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; {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:44:14,567 INFO L290 TraceCheckUtils]: 145: Hoare triple {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} assume !false; {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:44:14,567 INFO L272 TraceCheckUtils]: 146: Hoare triple {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15416#true} is VALID [2022-04-28 07:44:14,567 INFO L290 TraceCheckUtils]: 147: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,567 INFO L290 TraceCheckUtils]: 148: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,567 INFO L290 TraceCheckUtils]: 149: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,567 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {15416#true} {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} #54#return; {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 07:44:14,568 INFO L290 TraceCheckUtils]: 151: Hoare triple {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-28 07:44:14,568 INFO L290 TraceCheckUtils]: 152: Hoare triple {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} assume !false; {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-28 07:44:14,568 INFO L272 TraceCheckUtils]: 153: Hoare triple {15894#(and (<= main_~c~0 20) (< 19 main_~k~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)); {15416#true} is VALID [2022-04-28 07:44:14,568 INFO L290 TraceCheckUtils]: 154: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 07:44:14,568 INFO L290 TraceCheckUtils]: 155: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 07:44:14,568 INFO L290 TraceCheckUtils]: 156: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 07:44:14,569 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {15416#true} {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} #54#return; {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-28 07:44:14,569 INFO L290 TraceCheckUtils]: 158: Hoare triple {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} assume !(~c~0 < ~k~0); {15916#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-28 07:44:14,570 INFO L272 TraceCheckUtils]: 159: Hoare triple {15916#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15920#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:44:14,570 INFO L290 TraceCheckUtils]: 160: Hoare triple {15920#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15924#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:44:14,570 INFO L290 TraceCheckUtils]: 161: Hoare triple {15924#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15417#false} is VALID [2022-04-28 07:44:14,570 INFO L290 TraceCheckUtils]: 162: Hoare triple {15417#false} assume !false; {15417#false} is VALID [2022-04-28 07:44:14,571 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:44:14,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:44:14,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:44:14,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853595601] [2022-04-28 07:44:14,888 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:44:14,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149894834] [2022-04-28 07:44:14,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149894834] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:44:14,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:44:14,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-04-28 07:44:14,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:44:14,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1132752718] [2022-04-28 07:44:14,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1132752718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:44:14,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:44:14,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 07:44:14,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719924201] [2022-04-28 07:44:14,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:44:14,891 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:44:14,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:44:14,891 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:44:15,028 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:44:15,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 07:44:15,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:15,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 07:44:15,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-28 07:44:15,029 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:44:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:20,566 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-04-28 07:44:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 07:44:20,566 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:44:20,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:44:20,567 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:44:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-28 07:44:20,568 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:44:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-28 07:44:20,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 112 transitions. [2022-04-28 07:44:20,739 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:44:20,740 INFO L225 Difference]: With dead ends: 96 [2022-04-28 07:44:20,740 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 07:44:20,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2022-04-28 07:44:20,741 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 07:44:20,741 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.6s Time] [2022-04-28 07:44:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 07:44:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-28 07:44:20,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:44:20,845 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:44:20,846 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:44:20,846 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:44:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:20,847 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-28 07:44:20,847 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 07:44:20,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:20,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:20,848 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:44:20,848 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:44:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:20,850 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-28 07:44:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 07:44:20,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:20,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:20,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:44:20,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:44:20,850 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:44:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-04-28 07:44:20,852 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 163 [2022-04-28 07:44:20,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:44:20,852 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-04-28 07:44:20,852 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:44:20,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 111 transitions. [2022-04-28 07:44:21,087 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:44:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 07:44:21,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-04-28 07:44:21,088 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:44:21,088 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:44:21,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 07:44:21,288 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:44:21,288 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:44:21,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:44:21,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1329797496, now seen corresponding path program 41 times [2022-04-28 07:44:21,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:21,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1621861136] [2022-04-28 07:44:21,369 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:44:21,369 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:44:21,369 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:44:21,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1329797496, now seen corresponding path program 42 times [2022-04-28 07:44:21,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:44:21,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730152681] [2022-04-28 07:44:21,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:44:21,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:44:21,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:44:21,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324851936] [2022-04-28 07:44:21,400 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:44:21,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:44:21,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:44:21,401 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:44:21,402 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:44:22,134 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-28 07:44:22,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:44:22,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 07:44:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:44:22,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:44:23,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {16532#true} call ULTIMATE.init(); {16532#true} is VALID [2022-04-28 07:44:23,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {16532#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); {16532#true} is VALID [2022-04-28 07:44:23,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16532#true} {16532#true} #60#return; {16532#true} is VALID [2022-04-28 07:44:23,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {16532#true} call #t~ret5 := main(); {16532#true} is VALID [2022-04-28 07:44:23,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {16532#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; {16532#true} is VALID [2022-04-28 07:44:23,433 INFO L272 TraceCheckUtils]: 6: Hoare triple {16532#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {16532#true} is VALID [2022-04-28 07:44:23,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {16532#true} ~cond := #in~cond; {16558#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:44:23,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {16558#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {16562#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:44:23,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {16562#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {16562#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:44:23,434 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16562#(not (= |assume_abort_if_not_#in~cond| 0))} {16532#true} #52#return; {16569#(and (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 07:44:23,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {16569#(and (<= main_~k~0 20) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 07:44:23,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !false; {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 07:44:23,435 INFO L272 TraceCheckUtils]: 13: Hoare triple {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 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)); {16532#true} is VALID [2022-04-28 07:44:23,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,435 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16532#true} {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} #54#return; {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 07:44:23,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 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; {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 07:44:23,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 07:44:23,438 INFO L272 TraceCheckUtils]: 20: Hoare triple {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-28 07:44:23,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,439 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {16532#true} {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 07:44:23,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 07:44:23,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 07:44:23,443 INFO L272 TraceCheckUtils]: 27: Hoare triple {16617#(and (<= main_~k~0 20) (<= 0 main_~k~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)); {16532#true} is VALID [2022-04-28 07:44:23,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,443 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16532#true} {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} #54#return; {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 07:44:23,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {16617#(and (<= main_~k~0 20) (<= 0 main_~k~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; {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 07:44:23,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !false; {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 07:44:23,446 INFO L272 TraceCheckUtils]: 34: Hoare triple {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 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)); {16532#true} is VALID [2022-04-28 07:44:23,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,446 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16532#true} {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} #54#return; {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 07:44:23,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 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; {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 07:44:23,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !false; {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 07:44:23,449 INFO L272 TraceCheckUtils]: 41: Hoare triple {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 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)); {16532#true} is VALID [2022-04-28 07:44:23,450 INFO L290 TraceCheckUtils]: 42: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,450 INFO L290 TraceCheckUtils]: 43: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,450 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16532#true} {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} #54#return; {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 07:44:23,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 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; {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 07:44:23,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !false; {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 07:44:23,453 INFO L272 TraceCheckUtils]: 48: Hoare triple {16683#(and (<= main_~k~0 20) (<= 0 main_~k~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)); {16532#true} is VALID [2022-04-28 07:44:23,453 INFO L290 TraceCheckUtils]: 49: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,453 INFO L290 TraceCheckUtils]: 50: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,453 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16532#true} {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} #54#return; {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 07:44:23,455 INFO L290 TraceCheckUtils]: 53: Hoare triple {16683#(and (<= main_~k~0 20) (<= 0 main_~k~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; {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-28 07:44:23,455 INFO L290 TraceCheckUtils]: 54: Hoare triple {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} assume !false; {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-28 07:44:23,455 INFO L272 TraceCheckUtils]: 55: Hoare triple {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 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)); {16532#true} is VALID [2022-04-28 07:44:23,455 INFO L290 TraceCheckUtils]: 56: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,455 INFO L290 TraceCheckUtils]: 57: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,456 INFO L290 TraceCheckUtils]: 58: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,456 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16532#true} {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} #54#return; {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-28 07:44:23,459 INFO L290 TraceCheckUtils]: 60: Hoare triple {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 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; {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-28 07:44:23,460 INFO L290 TraceCheckUtils]: 61: Hoare triple {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} assume !false; {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-28 07:44:23,460 INFO L272 TraceCheckUtils]: 62: Hoare triple {16727#(and (<= main_~k~0 20) (<= 0 main_~k~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)); {16532#true} is VALID [2022-04-28 07:44:23,460 INFO L290 TraceCheckUtils]: 63: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,460 INFO L290 TraceCheckUtils]: 64: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,460 INFO L290 TraceCheckUtils]: 65: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,460 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16532#true} {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} #54#return; {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-28 07:44:23,462 INFO L290 TraceCheckUtils]: 67: Hoare triple {16727#(and (<= main_~k~0 20) (<= 0 main_~k~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; {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-28 07:44:23,462 INFO L290 TraceCheckUtils]: 68: Hoare triple {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} assume !false; {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-28 07:44:23,462 INFO L272 TraceCheckUtils]: 69: Hoare triple {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 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)); {16532#true} is VALID [2022-04-28 07:44:23,462 INFO L290 TraceCheckUtils]: 70: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,462 INFO L290 TraceCheckUtils]: 71: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,462 INFO L290 TraceCheckUtils]: 72: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,463 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16532#true} {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} #54#return; {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-28 07:44:23,466 INFO L290 TraceCheckUtils]: 74: Hoare triple {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 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; {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 07:44:23,466 INFO L290 TraceCheckUtils]: 75: Hoare triple {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 07:44:23,467 INFO L272 TraceCheckUtils]: 76: Hoare triple {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-28 07:44:23,467 INFO L290 TraceCheckUtils]: 77: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,467 INFO L290 TraceCheckUtils]: 78: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,467 INFO L290 TraceCheckUtils]: 79: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,467 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16532#true} {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 07:44:23,470 INFO L290 TraceCheckUtils]: 81: Hoare triple {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 07:44:23,471 INFO L290 TraceCheckUtils]: 82: Hoare triple {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 07:44:23,471 INFO L272 TraceCheckUtils]: 83: Hoare triple {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-28 07:44:23,471 INFO L290 TraceCheckUtils]: 84: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,471 INFO L290 TraceCheckUtils]: 85: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,471 INFO L290 TraceCheckUtils]: 86: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,471 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {16532#true} {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 07:44:23,473 INFO L290 TraceCheckUtils]: 88: Hoare triple {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 07:44:23,474 INFO L290 TraceCheckUtils]: 89: Hoare triple {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 07:44:23,474 INFO L272 TraceCheckUtils]: 90: Hoare triple {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-28 07:44:23,474 INFO L290 TraceCheckUtils]: 91: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,474 INFO L290 TraceCheckUtils]: 92: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,474 INFO L290 TraceCheckUtils]: 93: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,474 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {16532#true} {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 07:44:23,477 INFO L290 TraceCheckUtils]: 95: Hoare triple {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} is VALID [2022-04-28 07:44:23,477 INFO L290 TraceCheckUtils]: 96: Hoare triple {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} assume !false; {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} is VALID [2022-04-28 07:44:23,478 INFO L272 TraceCheckUtils]: 97: Hoare triple {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 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)); {16532#true} is VALID [2022-04-28 07:44:23,478 INFO L290 TraceCheckUtils]: 98: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,478 INFO L290 TraceCheckUtils]: 99: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,478 INFO L290 TraceCheckUtils]: 100: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,478 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {16532#true} {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} #54#return; {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} is VALID [2022-04-28 07:44:23,480 INFO L290 TraceCheckUtils]: 102: Hoare triple {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 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; {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} is VALID [2022-04-28 07:44:23,480 INFO L290 TraceCheckUtils]: 103: Hoare triple {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} assume !false; {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} is VALID [2022-04-28 07:44:23,481 INFO L272 TraceCheckUtils]: 104: Hoare triple {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 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)); {16532#true} is VALID [2022-04-28 07:44:23,481 INFO L290 TraceCheckUtils]: 105: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,481 INFO L290 TraceCheckUtils]: 106: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,481 INFO L290 TraceCheckUtils]: 107: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,481 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16532#true} {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} #54#return; {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} is VALID [2022-04-28 07:44:23,482 INFO L290 TraceCheckUtils]: 109: Hoare triple {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 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; {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} is VALID [2022-04-28 07:44:23,483 INFO L290 TraceCheckUtils]: 110: Hoare triple {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} assume !false; {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} is VALID [2022-04-28 07:44:23,483 INFO L272 TraceCheckUtils]: 111: Hoare triple {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 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)); {16532#true} is VALID [2022-04-28 07:44:23,483 INFO L290 TraceCheckUtils]: 112: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,483 INFO L290 TraceCheckUtils]: 113: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,483 INFO L290 TraceCheckUtils]: 114: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,483 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {16532#true} {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} #54#return; {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} is VALID [2022-04-28 07:44:23,486 INFO L290 TraceCheckUtils]: 116: Hoare triple {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 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; {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} is VALID [2022-04-28 07:44:23,487 INFO L290 TraceCheckUtils]: 117: Hoare triple {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} assume !false; {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} is VALID [2022-04-28 07:44:23,487 INFO L272 TraceCheckUtils]: 118: Hoare triple {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 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)); {16532#true} is VALID [2022-04-28 07:44:23,487 INFO L290 TraceCheckUtils]: 119: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,487 INFO L290 TraceCheckUtils]: 120: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,487 INFO L290 TraceCheckUtils]: 121: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,487 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {16532#true} {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} #54#return; {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} is VALID [2022-04-28 07:44:23,489 INFO L290 TraceCheckUtils]: 123: Hoare triple {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 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; {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} is VALID [2022-04-28 07:44:23,489 INFO L290 TraceCheckUtils]: 124: Hoare triple {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} assume !false; {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} is VALID [2022-04-28 07:44:23,490 INFO L272 TraceCheckUtils]: 125: Hoare triple {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 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)); {16532#true} is VALID [2022-04-28 07:44:23,490 INFO L290 TraceCheckUtils]: 126: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,490 INFO L290 TraceCheckUtils]: 127: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,490 INFO L290 TraceCheckUtils]: 128: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,490 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {16532#true} {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} #54#return; {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} is VALID [2022-04-28 07:44:23,492 INFO L290 TraceCheckUtils]: 130: Hoare triple {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 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; {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} is VALID [2022-04-28 07:44:23,492 INFO L290 TraceCheckUtils]: 131: Hoare triple {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} assume !false; {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} is VALID [2022-04-28 07:44:23,493 INFO L272 TraceCheckUtils]: 132: Hoare triple {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 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)); {16532#true} is VALID [2022-04-28 07:44:23,493 INFO L290 TraceCheckUtils]: 133: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,493 INFO L290 TraceCheckUtils]: 134: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,493 INFO L290 TraceCheckUtils]: 135: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,493 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {16532#true} {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} #54#return; {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} is VALID [2022-04-28 07:44:23,495 INFO L290 TraceCheckUtils]: 137: Hoare triple {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 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; {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 07:44:23,495 INFO L290 TraceCheckUtils]: 138: Hoare triple {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 07:44:23,495 INFO L272 TraceCheckUtils]: 139: Hoare triple {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-28 07:44:23,495 INFO L290 TraceCheckUtils]: 140: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,495 INFO L290 TraceCheckUtils]: 141: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,495 INFO L290 TraceCheckUtils]: 142: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,496 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {16532#true} {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 07:44:23,499 INFO L290 TraceCheckUtils]: 144: Hoare triple {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} is VALID [2022-04-28 07:44:23,499 INFO L290 TraceCheckUtils]: 145: Hoare triple {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} assume !false; {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} is VALID [2022-04-28 07:44:23,499 INFO L272 TraceCheckUtils]: 146: Hoare triple {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16532#true} is VALID [2022-04-28 07:44:23,499 INFO L290 TraceCheckUtils]: 147: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,499 INFO L290 TraceCheckUtils]: 148: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,500 INFO L290 TraceCheckUtils]: 149: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,500 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {16532#true} {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} #54#return; {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} is VALID [2022-04-28 07:44:23,503 INFO L290 TraceCheckUtils]: 151: Hoare triple {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} is VALID [2022-04-28 07:44:23,504 INFO L290 TraceCheckUtils]: 152: Hoare triple {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} assume !false; {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} is VALID [2022-04-28 07:44:23,504 INFO L272 TraceCheckUtils]: 153: Hoare triple {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 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)); {16532#true} is VALID [2022-04-28 07:44:23,504 INFO L290 TraceCheckUtils]: 154: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 07:44:23,504 INFO L290 TraceCheckUtils]: 155: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 07:44:23,504 INFO L290 TraceCheckUtils]: 156: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 07:44:23,504 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {16532#true} {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} #54#return; {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} is VALID [2022-04-28 07:44:23,507 INFO L290 TraceCheckUtils]: 158: Hoare triple {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 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; {16533#false} is VALID [2022-04-28 07:44:23,508 INFO L290 TraceCheckUtils]: 159: Hoare triple {16533#false} assume !false; {16533#false} is VALID [2022-04-28 07:44:23,508 INFO L272 TraceCheckUtils]: 160: Hoare triple {16533#false} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16533#false} is VALID [2022-04-28 07:44:23,508 INFO L290 TraceCheckUtils]: 161: Hoare triple {16533#false} ~cond := #in~cond; {16533#false} is VALID [2022-04-28 07:44:23,508 INFO L290 TraceCheckUtils]: 162: Hoare triple {16533#false} assume !(0 == ~cond); {16533#false} is VALID [2022-04-28 07:44:23,508 INFO L290 TraceCheckUtils]: 163: Hoare triple {16533#false} assume true; {16533#false} is VALID [2022-04-28 07:44:23,508 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {16533#false} {16533#false} #54#return; {16533#false} is VALID [2022-04-28 07:44:23,508 INFO L290 TraceCheckUtils]: 165: Hoare triple {16533#false} assume !(~c~0 < ~k~0); {16533#false} is VALID [2022-04-28 07:44:23,508 INFO L272 TraceCheckUtils]: 166: Hoare triple {16533#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16533#false} is VALID [2022-04-28 07:44:23,508 INFO L290 TraceCheckUtils]: 167: Hoare triple {16533#false} ~cond := #in~cond; {16533#false} is VALID [2022-04-28 07:44:23,508 INFO L290 TraceCheckUtils]: 168: Hoare triple {16533#false} assume 0 == ~cond; {16533#false} is VALID [2022-04-28 07:44:23,508 INFO L290 TraceCheckUtils]: 169: Hoare triple {16533#false} assume !false; {16533#false} is VALID [2022-04-28 07:44:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 819 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2022-04-28 07:44:23,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:44:23,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:44:23,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730152681] [2022-04-28 07:44:23,509 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:44:23,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324851936] [2022-04-28 07:44:23,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324851936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:44:23,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:44:23,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 07:44:23,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:44:23,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1621861136] [2022-04-28 07:44:23,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1621861136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:44:23,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:44:23,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 07:44:23,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172900039] [2022-04-28 07:44:23,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:44:23,511 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) Word has length 170 [2022-04-28 07:44:23,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:44:23,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-28 07:44:23,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:44:23,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 07:44:23,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:23,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 07:44:23,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2022-04-28 07:44:23,663 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-28 07:44:25,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:25,408 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-04-28 07:44:25,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 07:44:25,408 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) Word has length 170 [2022-04-28 07:44:25,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:44:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-28 07:44:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 110 transitions. [2022-04-28 07:44:25,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-28 07:44:25,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 110 transitions. [2022-04-28 07:44:25,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 110 transitions. [2022-04-28 07:44:25,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:44:25,607 INFO L225 Difference]: With dead ends: 95 [2022-04-28 07:44:25,607 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 07:44:25,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=418, Unknown=0, NotChecked=0, Total=702 [2022-04-28 07:44:25,608 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 07:44:25,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 548 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 07:44:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 07:44:25,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 07:44:25,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:44:25,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 07:44:25,608 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 07:44:25,608 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 07:44:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:25,608 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 07:44:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:44:25,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:25,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:25,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 07:44:25,609 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 07:44:25,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:25,609 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 07:44:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:44:25,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:25,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:25,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:44:25,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:44:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 07:44:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 07:44:25,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2022-04-28 07:44:25,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:44:25,609 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 07:44:25,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-28 07:44:25,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 07:44:25,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:44:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:44:25,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:25,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 07:44:25,625 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:44:25,818 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:44:25,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 07:44:27,602 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 07:44:27,603 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 07:44:27,603 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 07:44:27,603 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-28 07:44:27,603 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 07:44:27,603 INFO L895 garLoopResultBuilder]: At program point L7-2(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 07:44:27,603 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 07:44:27,603 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 40) the Hoare annotation is: true [2022-04-28 07:44:27,603 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 20)) (.cse1 (= (+ (* 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)))) (or (and .cse0 (= main_~c~0 16) (= main_~y~0 16) .cse1 (< 15 main_~k~0)) (and (= 7 main_~y~0) (= 7 main_~c~0) .cse0 .cse1 (< 6 main_~k~0)) (and (= main_~y~0 9) .cse0 (= main_~c~0 9) (< 8 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (< 7 main_~k~0) (= main_~y~0 8) .cse0 (= main_~c~0 8) .cse1) (and (= main_~c~0 17) .cse0 .cse1 (< 16 main_~k~0) (= main_~y~0 17)) (and (= main_~y~0 12) .cse0 (= main_~c~0 12) (< 11 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (< 17 main_~k~0) .cse0 (= main_~c~0 18) .cse1 (= main_~y~0 18)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and .cse0 (= main_~y~0 10) (< 9 main_~k~0) (= main_~c~0 10) .cse1) (and .cse0 (< 18 main_~k~0) (= 19 main_~y~0) .cse1 (= 19 main_~c~0)) (and (= main_~c~0 15) .cse0 (= main_~y~0 15) (< 14 main_~k~0) .cse1) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (<= main_~c~0 20) .cse0 (< 19 main_~k~0) (= main_~y~0 20) (<= 20 main_~c~0) .cse1) (and (= main_~y~0 2) (< 1 main_~k~0) .cse0 (= main_~c~0 2) .cse1) (and (< 12 main_~k~0) .cse0 (= main_~c~0 13) (= main_~y~0 13) .cse1) (and (< 10 main_~k~0) .cse0 (= main_~c~0 11) (= main_~y~0 11) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3)) (and (= main_~y~0 14) .cse0 (< 13 main_~k~0) (= main_~c~0 14) .cse1))) [2022-04-28 07:44:27,603 INFO L895 garLoopResultBuilder]: At program point L28-1(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 20)) (.cse1 (= (+ (* 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)))) (or (and .cse0 (= main_~c~0 16) (= main_~y~0 16) .cse1 (< 15 main_~k~0)) (and (= 7 main_~y~0) (= 7 main_~c~0) .cse0 .cse1 (< 6 main_~k~0)) (and (= main_~y~0 9) .cse0 (= main_~c~0 9) (< 8 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (< 7 main_~k~0) (= main_~y~0 8) .cse0 (= main_~c~0 8) .cse1) (and (= main_~c~0 17) .cse0 .cse1 (< 16 main_~k~0) (= main_~y~0 17)) (and (= main_~y~0 12) .cse0 (= main_~c~0 12) (< 11 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (< 17 main_~k~0) .cse0 (= main_~c~0 18) .cse1 (= main_~y~0 18)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and .cse0 (= main_~y~0 10) (< 9 main_~k~0) (= main_~c~0 10) .cse1) (and .cse0 (< 18 main_~k~0) (= 19 main_~y~0) .cse1 (= 19 main_~c~0)) (and (= main_~c~0 15) .cse0 (= main_~y~0 15) (< 14 main_~k~0) .cse1) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (<= main_~c~0 20) .cse0 (< 19 main_~k~0) (= main_~y~0 20) (<= 20 main_~c~0) .cse1) (and (= main_~y~0 2) (< 1 main_~k~0) .cse0 (= main_~c~0 2) .cse1) (and (< 12 main_~k~0) .cse0 (= main_~c~0 13) (= main_~y~0 13) .cse1) (and (< 10 main_~k~0) .cse0 (= main_~c~0 11) (= main_~y~0 11) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3)) (and (= main_~y~0 14) .cse0 (< 13 main_~k~0) (= main_~c~0 14) .cse1))) [2022-04-28 07:44:27,604 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 20)) (.cse1 (= (+ (* 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)))) (or (and .cse0 (= main_~c~0 16) (= main_~y~0 16) .cse1 (< 15 main_~k~0)) (and (= 7 main_~y~0) (= 7 main_~c~0) .cse0 .cse1 (< 6 main_~k~0)) (and (= main_~y~0 9) .cse0 (= main_~c~0 9) (< 8 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (< 7 main_~k~0) (= main_~y~0 8) .cse0 (= main_~c~0 8) .cse1) (and (= main_~c~0 17) .cse0 .cse1 (< 16 main_~k~0) (= main_~y~0 17)) (and (= main_~y~0 12) .cse0 (= main_~c~0 12) (< 11 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (< 17 main_~k~0) .cse0 (= main_~c~0 18) .cse1 (= main_~y~0 18)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and .cse0 (= main_~y~0 10) (< 9 main_~k~0) (= main_~c~0 10) .cse1) (and .cse0 (< 18 main_~k~0) (= 19 main_~y~0) .cse1 (= 19 main_~c~0)) (and (= main_~c~0 15) .cse0 (= main_~y~0 15) (< 14 main_~k~0) .cse1) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (<= main_~c~0 20) .cse0 (< 19 main_~k~0) (= main_~y~0 20) (<= 20 main_~c~0) .cse1) (and (= main_~y~0 2) (< 1 main_~k~0) .cse0 (= main_~c~0 2) .cse1) (and (< 12 main_~k~0) .cse0 (= main_~c~0 13) (= main_~y~0 13) .cse1) (and (< 10 main_~k~0) .cse0 (= main_~c~0 11) (= main_~y~0 11) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3)) (and (= main_~y~0 14) .cse0 (< 13 main_~k~0) (= main_~c~0 14) .cse1))) [2022-04-28 07:44:27,604 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 17 40) the Hoare annotation is: true [2022-04-28 07:44:27,604 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse1 (+ (- 1) main_~y~0)) (.cse2 (+ (- 2) main_~y~0)) (.cse0 (= (+ (* 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)))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (<= main_~k~0 6) (< 5 main_~k~0) .cse0 (<= main_~c~0 6) (= 5 .cse1)) (and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15) (<= main_~k~0 15) .cse0) (and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (<= main_~c~0 10) (< 9 main_~k~0) .cse0) (and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0) (<= main_~c~0 9) .cse0) (and (<= main_~c~0 20) (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20) .cse0) (and (<= main_~c~0 17) (<= main_~k~0 17) (= 16 .cse1) .cse0 (< 16 main_~k~0)) (and (<= main_~c~0 3) (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0) .cse0) (and (< 12 main_~k~0) (<= main_~c~0 13) (<= main_~k~0 13) (= main_~y~0 13) .cse0) (and (= .cse1 0) (<= main_~k~0 1) (< 0 main_~k~0) .cse0 (<= main_~c~0 1)) (and (<= main_~c~0 5) (<= main_~k~0 5) (= 5 main_~y~0) .cse0 (< 4 main_~k~0)) (and (= 3 .cse1) (< 3 main_~k~0) (<= main_~k~0 4) .cse0 (<= main_~c~0 4)) (and (< 1 main_~k~0) (= .cse2 0) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (< 17 main_~k~0) (<= main_~c~0 18) (<= main_~k~0 18) .cse0 (= .cse1 17)) (and (= main_~y~0 14) (< 13 main_~k~0) .cse0 (<= main_~k~0 14) (<= main_~c~0 14)) (and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0) .cse0 (<= main_~k~0 12)) (and (< 7 main_~k~0) (<= main_~c~0 8) (= .cse2 6) (<= main_~k~0 8) .cse0) (and (<= main_~k~0 7) (<= main_~c~0 7) (= 7 main_~y~0) .cse0 (< 6 main_~k~0)) (and (<= main_~k~0 16) (= main_~y~0 16) .cse0 (< 15 main_~k~0) (<= main_~c~0 16)) (and (< 18 main_~k~0) (<= main_~c~0 19) (<= main_~k~0 19) (= 19 main_~y~0) .cse0) (and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11) .cse0))) [2022-04-28 07:44:27,604 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-28 07:44:27,604 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= main_~k~0 20) (<= 0 main_~k~0)) [2022-04-28 07:44:27,604 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 17 40) the Hoare annotation is: true [2022-04-28 07:44:27,604 INFO L902 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-04-28 07:44:27,604 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* 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)) [2022-04-28 07:44:27,604 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 07:44:27,604 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 07:44:27,604 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 07:44:27,604 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 07:44:27,604 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 07:44:27,604 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 07:44:27,604 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 07:44:27,605 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-28 07:44:27,605 INFO L895 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 07:44:27,605 INFO L895 garLoopResultBuilder]: At program point L10(lines 10 13) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 07:44:27,605 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 07:44:27,605 INFO L895 garLoopResultBuilder]: At program point L10-2(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 07:44:27,605 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 07:44:27,607 INFO L356 BasicCegarLoop]: Path program histogram: [42, 2, 2, 2] [2022-04-28 07:44:27,608 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 07:44:27,610 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 07:44:27,619 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 07:44:27,716 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 07:44:27,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 07:44:27 BoogieIcfgContainer [2022-04-28 07:44:27,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 07:44:27,738 INFO L158 Benchmark]: Toolchain (without parser) took 91119.67ms. Allocated memory was 197.1MB in the beginning and 319.8MB in the end (delta: 122.7MB). Free memory was 141.3MB in the beginning and 143.3MB in the end (delta: -2.0MB). Peak memory consumption was 165.6MB. Max. memory is 8.0GB. [2022-04-28 07:44:27,738 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 197.1MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 07:44:27,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.75ms. Allocated memory was 197.1MB in the beginning and 266.3MB in the end (delta: 69.2MB). Free memory was 141.1MB in the beginning and 236.3MB in the end (delta: -95.1MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-04-28 07:44:27,739 INFO L158 Benchmark]: Boogie Preprocessor took 21.24ms. Allocated memory is still 266.3MB. Free memory was 236.3MB in the beginning and 234.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 07:44:27,739 INFO L158 Benchmark]: RCFGBuilder took 223.36ms. Allocated memory is still 266.3MB. Free memory was 234.7MB in the beginning and 224.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 07:44:27,739 INFO L158 Benchmark]: TraceAbstraction took 90672.35ms. Allocated memory was 266.3MB in the beginning and 319.8MB in the end (delta: 53.5MB). Free memory was 223.7MB in the beginning and 143.3MB in the end (delta: 80.4MB). Peak memory consumption was 178.5MB. Max. memory is 8.0GB. [2022-04-28 07:44:27,740 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 197.1MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.75ms. Allocated memory was 197.1MB in the beginning and 266.3MB in the end (delta: 69.2MB). Free memory was 141.1MB in the beginning and 236.3MB in the end (delta: -95.1MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.24ms. Allocated memory is still 266.3MB. Free memory was 236.3MB in the beginning and 234.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 223.36ms. Allocated memory is still 266.3MB. Free memory was 234.7MB in the beginning and 224.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 90672.35ms. Allocated memory was 266.3MB in the beginning and 319.8MB in the end (delta: 53.5MB). Free memory was 223.7MB in the beginning and 143.3MB in the end (delta: 80.4MB). Peak memory consumption was 178.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 90.5s, OverallIterations: 24, TraceHistogramMax: 23, PathProgramHistogramMax: 42, EmptinessCheckTime: 0.0s, AutomataDifference: 35.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 14.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 10579 SdHoareTripleChecker+Invalid, 14.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9364 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13155 IncrementalHoareTripleChecker+Invalid, 13185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 1215 mSDtfsCounter, 13155 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2767 GetRequests, 2274 SyntacticMatches, 22 SemanticMatches, 471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=23, InterpolantAutomatonStates: 369, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 316 PreInvPairs, 504 NumberOfFragments, 2797 HoareAnnotationTreeSize, 316 FomulaSimplifications, 2055 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 28 FomulaSimplificationsInter, 38 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((k <= 20 && c == 16) && y == 16) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 15 < k) || ((((7 == y && 7 == c) && k <= 20) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 6 < k)) || ((((y == 9 && k <= 20) && c == 9) && 8 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && y == 1) && 0 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c == 1)) || ((((7 < k && y == 8) && k <= 20) && c == 8) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((c == 17 && k <= 20) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 16 < k) && y == 17)) || ((((y == 12 && k <= 20) && c == 12) && 11 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && y == 4) && c == 4) && 3 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((17 < k && k <= 20) && c == 18) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && y == 18)) || ((((k <= 20 && 5 == c) && 5 == y) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 4 < k)) || ((((k <= 20 && y == 10) && 9 < k) && c == 10) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && 18 < k) && 19 == y) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 19 == c)) || ((((c == 15 && k <= 20) && y == 15) && 14 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && 0 <= k) && c == 0) && y == 0) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || (((((c <= 20 && k <= 20) && 19 < k) && y == 20) && 20 <= c) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((y == 2 && 1 < k) && k <= 20) && c == 2) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((12 < k && k <= 20) && c == 13) && y == 13) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((10 < k && k <= 20) && c == 11) && y == 11) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((y == 6 && k <= 20) && c == 6) && 5 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && y == 3) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c < k + 1) && c == 3)) || ((((y == 14 && k <= 20) && 13 < k) && c == 14) && y * y * y * y + y * y + y * y * y * 2 == x * 4) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-28 07:44:27,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...