/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:38:27,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:38:27,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:38:27,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:38:27,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:38:27,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:38:27,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:38:27,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:38:27,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:38:27,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:38:27,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:38:27,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:38:27,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:38:27,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:38:27,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:38:27,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:38:27,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:38:27,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:38:27,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:38:27,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:38:27,853 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:38:27,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:38:27,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:38:27,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:38:27,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:38:27,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:38:27,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:38:27,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:38:27,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:38:27,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:38:27,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:38:27,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:38:27,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:38:27,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:38:27,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:38:27,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:38:27,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:38:27,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:38:27,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:38:27,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:38:27,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:38:27,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:38:27,868 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 14:38:27,890 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:38:27,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:38:27,890 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:38:27,890 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:38:27,891 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:38:27,891 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:38:27,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:38:27,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:38:27,893 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:38:27,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:38:27,894 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:38:27,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:38:27,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:38:27,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:38:27,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:38:27,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:38:27,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:38:27,895 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:38:27,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:38:27,895 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:38:27,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:38:27,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:38:27,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:38:27,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:38:27,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:38:27,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:38:27,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:38:27,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:38:27,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:38:27,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:38:27,896 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:38:27,896 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:38:27,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:38:27,897 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 14:38:28,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:38:28,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:38:28,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:38:28,088 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:38:28,089 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:38:28,090 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c [2022-04-27 14:38:28,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb0024e7d/c487c5440eb9407188b0168b46310bdb/FLAGa3c036de2 [2022-04-27 14:38:28,489 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:38:28,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c [2022-04-27 14:38:28,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb0024e7d/c487c5440eb9407188b0168b46310bdb/FLAGa3c036de2 [2022-04-27 14:38:28,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb0024e7d/c487c5440eb9407188b0168b46310bdb [2022-04-27 14:38:28,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:38:28,926 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:38:28,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:38:28,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:38:28,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:38:28,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:38:28" (1/1) ... [2022-04-27 14:38:28,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345b8bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:28, skipping insertion in model container [2022-04-27 14:38:28,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:38:28" (1/1) ... [2022-04-27 14:38:28,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:38:28,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:38:29,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c[458,471] [2022-04-27 14:38:29,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:38:29,075 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:38:29,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c[458,471] [2022-04-27 14:38:29,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:38:29,109 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:38:29,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:29 WrapperNode [2022-04-27 14:38:29,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:38:29,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:38:29,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:38:29,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:38:29,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:29" (1/1) ... [2022-04-27 14:38:29,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:29" (1/1) ... [2022-04-27 14:38:29,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:29" (1/1) ... [2022-04-27 14:38:29,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:29" (1/1) ... [2022-04-27 14:38:29,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:29" (1/1) ... [2022-04-27 14:38:29,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:29" (1/1) ... [2022-04-27 14:38:29,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:29" (1/1) ... [2022-04-27 14:38:29,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:38:29,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:38:29,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:38:29,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:38:29,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:29" (1/1) ... [2022-04-27 14:38:29,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:38:29,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:29,178 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-27 14:38:29,196 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-27 14:38:29,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:38:29,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:38:29,212 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:38:29,213 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:38:29,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:38:29,213 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:38:29,213 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:38:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:38:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:38:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:38:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:38:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:38:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:38:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:38:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:38:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:38:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:38:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:38:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:38:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:38:29,257 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:38:29,258 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:38:29,359 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:38:29,364 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:38:29,364 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:38:29,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:38:29 BoogieIcfgContainer [2022-04-27 14:38:29,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:38:29,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:38:29,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:38:29,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:38:29,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:38:28" (1/3) ... [2022-04-27 14:38:29,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b208ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:38:29, skipping insertion in model container [2022-04-27 14:38:29,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:29" (2/3) ... [2022-04-27 14:38:29,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b208ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:38:29, skipping insertion in model container [2022-04-27 14:38:29,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:38:29" (3/3) ... [2022-04-27 14:38:29,383 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound50.c [2022-04-27 14:38:29,392 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:38:29,392 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:38:29,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:38:29,460 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@50c0d73f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b00905a [2022-04-27 14:38:29,460 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:38:29,467 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-27 14:38:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:38:29,472 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:29,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:38:29,472 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:29,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:29,476 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-27 14:38:29,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:29,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044650186] [2022-04-27 14:38:29,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:29,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:29,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:38:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:29,663 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-27 14:38:29,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 14:38:29,663 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-27 14:38:29,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:38:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:29,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-27 14:38:29,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-27 14:38:29,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-27 14:38:29,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-27 14:38:29,678 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-27 14:38:29,679 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-27 14:38:29,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 14:38:29,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-27 14:38:29,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-27 14:38:29,679 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-27 14:38:29,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {31#true} is VALID [2022-04-27 14:38:29,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-27 14:38:29,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-27 14:38:29,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-27 14:38:29,681 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-27 14:38:29,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-27 14:38:29,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-27 14:38:29,681 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-27 14:38:29,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-27 14:38:29,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-27 14:38:29,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-27 14:38:29,683 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-27 14:38:29,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:29,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044650186] [2022-04-27 14:38:29,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044650186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:38:29,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:38:29,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:38:29,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140753832] [2022-04-27 14:38:29,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:38:29,692 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-27 14:38:29,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:29,696 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-27 14:38:29,721 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-27 14:38:29,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:38:29,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:29,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:38:29,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:38:29,750 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-27 14:38:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:29,873 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-27 14:38:29,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:38:29,874 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-27 14:38:29,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:29,875 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-27 14:38:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 14:38:29,889 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-27 14:38:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 14:38:29,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-27 14:38:29,974 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-27 14:38:29,980 INFO L225 Difference]: With dead ends: 47 [2022-04-27 14:38:29,980 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 14:38:29,981 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-27 14:38:29,984 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-27 14:38:29,984 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-27 14:38:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 14:38:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 14:38:30,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:30,003 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-27 14:38:30,003 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-27 14:38:30,004 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-27 14:38:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:30,007 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 14:38:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:38:30,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:30,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:30,008 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-27 14:38:30,008 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-27 14:38:30,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:30,011 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 14:38:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:38:30,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:30,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:30,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:30,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:30,012 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-27 14:38:30,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-27 14:38:30,014 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-27 14:38:30,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:30,015 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-27 14:38:30,015 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-27 14:38:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:38:30,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:38:30,016 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:30,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:38:30,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:38:30,016 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-27 14:38:30,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:30,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093655537] [2022-04-27 14:38:30,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:30,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:30,030 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:30,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1160509867] [2022-04-27 14:38:30,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:30,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:30,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:30,032 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-27 14:38:30,060 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-27 14:38:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:30,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:38:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:30,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:30,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {186#true} call ULTIMATE.init(); {186#true} is VALID [2022-04-27 14:38:30,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#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); {186#true} is VALID [2022-04-27 14:38:30,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-27 14:38:30,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186#true} {186#true} #60#return; {186#true} is VALID [2022-04-27 14:38:30,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {186#true} call #t~ret5 := main(); {186#true} is VALID [2022-04-27 14:38:30,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#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; {186#true} is VALID [2022-04-27 14:38:30,242 INFO L272 TraceCheckUtils]: 6: Hoare triple {186#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {186#true} is VALID [2022-04-27 14:38:30,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#true} ~cond := #in~cond; {186#true} is VALID [2022-04-27 14:38:30,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#true} assume !(0 == ~cond); {186#true} is VALID [2022-04-27 14:38:30,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-27 14:38:30,243 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {186#true} {186#true} #52#return; {186#true} is VALID [2022-04-27 14:38:30,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {186#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {224#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:30,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {224#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {224#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:30,247 INFO L272 TraceCheckUtils]: 13: Hoare triple {224#(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)); {231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:30,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:30,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {187#false} is VALID [2022-04-27 14:38:30,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {187#false} assume !false; {187#false} is VALID [2022-04-27 14:38:30,248 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-27 14:38:30,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:38:30,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:30,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093655537] [2022-04-27 14:38:30,249 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:30,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160509867] [2022-04-27 14:38:30,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160509867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:38:30,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:38:30,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:38:30,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208879657] [2022-04-27 14:38:30,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:38:30,254 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-27 14:38:30,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:30,255 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-27 14:38:30,267 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-27 14:38:30,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:38:30,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:30,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:38:30,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:38:30,270 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-27 14:38:30,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:30,692 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 14:38:30,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:38:30,692 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-27 14:38:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:30,692 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-27 14:38:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 14:38:30,694 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-27 14:38:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 14:38:30,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-27 14:38:30,725 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-27 14:38:30,726 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:38:30,726 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 14:38:30,726 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-27 14:38:30,727 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-27 14:38:30,727 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-27 14:38:30,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 14:38:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 14:38:30,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:30,732 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-27 14:38:30,733 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-27 14:38:30,733 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-27 14:38:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:30,734 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 14:38:30,734 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:38:30,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:30,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:30,735 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-27 14:38:30,735 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-27 14:38:30,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:30,737 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 14:38:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:38:30,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:30,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:30,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:30,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:30,737 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-27 14:38:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-27 14:38:30,739 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-27 14:38:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:30,739 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-27 14:38:30,739 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-27 14:38:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:38:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 14:38:30,740 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:30,740 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-27 14:38:30,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 14:38:30,956 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-27 14:38:30,957 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:30,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:30,957 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-27 14:38:30,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:30,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653183035] [2022-04-27 14:38:30,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:30,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:30,967 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:30,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1053993385] [2022-04-27 14:38:30,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:30,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:30,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:30,969 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-27 14:38:30,970 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-27 14:38:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:31,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:38:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:31,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:31,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2022-04-27 14:38:31,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#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); {397#true} is VALID [2022-04-27 14:38:31,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:38:31,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #60#return; {397#true} is VALID [2022-04-27 14:38:31,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret5 := main(); {397#true} is VALID [2022-04-27 14:38:31,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#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; {397#true} is VALID [2022-04-27 14:38:31,108 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {397#true} is VALID [2022-04-27 14:38:31,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:38:31,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:38:31,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:38:31,108 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #52#return; {397#true} is VALID [2022-04-27 14:38:31,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:31,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:31,111 INFO L272 TraceCheckUtils]: 13: Hoare triple {435#(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)); {397#true} is VALID [2022-04-27 14:38:31,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:38:31,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:38:31,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:38:31,113 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {397#true} {435#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:31,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {435#(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; {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 14:38:31,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 14:38:31,114 INFO L272 TraceCheckUtils]: 20: Hoare triple {457#(and (= (+ (- 1) main_~y~0) 0) (= (* 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)); {464#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:31,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {468#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:31,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {398#false} is VALID [2022-04-27 14:38:31,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-04-27 14:38:31,115 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-27 14:38:31,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:31,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-04-27 14:38:31,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {398#false} is VALID [2022-04-27 14:38:31,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {468#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:31,262 INFO L272 TraceCheckUtils]: 20: Hoare triple {484#(= (+ (* 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)); {464#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:31,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {484#(= (+ (* 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; {484#(= (+ (* 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-27 14:38:31,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {484#(= (+ (* 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; {484#(= (+ (* 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-27 14:38:31,512 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {397#true} {484#(= (+ (* 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; {484#(= (+ (* 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-27 14:38:31,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:38:31,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:38:31,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:38:31,512 INFO L272 TraceCheckUtils]: 13: Hoare triple {484#(= (+ (* 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)); {397#true} is VALID [2022-04-27 14:38:31,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {484#(= (+ (* 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; {484#(= (+ (* 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-27 14:38:31,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {484#(= (+ (* 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-27 14:38:31,513 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #52#return; {397#true} is VALID [2022-04-27 14:38:31,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:38:31,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:38:31,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:38:31,514 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {397#true} is VALID [2022-04-27 14:38:31,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#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; {397#true} is VALID [2022-04-27 14:38:31,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret5 := main(); {397#true} is VALID [2022-04-27 14:38:31,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #60#return; {397#true} is VALID [2022-04-27 14:38:31,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:38:31,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#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); {397#true} is VALID [2022-04-27 14:38:31,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2022-04-27 14:38:31,515 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-27 14:38:31,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:31,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653183035] [2022-04-27 14:38:31,515 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:31,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053993385] [2022-04-27 14:38:31,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053993385] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:31,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:31,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:38:31,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133029609] [2022-04-27 14:38:31,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:38:31,516 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-27 14:38:31,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:31,516 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-27 14:38:31,985 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-27 14:38:31,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:38:31,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:31,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:38:31,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:38:31,986 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-27 14:38:32,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:32,077 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-27 14:38:32,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:38:32,077 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-27 14:38:32,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:32,078 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-27 14:38:32,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 14:38:32,081 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-27 14:38:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 14:38:32,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-27 14:38:32,550 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-27 14:38:32,551 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:38:32,551 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 14:38:32,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:38:32,552 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-27 14:38:32,552 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-27 14:38:32,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 14:38:32,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 14:38:32,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:32,559 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-27 14:38:32,559 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-27 14:38:32,560 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-27 14:38:32,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:32,561 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-27 14:38:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:38:32,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:32,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:32,562 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-27 14:38:32,562 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-27 14:38:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:32,563 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-27 14:38:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:38:32,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:32,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:32,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:32,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:32,564 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-27 14:38:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-27 14:38:32,565 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-27 14:38:32,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:32,565 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-27 14:38:32,565 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-27 14:38:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:38:32,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 14:38:32,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:32,566 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-27 14:38:32,582 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-27 14:38:32,782 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-27 14:38:32,782 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:32,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-27 14:38:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:32,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442057170] [2022-04-27 14:38:32,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:32,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:32,798 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:32,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1511013361] [2022-04-27 14:38:32,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:32,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:32,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:32,807 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-27 14:38:32,815 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-27 14:38:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:32,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:38:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:32,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:33,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2022-04-27 14:38:33,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {707#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); {707#true} is VALID [2022-04-27 14:38:33,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:38:33,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #60#return; {707#true} is VALID [2022-04-27 14:38:33,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret5 := main(); {707#true} is VALID [2022-04-27 14:38:33,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {707#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; {707#true} is VALID [2022-04-27 14:38:33,147 INFO L272 TraceCheckUtils]: 6: Hoare triple {707#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {707#true} is VALID [2022-04-27 14:38:33,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:38:33,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:38:33,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:38:33,147 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {707#true} {707#true} #52#return; {707#true} is VALID [2022-04-27 14:38:33,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {707#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {745#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:33,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {745#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {745#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:33,149 INFO L272 TraceCheckUtils]: 13: Hoare triple {745#(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)); {707#true} is VALID [2022-04-27 14:38:33,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:38:33,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:38:33,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:38:33,150 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {707#true} {745#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {745#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:33,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {745#(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; {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:38:33,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:38:33,151 INFO L272 TraceCheckUtils]: 20: Hoare triple {767#(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)); {707#true} is VALID [2022-04-27 14:38:33,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:38:33,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:38:33,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:38:33,152 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {707#true} {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:38:33,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {789#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:33,154 INFO L272 TraceCheckUtils]: 26: Hoare triple {789#(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)); {793#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:33,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {793#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {797#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:33,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {797#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {708#false} is VALID [2022-04-27 14:38:33,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {708#false} assume !false; {708#false} is VALID [2022-04-27 14:38:33,156 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-27 14:38:33,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:33,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:33,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442057170] [2022-04-27 14:38:33,432 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:33,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511013361] [2022-04-27 14:38:33,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511013361] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:33,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:33,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 14:38:33,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612680219] [2022-04-27 14:38:33,432 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:33,433 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-27 14:38:33,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:33,433 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-27 14:38:33,455 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-27 14:38:33,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:38:33,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:33,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:38:33,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:38:33,456 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-27 14:38:33,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:33,617 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-27 14:38:33,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:38:33,617 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-27 14:38:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:33,617 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-27 14:38:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-27 14:38:33,618 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-27 14:38:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-27 14:38:33,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-27 14:38:33,646 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-27 14:38:33,647 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:38:33,647 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 14:38:33,647 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-27 14:38:33,648 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-27 14:38:33,648 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-27 14:38:33,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 14:38:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 14:38:33,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:33,655 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-27 14:38:33,655 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-27 14:38:33,655 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-27 14:38:33,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:33,656 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-27 14:38:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:38:33,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:33,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:33,657 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-27 14:38:33,657 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-27 14:38:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:33,658 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-27 14:38:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:38:33,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:33,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:33,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:33,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:33,659 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-27 14:38:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-27 14:38:33,660 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-27 14:38:33,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:33,660 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-27 14:38:33,660 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-27 14:38:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:38:33,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:38:33,661 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:33,661 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-27 14:38:33,679 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-27 14:38:33,875 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-27 14:38:33,876 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:33,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:33,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 2 times [2022-04-27 14:38:33,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:33,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908159176] [2022-04-27 14:38:33,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:33,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:33,886 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:33,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1656735840] [2022-04-27 14:38:33,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:38:33,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:33,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:33,888 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-27 14:38:33,893 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-27 14:38:33,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:38:33,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:33,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:38:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:33,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:34,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2022-04-27 14:38:34,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {1024#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); {1024#true} is VALID [2022-04-27 14:38:34,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:38:34,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #60#return; {1024#true} is VALID [2022-04-27 14:38:34,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret5 := main(); {1024#true} is VALID [2022-04-27 14:38:34,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {1024#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; {1024#true} is VALID [2022-04-27 14:38:34,205 INFO L272 TraceCheckUtils]: 6: Hoare triple {1024#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:38:34,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:38:34,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:38:34,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:38:34,205 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1024#true} {1024#true} #52#return; {1024#true} is VALID [2022-04-27 14:38:34,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {1024#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1062#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:34,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {1062#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1062#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:34,207 INFO L272 TraceCheckUtils]: 13: Hoare triple {1062#(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)); {1024#true} is VALID [2022-04-27 14:38:34,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:38:34,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:38:34,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:38:34,208 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1024#true} {1062#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1062#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:34,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {1062#(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; {1084#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:38:34,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {1084#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1084#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:38:34,209 INFO L272 TraceCheckUtils]: 20: Hoare triple {1084#(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)); {1024#true} is VALID [2022-04-27 14:38:34,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:38:34,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:38:34,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:38:34,210 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1024#true} {1084#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {1084#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:38:34,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {1084#(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; {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:38:34,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !false; {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:38:34,211 INFO L272 TraceCheckUtils]: 27: Hoare triple {1106#(and (< 1 main_~k~0) (= (+ (- 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)); {1024#true} is VALID [2022-04-27 14:38:34,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:38:34,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:38:34,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:38:34,211 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1024#true} {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} #54#return; {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:38:34,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1128#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-27 14:38:34,212 INFO L272 TraceCheckUtils]: 33: Hoare triple {1128#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:34,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1136#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:34,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {1136#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1025#false} is VALID [2022-04-27 14:38:34,213 INFO L290 TraceCheckUtils]: 36: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2022-04-27 14:38:34,213 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-27 14:38:34,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:34,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:34,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908159176] [2022-04-27 14:38:34,464 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:34,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656735840] [2022-04-27 14:38:34,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656735840] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:34,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:34,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:38:34,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127682088] [2022-04-27 14:38:34,465 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:34,465 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-27 14:38:34,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:34,466 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-27 14:38:34,488 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-27 14:38:34,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:38:34,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:34,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:38:34,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:38:34,489 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-27 14:38:34,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:34,650 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-27 14:38:34,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:38:34,651 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-27 14:38:34,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:34,651 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-27 14:38:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-27 14:38:34,654 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-27 14:38:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-27 14:38:34,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-27 14:38:34,678 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-27 14:38:34,680 INFO L225 Difference]: With dead ends: 42 [2022-04-27 14:38:34,680 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 14:38:34,681 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-27 14:38:34,682 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-27 14:38:34,684 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-27 14:38:34,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 14:38:34,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-27 14:38:34,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:34,710 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-27 14:38:34,710 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-27 14:38:34,710 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-27 14:38:34,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:34,711 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 14:38:34,711 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 14:38:34,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:34,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:34,712 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-27 14:38:34,712 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-27 14:38:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:34,713 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 14:38:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 14:38:34,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:34,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:34,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:34,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:34,714 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-27 14:38:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-27 14:38:34,718 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 37 [2022-04-27 14:38:34,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:34,718 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-27 14:38:34,719 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-27 14:38:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 14:38:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 14:38:34,720 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:34,720 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-27 14:38:34,747 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-27 14:38:34,936 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-27 14:38:34,937 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:34,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:34,937 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 3 times [2022-04-27 14:38:34,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:34,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715455173] [2022-04-27 14:38:34,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:34,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:34,950 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:34,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1203082621] [2022-04-27 14:38:34,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:38:34,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:34,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:34,951 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-27 14:38:34,952 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-27 14:38:35,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:38:35,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:35,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:38:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:35,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:35,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-27 14:38:35,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#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); {1379#true} is VALID [2022-04-27 14:38:35,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:38:35,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #60#return; {1379#true} is VALID [2022-04-27 14:38:35,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret5 := main(); {1379#true} is VALID [2022-04-27 14:38:35,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#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; {1379#true} is VALID [2022-04-27 14:38:35,342 INFO L272 TraceCheckUtils]: 6: Hoare triple {1379#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:38:35,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:38:35,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:38:35,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:38:35,342 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1379#true} {1379#true} #52#return; {1379#true} is VALID [2022-04-27 14:38:35,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {1379#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1417#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:35,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {1417#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1417#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:35,344 INFO L272 TraceCheckUtils]: 13: Hoare triple {1417#(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)); {1379#true} is VALID [2022-04-27 14:38:35,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:38:35,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:38:35,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:38:35,344 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1379#true} {1417#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1417#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:35,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {1417#(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; {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:35,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:35,345 INFO L272 TraceCheckUtils]: 20: Hoare triple {1439#(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)); {1379#true} is VALID [2022-04-27 14:38:35,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:38:35,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:38:35,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:38:35,346 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1379#true} {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:35,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {1439#(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; {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:35,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:35,346 INFO L272 TraceCheckUtils]: 27: Hoare triple {1461#(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)); {1379#true} is VALID [2022-04-27 14:38:35,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:38:35,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:38:35,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:38:35,347 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1379#true} {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:35,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {1461#(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; {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:38:35,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !false; {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:38:35,348 INFO L272 TraceCheckUtils]: 34: Hoare triple {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 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)); {1379#true} is VALID [2022-04-27 14:38:35,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:38:35,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:38:35,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:38:35,349 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1379#true} {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #54#return; {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:38:35,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1505#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:38:35,350 INFO L272 TraceCheckUtils]: 40: Hoare triple {1505#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1509#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:35,350 INFO L290 TraceCheckUtils]: 41: Hoare triple {1509#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1513#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:35,350 INFO L290 TraceCheckUtils]: 42: Hoare triple {1513#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1380#false} is VALID [2022-04-27 14:38:35,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-27 14:38:35,350 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-27 14:38:35,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:35,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:35,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715455173] [2022-04-27 14:38:35,582 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:35,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203082621] [2022-04-27 14:38:35,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203082621] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:35,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:35,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:38:35,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625593901] [2022-04-27 14:38:35,582 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:35,583 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-27 14:38:35,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:35,583 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-27 14:38:35,600 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-27 14:38:35,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:38:35,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:35,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:38:35,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:38:35,601 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-27 14:38:35,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:35,800 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-27 14:38:35,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:38:35,800 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-27 14:38:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:35,800 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-27 14:38:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:38:35,802 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-27 14:38:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:38:35,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-27 14:38:35,824 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-27 14:38:35,825 INFO L225 Difference]: With dead ends: 45 [2022-04-27 14:38:35,825 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 14:38:35,826 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-27 14:38:35,826 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-27 14:38:35,826 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-27 14:38:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 14:38:35,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-27 14:38:35,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:35,836 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-27 14:38:35,836 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-27 14:38:35,836 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-27 14:38:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:35,839 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 14:38:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 14:38:35,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:35,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:35,839 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-27 14:38:35,839 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-27 14:38:35,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:35,856 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 14:38:35,856 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 14:38:35,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:35,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:35,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:35,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:35,858 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-27 14:38:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-27 14:38:35,860 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 44 [2022-04-27 14:38:35,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:35,861 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-27 14:38:35,861 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-27 14:38:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 14:38:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 14:38:35,862 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:35,862 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-27 14:38:35,881 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-27 14:38:36,067 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-27 14:38:36,069 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:36,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:36,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 4 times [2022-04-27 14:38:36,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:36,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213227916] [2022-04-27 14:38:36,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:36,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:36,085 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:36,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538532013] [2022-04-27 14:38:36,086 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:38:36,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:36,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:36,092 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-27 14:38:36,092 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-27 14:38:36,297 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:38:36,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:36,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:38:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:36,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:36,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {1772#true} call ULTIMATE.init(); {1772#true} is VALID [2022-04-27 14:38:36,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {1772#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); {1772#true} is VALID [2022-04-27 14:38:36,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:38:36,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1772#true} {1772#true} #60#return; {1772#true} is VALID [2022-04-27 14:38:36,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {1772#true} call #t~ret5 := main(); {1772#true} is VALID [2022-04-27 14:38:36,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {1772#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; {1772#true} is VALID [2022-04-27 14:38:36,584 INFO L272 TraceCheckUtils]: 6: Hoare triple {1772#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:38:36,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:38:36,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:38:36,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:38:36,584 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1772#true} {1772#true} #52#return; {1772#true} is VALID [2022-04-27 14:38:36,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {1772#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1810#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:36,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {1810#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1810#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:36,585 INFO L272 TraceCheckUtils]: 13: Hoare triple {1810#(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)); {1772#true} is VALID [2022-04-27 14:38:36,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:38:36,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:38:36,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:38:36,586 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1772#true} {1810#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1810#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:36,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {1810#(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; {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:38:36,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:38:36,586 INFO L272 TraceCheckUtils]: 20: Hoare triple {1832#(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)); {1772#true} is VALID [2022-04-27 14:38:36,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:38:36,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:38:36,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:38:36,587 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1772#true} {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:38:36,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {1832#(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; {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:36,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:36,588 INFO L272 TraceCheckUtils]: 27: Hoare triple {1854#(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)); {1772#true} is VALID [2022-04-27 14:38:36,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:38:36,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:38:36,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:38:36,588 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1772#true} {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:36,589 INFO L290 TraceCheckUtils]: 32: Hoare triple {1854#(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; {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:38:36,589 INFO L290 TraceCheckUtils]: 33: Hoare triple {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:38:36,589 INFO L272 TraceCheckUtils]: 34: Hoare triple {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:38:36,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:38:36,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:38:36,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:38:36,590 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1772#true} {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #54#return; {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:38:36,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:38:36,591 INFO L290 TraceCheckUtils]: 40: Hoare triple {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:38:36,591 INFO L272 TraceCheckUtils]: 41: Hoare triple {1898#(and (= main_~y~0 4) (< 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)); {1772#true} is VALID [2022-04-27 14:38:36,591 INFO L290 TraceCheckUtils]: 42: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:38:36,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:38:36,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:38:36,592 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1772#true} {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #54#return; {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:38:36,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {1920#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:38:36,595 INFO L272 TraceCheckUtils]: 47: Hoare triple {1920#(and (= main_~y~0 4) (< 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)); {1924#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:36,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {1924#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:36,597 INFO L290 TraceCheckUtils]: 49: Hoare triple {1928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1773#false} is VALID [2022-04-27 14:38:36,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {1773#false} assume !false; {1773#false} is VALID [2022-04-27 14:38:36,598 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-27 14:38:36,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:36,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:36,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213227916] [2022-04-27 14:38:36,851 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:36,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538532013] [2022-04-27 14:38:36,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538532013] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:36,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:36,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:38:36,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059801686] [2022-04-27 14:38:36,851 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:36,852 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-27 14:38:36,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:36,852 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-27 14:38:36,876 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-27 14:38:36,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:38:36,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:36,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:38:36,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:38:36,877 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-27 14:38:37,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:37,275 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-27 14:38:37,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:38:37,275 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-27 14:38:37,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:37,276 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-27 14:38:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-27 14:38:37,277 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-27 14:38:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-27 14:38:37,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-27 14:38:37,330 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-27 14:38:37,331 INFO L225 Difference]: With dead ends: 48 [2022-04-27 14:38:37,332 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 14:38:37,332 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-27 14:38:37,333 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:37,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:38:37,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 14:38:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 14:38:37,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:37,350 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-27 14:38:37,350 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-27 14:38:37,350 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-27 14:38:37,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:37,352 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-27 14:38:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 14:38:37,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:37,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:37,352 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-27 14:38:37,352 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-27 14:38:37,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:37,356 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-27 14:38:37,356 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 14:38:37,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:37,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:37,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:37,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:37,358 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-27 14:38:37,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-27 14:38:37,359 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 51 [2022-04-27 14:38:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:37,359 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-27 14:38:37,359 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-27 14:38:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 14:38:37,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 14:38:37,360 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:37,360 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-27 14:38:37,377 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-27 14:38:37,575 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-27 14:38:37,575 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:37,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:37,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 5 times [2022-04-27 14:38:37,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:37,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900028258] [2022-04-27 14:38:37,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:37,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:37,590 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:37,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [346001557] [2022-04-27 14:38:37,590 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:38:37,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:37,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:37,591 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-27 14:38:37,592 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-27 14:38:37,702 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:38:37,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:37,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:38:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:37,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:38,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {2203#true} call ULTIMATE.init(); {2203#true} is VALID [2022-04-27 14:38:38,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {2203#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); {2203#true} is VALID [2022-04-27 14:38:38,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:38:38,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2203#true} {2203#true} #60#return; {2203#true} is VALID [2022-04-27 14:38:38,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {2203#true} call #t~ret5 := main(); {2203#true} is VALID [2022-04-27 14:38:38,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {2203#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; {2203#true} is VALID [2022-04-27 14:38:38,097 INFO L272 TraceCheckUtils]: 6: Hoare triple {2203#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:38:38,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:38:38,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:38:38,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:38:38,097 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2203#true} {2203#true} #52#return; {2203#true} is VALID [2022-04-27 14:38:38,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {2203#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2241#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:38,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {2241#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2241#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:38,098 INFO L272 TraceCheckUtils]: 13: Hoare triple {2241#(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)); {2203#true} is VALID [2022-04-27 14:38:38,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:38:38,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:38:38,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:38:38,099 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2203#true} {2241#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2241#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:38,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {2241#(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; {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:38,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:38,100 INFO L272 TraceCheckUtils]: 20: Hoare triple {2263#(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)); {2203#true} is VALID [2022-04-27 14:38:38,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:38:38,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:38:38,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:38:38,100 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2203#true} {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:38,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {2263#(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; {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:38:38,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:38:38,101 INFO L272 TraceCheckUtils]: 27: Hoare triple {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:38:38,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:38:38,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:38:38,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:38:38,102 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2203#true} {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:38:38,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:38:38,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:38:38,103 INFO L272 TraceCheckUtils]: 34: Hoare triple {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:38:38,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:38:38,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:38:38,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:38:38,103 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2203#true} {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:38:38,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:38,104 INFO L290 TraceCheckUtils]: 40: Hoare triple {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:38,104 INFO L272 TraceCheckUtils]: 41: Hoare triple {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:38:38,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:38:38,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:38:38,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:38:38,105 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2203#true} {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #54#return; {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:38,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:38:38,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !false; {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:38:38,106 INFO L272 TraceCheckUtils]: 48: Hoare triple {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 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)); {2203#true} is VALID [2022-04-27 14:38:38,106 INFO L290 TraceCheckUtils]: 49: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:38:38,106 INFO L290 TraceCheckUtils]: 50: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:38:38,106 INFO L290 TraceCheckUtils]: 51: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:38:38,107 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2203#true} {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #54#return; {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:38:38,107 INFO L290 TraceCheckUtils]: 53: Hoare triple {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2373#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:38:38,108 INFO L272 TraceCheckUtils]: 54: Hoare triple {2373#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2377#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:38,108 INFO L290 TraceCheckUtils]: 55: Hoare triple {2377#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2381#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:38,109 INFO L290 TraceCheckUtils]: 56: Hoare triple {2381#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2204#false} is VALID [2022-04-27 14:38:38,109 INFO L290 TraceCheckUtils]: 57: Hoare triple {2204#false} assume !false; {2204#false} is VALID [2022-04-27 14:38:38,109 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-27 14:38:38,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:38,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:38,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900028258] [2022-04-27 14:38:38,343 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:38,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346001557] [2022-04-27 14:38:38,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346001557] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:38,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:38,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:38:38,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860333055] [2022-04-27 14:38:38,343 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:38,344 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-27 14:38:38,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:38,344 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-27 14:38:38,372 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-27 14:38:38,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:38:38,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:38,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:38:38,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:38:38,372 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-27 14:38:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:38,787 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-27 14:38:38,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:38:38,787 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-27 14:38:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:38,788 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-27 14:38:38,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-27 14:38:38,789 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-27 14:38:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-27 14:38:38,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-27 14:38:38,824 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-27 14:38:38,825 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:38:38,825 INFO L226 Difference]: Without dead ends: 46 [2022-04-27 14:38:38,826 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-27 14:38:38,826 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-27 14:38:38,826 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-27 14:38:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-27 14:38:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-27 14:38:38,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:38,879 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-27 14:38:38,882 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-27 14:38:38,885 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-27 14:38:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:38,887 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-27 14:38:38,887 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 14:38:38,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:38,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:38,887 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-27 14:38:38,889 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-27 14:38:38,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:38,891 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-27 14:38:38,891 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 14:38:38,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:38,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:38,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:38,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:38,891 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-27 14:38:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-27 14:38:38,893 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 58 [2022-04-27 14:38:38,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:38,893 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-27 14:38:38,893 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-27 14:38:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 14:38:38,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-27 14:38:38,893 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:38,893 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-27 14:38:38,911 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-27 14:38:39,097 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-27 14:38:39,098 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:39,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:39,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 6 times [2022-04-27 14:38:39,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:39,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980576720] [2022-04-27 14:38:39,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:39,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:39,119 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:39,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [696718131] [2022-04-27 14:38:39,120 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:38:39,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:39,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:39,122 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-27 14:38:39,123 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-27 14:38:39,254 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:38:39,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:39,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 14:38:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:39,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:39,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2672#true} is VALID [2022-04-27 14:38:39,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#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); {2672#true} is VALID [2022-04-27 14:38:39,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:38:39,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #60#return; {2672#true} is VALID [2022-04-27 14:38:39,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret5 := main(); {2672#true} is VALID [2022-04-27 14:38:39,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#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; {2672#true} is VALID [2022-04-27 14:38:39,655 INFO L272 TraceCheckUtils]: 6: Hoare triple {2672#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:38:39,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:38:39,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:38:39,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:38:39,656 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2672#true} {2672#true} #52#return; {2672#true} is VALID [2022-04-27 14:38:39,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {2672#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2710#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:39,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {2710#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2710#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:39,656 INFO L272 TraceCheckUtils]: 13: Hoare triple {2710#(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)); {2672#true} is VALID [2022-04-27 14:38:39,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:38:39,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:38:39,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:38:39,657 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2672#true} {2710#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2710#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:39,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {2710#(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; {2732#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:38:39,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {2732#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {2732#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:38:39,658 INFO L272 TraceCheckUtils]: 20: Hoare triple {2732#(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)); {2672#true} is VALID [2022-04-27 14:38:39,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:38:39,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:38:39,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:38:39,659 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2672#true} {2732#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {2732#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:38:39,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {2732#(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; {2754#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:38:39,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {2754#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {2754#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:38:39,659 INFO L272 TraceCheckUtils]: 27: Hoare triple {2754#(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)); {2672#true} is VALID [2022-04-27 14:38:39,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:38:39,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:38:39,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:38:39,660 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2672#true} {2754#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {2754#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:38:39,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {2754#(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; {2776#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:38:39,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {2776#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {2776#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:38:39,661 INFO L272 TraceCheckUtils]: 34: Hoare triple {2776#(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)); {2672#true} is VALID [2022-04-27 14:38:39,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:38:39,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:38:39,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:38:39,662 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2672#true} {2776#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #54#return; {2776#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:38:39,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {2776#(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; {2798#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:38:39,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {2798#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {2798#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:38:39,662 INFO L272 TraceCheckUtils]: 41: Hoare triple {2798#(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)); {2672#true} is VALID [2022-04-27 14:38:39,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:38:39,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:38:39,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:38:39,663 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2672#true} {2798#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {2798#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:38:39,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {2798#(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; {2820#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:39,664 INFO L290 TraceCheckUtils]: 47: Hoare triple {2820#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {2820#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:39,664 INFO L272 TraceCheckUtils]: 48: Hoare triple {2820#(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)); {2672#true} is VALID [2022-04-27 14:38:39,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:38:39,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:38:39,664 INFO L290 TraceCheckUtils]: 51: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:38:39,664 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2672#true} {2820#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {2820#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:39,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {2820#(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; {2842#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:38:39,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {2842#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {2842#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:38:39,665 INFO L272 TraceCheckUtils]: 55: Hoare triple {2842#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:38:39,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:38:39,665 INFO L290 TraceCheckUtils]: 57: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:38:39,665 INFO L290 TraceCheckUtils]: 58: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:38:39,666 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2672#true} {2842#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #54#return; {2842#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:38:39,666 INFO L290 TraceCheckUtils]: 60: Hoare triple {2842#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {2864#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:38:39,667 INFO L272 TraceCheckUtils]: 61: Hoare triple {2864#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2868#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:39,667 INFO L290 TraceCheckUtils]: 62: Hoare triple {2868#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2872#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:39,667 INFO L290 TraceCheckUtils]: 63: Hoare triple {2872#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2673#false} is VALID [2022-04-27 14:38:39,667 INFO L290 TraceCheckUtils]: 64: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-27 14:38:39,668 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-27 14:38:39,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:39,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:39,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980576720] [2022-04-27 14:38:39,981 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:39,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696718131] [2022-04-27 14:38:39,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696718131] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:39,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:39,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 14:38:39,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197835187] [2022-04-27 14:38:39,982 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:39,982 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-27 14:38:39,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:39,982 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-27 14:38:40,012 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-27 14:38:40,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:38:40,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:40,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:38:40,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:38:40,013 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-27 14:38:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:40,506 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-27 14:38:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:38:40,507 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-27 14:38:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:40,507 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-27 14:38:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-27 14:38:40,508 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-27 14:38:40,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-27 14:38:40,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-27 14:38:40,546 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-27 14:38:40,546 INFO L225 Difference]: With dead ends: 54 [2022-04-27 14:38:40,546 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 14:38:40,547 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-27 14:38:40,547 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-27 14:38:40,547 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-27 14:38:40,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 14:38:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-27 14:38:40,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:40,561 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-27 14:38:40,562 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-27 14:38:40,562 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-27 14:38:40,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:40,563 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-27 14:38:40,563 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-27 14:38:40,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:40,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:40,564 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-27 14:38:40,564 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-27 14:38:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:40,565 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-27 14:38:40,565 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-27 14:38:40,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:40,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:40,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:40,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:40,565 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-27 14:38:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-04-27 14:38:40,566 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 65 [2022-04-27 14:38:40,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:40,566 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-04-27 14:38:40,566 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-27 14:38:40,566 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-27 14:38:40,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-27 14:38:40,567 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:40,567 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-27 14:38:40,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 14:38:40,771 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-27 14:38:40,772 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:40,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:40,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 7 times [2022-04-27 14:38:40,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:40,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712699284] [2022-04-27 14:38:40,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:40,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:40,782 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:40,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690319104] [2022-04-27 14:38:40,782 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:38:40,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:40,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:40,783 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-27 14:38:40,784 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-27 14:38:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:41,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 14:38:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:41,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:41,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {3179#true} call ULTIMATE.init(); {3179#true} is VALID [2022-04-27 14:38:41,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {3179#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); {3179#true} is VALID [2022-04-27 14:38:41,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:38:41,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3179#true} {3179#true} #60#return; {3179#true} is VALID [2022-04-27 14:38:41,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {3179#true} call #t~ret5 := main(); {3179#true} is VALID [2022-04-27 14:38:41,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {3179#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; {3179#true} is VALID [2022-04-27 14:38:41,587 INFO L272 TraceCheckUtils]: 6: Hoare triple {3179#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {3179#true} is VALID [2022-04-27 14:38:41,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:38:41,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:38:41,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:38:41,587 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3179#true} {3179#true} #52#return; {3179#true} is VALID [2022-04-27 14:38:41,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {3179#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3217#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:41,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {3217#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3217#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:41,588 INFO L272 TraceCheckUtils]: 13: Hoare triple {3217#(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)); {3179#true} is VALID [2022-04-27 14:38:41,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:38:41,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:38:41,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:38:41,589 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3179#true} {3217#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3217#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:41,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {3217#(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; {3239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:38:41,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {3239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {3239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:38:41,590 INFO L272 TraceCheckUtils]: 20: Hoare triple {3239#(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)); {3179#true} is VALID [2022-04-27 14:38:41,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:38:41,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:38:41,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:38:41,590 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3179#true} {3239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {3239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:38:41,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {3239#(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; {3261#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:41,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {3261#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {3261#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:41,591 INFO L272 TraceCheckUtils]: 27: Hoare triple {3261#(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)); {3179#true} is VALID [2022-04-27 14:38:41,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:38:41,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:38:41,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:38:41,592 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3179#true} {3261#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {3261#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:41,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {3261#(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; {3283#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:38:41,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {3283#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {3283#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:38:41,593 INFO L272 TraceCheckUtils]: 34: Hoare triple {3283#(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)); {3179#true} is VALID [2022-04-27 14:38:41,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:38:41,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:38:41,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:38:41,593 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3179#true} {3283#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {3283#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:38:41,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {3283#(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; {3305#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:38:41,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {3305#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {3305#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:38:41,594 INFO L272 TraceCheckUtils]: 41: Hoare triple {3305#(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)); {3179#true} is VALID [2022-04-27 14:38:41,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:38:41,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:38:41,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:38:41,595 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3179#true} {3305#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {3305#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:38:41,595 INFO L290 TraceCheckUtils]: 46: Hoare triple {3305#(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; {3327#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:41,596 INFO L290 TraceCheckUtils]: 47: Hoare triple {3327#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {3327#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:41,596 INFO L272 TraceCheckUtils]: 48: Hoare triple {3327#(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)); {3179#true} is VALID [2022-04-27 14:38:41,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:38:41,596 INFO L290 TraceCheckUtils]: 50: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:38:41,596 INFO L290 TraceCheckUtils]: 51: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:38:41,596 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3179#true} {3327#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {3327#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:41,597 INFO L290 TraceCheckUtils]: 53: Hoare triple {3327#(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; {3349#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:41,597 INFO L290 TraceCheckUtils]: 54: Hoare triple {3349#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {3349#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:41,597 INFO L272 TraceCheckUtils]: 55: Hoare triple {3349#(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)); {3179#true} is VALID [2022-04-27 14:38:41,597 INFO L290 TraceCheckUtils]: 56: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:38:41,597 INFO L290 TraceCheckUtils]: 57: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:38:41,597 INFO L290 TraceCheckUtils]: 58: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:38:41,598 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3179#true} {3349#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {3349#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:41,598 INFO L290 TraceCheckUtils]: 60: Hoare triple {3349#(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; {3371#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 14:38:41,598 INFO L290 TraceCheckUtils]: 61: Hoare triple {3371#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !false; {3371#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 14:38:41,598 INFO L272 TraceCheckUtils]: 62: Hoare triple {3371#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 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)); {3179#true} is VALID [2022-04-27 14:38:41,599 INFO L290 TraceCheckUtils]: 63: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:38:41,599 INFO L290 TraceCheckUtils]: 64: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:38:41,599 INFO L290 TraceCheckUtils]: 65: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:38:41,599 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3179#true} {3371#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} #54#return; {3371#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 14:38:41,600 INFO L290 TraceCheckUtils]: 67: Hoare triple {3371#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3393#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 14:38:41,600 INFO L272 TraceCheckUtils]: 68: Hoare triple {3393#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3397#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:41,601 INFO L290 TraceCheckUtils]: 69: Hoare triple {3397#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3401#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:41,601 INFO L290 TraceCheckUtils]: 70: Hoare triple {3401#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3180#false} is VALID [2022-04-27 14:38:41,601 INFO L290 TraceCheckUtils]: 71: Hoare triple {3180#false} assume !false; {3180#false} is VALID [2022-04-27 14:38:41,601 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-27 14:38:41,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:41,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:41,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712699284] [2022-04-27 14:38:41,828 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:41,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690319104] [2022-04-27 14:38:41,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690319104] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:41,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:41,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 14:38:41,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540836850] [2022-04-27 14:38:41,829 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:41,829 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-27 14:38:41,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:41,829 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-27 14:38:41,861 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-27 14:38:41,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:38:41,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:41,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:38:41,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:38:41,862 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-27 14:38:42,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:42,461 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-27 14:38:42,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:38:42,461 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-27 14:38:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:42,462 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-27 14:38:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-27 14:38:42,463 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-27 14:38:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-27 14:38:42,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-27 14:38:42,501 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-27 14:38:42,502 INFO L225 Difference]: With dead ends: 57 [2022-04-27 14:38:42,502 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 14:38:42,502 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-27 14:38:42,503 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-27 14:38:42,503 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-27 14:38:42,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 14:38:42,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 14:38:42,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:42,519 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-27 14:38:42,519 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-27 14:38:42,519 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-27 14:38:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:42,520 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:38:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:38:42,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:42,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:42,520 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-27 14:38:42,520 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-27 14:38:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:42,521 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:38:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:38:42,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:42,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:42,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:42,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:42,529 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-27 14:38:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-27 14:38:42,540 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 72 [2022-04-27 14:38:42,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:42,540 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-27 14:38:42,540 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-27 14:38:42,540 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:38:42,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-27 14:38:42,540 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:42,541 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-27 14:38:42,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 14:38:42,741 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-27 14:38:42,741 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:42,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:42,742 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 8 times [2022-04-27 14:38:42,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:42,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682919209] [2022-04-27 14:38:42,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:42,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:42,753 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:42,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1123603659] [2022-04-27 14:38:42,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:38:42,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:42,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:42,756 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-27 14:38:42,757 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-27 14:38:43,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:38:43,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:43,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 14:38:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:43,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:43,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {3724#true} call ULTIMATE.init(); {3724#true} is VALID [2022-04-27 14:38:43,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {3724#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); {3724#true} is VALID [2022-04-27 14:38:43,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:43,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3724#true} {3724#true} #60#return; {3724#true} is VALID [2022-04-27 14:38:43,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {3724#true} call #t~ret5 := main(); {3724#true} is VALID [2022-04-27 14:38:43,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {3724#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; {3724#true} is VALID [2022-04-27 14:38:43,862 INFO L272 TraceCheckUtils]: 6: Hoare triple {3724#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {3724#true} is VALID [2022-04-27 14:38:43,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:43,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:43,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:43,862 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3724#true} {3724#true} #52#return; {3724#true} is VALID [2022-04-27 14:38:43,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {3724#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3762#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:43,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {3762#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3762#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:43,863 INFO L272 TraceCheckUtils]: 13: Hoare triple {3762#(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)); {3724#true} is VALID [2022-04-27 14:38:43,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:43,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:43,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:43,864 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3724#true} {3762#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3762#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:43,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {3762#(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; {3784#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:38:43,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {3784#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3784#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:38:43,864 INFO L272 TraceCheckUtils]: 20: Hoare triple {3784#(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)); {3724#true} is VALID [2022-04-27 14:38:43,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:43,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:43,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:43,865 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3724#true} {3784#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {3784#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:38:43,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {3784#(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; {3806#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:38:43,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {3806#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {3806#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:38:43,866 INFO L272 TraceCheckUtils]: 27: Hoare triple {3806#(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)); {3724#true} is VALID [2022-04-27 14:38:43,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:43,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:43,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:43,866 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3724#true} {3806#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {3806#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:38:43,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {3806#(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; {3828#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:38:43,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {3828#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {3828#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:38:43,867 INFO L272 TraceCheckUtils]: 34: Hoare triple {3828#(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)); {3724#true} is VALID [2022-04-27 14:38:43,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:43,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:43,867 INFO L290 TraceCheckUtils]: 37: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:43,868 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3724#true} {3828#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {3828#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:38:43,868 INFO L290 TraceCheckUtils]: 39: Hoare triple {3828#(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; {3850#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:43,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {3850#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {3850#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:43,868 INFO L272 TraceCheckUtils]: 41: Hoare triple {3850#(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)); {3724#true} is VALID [2022-04-27 14:38:43,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:43,869 INFO L290 TraceCheckUtils]: 43: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:43,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:43,869 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3724#true} {3850#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {3850#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:43,869 INFO L290 TraceCheckUtils]: 46: Hoare triple {3850#(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; {3872#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:43,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {3872#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3872#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:43,870 INFO L272 TraceCheckUtils]: 48: Hoare triple {3872#(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)); {3724#true} is VALID [2022-04-27 14:38:43,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:43,870 INFO L290 TraceCheckUtils]: 50: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:43,870 INFO L290 TraceCheckUtils]: 51: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:43,870 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3724#true} {3872#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {3872#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:43,871 INFO L290 TraceCheckUtils]: 53: Hoare triple {3872#(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; {3894#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:38:43,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {3894#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {3894#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:38:43,871 INFO L272 TraceCheckUtils]: 55: Hoare triple {3894#(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)); {3724#true} is VALID [2022-04-27 14:38:43,872 INFO L290 TraceCheckUtils]: 56: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:43,872 INFO L290 TraceCheckUtils]: 57: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:43,878 INFO L290 TraceCheckUtils]: 58: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:43,879 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3724#true} {3894#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {3894#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:38:43,879 INFO L290 TraceCheckUtils]: 60: Hoare triple {3894#(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; {3916#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:43,879 INFO L290 TraceCheckUtils]: 61: Hoare triple {3916#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {3916#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:43,879 INFO L272 TraceCheckUtils]: 62: Hoare triple {3916#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3724#true} is VALID [2022-04-27 14:38:43,879 INFO L290 TraceCheckUtils]: 63: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:43,880 INFO L290 TraceCheckUtils]: 64: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:43,880 INFO L290 TraceCheckUtils]: 65: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:43,880 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3724#true} {3916#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #54#return; {3916#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:43,881 INFO L290 TraceCheckUtils]: 67: Hoare triple {3916#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3938#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:38:43,881 INFO L290 TraceCheckUtils]: 68: Hoare triple {3938#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {3938#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:38:43,881 INFO L272 TraceCheckUtils]: 69: Hoare triple {3938#(and (< 7 main_~k~0) (= 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)); {3724#true} is VALID [2022-04-27 14:38:43,881 INFO L290 TraceCheckUtils]: 70: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:43,881 INFO L290 TraceCheckUtils]: 71: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:43,881 INFO L290 TraceCheckUtils]: 72: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:43,882 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3724#true} {3938#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #54#return; {3938#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:38:43,882 INFO L290 TraceCheckUtils]: 74: Hoare triple {3938#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {3960#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:38:43,883 INFO L272 TraceCheckUtils]: 75: Hoare triple {3960#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3964#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:43,883 INFO L290 TraceCheckUtils]: 76: Hoare triple {3964#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3968#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:43,883 INFO L290 TraceCheckUtils]: 77: Hoare triple {3968#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3725#false} is VALID [2022-04-27 14:38:43,883 INFO L290 TraceCheckUtils]: 78: Hoare triple {3725#false} assume !false; {3725#false} is VALID [2022-04-27 14:38:43,884 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-27 14:38:43,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:44,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:44,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682919209] [2022-04-27 14:38:44,184 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:44,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123603659] [2022-04-27 14:38:44,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123603659] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:44,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:44,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:38:44,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417735732] [2022-04-27 14:38:44,185 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:44,187 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-27 14:38:44,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:44,187 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-27 14:38:44,219 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-27 14:38:44,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:38:44,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:44,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:38:44,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:38:44,220 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-27 14:38:44,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:44,962 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-27 14:38:44,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 14:38:44,962 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-27 14:38:44,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:44,962 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-27 14:38:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-27 14:38:44,963 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-27 14:38:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-27 14:38:44,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-27 14:38:45,001 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-27 14:38:45,002 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:38:45,002 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 14:38:45,002 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-27 14:38:45,002 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-27 14:38:45,003 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-27 14:38:45,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 14:38:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 14:38:45,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:45,021 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-27 14:38:45,021 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-27 14:38:45,021 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-27 14:38:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:45,022 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-27 14:38:45,022 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 14:38:45,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:45,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:45,023 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-27 14:38:45,023 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-27 14:38:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:45,024 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-27 14:38:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 14:38:45,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:45,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:45,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:45,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:45,024 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-27 14:38:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-04-27 14:38:45,025 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 79 [2022-04-27 14:38:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:45,025 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-04-27 14:38:45,026 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-27 14:38:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 14:38:45,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-27 14:38:45,026 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:45,026 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-27 14:38:45,042 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-27 14:38:45,234 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-27 14:38:45,234 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:45,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:45,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 9 times [2022-04-27 14:38:45,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:45,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519092435] [2022-04-27 14:38:45,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:45,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:45,244 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:45,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [496741651] [2022-04-27 14:38:45,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:38:45,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:45,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:45,245 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-27 14:38:45,246 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-27 14:38:45,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-27 14:38:45,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:45,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-27 14:38:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:45,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:46,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {4307#true} call ULTIMATE.init(); {4307#true} is VALID [2022-04-27 14:38:46,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {4307#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); {4307#true} is VALID [2022-04-27 14:38:46,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:46,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4307#true} {4307#true} #60#return; {4307#true} is VALID [2022-04-27 14:38:46,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {4307#true} call #t~ret5 := main(); {4307#true} is VALID [2022-04-27 14:38:46,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {4307#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; {4307#true} is VALID [2022-04-27 14:38:46,102 INFO L272 TraceCheckUtils]: 6: Hoare triple {4307#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {4307#true} is VALID [2022-04-27 14:38:46,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:46,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:46,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:46,102 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4307#true} {4307#true} #52#return; {4307#true} is VALID [2022-04-27 14:38:46,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {4307#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4345#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:46,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {4345#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4345#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:46,103 INFO L272 TraceCheckUtils]: 13: Hoare triple {4345#(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)); {4307#true} is VALID [2022-04-27 14:38:46,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:46,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:46,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:46,104 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4307#true} {4345#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {4345#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:46,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {4345#(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; {4367#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:46,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {4367#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {4367#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:46,105 INFO L272 TraceCheckUtils]: 20: Hoare triple {4367#(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)); {4307#true} is VALID [2022-04-27 14:38:46,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:46,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:46,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:46,105 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4307#true} {4367#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {4367#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:46,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {4367#(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; {4389#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:38:46,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {4389#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {4389#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:38:46,106 INFO L272 TraceCheckUtils]: 27: Hoare triple {4389#(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)); {4307#true} is VALID [2022-04-27 14:38:46,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:46,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:46,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:46,107 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4307#true} {4389#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {4389#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:38:46,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {4389#(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; {4411#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:38:46,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {4411#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {4411#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:38:46,108 INFO L272 TraceCheckUtils]: 34: Hoare triple {4411#(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)); {4307#true} is VALID [2022-04-27 14:38:46,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:46,108 INFO L290 TraceCheckUtils]: 36: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:46,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:46,109 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4307#true} {4411#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {4411#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:38:46,109 INFO L290 TraceCheckUtils]: 39: Hoare triple {4411#(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; {4433#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:38:46,110 INFO L290 TraceCheckUtils]: 40: Hoare triple {4433#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {4433#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:38:46,110 INFO L272 TraceCheckUtils]: 41: Hoare triple {4433#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4307#true} is VALID [2022-04-27 14:38:46,110 INFO L290 TraceCheckUtils]: 42: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:46,110 INFO L290 TraceCheckUtils]: 43: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:46,110 INFO L290 TraceCheckUtils]: 44: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:46,110 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4307#true} {4433#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #54#return; {4433#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:38:46,111 INFO L290 TraceCheckUtils]: 46: Hoare triple {4433#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4455#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:46,111 INFO L290 TraceCheckUtils]: 47: Hoare triple {4455#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {4455#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:46,111 INFO L272 TraceCheckUtils]: 48: Hoare triple {4455#(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)); {4307#true} is VALID [2022-04-27 14:38:46,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:46,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:46,111 INFO L290 TraceCheckUtils]: 51: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:46,112 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4307#true} {4455#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {4455#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:46,112 INFO L290 TraceCheckUtils]: 53: Hoare triple {4455#(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; {4477#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:38:46,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {4477#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {4477#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:38:46,113 INFO L272 TraceCheckUtils]: 55: Hoare triple {4477#(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)); {4307#true} is VALID [2022-04-27 14:38:46,113 INFO L290 TraceCheckUtils]: 56: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:46,113 INFO L290 TraceCheckUtils]: 57: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:46,113 INFO L290 TraceCheckUtils]: 58: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:46,113 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4307#true} {4477#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {4477#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:38:46,114 INFO L290 TraceCheckUtils]: 60: Hoare triple {4477#(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; {4499#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:38:46,114 INFO L290 TraceCheckUtils]: 61: Hoare triple {4499#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {4499#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:38:46,114 INFO L272 TraceCheckUtils]: 62: Hoare triple {4499#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 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)); {4307#true} is VALID [2022-04-27 14:38:46,114 INFO L290 TraceCheckUtils]: 63: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:46,115 INFO L290 TraceCheckUtils]: 64: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:46,115 INFO L290 TraceCheckUtils]: 65: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:46,115 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4307#true} {4499#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {4499#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:38:46,116 INFO L290 TraceCheckUtils]: 67: Hoare triple {4499#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 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; {4521#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 14:38:46,116 INFO L290 TraceCheckUtils]: 68: Hoare triple {4521#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} assume !false; {4521#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 14:38:46,116 INFO L272 TraceCheckUtils]: 69: Hoare triple {4521#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~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)); {4307#true} is VALID [2022-04-27 14:38:46,116 INFO L290 TraceCheckUtils]: 70: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:46,116 INFO L290 TraceCheckUtils]: 71: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:46,116 INFO L290 TraceCheckUtils]: 72: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:46,117 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4307#true} {4521#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} #54#return; {4521#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 14:38:46,118 INFO L290 TraceCheckUtils]: 74: Hoare triple {4521#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~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; {4543#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:38:46,118 INFO L290 TraceCheckUtils]: 75: Hoare triple {4543#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {4543#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:38:46,118 INFO L272 TraceCheckUtils]: 76: Hoare triple {4543#(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)); {4307#true} is VALID [2022-04-27 14:38:46,118 INFO L290 TraceCheckUtils]: 77: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:46,118 INFO L290 TraceCheckUtils]: 78: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:46,118 INFO L290 TraceCheckUtils]: 79: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:46,119 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {4307#true} {4543#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #54#return; {4543#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:38:46,119 INFO L290 TraceCheckUtils]: 81: Hoare triple {4543#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {4565#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 14:38:46,120 INFO L272 TraceCheckUtils]: 82: Hoare triple {4565#(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)); {4569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:46,120 INFO L290 TraceCheckUtils]: 83: Hoare triple {4569#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:46,121 INFO L290 TraceCheckUtils]: 84: Hoare triple {4573#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4308#false} is VALID [2022-04-27 14:38:46,121 INFO L290 TraceCheckUtils]: 85: Hoare triple {4308#false} assume !false; {4308#false} is VALID [2022-04-27 14:38:46,121 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-27 14:38:46,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:46,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:46,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519092435] [2022-04-27 14:38:46,514 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:46,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496741651] [2022-04-27 14:38:46,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496741651] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:46,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:46,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-27 14:38:46,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987604138] [2022-04-27 14:38:46,514 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:46,515 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-27 14:38:46,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:46,515 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-27 14:38:46,554 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-27 14:38:46,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 14:38:46,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:46,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 14:38:46,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:38:46,555 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-27 14:38:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:47,413 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-27 14:38:47,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 14:38:47,413 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-27 14:38:47,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:47,414 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-27 14:38:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-27 14:38:47,416 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-27 14:38:47,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-27 14:38:47,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 68 transitions. [2022-04-27 14:38:47,455 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-27 14:38:47,457 INFO L225 Difference]: With dead ends: 63 [2022-04-27 14:38:47,457 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 14:38:47,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:38:47,458 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:47,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 393 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 14:38:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 14:38:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 14:38:47,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:47,477 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-27 14:38:47,477 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-27 14:38:47,478 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-27 14:38:47,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:47,479 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-27 14:38:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 14:38:47,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:47,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:47,479 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-27 14:38:47,479 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-27 14:38:47,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:47,480 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-27 14:38:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 14:38:47,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:47,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:47,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:47,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:47,481 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-27 14:38:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-27 14:38:47,482 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 86 [2022-04-27 14:38:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:47,482 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-27 14:38:47,482 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-27 14:38:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 14:38:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-27 14:38:47,483 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:47,483 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-27 14:38:47,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-27 14:38:47,687 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-27 14:38:47,688 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:47,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:47,688 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 10 times [2022-04-27 14:38:47,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:47,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202480499] [2022-04-27 14:38:47,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:47,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:47,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:47,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1673367991] [2022-04-27 14:38:47,702 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:38:47,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:47,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:47,703 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-27 14:38:47,704 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-27 14:38:48,203 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:38:48,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:48,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 14:38:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:48,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:48,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {4972#true} call ULTIMATE.init(); {4972#true} is VALID [2022-04-27 14:38:48,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {4972#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); {4972#true} is VALID [2022-04-27 14:38:48,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:48,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4972#true} {4972#true} #60#return; {4972#true} is VALID [2022-04-27 14:38:48,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {4972#true} call #t~ret5 := main(); {4972#true} is VALID [2022-04-27 14:38:48,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {4972#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; {4972#true} is VALID [2022-04-27 14:38:48,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {4972#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:38:48,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:48,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:48,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:48,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4972#true} {4972#true} #52#return; {4972#true} is VALID [2022-04-27 14:38:48,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {4972#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5010#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:48,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {5010#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5010#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:48,680 INFO L272 TraceCheckUtils]: 13: Hoare triple {5010#(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)); {4972#true} is VALID [2022-04-27 14:38:48,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:48,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:48,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:48,680 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4972#true} {5010#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {5010#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:48,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {5010#(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; {5032#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:38:48,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {5032#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {5032#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:38:48,681 INFO L272 TraceCheckUtils]: 20: Hoare triple {5032#(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)); {4972#true} is VALID [2022-04-27 14:38:48,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:48,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:48,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:48,683 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4972#true} {5032#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {5032#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:38:48,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {5032#(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; {5054#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:38:48,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {5054#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {5054#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:38:48,683 INFO L272 TraceCheckUtils]: 27: Hoare triple {5054#(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)); {4972#true} is VALID [2022-04-27 14:38:48,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:48,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:48,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:48,684 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4972#true} {5054#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {5054#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:38:48,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {5054#(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; {5076#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:38:48,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {5076#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {5076#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:38:48,685 INFO L272 TraceCheckUtils]: 34: Hoare triple {5076#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:38:48,685 INFO L290 TraceCheckUtils]: 35: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:48,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:48,685 INFO L290 TraceCheckUtils]: 37: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:48,686 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4972#true} {5076#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {5076#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:38:48,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {5076#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5098#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:38:48,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {5098#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {5098#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:38:48,687 INFO L272 TraceCheckUtils]: 41: Hoare triple {5098#(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)); {4972#true} is VALID [2022-04-27 14:38:48,687 INFO L290 TraceCheckUtils]: 42: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:48,687 INFO L290 TraceCheckUtils]: 43: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:48,687 INFO L290 TraceCheckUtils]: 44: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:48,687 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4972#true} {5098#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {5098#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:38:48,688 INFO L290 TraceCheckUtils]: 46: Hoare triple {5098#(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; {5120#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:38:48,690 INFO L290 TraceCheckUtils]: 47: Hoare triple {5120#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {5120#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:38:48,690 INFO L272 TraceCheckUtils]: 48: Hoare triple {5120#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:38:48,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:48,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:48,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:48,691 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4972#true} {5120#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {5120#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:38:48,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {5120#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5142#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:38:48,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {5142#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {5142#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:38:48,692 INFO L272 TraceCheckUtils]: 55: Hoare triple {5142#(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)); {4972#true} is VALID [2022-04-27 14:38:48,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:48,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:48,692 INFO L290 TraceCheckUtils]: 58: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:48,692 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4972#true} {5142#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {5142#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:38:48,693 INFO L290 TraceCheckUtils]: 60: Hoare triple {5142#(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; {5164#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:38:48,693 INFO L290 TraceCheckUtils]: 61: Hoare triple {5164#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {5164#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:38:48,693 INFO L272 TraceCheckUtils]: 62: Hoare triple {5164#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:38:48,693 INFO L290 TraceCheckUtils]: 63: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:48,693 INFO L290 TraceCheckUtils]: 64: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:48,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:48,694 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4972#true} {5164#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {5164#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:38:48,694 INFO L290 TraceCheckUtils]: 67: Hoare triple {5164#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5186#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:38:48,694 INFO L290 TraceCheckUtils]: 68: Hoare triple {5186#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {5186#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:38:48,694 INFO L272 TraceCheckUtils]: 69: Hoare triple {5186#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:38:48,694 INFO L290 TraceCheckUtils]: 70: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:48,694 INFO L290 TraceCheckUtils]: 71: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:48,695 INFO L290 TraceCheckUtils]: 72: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:48,695 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4972#true} {5186#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #54#return; {5186#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:38:48,695 INFO L290 TraceCheckUtils]: 74: Hoare triple {5186#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5208#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:48,696 INFO L290 TraceCheckUtils]: 75: Hoare triple {5208#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {5208#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:48,696 INFO L272 TraceCheckUtils]: 76: Hoare triple {5208#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:38:48,696 INFO L290 TraceCheckUtils]: 77: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:48,696 INFO L290 TraceCheckUtils]: 78: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:48,696 INFO L290 TraceCheckUtils]: 79: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:48,696 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {4972#true} {5208#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #54#return; {5208#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:48,697 INFO L290 TraceCheckUtils]: 81: Hoare triple {5208#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5230#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:38:48,697 INFO L290 TraceCheckUtils]: 82: Hoare triple {5230#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !false; {5230#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:38:48,697 INFO L272 TraceCheckUtils]: 83: Hoare triple {5230#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:38:48,697 INFO L290 TraceCheckUtils]: 84: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:48,697 INFO L290 TraceCheckUtils]: 85: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:48,697 INFO L290 TraceCheckUtils]: 86: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:48,698 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {4972#true} {5230#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #54#return; {5230#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:38:48,698 INFO L290 TraceCheckUtils]: 88: Hoare triple {5230#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {5252#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:38:48,699 INFO L272 TraceCheckUtils]: 89: Hoare triple {5252#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5256#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:48,699 INFO L290 TraceCheckUtils]: 90: Hoare triple {5256#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5260#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:48,700 INFO L290 TraceCheckUtils]: 91: Hoare triple {5260#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4973#false} is VALID [2022-04-27 14:38:48,700 INFO L290 TraceCheckUtils]: 92: Hoare triple {4973#false} assume !false; {4973#false} is VALID [2022-04-27 14:38:48,700 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-27 14:38:48,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:48,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:48,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202480499] [2022-04-27 14:38:48,949 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:48,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673367991] [2022-04-27 14:38:48,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673367991] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:48,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:48,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-27 14:38:48,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139974855] [2022-04-27 14:38:48,949 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:48,949 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-27 14:38:48,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:48,950 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-27 14:38:48,992 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-27 14:38:48,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 14:38:48,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:48,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 14:38:48,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:38:48,992 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-27 14:38:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:50,007 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-27 14:38:50,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 14:38:50,007 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-27 14:38:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:50,009 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-27 14:38:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-27 14:38:50,010 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-27 14:38:50,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-27 14:38:50,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 72 transitions. [2022-04-27 14:38:50,080 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-27 14:38:50,081 INFO L225 Difference]: With dead ends: 66 [2022-04-27 14:38:50,081 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 14:38:50,081 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-27 14:38:50,082 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:50,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 14:38:50,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 14:38:50,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-27 14:38:50,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:50,108 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-27 14:38:50,108 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-27 14:38:50,108 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-27 14:38:50,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:50,109 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-27 14:38:50,109 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 14:38:50,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:50,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:50,110 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-27 14:38:50,110 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-27 14:38:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:50,111 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-27 14:38:50,111 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 14:38:50,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:50,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:50,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:50,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:50,112 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-27 14:38:50,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-04-27 14:38:50,113 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 93 [2022-04-27 14:38:50,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:50,114 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-04-27 14:38:50,114 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-27 14:38:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 14:38:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-27 14:38:50,115 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:50,115 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-27 14:38:50,125 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-27 14:38:50,325 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-27 14:38:50,326 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:50,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:50,326 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 11 times [2022-04-27 14:38:50,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:50,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418332045] [2022-04-27 14:38:50,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:50,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:50,338 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:50,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [382269490] [2022-04-27 14:38:50,338 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:38:50,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:50,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:50,339 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-27 14:38:50,340 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-27 14:38:50,909 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-27 14:38:50,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:50,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-27 14:38:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:50,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:51,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {5631#true} call ULTIMATE.init(); {5631#true} is VALID [2022-04-27 14:38:51,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {5631#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); {5631#true} is VALID [2022-04-27 14:38:51,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:51,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5631#true} {5631#true} #60#return; {5631#true} is VALID [2022-04-27 14:38:51,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {5631#true} call #t~ret5 := main(); {5631#true} is VALID [2022-04-27 14:38:51,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {5631#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; {5631#true} is VALID [2022-04-27 14:38:51,561 INFO L272 TraceCheckUtils]: 6: Hoare triple {5631#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:38:51,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:51,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:51,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:51,561 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5631#true} {5631#true} #52#return; {5631#true} is VALID [2022-04-27 14:38:51,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {5631#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5669#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:51,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {5669#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5669#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:51,562 INFO L272 TraceCheckUtils]: 13: Hoare triple {5669#(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)); {5631#true} is VALID [2022-04-27 14:38:51,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:51,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:51,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:51,563 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5631#true} {5669#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {5669#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:51,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {5669#(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; {5691#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:38:51,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {5691#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {5691#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:38:51,563 INFO L272 TraceCheckUtils]: 20: Hoare triple {5691#(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)); {5631#true} is VALID [2022-04-27 14:38:51,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:51,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:51,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:51,564 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5631#true} {5691#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #54#return; {5691#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:38:51,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {5691#(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; {5713#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {5713#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !false; {5713#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,565 INFO L272 TraceCheckUtils]: 27: Hoare triple {5713#(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)); {5631#true} is VALID [2022-04-27 14:38:51,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:51,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:51,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:51,565 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5631#true} {5713#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} #54#return; {5713#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,566 INFO L290 TraceCheckUtils]: 32: Hoare triple {5713#(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; {5735#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {5735#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< 0 main_~k~0))} assume !false; {5735#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,566 INFO L272 TraceCheckUtils]: 34: Hoare triple {5735#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:38:51,566 INFO L290 TraceCheckUtils]: 35: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:51,566 INFO L290 TraceCheckUtils]: 36: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:51,566 INFO L290 TraceCheckUtils]: 37: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:51,567 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5631#true} {5735#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< 0 main_~k~0))} #54#return; {5735#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,567 INFO L290 TraceCheckUtils]: 39: Hoare triple {5735#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5757#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {5757#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} assume !false; {5757#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,568 INFO L272 TraceCheckUtils]: 41: Hoare triple {5757#(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)); {5631#true} is VALID [2022-04-27 14:38:51,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:51,568 INFO L290 TraceCheckUtils]: 43: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:51,568 INFO L290 TraceCheckUtils]: 44: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:51,568 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5631#true} {5757#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} #54#return; {5757#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,569 INFO L290 TraceCheckUtils]: 46: Hoare triple {5757#(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; {5779#(and (= (+ main_~c~0 (- 4)) 1) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,569 INFO L290 TraceCheckUtils]: 47: Hoare triple {5779#(and (= (+ main_~c~0 (- 4)) 1) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {5779#(and (= (+ main_~c~0 (- 4)) 1) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,569 INFO L272 TraceCheckUtils]: 48: Hoare triple {5779#(and (= (+ main_~c~0 (- 4)) 1) (= 5 main_~y~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:38:51,569 INFO L290 TraceCheckUtils]: 49: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:51,569 INFO L290 TraceCheckUtils]: 50: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:51,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:51,570 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5631#true} {5779#(and (= (+ main_~c~0 (- 4)) 1) (= 5 main_~y~0) (< 0 main_~k~0))} #54#return; {5779#(and (= (+ main_~c~0 (- 4)) 1) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,570 INFO L290 TraceCheckUtils]: 53: Hoare triple {5779#(and (= (+ main_~c~0 (- 4)) 1) (= 5 main_~y~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5801#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {5801#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !false; {5801#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,570 INFO L272 TraceCheckUtils]: 55: Hoare triple {5801#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:38:51,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:51,570 INFO L290 TraceCheckUtils]: 57: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:51,571 INFO L290 TraceCheckUtils]: 58: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:51,571 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5631#true} {5801#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} #54#return; {5801#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,571 INFO L290 TraceCheckUtils]: 60: Hoare triple {5801#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5823#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,572 INFO L290 TraceCheckUtils]: 61: Hoare triple {5823#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} assume !false; {5823#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,572 INFO L272 TraceCheckUtils]: 62: Hoare triple {5823#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:38:51,572 INFO L290 TraceCheckUtils]: 63: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:51,572 INFO L290 TraceCheckUtils]: 64: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:51,572 INFO L290 TraceCheckUtils]: 65: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:51,572 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5631#true} {5823#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} #54#return; {5823#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,573 INFO L290 TraceCheckUtils]: 67: Hoare triple {5823#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5845#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,573 INFO L290 TraceCheckUtils]: 68: Hoare triple {5845#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {5845#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,573 INFO L272 TraceCheckUtils]: 69: Hoare triple {5845#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:38:51,573 INFO L290 TraceCheckUtils]: 70: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:51,573 INFO L290 TraceCheckUtils]: 71: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:51,573 INFO L290 TraceCheckUtils]: 72: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:51,574 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5631#true} {5845#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} #54#return; {5845#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,574 INFO L290 TraceCheckUtils]: 74: Hoare triple {5845#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5867#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,575 INFO L290 TraceCheckUtils]: 75: Hoare triple {5867#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {5867#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,575 INFO L272 TraceCheckUtils]: 76: Hoare triple {5867#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:38:51,575 INFO L290 TraceCheckUtils]: 77: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:51,575 INFO L290 TraceCheckUtils]: 78: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:51,575 INFO L290 TraceCheckUtils]: 79: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:51,575 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5631#true} {5867#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} #54#return; {5867#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,576 INFO L290 TraceCheckUtils]: 81: Hoare triple {5867#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5889#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,576 INFO L290 TraceCheckUtils]: 82: Hoare triple {5889#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} assume !false; {5889#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,576 INFO L272 TraceCheckUtils]: 83: Hoare triple {5889#(and (= main_~y~0 10) (= (+ (- 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)); {5631#true} is VALID [2022-04-27 14:38:51,576 INFO L290 TraceCheckUtils]: 84: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:51,576 INFO L290 TraceCheckUtils]: 85: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:51,576 INFO L290 TraceCheckUtils]: 86: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:51,577 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {5631#true} {5889#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} #54#return; {5889#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:51,577 INFO L290 TraceCheckUtils]: 88: Hoare triple {5889#(and (= main_~y~0 10) (= (+ (- 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; {5911#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:38:51,577 INFO L290 TraceCheckUtils]: 89: Hoare triple {5911#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !false; {5911#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:38:51,577 INFO L272 TraceCheckUtils]: 90: Hoare triple {5911#(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)); {5631#true} is VALID [2022-04-27 14:38:51,578 INFO L290 TraceCheckUtils]: 91: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:51,578 INFO L290 TraceCheckUtils]: 92: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:51,578 INFO L290 TraceCheckUtils]: 93: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:51,578 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {5631#true} {5911#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} #54#return; {5911#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:38:51,579 INFO L290 TraceCheckUtils]: 95: Hoare triple {5911#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !(~c~0 < ~k~0); {5933#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} is VALID [2022-04-27 14:38:51,579 INFO L272 TraceCheckUtils]: 96: Hoare triple {5933#(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)); {5937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:51,580 INFO L290 TraceCheckUtils]: 97: Hoare triple {5937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:51,580 INFO L290 TraceCheckUtils]: 98: Hoare triple {5941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5632#false} is VALID [2022-04-27 14:38:51,580 INFO L290 TraceCheckUtils]: 99: Hoare triple {5632#false} assume !false; {5632#false} is VALID [2022-04-27 14:38:51,580 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-27 14:38:51,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:52,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:52,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418332045] [2022-04-27 14:38:52,604 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:52,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382269490] [2022-04-27 14:38:52,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382269490] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:52,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:52,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-27 14:38:52,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148967536] [2022-04-27 14:38:52,604 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:52,604 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-27 14:38:52,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:52,605 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-27 14:38:52,652 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-27 14:38:52,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 14:38:52,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:52,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 14:38:52,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2022-04-27 14:38:52,653 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-27 14:38:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:54,069 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-27 14:38:54,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 14:38:54,070 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-27 14:38:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:54,070 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-27 14:38:54,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-27 14:38:54,071 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-27 14:38:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-27 14:38:54,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 76 transitions. [2022-04-27 14:38:54,140 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-27 14:38:54,141 INFO L225 Difference]: With dead ends: 69 [2022-04-27 14:38:54,141 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 14:38:54,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2022-04-27 14:38:54,142 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:54,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 475 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 14:38:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 14:38:54,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-27 14:38:54,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:54,206 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-27 14:38:54,206 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-27 14:38:54,206 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-27 14:38:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:54,208 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-27 14:38:54,208 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-27 14:38:54,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:54,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:54,208 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-27 14:38:54,208 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-27 14:38:54,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:54,210 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-27 14:38:54,210 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-27 14:38:54,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:54,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:54,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:54,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:54,210 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-27 14:38:54,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-04-27 14:38:54,212 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 100 [2022-04-27 14:38:54,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:54,212 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-04-27 14:38:54,212 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-27 14:38:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-27 14:38:54,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-27 14:38:54,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:54,213 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-27 14:38:54,227 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-27 14:38:54,419 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-27 14:38:54,419 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:54,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:54,420 INFO L85 PathProgramCache]: Analyzing trace with hash 893158889, now seen corresponding path program 12 times [2022-04-27 14:38:54,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:54,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012126805] [2022-04-27 14:38:54,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:54,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:54,438 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:54,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [924812412] [2022-04-27 14:38:54,439 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:38:54,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:54,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:54,440 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-27 14:38:54,441 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-27 14:38:54,768 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-27 14:38:54,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:54,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-27 14:38:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:54,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:55,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {6548#true} call ULTIMATE.init(); {6548#true} is VALID [2022-04-27 14:38:55,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {6548#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); {6548#true} is VALID [2022-04-27 14:38:55,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:55,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6548#true} {6548#true} #60#return; {6548#true} is VALID [2022-04-27 14:38:55,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {6548#true} call #t~ret5 := main(); {6548#true} is VALID [2022-04-27 14:38:55,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {6548#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; {6548#true} is VALID [2022-04-27 14:38:55,552 INFO L272 TraceCheckUtils]: 6: Hoare triple {6548#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:38:55,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:55,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:55,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:55,552 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6548#true} {6548#true} #52#return; {6548#true} is VALID [2022-04-27 14:38:55,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {6548#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6586#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:55,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {6586#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6586#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:55,553 INFO L272 TraceCheckUtils]: 13: Hoare triple {6586#(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)); {6548#true} is VALID [2022-04-27 14:38:55,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:55,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:55,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:55,554 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6548#true} {6586#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {6586#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:55,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {6586#(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; {6608#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:55,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {6608#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {6608#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:55,554 INFO L272 TraceCheckUtils]: 20: Hoare triple {6608#(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)); {6548#true} is VALID [2022-04-27 14:38:55,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:55,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:55,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:55,555 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6548#true} {6608#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {6608#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:55,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {6608#(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; {6630#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:38:55,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {6630#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {6630#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:38:55,555 INFO L272 TraceCheckUtils]: 27: Hoare triple {6630#(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)); {6548#true} is VALID [2022-04-27 14:38:55,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:55,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:55,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:55,556 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6548#true} {6630#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {6630#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:38:55,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {6630#(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; {6652#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:38:55,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {6652#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {6652#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:38:55,556 INFO L272 TraceCheckUtils]: 34: Hoare triple {6652#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:38:55,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:55,556 INFO L290 TraceCheckUtils]: 36: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:55,556 INFO L290 TraceCheckUtils]: 37: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:55,557 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6548#true} {6652#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {6652#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:38:55,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {6652#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6674#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:55,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {6674#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {6674#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:55,557 INFO L272 TraceCheckUtils]: 41: Hoare triple {6674#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:38:55,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:55,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:55,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:55,558 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6548#true} {6674#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #54#return; {6674#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:55,558 INFO L290 TraceCheckUtils]: 46: Hoare triple {6674#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6696#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:55,558 INFO L290 TraceCheckUtils]: 47: Hoare triple {6696#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {6696#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:55,558 INFO L272 TraceCheckUtils]: 48: Hoare triple {6696#(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)); {6548#true} is VALID [2022-04-27 14:38:55,558 INFO L290 TraceCheckUtils]: 49: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:55,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:55,559 INFO L290 TraceCheckUtils]: 51: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:55,559 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6548#true} {6696#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #54#return; {6696#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:38:55,559 INFO L290 TraceCheckUtils]: 53: Hoare triple {6696#(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; {6718#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:55,559 INFO L290 TraceCheckUtils]: 54: Hoare triple {6718#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !false; {6718#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:55,559 INFO L272 TraceCheckUtils]: 55: Hoare triple {6718#(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)); {6548#true} is VALID [2022-04-27 14:38:55,560 INFO L290 TraceCheckUtils]: 56: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:55,560 INFO L290 TraceCheckUtils]: 57: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:55,560 INFO L290 TraceCheckUtils]: 58: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:55,560 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6548#true} {6718#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} #54#return; {6718#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:55,560 INFO L290 TraceCheckUtils]: 60: Hoare triple {6718#(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; {6740#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:38:55,561 INFO L290 TraceCheckUtils]: 61: Hoare triple {6740#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} assume !false; {6740#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:38:55,561 INFO L272 TraceCheckUtils]: 62: Hoare triple {6740#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 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)); {6548#true} is VALID [2022-04-27 14:38:55,561 INFO L290 TraceCheckUtils]: 63: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:55,561 INFO L290 TraceCheckUtils]: 64: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:55,561 INFO L290 TraceCheckUtils]: 65: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:55,561 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6548#true} {6740#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} #54#return; {6740#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:38:55,561 INFO L290 TraceCheckUtils]: 67: Hoare triple {6740#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 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; {6762#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)) (< 5 main_~k~0))} is VALID [2022-04-27 14:38:55,562 INFO L290 TraceCheckUtils]: 68: Hoare triple {6762#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)) (< 5 main_~k~0))} assume !false; {6762#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)) (< 5 main_~k~0))} is VALID [2022-04-27 14:38:55,562 INFO L272 TraceCheckUtils]: 69: Hoare triple {6762#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:38:55,562 INFO L290 TraceCheckUtils]: 70: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:55,562 INFO L290 TraceCheckUtils]: 71: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:55,562 INFO L290 TraceCheckUtils]: 72: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:55,562 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6548#true} {6762#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)) (< 5 main_~k~0))} #54#return; {6762#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)) (< 5 main_~k~0))} is VALID [2022-04-27 14:38:55,563 INFO L290 TraceCheckUtils]: 74: Hoare triple {6762#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)) (< 5 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6784#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-27 14:38:55,563 INFO L290 TraceCheckUtils]: 75: Hoare triple {6784#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} assume !false; {6784#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-27 14:38:55,563 INFO L272 TraceCheckUtils]: 76: Hoare triple {6784#(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)); {6548#true} is VALID [2022-04-27 14:38:55,563 INFO L290 TraceCheckUtils]: 77: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:55,563 INFO L290 TraceCheckUtils]: 78: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:55,563 INFO L290 TraceCheckUtils]: 79: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:55,563 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6548#true} {6784#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} #54#return; {6784#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-27 14:38:55,564 INFO L290 TraceCheckUtils]: 81: Hoare triple {6784#(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; {6806#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-27 14:38:55,564 INFO L290 TraceCheckUtils]: 82: Hoare triple {6806#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} assume !false; {6806#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-27 14:38:55,564 INFO L272 TraceCheckUtils]: 83: Hoare triple {6806#(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)); {6548#true} is VALID [2022-04-27 14:38:55,564 INFO L290 TraceCheckUtils]: 84: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:55,564 INFO L290 TraceCheckUtils]: 85: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:55,564 INFO L290 TraceCheckUtils]: 86: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:55,564 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {6548#true} {6806#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} #54#return; {6806#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-27 14:38:55,565 INFO L290 TraceCheckUtils]: 88: Hoare triple {6806#(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; {6828#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:38:55,565 INFO L290 TraceCheckUtils]: 89: Hoare triple {6828#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11))} assume !false; {6828#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:38:55,565 INFO L272 TraceCheckUtils]: 90: Hoare triple {6828#(and (= (+ (- 1) main_~c~0) 10) (< 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)); {6548#true} is VALID [2022-04-27 14:38:55,565 INFO L290 TraceCheckUtils]: 91: Hoare triple {6548#true} ~cond := #in~cond; {6838#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:55,565 INFO L290 TraceCheckUtils]: 92: Hoare triple {6838#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:38:55,565 INFO L290 TraceCheckUtils]: 93: Hoare triple {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:38:55,566 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} {6828#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11))} #54#return; {6849#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} is VALID [2022-04-27 14:38:55,567 INFO L290 TraceCheckUtils]: 95: Hoare triple {6849#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6853#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0) (< 11 main_~k~0))} is VALID [2022-04-27 14:38:55,567 INFO L290 TraceCheckUtils]: 96: Hoare triple {6853#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0) (< 11 main_~k~0))} assume !false; {6853#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0) (< 11 main_~k~0))} is VALID [2022-04-27 14:38:55,567 INFO L272 TraceCheckUtils]: 97: Hoare triple {6853#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0) (< 11 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:38:55,567 INFO L290 TraceCheckUtils]: 98: Hoare triple {6548#true} ~cond := #in~cond; {6838#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:55,568 INFO L290 TraceCheckUtils]: 99: Hoare triple {6838#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:38:55,568 INFO L290 TraceCheckUtils]: 100: Hoare triple {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:38:55,569 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} {6853#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0) (< 11 main_~k~0))} #54#return; {6872#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:38:55,569 INFO L290 TraceCheckUtils]: 102: Hoare triple {6872#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {6876#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-27 14:38:55,569 INFO L272 TraceCheckUtils]: 103: Hoare triple {6876#(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)); {6880#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:55,570 INFO L290 TraceCheckUtils]: 104: Hoare triple {6880#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6884#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:55,570 INFO L290 TraceCheckUtils]: 105: Hoare triple {6884#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6549#false} is VALID [2022-04-27 14:38:55,570 INFO L290 TraceCheckUtils]: 106: Hoare triple {6549#false} assume !false; {6549#false} is VALID [2022-04-27 14:38:55,570 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 90 proven. 236 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-04-27 14:38:55,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:55,252 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 c_main_~y~0))) (or (= (+ (* 2 c_main_~y~0) (* .cse0 .cse0) 5) (+ c_main_~k~0 (* .cse0 c_main_~k~0))) (<= c_main_~k~0 (+ 2 c_main_~c~0)) (not (= (mod (+ (* (- 6) .cse0 .cse0 .cse0) (* (- 13) .cse0 .cse0) (* (- 1) .cse0 .cse0 .cse0 .cse0)) 4) 0)) (< (+ 3 c_main_~c~0) c_main_~k~0))) is different from false [2022-04-27 14:40:48,725 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 5 c_main_~y~0))) (or (< (+ 6 c_main_~c~0) c_main_~k~0) (= (+ (* .cse0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) (* .cse0 .cse0) 11)) (not (= (mod (+ (* .cse0 .cse0 .cse0 (- 6)) (* (- 1) .cse0 .cse0 .cse0 .cse0) (* (- 13) .cse0 .cse0)) 4) 0)) (<= c_main_~k~0 (+ 5 c_main_~c~0)))) is different from false [2022-04-27 14:40:56,830 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (<= main_~k~0 (+ 6 c_main_~c~0)) (< (+ 7 c_main_~c~0) main_~k~0) (= (+ (* 7 main_~k~0) (* main_~k~0 c_main_~y~0)) (+ (* 14 c_main_~y~0) 49 (* c_main_~y~0 c_main_~y~0))))) (not (= (mod (let ((.cse0 (+ 6 c_main_~y~0))) (+ (* (- 1) .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6)) (* (- 13) .cse0 .cse0))) 4) 0))) is different from false [2022-04-27 14:40:58,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:40:58,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012126805] [2022-04-27 14:40:58,897 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:40:58,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924812412] [2022-04-27 14:40:58,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924812412] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:40:58,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:40:58,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-27 14:40:58,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418066979] [2022-04-27 14:40:58,897 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:40:58,898 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 107 [2022-04-27 14:40:58,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:40:58,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:40:58,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:40:58,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 14:40:58,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:40:58,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 14:40:58,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=785, Unknown=5, NotChecked=180, Total=1122 [2022-04-27 14:40:58,955 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:41:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:01,058 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-27 14:41:01,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 14:41:01,058 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 107 [2022-04-27 14:41:01,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:41:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:41:01,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-27 14:41:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:41:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-27 14:41:01,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 80 transitions. [2022-04-27 14:41:01,125 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-27 14:41:01,126 INFO L225 Difference]: With dead ends: 72 [2022-04-27 14:41:01,126 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 14:41:01,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 68.2s TimeCoverageRelationStatistics Valid=173, Invalid=956, Unknown=5, NotChecked=198, Total=1332 [2022-04-27 14:41:01,127 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:41:01,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 489 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 14:41:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 14:41:01,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-27 14:41:01,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:41:01,169 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-27 14:41:01,169 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-27 14:41:01,169 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-27 14:41:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:01,170 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-27 14:41:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-27 14:41:01,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:41:01,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:41:01,171 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-27 14:41:01,171 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-27 14:41:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:01,172 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-27 14:41:01,172 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-27 14:41:01,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:41:01,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:41:01,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:41:01,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:41:01,172 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-27 14:41:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-04-27 14:41:01,173 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 107 [2022-04-27 14:41:01,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:41:01,174 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-04-27 14:41:01,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:41:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-27 14:41:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-27 14:41:01,174 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:41:01,175 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-27 14:41:01,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-27 14:41:01,379 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-27 14:41:01,379 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:41:01,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:41:01,380 INFO L85 PathProgramCache]: Analyzing trace with hash 363946760, now seen corresponding path program 13 times [2022-04-27 14:41:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:41:01,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773325418] [2022-04-27 14:41:01,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:41:01,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:41:01,391 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:41:01,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1250482629] [2022-04-27 14:41:01,391 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:41:01,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:41:01,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:41:01,392 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-27 14:41:01,393 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-27 14:41:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:41:02,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-27 14:41:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:41:02,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:41:03,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {7424#true} call ULTIMATE.init(); {7424#true} is VALID [2022-04-27 14:41:03,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {7424#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); {7424#true} is VALID [2022-04-27 14:41:03,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:41:03,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7424#true} {7424#true} #60#return; {7424#true} is VALID [2022-04-27 14:41:03,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {7424#true} call #t~ret5 := main(); {7424#true} is VALID [2022-04-27 14:41:03,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {7424#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; {7424#true} is VALID [2022-04-27 14:41:03,035 INFO L272 TraceCheckUtils]: 6: Hoare triple {7424#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:41:03,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:41:03,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:41:03,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:41:03,035 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7424#true} {7424#true} #52#return; {7424#true} is VALID [2022-04-27 14:41:03,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {7424#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7462#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:03,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {7462#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7462#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:03,036 INFO L272 TraceCheckUtils]: 13: Hoare triple {7462#(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)); {7424#true} is VALID [2022-04-27 14:41:03,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:41:03,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:41:03,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:41:03,036 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7424#true} {7462#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {7462#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:03,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {7462#(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; {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:41:03,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:41:03,037 INFO L272 TraceCheckUtils]: 20: Hoare triple {7484#(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)); {7424#true} is VALID [2022-04-27 14:41:03,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:41:03,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:41:03,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:41:03,037 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7424#true} {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:41:03,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {7484#(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; {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:41:03,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:41:03,038 INFO L272 TraceCheckUtils]: 27: Hoare triple {7506#(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)); {7424#true} is VALID [2022-04-27 14:41:03,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:41:03,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:41:03,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:41:03,038 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7424#true} {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:41:03,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {7506#(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; {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:41:03,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:41:03,039 INFO L272 TraceCheckUtils]: 34: Hoare triple {7528#(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)); {7424#true} is VALID [2022-04-27 14:41:03,039 INFO L290 TraceCheckUtils]: 35: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:41:03,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:41:03,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:41:03,039 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7424#true} {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #54#return; {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:41:03,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {7528#(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; {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:41:03,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:41:03,040 INFO L272 TraceCheckUtils]: 41: Hoare triple {7550#(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)); {7424#true} is VALID [2022-04-27 14:41:03,040 INFO L290 TraceCheckUtils]: 42: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:41:03,040 INFO L290 TraceCheckUtils]: 43: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:41:03,040 INFO L290 TraceCheckUtils]: 44: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:41:03,040 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7424#true} {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:41:03,040 INFO L290 TraceCheckUtils]: 46: Hoare triple {7550#(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; {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:41:03,041 INFO L290 TraceCheckUtils]: 47: Hoare triple {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:41:03,041 INFO L272 TraceCheckUtils]: 48: Hoare triple {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:41:03,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:41:03,041 INFO L290 TraceCheckUtils]: 50: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:41:03,041 INFO L290 TraceCheckUtils]: 51: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:41:03,042 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7424#true} {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #54#return; {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:41:03,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:41:03,042 INFO L290 TraceCheckUtils]: 54: Hoare triple {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !false; {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:41:03,042 INFO L272 TraceCheckUtils]: 55: Hoare triple {7594#(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)); {7424#true} is VALID [2022-04-27 14:41:03,042 INFO L290 TraceCheckUtils]: 56: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:41:03,042 INFO L290 TraceCheckUtils]: 57: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:41:03,042 INFO L290 TraceCheckUtils]: 58: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:41:03,043 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7424#true} {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #54#return; {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:41:03,043 INFO L290 TraceCheckUtils]: 60: Hoare triple {7594#(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; {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:41:03,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:41:03,043 INFO L272 TraceCheckUtils]: 62: Hoare triple {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:41:03,043 INFO L290 TraceCheckUtils]: 63: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:41:03,043 INFO L290 TraceCheckUtils]: 64: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:41:03,043 INFO L290 TraceCheckUtils]: 65: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:41:03,044 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7424#true} {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:41:03,044 INFO L290 TraceCheckUtils]: 67: Hoare triple {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:41:03,044 INFO L290 TraceCheckUtils]: 68: Hoare triple {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:41:03,044 INFO L272 TraceCheckUtils]: 69: Hoare triple {7638#(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)); {7424#true} is VALID [2022-04-27 14:41:03,044 INFO L290 TraceCheckUtils]: 70: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:41:03,044 INFO L290 TraceCheckUtils]: 71: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:41:03,044 INFO L290 TraceCheckUtils]: 72: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:41:03,045 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7424#true} {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:41:03,045 INFO L290 TraceCheckUtils]: 74: Hoare triple {7638#(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; {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:41:03,045 INFO L290 TraceCheckUtils]: 75: Hoare triple {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:41:03,045 INFO L272 TraceCheckUtils]: 76: Hoare triple {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:41:03,045 INFO L290 TraceCheckUtils]: 77: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:41:03,045 INFO L290 TraceCheckUtils]: 78: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:41:03,045 INFO L290 TraceCheckUtils]: 79: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:41:03,046 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7424#true} {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #54#return; {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:41:03,046 INFO L290 TraceCheckUtils]: 81: Hoare triple {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7682#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:41:03,046 INFO L290 TraceCheckUtils]: 82: Hoare triple {7682#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {7682#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:41:03,046 INFO L272 TraceCheckUtils]: 83: Hoare triple {7682#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:41:03,046 INFO L290 TraceCheckUtils]: 84: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:41:03,046 INFO L290 TraceCheckUtils]: 85: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:41:03,046 INFO L290 TraceCheckUtils]: 86: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:41:03,047 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {7424#true} {7682#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {7682#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:41:03,047 INFO L290 TraceCheckUtils]: 88: Hoare triple {7682#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7704#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:41:03,047 INFO L290 TraceCheckUtils]: 89: Hoare triple {7704#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {7704#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:41:03,047 INFO L272 TraceCheckUtils]: 90: Hoare triple {7704#(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)); {7424#true} is VALID [2022-04-27 14:41:03,047 INFO L290 TraceCheckUtils]: 91: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:41:03,047 INFO L290 TraceCheckUtils]: 92: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:41:03,047 INFO L290 TraceCheckUtils]: 93: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:41:03,047 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7424#true} {7704#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {7704#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:41:03,048 INFO L290 TraceCheckUtils]: 95: Hoare triple {7704#(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; {7726#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:41:03,048 INFO L290 TraceCheckUtils]: 96: Hoare triple {7726#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {7726#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:41:03,048 INFO L272 TraceCheckUtils]: 97: Hoare triple {7726#(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)); {7424#true} is VALID [2022-04-27 14:41:03,048 INFO L290 TraceCheckUtils]: 98: Hoare triple {7424#true} ~cond := #in~cond; {7736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:41:03,049 INFO L290 TraceCheckUtils]: 99: Hoare triple {7736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:41:03,049 INFO L290 TraceCheckUtils]: 100: Hoare triple {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:41:03,049 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} {7726#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {7747#(and (= main_~y~0 12) (= main_~c~0 12) (= (+ (* 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-27 14:41:03,052 INFO L290 TraceCheckUtils]: 102: Hoare triple {7747#(and (= main_~y~0 12) (= main_~c~0 12) (= (+ (* 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; {7751#(and (< 12 main_~k~0) (<= main_~c~0 13) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (= main_~y~0 13))} is VALID [2022-04-27 14:41:03,052 INFO L290 TraceCheckUtils]: 103: Hoare triple {7751#(and (< 12 main_~k~0) (<= main_~c~0 13) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (= main_~y~0 13))} assume !false; {7751#(and (< 12 main_~k~0) (<= main_~c~0 13) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (= main_~y~0 13))} is VALID [2022-04-27 14:41:03,052 INFO L272 TraceCheckUtils]: 104: Hoare triple {7751#(and (< 12 main_~k~0) (<= main_~c~0 13) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (= 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)); {7424#true} is VALID [2022-04-27 14:41:03,053 INFO L290 TraceCheckUtils]: 105: Hoare triple {7424#true} ~cond := #in~cond; {7736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:41:03,055 INFO L290 TraceCheckUtils]: 106: Hoare triple {7736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:41:03,056 INFO L290 TraceCheckUtils]: 107: Hoare triple {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:41:03,056 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} {7751#(and (< 12 main_~k~0) (<= main_~c~0 13) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (= main_~y~0 13))} #54#return; {7770#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:41:03,057 INFO L290 TraceCheckUtils]: 109: Hoare triple {7770#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !(~c~0 < ~k~0); {7774#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:41:03,057 INFO L272 TraceCheckUtils]: 110: Hoare triple {7774#(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)); {7778#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:41:03,057 INFO L290 TraceCheckUtils]: 111: Hoare triple {7778#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7782#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:41:03,058 INFO L290 TraceCheckUtils]: 112: Hoare triple {7782#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7425#false} is VALID [2022-04-27 14:41:03,058 INFO L290 TraceCheckUtils]: 113: Hoare triple {7425#false} assume !false; {7425#false} is VALID [2022-04-27 14:41:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 98 proven. 275 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2022-04-27 14:41:03,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:41:48,936 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= (mod (+ (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 13) c_main_~y~0 c_main_~y~0) (* (- 1) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) is different from false [2022-04-27 14:41:48,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:41:48,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773325418] [2022-04-27 14:41:48,939 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:41:48,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250482629] [2022-04-27 14:41:48,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250482629] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:41:48,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:41:48,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-27 14:41:48,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662280680] [2022-04-27 14:41:48,939 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:41:48,939 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 16 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 114 [2022-04-27 14:41:48,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:41:48,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 16 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 14:41:49,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:41:49,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 14:41:49,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:41:49,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 14:41:49,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=666, Unknown=6, NotChecked=52, Total=812 [2022-04-27 14:41:49,001 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 16 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 14:41:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:51,495 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-04-27 14:41:51,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:41:51,496 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 16 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 114 [2022-04-27 14:41:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:41:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 16 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 14:41:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 84 transitions. [2022-04-27 14:41:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 16 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 14:41:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 84 transitions. [2022-04-27 14:41:51,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 84 transitions. [2022-04-27 14:41:51,574 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-27 14:41:51,575 INFO L225 Difference]: With dead ends: 75 [2022-04-27 14:41:51,575 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 14:41:51,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=109, Invalid=819, Unknown=6, NotChecked=58, Total=992 [2022-04-27 14:41:51,576 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:41:51,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 594 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 14:41:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 14:41:51,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-27 14:41:51,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:41:51,623 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-27 14:41:51,623 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-27 14:41:51,623 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-27 14:41:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:51,625 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-27 14:41:51,625 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 14:41:51,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:41:51,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:41:51,625 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-27 14:41:51,625 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-27 14:41:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:51,627 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-27 14:41:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 14:41:51,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:41:51,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:41:51,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:41:51,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:41:51,628 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-27 14:41:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-04-27 14:41:51,629 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 114 [2022-04-27 14:41:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:41:51,629 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-04-27 14:41:51,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 16 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 14:41:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 14:41:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-27 14:41:51,631 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:41:51,631 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-27 14:41:51,637 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-27 14:41:51,837 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-27 14:41:51,838 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:41:51,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:41:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2101455607, now seen corresponding path program 14 times [2022-04-27 14:41:51,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:41:51,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873426820] [2022-04-27 14:41:51,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:41:51,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:41:51,851 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:41:51,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2018603963] [2022-04-27 14:41:51,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:41:51,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:41:51,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:41:51,853 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-27 14:41:51,854 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-27 14:41:52,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:41:52,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:41:52,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-27 14:41:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:41:52,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:41:53,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {8206#true} call ULTIMATE.init(); {8206#true} is VALID [2022-04-27 14:41:53,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {8206#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); {8206#true} is VALID [2022-04-27 14:41:53,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8206#true} {8206#true} #60#return; {8206#true} is VALID [2022-04-27 14:41:53,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {8206#true} call #t~ret5 := main(); {8206#true} is VALID [2022-04-27 14:41:53,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {8206#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; {8206#true} is VALID [2022-04-27 14:41:53,235 INFO L272 TraceCheckUtils]: 6: Hoare triple {8206#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:41:53,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:41:53,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:41:53,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,243 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8206#true} {8206#true} #52#return; {8206#true} is VALID [2022-04-27 14:41:53,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {8206#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8244#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:53,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {8244#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {8244#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:53,244 INFO L272 TraceCheckUtils]: 13: Hoare triple {8244#(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)); {8206#true} is VALID [2022-04-27 14:41:53,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:41:53,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:41:53,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,244 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8206#true} {8244#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {8244#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:53,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {8244#(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; {8266#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:41:53,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {8266#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {8266#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:41:53,245 INFO L272 TraceCheckUtils]: 20: Hoare triple {8266#(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)); {8206#true} is VALID [2022-04-27 14:41:53,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:41:53,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:41:53,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,245 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8206#true} {8266#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {8266#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:41:53,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {8266#(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; {8288#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:41:53,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {8288#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {8288#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:41:53,246 INFO L272 TraceCheckUtils]: 27: Hoare triple {8288#(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)); {8206#true} is VALID [2022-04-27 14:41:53,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:41:53,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:41:53,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,247 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8206#true} {8288#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {8288#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:41:53,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {8288#(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; {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:41:53,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:41:53,247 INFO L272 TraceCheckUtils]: 34: Hoare triple {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:41:53,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:41:53,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:41:53,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,248 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8206#true} {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:41:53,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:41:53,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:41:53,248 INFO L272 TraceCheckUtils]: 41: Hoare triple {8332#(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)); {8206#true} is VALID [2022-04-27 14:41:53,248 INFO L290 TraceCheckUtils]: 42: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:41:53,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:41:53,249 INFO L290 TraceCheckUtils]: 44: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,249 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8206#true} {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:41:53,249 INFO L290 TraceCheckUtils]: 46: Hoare triple {8332#(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; {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:41:53,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:41:53,250 INFO L272 TraceCheckUtils]: 48: Hoare triple {8354#(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)); {8206#true} is VALID [2022-04-27 14:41:53,250 INFO L290 TraceCheckUtils]: 49: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:41:53,250 INFO L290 TraceCheckUtils]: 50: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:41:53,250 INFO L290 TraceCheckUtils]: 51: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,250 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8206#true} {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:41:53,250 INFO L290 TraceCheckUtils]: 53: Hoare triple {8354#(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; {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:41:53,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:41:53,251 INFO L272 TraceCheckUtils]: 55: Hoare triple {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:41:53,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:41:53,251 INFO L290 TraceCheckUtils]: 57: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:41:53,251 INFO L290 TraceCheckUtils]: 58: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,251 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8206#true} {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #54#return; {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:41:53,252 INFO L290 TraceCheckUtils]: 60: Hoare triple {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-27 14:41:53,252 INFO L290 TraceCheckUtils]: 61: Hoare triple {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-27 14:41:53,252 INFO L272 TraceCheckUtils]: 62: Hoare triple {8398#(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)); {8206#true} is VALID [2022-04-27 14:41:53,252 INFO L290 TraceCheckUtils]: 63: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:41:53,252 INFO L290 TraceCheckUtils]: 64: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:41:53,252 INFO L290 TraceCheckUtils]: 65: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,252 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8206#true} {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #54#return; {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-27 14:41:53,253 INFO L290 TraceCheckUtils]: 67: Hoare triple {8398#(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; {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:41:53,265 INFO L290 TraceCheckUtils]: 68: Hoare triple {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !false; {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:41:53,265 INFO L272 TraceCheckUtils]: 69: Hoare triple {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:41:53,265 INFO L290 TraceCheckUtils]: 70: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:41:53,266 INFO L290 TraceCheckUtils]: 71: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:41:53,266 INFO L290 TraceCheckUtils]: 72: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,267 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8206#true} {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} #54#return; {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:41:53,268 INFO L290 TraceCheckUtils]: 74: Hoare triple {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:41:53,268 INFO L290 TraceCheckUtils]: 75: Hoare triple {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:41:53,268 INFO L272 TraceCheckUtils]: 76: Hoare triple {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:41:53,268 INFO L290 TraceCheckUtils]: 77: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:41:53,268 INFO L290 TraceCheckUtils]: 78: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:41:53,268 INFO L290 TraceCheckUtils]: 79: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,269 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {8206#true} {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #54#return; {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:41:53,269 INFO L290 TraceCheckUtils]: 81: Hoare triple {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:41:53,270 INFO L290 TraceCheckUtils]: 82: Hoare triple {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:41:53,270 INFO L272 TraceCheckUtils]: 83: Hoare triple {8464#(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)); {8206#true} is VALID [2022-04-27 14:41:53,270 INFO L290 TraceCheckUtils]: 84: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:41:53,270 INFO L290 TraceCheckUtils]: 85: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:41:53,270 INFO L290 TraceCheckUtils]: 86: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,271 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {8206#true} {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:41:53,271 INFO L290 TraceCheckUtils]: 88: Hoare triple {8464#(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; {8486#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:41:53,271 INFO L290 TraceCheckUtils]: 89: Hoare triple {8486#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {8486#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:41:53,272 INFO L272 TraceCheckUtils]: 90: Hoare triple {8486#(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)); {8206#true} is VALID [2022-04-27 14:41:53,272 INFO L290 TraceCheckUtils]: 91: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:41:53,272 INFO L290 TraceCheckUtils]: 92: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:41:53,272 INFO L290 TraceCheckUtils]: 93: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,272 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8206#true} {8486#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {8486#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:41:53,273 INFO L290 TraceCheckUtils]: 95: Hoare triple {8486#(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; {8508#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:41:53,273 INFO L290 TraceCheckUtils]: 96: Hoare triple {8508#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {8508#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:41:53,273 INFO L272 TraceCheckUtils]: 97: Hoare triple {8508#(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)); {8206#true} is VALID [2022-04-27 14:41:53,273 INFO L290 TraceCheckUtils]: 98: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:41:53,273 INFO L290 TraceCheckUtils]: 99: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:41:53,273 INFO L290 TraceCheckUtils]: 100: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,274 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {8206#true} {8508#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {8508#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:41:53,274 INFO L290 TraceCheckUtils]: 102: Hoare triple {8508#(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; {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:41:53,275 INFO L290 TraceCheckUtils]: 103: Hoare triple {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !false; {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:41:53,275 INFO L272 TraceCheckUtils]: 104: Hoare triple {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:41:53,275 INFO L290 TraceCheckUtils]: 105: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:41:53,275 INFO L290 TraceCheckUtils]: 106: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:41:53,275 INFO L290 TraceCheckUtils]: 107: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,276 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {8206#true} {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} #54#return; {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:41:53,276 INFO L290 TraceCheckUtils]: 109: Hoare triple {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-27 14:41:53,277 INFO L290 TraceCheckUtils]: 110: Hoare triple {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !false; {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-27 14:41:53,277 INFO L272 TraceCheckUtils]: 111: Hoare triple {8552#(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)); {8206#true} is VALID [2022-04-27 14:41:53,277 INFO L290 TraceCheckUtils]: 112: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:41:53,277 INFO L290 TraceCheckUtils]: 113: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:41:53,277 INFO L290 TraceCheckUtils]: 114: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:41:53,277 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {8206#true} {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} #54#return; {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-27 14:41:53,279 INFO L290 TraceCheckUtils]: 116: Hoare triple {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {8574#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-27 14:41:53,279 INFO L272 TraceCheckUtils]: 117: Hoare triple {8574#(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)); {8578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:41:53,280 INFO L290 TraceCheckUtils]: 118: Hoare triple {8578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:41:53,280 INFO L290 TraceCheckUtils]: 119: Hoare triple {8582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8207#false} is VALID [2022-04-27 14:41:53,280 INFO L290 TraceCheckUtils]: 120: Hoare triple {8207#false} assume !false; {8207#false} is VALID [2022-04-27 14:41:53,281 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-27 14:41:53,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:41:53,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:41:53,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873426820] [2022-04-27 14:41:53,594 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:41:53,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018603963] [2022-04-27 14:41:53,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018603963] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:41:53,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:41:53,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-27 14:41:53,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791429191] [2022-04-27 14:41:53,595 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:41:53,595 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-27 14:41:53,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:41:53,595 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-27 14:41:53,666 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-27 14:41:53,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 14:41:53,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:41:53,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 14:41:53,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:41:53,668 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-27 14:41:55,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:55,822 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2022-04-27 14:41:55,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 14:41:55,823 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-27 14:41:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:41:55,825 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-27 14:41:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-27 14:41:55,827 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-27 14:41:55,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-27 14:41:55,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 88 transitions. [2022-04-27 14:41:55,967 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-27 14:41:55,968 INFO L225 Difference]: With dead ends: 78 [2022-04-27 14:41:55,968 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 14:41:55,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-27 14:41:55,969 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:41:55,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 635 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 14:41:55,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 14:41:56,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-27 14:41:56,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:41:56,011 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-27 14:41:56,011 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-27 14:41:56,012 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-27 14:41:56,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:56,014 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-27 14:41:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-27 14:41:56,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:41:56,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:41:56,017 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-27 14:41:56,017 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-27 14:41:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:56,019 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-27 14:41:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-27 14:41:56,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:41:56,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:41:56,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:41:56,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:41:56,019 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-27 14:41:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2022-04-27 14:41:56,040 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 121 [2022-04-27 14:41:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:41:56,041 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2022-04-27 14:41:56,041 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-27 14:41:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-27 14:41:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-27 14:41:56,042 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:41:56,042 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-27 14:41:56,064 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-27 14:41:56,248 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-27 14:41:56,248 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:41:56,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:41:56,248 INFO L85 PathProgramCache]: Analyzing trace with hash -729919512, now seen corresponding path program 15 times [2022-04-27 14:41:56,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:41:56,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900045270] [2022-04-27 14:41:56,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:41:56,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:41:56,261 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:41:56,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1920545640] [2022-04-27 14:41:56,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:41:56,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:41:56,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:41:56,264 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-27 14:41:56,265 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-27 14:41:56,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-04-27 14:41:56,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:41:56,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-27 14:41:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:41:56,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:41:57,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {9017#true} call ULTIMATE.init(); {9017#true} is VALID [2022-04-27 14:41:57,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {9017#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); {9017#true} is VALID [2022-04-27 14:41:57,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9017#true} {9017#true} #60#return; {9017#true} is VALID [2022-04-27 14:41:57,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {9017#true} call #t~ret5 := main(); {9017#true} is VALID [2022-04-27 14:41:57,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {9017#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; {9017#true} is VALID [2022-04-27 14:41:57,587 INFO L272 TraceCheckUtils]: 6: Hoare triple {9017#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:41:57,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,587 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9017#true} {9017#true} #52#return; {9017#true} is VALID [2022-04-27 14:41:57,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {9017#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9055#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:57,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {9055#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {9055#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:57,588 INFO L272 TraceCheckUtils]: 13: Hoare triple {9055#(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)); {9017#true} is VALID [2022-04-27 14:41:57,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,589 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9017#true} {9055#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {9055#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:57,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {9055#(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; {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:41:57,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:41:57,590 INFO L272 TraceCheckUtils]: 20: Hoare triple {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:41:57,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,590 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9017#true} {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:41:57,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !false; {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,592 INFO L272 TraceCheckUtils]: 27: Hoare triple {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:41:57,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,593 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9017#true} {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} #54#return; {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:41:57,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:41:57,594 INFO L272 TraceCheckUtils]: 34: Hoare triple {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:41:57,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,594 INFO L290 TraceCheckUtils]: 37: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,595 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9017#true} {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #54#return; {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:41:57,595 INFO L290 TraceCheckUtils]: 39: Hoare triple {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,596 INFO L290 TraceCheckUtils]: 40: Hoare triple {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,596 INFO L272 TraceCheckUtils]: 41: Hoare triple {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:41:57,596 INFO L290 TraceCheckUtils]: 42: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,596 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9017#true} {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,597 INFO L290 TraceCheckUtils]: 47: Hoare triple {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} assume !false; {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,597 INFO L272 TraceCheckUtils]: 48: Hoare triple {9165#(and (= (+ (- 2) main_~y~0) 3) (= 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)); {9017#true} is VALID [2022-04-27 14:41:57,597 INFO L290 TraceCheckUtils]: 49: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,598 INFO L290 TraceCheckUtils]: 51: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,598 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9017#true} {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} #54#return; {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {9165#(and (= (+ (- 2) main_~y~0) 3) (= 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; {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,599 INFO L290 TraceCheckUtils]: 54: Hoare triple {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !false; {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,599 INFO L272 TraceCheckUtils]: 55: Hoare triple {9187#(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)); {9017#true} is VALID [2022-04-27 14:41:57,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,599 INFO L290 TraceCheckUtils]: 57: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,599 INFO L290 TraceCheckUtils]: 58: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,600 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9017#true} {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #54#return; {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {9187#(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; {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,601 INFO L290 TraceCheckUtils]: 61: Hoare triple {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,601 INFO L272 TraceCheckUtils]: 62: Hoare triple {9209#(and (= 7 main_~y~0) (= 5 (+ (- 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)); {9017#true} is VALID [2022-04-27 14:41:57,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,601 INFO L290 TraceCheckUtils]: 65: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,602 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9017#true} {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #54#return; {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,602 INFO L290 TraceCheckUtils]: 67: Hoare triple {9209#(and (= 7 main_~y~0) (= 5 (+ (- 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; {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:41:57,603 INFO L290 TraceCheckUtils]: 68: Hoare triple {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} assume !false; {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:41:57,603 INFO L272 TraceCheckUtils]: 69: Hoare triple {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:41:57,603 INFO L290 TraceCheckUtils]: 70: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,603 INFO L290 TraceCheckUtils]: 71: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,603 INFO L290 TraceCheckUtils]: 72: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,603 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9017#true} {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} #54#return; {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:41:57,604 INFO L290 TraceCheckUtils]: 74: Hoare triple {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:41:57,604 INFO L290 TraceCheckUtils]: 75: Hoare triple {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} assume !false; {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:41:57,604 INFO L272 TraceCheckUtils]: 76: Hoare triple {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ 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)); {9017#true} is VALID [2022-04-27 14:41:57,604 INFO L290 TraceCheckUtils]: 77: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,604 INFO L290 TraceCheckUtils]: 78: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,605 INFO L290 TraceCheckUtils]: 79: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,605 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9017#true} {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} #54#return; {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:41:57,606 INFO L290 TraceCheckUtils]: 81: Hoare triple {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ 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; {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,606 INFO L290 TraceCheckUtils]: 82: Hoare triple {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} assume !false; {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,606 INFO L272 TraceCheckUtils]: 83: Hoare triple {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:41:57,606 INFO L290 TraceCheckUtils]: 84: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,606 INFO L290 TraceCheckUtils]: 85: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,606 INFO L290 TraceCheckUtils]: 86: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,607 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {9017#true} {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} #54#return; {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,607 INFO L290 TraceCheckUtils]: 88: Hoare triple {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,608 INFO L290 TraceCheckUtils]: 89: Hoare triple {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !false; {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,608 INFO L272 TraceCheckUtils]: 90: Hoare triple {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:41:57,608 INFO L290 TraceCheckUtils]: 91: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,608 INFO L290 TraceCheckUtils]: 92: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,608 INFO L290 TraceCheckUtils]: 93: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,608 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {9017#true} {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} #54#return; {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,609 INFO L290 TraceCheckUtils]: 95: Hoare triple {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-27 14:41:57,609 INFO L290 TraceCheckUtils]: 96: Hoare triple {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} assume !false; {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-27 14:41:57,610 INFO L272 TraceCheckUtils]: 97: Hoare triple {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 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)); {9017#true} is VALID [2022-04-27 14:41:57,610 INFO L290 TraceCheckUtils]: 98: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,610 INFO L290 TraceCheckUtils]: 99: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,610 INFO L290 TraceCheckUtils]: 100: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,610 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9017#true} {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} #54#return; {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-27 14:41:57,611 INFO L290 TraceCheckUtils]: 102: Hoare triple {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 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; {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 14:41:57,611 INFO L290 TraceCheckUtils]: 103: Hoare triple {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 14:41:57,611 INFO L272 TraceCheckUtils]: 104: Hoare triple {9341#(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)); {9017#true} is VALID [2022-04-27 14:41:57,611 INFO L290 TraceCheckUtils]: 105: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,611 INFO L290 TraceCheckUtils]: 106: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,611 INFO L290 TraceCheckUtils]: 107: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,612 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9017#true} {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} #54#return; {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 14:41:57,613 INFO L290 TraceCheckUtils]: 109: Hoare triple {9341#(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; {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:41:57,613 INFO L290 TraceCheckUtils]: 110: Hoare triple {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !false; {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:41:57,613 INFO L272 TraceCheckUtils]: 111: Hoare triple {9363#(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)); {9017#true} is VALID [2022-04-27 14:41:57,613 INFO L290 TraceCheckUtils]: 112: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,613 INFO L290 TraceCheckUtils]: 113: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,613 INFO L290 TraceCheckUtils]: 114: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,614 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {9017#true} {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} #54#return; {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:41:57,614 INFO L290 TraceCheckUtils]: 116: Hoare triple {9363#(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; {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:41:57,615 INFO L290 TraceCheckUtils]: 117: Hoare triple {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} assume !false; {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:41:57,615 INFO L272 TraceCheckUtils]: 118: Hoare triple {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:41:57,615 INFO L290 TraceCheckUtils]: 119: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:41:57,615 INFO L290 TraceCheckUtils]: 120: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:41:57,615 INFO L290 TraceCheckUtils]: 121: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:41:57,615 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9017#true} {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} #54#return; {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:41:57,616 INFO L290 TraceCheckUtils]: 123: Hoare triple {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} assume !(~c~0 < ~k~0); {9407#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-27 14:41:57,617 INFO L272 TraceCheckUtils]: 124: Hoare triple {9407#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9411#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:41:57,617 INFO L290 TraceCheckUtils]: 125: Hoare triple {9411#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9415#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:41:57,618 INFO L290 TraceCheckUtils]: 126: Hoare triple {9415#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9018#false} is VALID [2022-04-27 14:41:57,618 INFO L290 TraceCheckUtils]: 127: Hoare triple {9018#false} assume !false; {9018#false} is VALID [2022-04-27 14:41:57,618 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-27 14:41:57,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:41:59,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:41:59,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900045270] [2022-04-27 14:41:59,222 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:41:59,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920545640] [2022-04-27 14:41:59,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920545640] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:41:59,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:41:59,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-27 14:41:59,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140377464] [2022-04-27 14:41:59,222 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:41:59,223 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-27 14:41:59,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:41:59,223 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-27 14:41:59,291 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-27 14:41:59,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 14:41:59,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:41:59,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 14:41:59,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1101, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 14:41:59,292 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-27 14:42:01,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:01,899 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2022-04-27 14:42:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 14:42:01,900 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-27 14:42:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:01,900 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-27 14:42:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-27 14:42:01,901 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-27 14:42:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-27 14:42:01,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 92 transitions. [2022-04-27 14:42:01,981 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-27 14:42:01,982 INFO L225 Difference]: With dead ends: 81 [2022-04-27 14:42:01,982 INFO L226 Difference]: Without dead ends: 76 [2022-04-27 14:42:01,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=1245, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 14:42:01,983 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:01,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 675 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 14:42:01,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-27 14:42:02,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-27 14:42:02,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:02,032 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-27 14:42:02,033 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-27 14:42:02,033 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-27 14:42:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:02,034 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-27 14:42:02,034 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-27 14:42:02,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:02,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:02,034 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-27 14:42:02,034 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-27 14:42:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:02,036 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-27 14:42:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-27 14:42:02,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:02,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:02,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:02,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:02,036 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-27 14:42:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2022-04-27 14:42:02,037 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 128 [2022-04-27 14:42:02,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:02,038 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2022-04-27 14:42:02,038 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-27 14:42:02,038 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-27 14:42:02,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-27 14:42:02,038 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:02,038 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-27 14:42:02,044 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-27 14:42:02,244 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-27 14:42:02,245 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:02,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:02,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843369, now seen corresponding path program 16 times [2022-04-27 14:42:02,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:02,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967540772] [2022-04-27 14:42:02,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:02,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:02,257 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:02,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867992726] [2022-04-27 14:42:02,257 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:42:02,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:02,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:02,258 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-27 14:42:02,259 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-27 14:42:02,613 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:42:02,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:02,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 83 conjunts are in the unsatisfiable core [2022-04-27 14:42:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:02,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:03,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {10174#true} call ULTIMATE.init(); {10174#true} is VALID [2022-04-27 14:42:03,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {10174#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); {10174#true} is VALID [2022-04-27 14:42:03,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10174#true} {10174#true} #60#return; {10174#true} is VALID [2022-04-27 14:42:03,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {10174#true} call #t~ret5 := main(); {10174#true} is VALID [2022-04-27 14:42:03,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {10174#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; {10174#true} is VALID [2022-04-27 14:42:03,406 INFO L272 TraceCheckUtils]: 6: Hoare triple {10174#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:03,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:03,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:03,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,406 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10174#true} {10174#true} #52#return; {10174#true} is VALID [2022-04-27 14:42:03,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {10174#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10212#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:03,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {10212#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {10212#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:03,407 INFO L272 TraceCheckUtils]: 13: Hoare triple {10212#(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)); {10174#true} is VALID [2022-04-27 14:42:03,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:03,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:03,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,407 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10174#true} {10212#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {10212#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:03,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {10212#(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; {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:42:03,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:42:03,408 INFO L272 TraceCheckUtils]: 20: Hoare triple {10234#(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)); {10174#true} is VALID [2022-04-27 14:42:03,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:03,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:03,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,408 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10174#true} {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:42:03,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {10234#(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; {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:03,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:03,409 INFO L272 TraceCheckUtils]: 27: Hoare triple {10256#(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)); {10174#true} is VALID [2022-04-27 14:42:03,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:03,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:03,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,412 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10174#true} {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:03,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {10256#(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; {10278#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:03,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {10278#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {10278#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:03,412 INFO L272 TraceCheckUtils]: 34: Hoare triple {10278#(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)); {10174#true} is VALID [2022-04-27 14:42:03,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:03,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:03,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,435 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10174#true} {10278#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {10278#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:03,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {10278#(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; {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:03,436 INFO L290 TraceCheckUtils]: 40: Hoare triple {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:03,436 INFO L272 TraceCheckUtils]: 41: Hoare triple {10300#(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)); {10174#true} is VALID [2022-04-27 14:42:03,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:03,436 INFO L290 TraceCheckUtils]: 43: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:03,436 INFO L290 TraceCheckUtils]: 44: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,436 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10174#true} {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:03,437 INFO L290 TraceCheckUtils]: 46: Hoare triple {10300#(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; {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:42:03,437 INFO L290 TraceCheckUtils]: 47: Hoare triple {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:42:03,437 INFO L272 TraceCheckUtils]: 48: Hoare triple {10322#(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)); {10174#true} is VALID [2022-04-27 14:42:03,437 INFO L290 TraceCheckUtils]: 49: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:03,437 INFO L290 TraceCheckUtils]: 50: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:03,437 INFO L290 TraceCheckUtils]: 51: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,437 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10174#true} {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #54#return; {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:42:03,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {10322#(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; {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:42:03,438 INFO L290 TraceCheckUtils]: 54: Hoare triple {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} assume !false; {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:42:03,438 INFO L272 TraceCheckUtils]: 55: Hoare triple {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:03,438 INFO L290 TraceCheckUtils]: 56: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:03,438 INFO L290 TraceCheckUtils]: 57: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:03,438 INFO L290 TraceCheckUtils]: 58: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,439 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10174#true} {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} #54#return; {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:42:03,439 INFO L290 TraceCheckUtils]: 60: Hoare triple {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:42:03,439 INFO L290 TraceCheckUtils]: 61: Hoare triple {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} assume !false; {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:42:03,439 INFO L272 TraceCheckUtils]: 62: Hoare triple {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:03,439 INFO L290 TraceCheckUtils]: 63: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:03,439 INFO L290 TraceCheckUtils]: 64: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:03,439 INFO L290 TraceCheckUtils]: 65: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,440 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10174#true} {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} #54#return; {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:42:03,440 INFO L290 TraceCheckUtils]: 67: Hoare triple {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10388#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:42:03,440 INFO L290 TraceCheckUtils]: 68: Hoare triple {10388#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {10388#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:42:03,440 INFO L272 TraceCheckUtils]: 69: Hoare triple {10388#(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)); {10174#true} is VALID [2022-04-27 14:42:03,440 INFO L290 TraceCheckUtils]: 70: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:03,440 INFO L290 TraceCheckUtils]: 71: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:03,440 INFO L290 TraceCheckUtils]: 72: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,441 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10174#true} {10388#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {10388#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:42:03,441 INFO L290 TraceCheckUtils]: 74: Hoare triple {10388#(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; {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:42:03,441 INFO L290 TraceCheckUtils]: 75: Hoare triple {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:42:03,441 INFO L272 TraceCheckUtils]: 76: Hoare triple {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:03,441 INFO L290 TraceCheckUtils]: 77: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:03,441 INFO L290 TraceCheckUtils]: 78: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:03,441 INFO L290 TraceCheckUtils]: 79: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,441 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10174#true} {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #54#return; {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:42:03,442 INFO L290 TraceCheckUtils]: 81: Hoare triple {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:42:03,442 INFO L290 TraceCheckUtils]: 82: Hoare triple {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !false; {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:42:03,442 INFO L272 TraceCheckUtils]: 83: Hoare triple {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:03,442 INFO L290 TraceCheckUtils]: 84: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:03,442 INFO L290 TraceCheckUtils]: 85: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:03,442 INFO L290 TraceCheckUtils]: 86: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,453 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {10174#true} {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} #54#return; {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:42:03,453 INFO L290 TraceCheckUtils]: 88: Hoare triple {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10454#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:42:03,453 INFO L290 TraceCheckUtils]: 89: Hoare triple {10454#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {10454#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:42:03,453 INFO L272 TraceCheckUtils]: 90: Hoare triple {10454#(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)); {10174#true} is VALID [2022-04-27 14:42:03,453 INFO L290 TraceCheckUtils]: 91: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:03,453 INFO L290 TraceCheckUtils]: 92: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:03,453 INFO L290 TraceCheckUtils]: 93: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,454 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {10174#true} {10454#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {10454#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:42:03,454 INFO L290 TraceCheckUtils]: 95: Hoare triple {10454#(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; {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:42:03,454 INFO L290 TraceCheckUtils]: 96: Hoare triple {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:42:03,454 INFO L272 TraceCheckUtils]: 97: Hoare triple {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:03,454 INFO L290 TraceCheckUtils]: 98: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:03,454 INFO L290 TraceCheckUtils]: 99: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:03,454 INFO L290 TraceCheckUtils]: 100: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,454 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10174#true} {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #54#return; {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:42:03,455 INFO L290 TraceCheckUtils]: 102: Hoare triple {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10498#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:42:03,455 INFO L290 TraceCheckUtils]: 103: Hoare triple {10498#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {10498#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:42:03,455 INFO L272 TraceCheckUtils]: 104: Hoare triple {10498#(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)); {10174#true} is VALID [2022-04-27 14:42:03,455 INFO L290 TraceCheckUtils]: 105: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:03,455 INFO L290 TraceCheckUtils]: 106: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:03,455 INFO L290 TraceCheckUtils]: 107: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,455 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {10174#true} {10498#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {10498#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:42:03,456 INFO L290 TraceCheckUtils]: 109: Hoare triple {10498#(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; {10520#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:42:03,456 INFO L290 TraceCheckUtils]: 110: Hoare triple {10520#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {10520#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:42:03,456 INFO L272 TraceCheckUtils]: 111: Hoare triple {10520#(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)); {10174#true} is VALID [2022-04-27 14:42:03,456 INFO L290 TraceCheckUtils]: 112: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:03,456 INFO L290 TraceCheckUtils]: 113: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:03,456 INFO L290 TraceCheckUtils]: 114: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:03,456 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {10174#true} {10520#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {10520#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:42:03,457 INFO L290 TraceCheckUtils]: 116: Hoare triple {10520#(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; {10542#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:03,457 INFO L290 TraceCheckUtils]: 117: Hoare triple {10542#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !false; {10542#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:03,457 INFO L272 TraceCheckUtils]: 118: Hoare triple {10542#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:03,457 INFO L290 TraceCheckUtils]: 119: Hoare triple {10174#true} ~cond := #in~cond; {10552#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:03,457 INFO L290 TraceCheckUtils]: 120: Hoare triple {10552#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:42:03,458 INFO L290 TraceCheckUtils]: 121: Hoare triple {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:42:03,458 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} {10542#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} #54#return; {10563#(and (= (+ (- 1) main_~c~0) 14) (= (+ (* 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)) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:03,459 INFO L290 TraceCheckUtils]: 123: Hoare triple {10563#(and (= (+ (- 1) main_~c~0) 14) (= (+ (* 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)) (= 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; {10567#(and (= main_~y~0 16) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:42:03,459 INFO L290 TraceCheckUtils]: 124: Hoare triple {10567#(and (= main_~y~0 16) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (< 15 main_~k~0) (<= main_~c~0 16))} assume !false; {10567#(and (= main_~y~0 16) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:42:03,459 INFO L272 TraceCheckUtils]: 125: Hoare triple {10567#(and (= main_~y~0 16) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (< 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)); {10174#true} is VALID [2022-04-27 14:42:03,459 INFO L290 TraceCheckUtils]: 126: Hoare triple {10174#true} ~cond := #in~cond; {10552#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:03,460 INFO L290 TraceCheckUtils]: 127: Hoare triple {10552#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:42:03,460 INFO L290 TraceCheckUtils]: 128: Hoare triple {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:42:03,460 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} {10567#(and (= main_~y~0 16) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (< 15 main_~k~0) (<= main_~c~0 16))} #54#return; {10586#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:42:03,461 INFO L290 TraceCheckUtils]: 130: Hoare triple {10586#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !(~c~0 < ~k~0); {10590#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} is VALID [2022-04-27 14:42:03,462 INFO L272 TraceCheckUtils]: 131: Hoare triple {10590#(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)); {10594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:03,462 INFO L290 TraceCheckUtils]: 132: Hoare triple {10594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:03,462 INFO L290 TraceCheckUtils]: 133: Hoare triple {10598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10175#false} is VALID [2022-04-27 14:42:03,462 INFO L290 TraceCheckUtils]: 134: Hoare triple {10175#false} assume !false; {10175#false} is VALID [2022-04-27 14:42:03,463 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 122 proven. 410 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-04-27 14:42:03,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:22,005 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse2 (* (- 13) c_main_~y~0 c_main_~y~0)) (.cse3 (* (- 1) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= (mod (+ .cse1 .cse2 .cse3) 4) 0)) (not (<= (div (+ .cse1 .cse2 .cse3 (- 4)) (- 4)) (+ (* c_main_~y~0 c_main_~y~0 c_main_~y~0) c_main_~x~0 1 (* 3 (* c_main_~y~0 c_main_~y~0))))))) is different from false [2022-04-27 14:42:26,177 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= (mod (+ (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 13) c_main_~y~0 c_main_~y~0) (* (- 1) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) is different from false [2022-04-27 14:42:26,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:26,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967540772] [2022-04-27 14:42:26,179 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:26,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867992726] [2022-04-27 14:42:26,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867992726] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:26,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:26,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-04-27 14:42:26,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204003256] [2022-04-27 14:42:26,180 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:26,180 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 19 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) Word has length 135 [2022-04-27 14:42:26,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:26,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 19 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-27 14:42:26,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:26,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 14:42:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:26,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 14:42:26,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=796, Unknown=2, NotChecked=114, Total=992 [2022-04-27 14:42:26,258 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 26 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 19 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-27 14:42:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:29,329 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-04-27 14:42:29,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 14:42:29,329 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 19 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) Word has length 135 [2022-04-27 14:42:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 19 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-27 14:42:29,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 96 transitions. [2022-04-27 14:42:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 19 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-27 14:42:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 96 transitions. [2022-04-27 14:42:29,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 96 transitions. [2022-04-27 14:42:29,422 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-27 14:42:29,423 INFO L225 Difference]: With dead ends: 84 [2022-04-27 14:42:29,423 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 14:42:29,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=101, Invalid=961, Unknown=2, NotChecked=126, Total=1190 [2022-04-27 14:42:29,423 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 9 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:29,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 692 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-27 14:42:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 14:42:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-27 14:42:29,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:29,457 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-27 14:42:29,457 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-27 14:42:29,457 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-27 14:42:29,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:29,459 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-27 14:42:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 14:42:29,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:29,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:29,459 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-27 14:42:29,459 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-27 14:42:29,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:29,460 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-27 14:42:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 14:42:29,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:29,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:29,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:29,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:29,461 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-27 14:42:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-27 14:42:29,462 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 135 [2022-04-27 14:42:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:29,462 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-27 14:42:29,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 19 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-27 14:42:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 14:42:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-04-27 14:42:29,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:29,463 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-27 14:42:29,483 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-27 14:42:29,668 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-27 14:42:29,668 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:29,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1539623736, now seen corresponding path program 17 times [2022-04-27 14:42:29,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:29,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351022640] [2022-04-27 14:42:29,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:29,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:29,677 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:29,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325934553] [2022-04-27 14:42:29,677 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:42:29,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:29,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:29,678 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-27 14:42:29,681 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-27 14:42:30,819 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-04-27 14:42:30,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:30,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-27 14:42:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:30,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:31,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {11070#true} call ULTIMATE.init(); {11070#true} is VALID [2022-04-27 14:42:31,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {11070#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); {11070#true} is VALID [2022-04-27 14:42:31,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11070#true} {11070#true} #60#return; {11070#true} is VALID [2022-04-27 14:42:31,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {11070#true} call #t~ret5 := main(); {11070#true} is VALID [2022-04-27 14:42:31,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {11070#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; {11070#true} is VALID [2022-04-27 14:42:31,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {11070#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:31,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11070#true} {11070#true} #52#return; {11070#true} is VALID [2022-04-27 14:42:31,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {11070#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:31,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {11108#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {11108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:31,308 INFO L272 TraceCheckUtils]: 13: Hoare triple {11108#(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)); {11070#true} is VALID [2022-04-27 14:42:31,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,308 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11070#true} {11108#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {11108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:31,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {11108#(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; {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:42:31,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:42:31,309 INFO L272 TraceCheckUtils]: 20: Hoare triple {11130#(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)); {11070#true} is VALID [2022-04-27 14:42:31,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,309 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11070#true} {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:42:31,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {11130#(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; {11152#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:42:31,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {11152#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {11152#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:42:31,310 INFO L272 TraceCheckUtils]: 27: Hoare triple {11152#(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)); {11070#true} is VALID [2022-04-27 14:42:31,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,310 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11070#true} {11152#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {11152#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:42:31,310 INFO L290 TraceCheckUtils]: 32: Hoare triple {11152#(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; {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:42:31,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:42:31,310 INFO L272 TraceCheckUtils]: 34: Hoare triple {11174#(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)); {11070#true} is VALID [2022-04-27 14:42:31,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,310 INFO L290 TraceCheckUtils]: 36: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,314 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11070#true} {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:42:31,315 INFO L290 TraceCheckUtils]: 39: Hoare triple {11174#(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; {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:42:31,315 INFO L290 TraceCheckUtils]: 40: Hoare triple {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:42:31,315 INFO L272 TraceCheckUtils]: 41: Hoare triple {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:31,315 INFO L290 TraceCheckUtils]: 42: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,315 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11070#true} {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #54#return; {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:42:31,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:31,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:31,316 INFO L272 TraceCheckUtils]: 48: Hoare triple {11218#(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)); {11070#true} is VALID [2022-04-27 14:42:31,316 INFO L290 TraceCheckUtils]: 49: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,316 INFO L290 TraceCheckUtils]: 50: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,316 INFO L290 TraceCheckUtils]: 51: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,316 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11070#true} {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:31,317 INFO L290 TraceCheckUtils]: 53: Hoare triple {11218#(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; {11240#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:42:31,317 INFO L290 TraceCheckUtils]: 54: Hoare triple {11240#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {11240#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:42:31,317 INFO L272 TraceCheckUtils]: 55: Hoare triple {11240#(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)); {11070#true} is VALID [2022-04-27 14:42:31,317 INFO L290 TraceCheckUtils]: 56: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,317 INFO L290 TraceCheckUtils]: 57: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,317 INFO L290 TraceCheckUtils]: 58: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,317 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11070#true} {11240#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {11240#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:42:31,318 INFO L290 TraceCheckUtils]: 60: Hoare triple {11240#(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; {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:31,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:31,318 INFO L272 TraceCheckUtils]: 62: Hoare triple {11262#(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)); {11070#true} is VALID [2022-04-27 14:42:31,318 INFO L290 TraceCheckUtils]: 63: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,318 INFO L290 TraceCheckUtils]: 64: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,318 INFO L290 TraceCheckUtils]: 65: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,318 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11070#true} {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:31,318 INFO L290 TraceCheckUtils]: 67: Hoare triple {11262#(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; {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:42:31,319 INFO L290 TraceCheckUtils]: 68: Hoare triple {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:42:31,319 INFO L272 TraceCheckUtils]: 69: Hoare triple {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:31,319 INFO L290 TraceCheckUtils]: 70: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,319 INFO L290 TraceCheckUtils]: 71: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,319 INFO L290 TraceCheckUtils]: 72: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,319 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11070#true} {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #54#return; {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:42:31,319 INFO L290 TraceCheckUtils]: 74: Hoare triple {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:31,320 INFO L290 TraceCheckUtils]: 75: Hoare triple {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} assume !false; {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:31,320 INFO L272 TraceCheckUtils]: 76: Hoare triple {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:31,320 INFO L290 TraceCheckUtils]: 77: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,320 INFO L290 TraceCheckUtils]: 78: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,320 INFO L290 TraceCheckUtils]: 79: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,320 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {11070#true} {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} #54#return; {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:31,320 INFO L290 TraceCheckUtils]: 81: Hoare triple {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:42:31,321 INFO L290 TraceCheckUtils]: 82: Hoare triple {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} assume !false; {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:42:31,321 INFO L272 TraceCheckUtils]: 83: Hoare triple {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:31,321 INFO L290 TraceCheckUtils]: 84: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,321 INFO L290 TraceCheckUtils]: 85: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,321 INFO L290 TraceCheckUtils]: 86: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,321 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {11070#true} {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} #54#return; {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:42:31,321 INFO L290 TraceCheckUtils]: 88: Hoare triple {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:42:31,322 INFO L290 TraceCheckUtils]: 89: Hoare triple {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} assume !false; {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:42:31,322 INFO L272 TraceCheckUtils]: 90: Hoare triple {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:31,322 INFO L290 TraceCheckUtils]: 91: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,322 INFO L290 TraceCheckUtils]: 92: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,322 INFO L290 TraceCheckUtils]: 93: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,322 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {11070#true} {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} #54#return; {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:42:31,322 INFO L290 TraceCheckUtils]: 95: Hoare triple {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} is VALID [2022-04-27 14:42:31,323 INFO L290 TraceCheckUtils]: 96: Hoare triple {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} assume !false; {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} is VALID [2022-04-27 14:42:31,323 INFO L272 TraceCheckUtils]: 97: Hoare triple {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 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)); {11070#true} is VALID [2022-04-27 14:42:31,323 INFO L290 TraceCheckUtils]: 98: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,323 INFO L290 TraceCheckUtils]: 99: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,323 INFO L290 TraceCheckUtils]: 100: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,323 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11070#true} {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} #54#return; {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} is VALID [2022-04-27 14:42:31,323 INFO L290 TraceCheckUtils]: 102: Hoare triple {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 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; {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 14:42:31,324 INFO L290 TraceCheckUtils]: 103: Hoare triple {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} assume !false; {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 14:42:31,324 INFO L272 TraceCheckUtils]: 104: Hoare triple {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ 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)); {11070#true} is VALID [2022-04-27 14:42:31,324 INFO L290 TraceCheckUtils]: 105: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,324 INFO L290 TraceCheckUtils]: 106: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,324 INFO L290 TraceCheckUtils]: 107: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,324 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {11070#true} {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} #54#return; {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 14:42:31,324 INFO L290 TraceCheckUtils]: 109: Hoare triple {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ 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; {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} is VALID [2022-04-27 14:42:31,325 INFO L290 TraceCheckUtils]: 110: Hoare triple {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} assume !false; {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} is VALID [2022-04-27 14:42:31,325 INFO L272 TraceCheckUtils]: 111: Hoare triple {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:31,325 INFO L290 TraceCheckUtils]: 112: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,325 INFO L290 TraceCheckUtils]: 113: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,325 INFO L290 TraceCheckUtils]: 114: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,325 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {11070#true} {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} #54#return; {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} is VALID [2022-04-27 14:42:31,325 INFO L290 TraceCheckUtils]: 116: Hoare triple {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} is VALID [2022-04-27 14:42:31,325 INFO L290 TraceCheckUtils]: 117: Hoare triple {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} assume !false; {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} is VALID [2022-04-27 14:42:31,326 INFO L272 TraceCheckUtils]: 118: Hoare triple {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ 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)); {11070#true} is VALID [2022-04-27 14:42:31,326 INFO L290 TraceCheckUtils]: 119: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,326 INFO L290 TraceCheckUtils]: 120: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,326 INFO L290 TraceCheckUtils]: 121: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,326 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {11070#true} {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} #54#return; {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} is VALID [2022-04-27 14:42:31,326 INFO L290 TraceCheckUtils]: 123: Hoare triple {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ 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; {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} is VALID [2022-04-27 14:42:31,326 INFO L290 TraceCheckUtils]: 124: Hoare triple {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} assume !false; {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} is VALID [2022-04-27 14:42:31,326 INFO L272 TraceCheckUtils]: 125: Hoare triple {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) 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)); {11070#true} is VALID [2022-04-27 14:42:31,327 INFO L290 TraceCheckUtils]: 126: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,327 INFO L290 TraceCheckUtils]: 127: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,327 INFO L290 TraceCheckUtils]: 128: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,327 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {11070#true} {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} #54#return; {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} is VALID [2022-04-27 14:42:31,327 INFO L290 TraceCheckUtils]: 130: Hoare triple {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) 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; {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:42:31,327 INFO L290 TraceCheckUtils]: 131: Hoare triple {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} assume !false; {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:42:31,327 INFO L272 TraceCheckUtils]: 132: Hoare triple {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:31,327 INFO L290 TraceCheckUtils]: 133: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:31,328 INFO L290 TraceCheckUtils]: 134: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:31,328 INFO L290 TraceCheckUtils]: 135: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:31,328 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {11070#true} {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} #54#return; {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:42:31,329 INFO L290 TraceCheckUtils]: 137: Hoare triple {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} assume !(~c~0 < ~k~0); {11504#(and (<= main_~k~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:42:31,329 INFO L272 TraceCheckUtils]: 138: Hoare triple {11504#(and (<= main_~k~0 17) (< 16 main_~k~0) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11508#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:31,330 INFO L290 TraceCheckUtils]: 139: Hoare triple {11508#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11512#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:31,330 INFO L290 TraceCheckUtils]: 140: Hoare triple {11512#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11071#false} is VALID [2022-04-27 14:42:31,330 INFO L290 TraceCheckUtils]: 141: Hoare triple {11071#false} assume !false; {11071#false} is VALID [2022-04-27 14:42:31,331 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-27 14:42:31,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:31,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:31,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351022640] [2022-04-27 14:42:31,521 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:31,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325934553] [2022-04-27 14:42:31,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325934553] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:31,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:31,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-27 14:42:31,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768676066] [2022-04-27 14:42:31,521 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:31,522 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-27 14:42:31,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:31,522 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-27 14:42:31,576 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-27 14:42:31,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 14:42:31,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:31,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 14:42:31,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-27 14:42:31,576 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-27 14:42:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:33,918 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-04-27 14:42:33,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-27 14:42:33,918 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-27 14:42:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:33,918 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-27 14:42:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-27 14:42:33,920 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-27 14:42:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-27 14:42:33,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 100 transitions. [2022-04-27 14:42:34,006 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-27 14:42:34,007 INFO L225 Difference]: With dead ends: 87 [2022-04-27 14:42:34,007 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 14:42:34,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2022-04-27 14:42:34,008 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-27 14:42:34,008 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-27 14:42:34,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 14:42:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-27 14:42:34,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:34,055 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-27 14:42:34,055 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-27 14:42:34,056 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-27 14:42:34,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:34,072 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-27 14:42:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-27 14:42:34,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:34,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:34,072 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-27 14:42:34,072 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-27 14:42:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:34,074 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-27 14:42:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-27 14:42:34,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:34,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:34,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:34,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:34,074 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-27 14:42:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-04-27 14:42:34,076 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 142 [2022-04-27 14:42:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:34,076 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-04-27 14:42:34,076 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-27 14:42:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-27 14:42:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-27 14:42:34,077 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:34,077 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-27 14:42:34,085 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-27 14:42:34,277 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-27 14:42:34,277 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:34,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:34,278 INFO L85 PathProgramCache]: Analyzing trace with hash -157742263, now seen corresponding path program 18 times [2022-04-27 14:42:34,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:34,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475185728] [2022-04-27 14:42:34,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:34,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:34,293 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:34,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [910826626] [2022-04-27 14:42:34,293 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:42:34,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:34,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:34,308 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-27 14:42:34,308 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-27 14:42:37,294 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-27 14:42:37,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:37,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 81 conjunts are in the unsatisfiable core [2022-04-27 14:42:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:37,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:38,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {11995#true} call ULTIMATE.init(); {11995#true} is VALID [2022-04-27 14:42:38,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {11995#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); {11995#true} is VALID [2022-04-27 14:42:38,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11995#true} {11995#true} #60#return; {11995#true} is VALID [2022-04-27 14:42:38,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {11995#true} call #t~ret5 := main(); {11995#true} is VALID [2022-04-27 14:42:38,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {11995#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; {11995#true} is VALID [2022-04-27 14:42:38,291 INFO L272 TraceCheckUtils]: 6: Hoare triple {11995#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:38,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,291 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11995#true} {11995#true} #52#return; {11995#true} is VALID [2022-04-27 14:42:38,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {11995#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12033#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:38,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {12033#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {12033#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:38,292 INFO L272 TraceCheckUtils]: 13: Hoare triple {12033#(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)); {11995#true} is VALID [2022-04-27 14:42:38,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,292 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11995#true} {12033#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {12033#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:38,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {12033#(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; {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:38,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:38,293 INFO L272 TraceCheckUtils]: 20: Hoare triple {12055#(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)); {11995#true} is VALID [2022-04-27 14:42:38,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,293 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11995#true} {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:38,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {12055#(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; {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:42:38,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:42:38,294 INFO L272 TraceCheckUtils]: 27: Hoare triple {12077#(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)); {11995#true} is VALID [2022-04-27 14:42:38,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,294 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11995#true} {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:42:38,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {12077#(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; {12099#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:38,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {12099#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {12099#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:38,295 INFO L272 TraceCheckUtils]: 34: Hoare triple {12099#(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)); {11995#true} is VALID [2022-04-27 14:42:38,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,295 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11995#true} {12099#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {12099#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:38,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {12099#(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; {12121#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:42:38,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {12121#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {12121#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:42:38,296 INFO L272 TraceCheckUtils]: 41: Hoare triple {12121#(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)); {11995#true} is VALID [2022-04-27 14:42:38,296 INFO L290 TraceCheckUtils]: 42: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,296 INFO L290 TraceCheckUtils]: 43: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,296 INFO L290 TraceCheckUtils]: 44: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,296 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11995#true} {12121#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {12121#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:42:38,297 INFO L290 TraceCheckUtils]: 46: Hoare triple {12121#(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; {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:38,297 INFO L290 TraceCheckUtils]: 47: Hoare triple {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:38,297 INFO L272 TraceCheckUtils]: 48: Hoare triple {12143#(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)); {11995#true} is VALID [2022-04-27 14:42:38,297 INFO L290 TraceCheckUtils]: 49: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,297 INFO L290 TraceCheckUtils]: 50: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,297 INFO L290 TraceCheckUtils]: 51: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,297 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11995#true} {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:38,298 INFO L290 TraceCheckUtils]: 53: Hoare triple {12143#(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; {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:38,298 INFO L290 TraceCheckUtils]: 54: Hoare triple {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:38,298 INFO L272 TraceCheckUtils]: 55: Hoare triple {12165#(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)); {11995#true} is VALID [2022-04-27 14:42:38,298 INFO L290 TraceCheckUtils]: 56: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,298 INFO L290 TraceCheckUtils]: 57: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,298 INFO L290 TraceCheckUtils]: 58: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,298 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11995#true} {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:38,299 INFO L290 TraceCheckUtils]: 60: Hoare triple {12165#(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; {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:42:38,299 INFO L290 TraceCheckUtils]: 61: Hoare triple {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:42:38,299 INFO L272 TraceCheckUtils]: 62: Hoare triple {12187#(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)); {11995#true} is VALID [2022-04-27 14:42:38,299 INFO L290 TraceCheckUtils]: 63: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,299 INFO L290 TraceCheckUtils]: 64: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,299 INFO L290 TraceCheckUtils]: 65: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,299 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11995#true} {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:42:38,300 INFO L290 TraceCheckUtils]: 67: Hoare triple {12187#(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; {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:42:38,300 INFO L290 TraceCheckUtils]: 68: Hoare triple {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:42:38,300 INFO L272 TraceCheckUtils]: 69: Hoare triple {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:38,300 INFO L290 TraceCheckUtils]: 70: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,300 INFO L290 TraceCheckUtils]: 71: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,300 INFO L290 TraceCheckUtils]: 72: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,300 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11995#true} {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:42:38,302 INFO L290 TraceCheckUtils]: 74: Hoare triple {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 14:42:38,302 INFO L290 TraceCheckUtils]: 75: Hoare triple {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} assume !false; {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 14:42:38,302 INFO L272 TraceCheckUtils]: 76: Hoare triple {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)) (< main_~c~0 (+ main_~k~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)); {11995#true} is VALID [2022-04-27 14:42:38,302 INFO L290 TraceCheckUtils]: 77: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,302 INFO L290 TraceCheckUtils]: 78: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,302 INFO L290 TraceCheckUtils]: 79: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,303 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {11995#true} {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} #54#return; {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 14:42:38,303 INFO L290 TraceCheckUtils]: 81: Hoare triple {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)) (< main_~c~0 (+ main_~k~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; {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10) (< main_~c~0 (+ main_~k~0 3)))} is VALID [2022-04-27 14:42:38,303 INFO L290 TraceCheckUtils]: 82: Hoare triple {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10) (< main_~c~0 (+ main_~k~0 3)))} assume !false; {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10) (< main_~c~0 (+ main_~k~0 3)))} is VALID [2022-04-27 14:42:38,303 INFO L272 TraceCheckUtils]: 83: Hoare triple {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10) (< main_~c~0 (+ main_~k~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)); {11995#true} is VALID [2022-04-27 14:42:38,303 INFO L290 TraceCheckUtils]: 84: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,303 INFO L290 TraceCheckUtils]: 85: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,303 INFO L290 TraceCheckUtils]: 86: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,304 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {11995#true} {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10) (< main_~c~0 (+ main_~k~0 3)))} #54#return; {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10) (< main_~c~0 (+ main_~k~0 3)))} is VALID [2022-04-27 14:42:38,314 INFO L290 TraceCheckUtils]: 88: Hoare triple {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10) (< main_~c~0 (+ main_~k~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; {12275#(and (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-27 14:42:38,314 INFO L290 TraceCheckUtils]: 89: Hoare triple {12275#(and (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} assume !false; {12275#(and (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-27 14:42:38,315 INFO L272 TraceCheckUtils]: 90: Hoare triple {12275#(and (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:38,315 INFO L290 TraceCheckUtils]: 91: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,315 INFO L290 TraceCheckUtils]: 92: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,315 INFO L290 TraceCheckUtils]: 93: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,315 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {11995#true} {12275#(and (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} #54#return; {12275#(and (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-27 14:42:38,315 INFO L290 TraceCheckUtils]: 95: Hoare triple {12275#(and (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))) (< main_~c~0 (+ 5 main_~k~0)))} is VALID [2022-04-27 14:42:38,316 INFO L290 TraceCheckUtils]: 96: Hoare triple {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))) (< main_~c~0 (+ 5 main_~k~0)))} assume !false; {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))) (< main_~c~0 (+ 5 main_~k~0)))} is VALID [2022-04-27 14:42:38,316 INFO L272 TraceCheckUtils]: 97: Hoare triple {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))) (< main_~c~0 (+ 5 main_~k~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:38,316 INFO L290 TraceCheckUtils]: 98: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,316 INFO L290 TraceCheckUtils]: 99: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,316 INFO L290 TraceCheckUtils]: 100: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,316 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11995#true} {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))) (< main_~c~0 (+ 5 main_~k~0)))} #54#return; {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))) (< main_~c~0 (+ 5 main_~k~0)))} is VALID [2022-04-27 14:42:38,316 INFO L290 TraceCheckUtils]: 102: Hoare triple {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))) (< main_~c~0 (+ 5 main_~k~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12319#(and (< 7 main_~k~0) (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:38,317 INFO L290 TraceCheckUtils]: 103: Hoare triple {12319#(and (< 7 main_~k~0) (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {12319#(and (< 7 main_~k~0) (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:38,317 INFO L272 TraceCheckUtils]: 104: Hoare triple {12319#(and (< 7 main_~k~0) (= 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)); {11995#true} is VALID [2022-04-27 14:42:38,317 INFO L290 TraceCheckUtils]: 105: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,317 INFO L290 TraceCheckUtils]: 106: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,317 INFO L290 TraceCheckUtils]: 107: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,317 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {11995#true} {12319#(and (< 7 main_~k~0) (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {12319#(and (< 7 main_~k~0) (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:38,318 INFO L290 TraceCheckUtils]: 109: Hoare triple {12319#(and (< 7 main_~k~0) (= 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; {12341#(and (< 7 main_~k~0) (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:42:38,318 INFO L290 TraceCheckUtils]: 110: Hoare triple {12341#(and (< 7 main_~k~0) (= main_~y~0 14) (= main_~c~0 14))} assume !false; {12341#(and (< 7 main_~k~0) (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:42:38,318 INFO L272 TraceCheckUtils]: 111: Hoare triple {12341#(and (< 7 main_~k~0) (= 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)); {11995#true} is VALID [2022-04-27 14:42:38,318 INFO L290 TraceCheckUtils]: 112: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,318 INFO L290 TraceCheckUtils]: 113: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,318 INFO L290 TraceCheckUtils]: 114: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,328 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {11995#true} {12341#(and (< 7 main_~k~0) (= main_~y~0 14) (= main_~c~0 14))} #54#return; {12341#(and (< 7 main_~k~0) (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:42:38,328 INFO L290 TraceCheckUtils]: 116: Hoare triple {12341#(and (< 7 main_~k~0) (= 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; {12363#(and (< 7 main_~k~0) (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 14:42:38,329 INFO L290 TraceCheckUtils]: 117: Hoare triple {12363#(and (< 7 main_~k~0) (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !false; {12363#(and (< 7 main_~k~0) (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 14:42:38,329 INFO L272 TraceCheckUtils]: 118: Hoare triple {12363#(and (< 7 main_~k~0) (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:38,329 INFO L290 TraceCheckUtils]: 119: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,329 INFO L290 TraceCheckUtils]: 120: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,329 INFO L290 TraceCheckUtils]: 121: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,329 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {11995#true} {12363#(and (< 7 main_~k~0) (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} #54#return; {12363#(and (< 7 main_~k~0) (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 14:42:38,330 INFO L290 TraceCheckUtils]: 123: Hoare triple {12363#(and (< 7 main_~k~0) (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12385#(and (< 7 main_~k~0) (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:38,330 INFO L290 TraceCheckUtils]: 124: Hoare triple {12385#(and (< 7 main_~k~0) (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {12385#(and (< 7 main_~k~0) (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:38,330 INFO L272 TraceCheckUtils]: 125: Hoare triple {12385#(and (< 7 main_~k~0) (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:38,330 INFO L290 TraceCheckUtils]: 126: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,330 INFO L290 TraceCheckUtils]: 127: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,330 INFO L290 TraceCheckUtils]: 128: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,330 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {11995#true} {12385#(and (< 7 main_~k~0) (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #54#return; {12385#(and (< 7 main_~k~0) (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:38,331 INFO L290 TraceCheckUtils]: 130: Hoare triple {12385#(and (< 7 main_~k~0) (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12407#(and (< 7 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:42:38,331 INFO L290 TraceCheckUtils]: 131: Hoare triple {12407#(and (< 7 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} assume !false; {12407#(and (< 7 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:42:38,331 INFO L272 TraceCheckUtils]: 132: Hoare triple {12407#(and (< 7 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:38,331 INFO L290 TraceCheckUtils]: 133: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,331 INFO L290 TraceCheckUtils]: 134: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,331 INFO L290 TraceCheckUtils]: 135: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,331 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {11995#true} {12407#(and (< 7 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} #54#return; {12407#(and (< 7 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:42:38,332 INFO L290 TraceCheckUtils]: 137: Hoare triple {12407#(and (< 7 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:42:38,332 INFO L290 TraceCheckUtils]: 138: Hoare triple {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !false; {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:42:38,332 INFO L272 TraceCheckUtils]: 139: Hoare triple {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:38,332 INFO L290 TraceCheckUtils]: 140: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:38,332 INFO L290 TraceCheckUtils]: 141: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:38,332 INFO L290 TraceCheckUtils]: 142: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:38,332 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {11995#true} {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} #54#return; {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:42:38,334 INFO L290 TraceCheckUtils]: 144: Hoare triple {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !(~c~0 < ~k~0); {12451#(and (< 17 main_~k~0) (<= main_~k~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:42:38,334 INFO L272 TraceCheckUtils]: 145: Hoare triple {12451#(and (< 17 main_~k~0) (<= main_~k~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12455#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:38,334 INFO L290 TraceCheckUtils]: 146: Hoare triple {12455#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12459#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:38,335 INFO L290 TraceCheckUtils]: 147: Hoare triple {12459#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11996#false} is VALID [2022-04-27 14:42:38,335 INFO L290 TraceCheckUtils]: 148: Hoare triple {11996#false} assume !false; {11996#false} is VALID [2022-04-27 14:42:38,335 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-27 14:42:38,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:39,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:39,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475185728] [2022-04-27 14:42:39,368 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:39,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910826626] [2022-04-27 14:42:39,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910826626] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:39,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:39,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2022-04-27 14:42:39,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572808016] [2022-04-27 14:42:39,369 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:39,369 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-27 14:42:39,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:39,369 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-27 14:42:39,434 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-27 14:42:39,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 14:42:39,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:39,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 14:42:39,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1056, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 14:42:39,435 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-27 14:42:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:42,872 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2022-04-27 14:42:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 14:42:42,872 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-27 14:42:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:42,872 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-27 14:42:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-27 14:42:42,874 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-27 14:42:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-27 14:42:42,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 104 transitions. [2022-04-27 14:42:42,970 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-27 14:42:42,971 INFO L225 Difference]: With dead ends: 90 [2022-04-27 14:42:42,971 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 14:42:42,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2022-04-27 14:42:42,972 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:42,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 853 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 14:42:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 14:42:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-27 14:42:43,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:43,035 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-27 14:42:43,035 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-27 14:42:43,036 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-27 14:42:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:43,037 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-27 14:42:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-27 14:42:43,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:43,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:43,037 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-27 14:42:43,037 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-27 14:42:43,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:43,039 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-27 14:42:43,039 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-27 14:42:43,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:43,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:43,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:43,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:43,039 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-27 14:42:43,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-04-27 14:42:43,040 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 149 [2022-04-27 14:42:43,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:43,041 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-04-27 14:42:43,041 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-27 14:42:43,041 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-27 14:42:43,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-27 14:42:43,042 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:43,042 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-27 14:42:43,050 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-27 14:42:43,248 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-27 14:42:43,248 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:43,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:43,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1167462824, now seen corresponding path program 19 times [2022-04-27 14:42:43,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:43,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134640993] [2022-04-27 14:42:43,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:43,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:43,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:43,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [116630623] [2022-04-27 14:42:43,264 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:42:43,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:43,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:43,265 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-27 14:42:43,266 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-27 14:42:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:43,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 84 conjunts are in the unsatisfiable core [2022-04-27 14:42:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:43,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:44,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {13178#true} call ULTIMATE.init(); {13178#true} is VALID [2022-04-27 14:42:44,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {13178#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); {13178#true} is VALID [2022-04-27 14:42:44,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13178#true} {13178#true} #60#return; {13178#true} is VALID [2022-04-27 14:42:44,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {13178#true} call #t~ret5 := main(); {13178#true} is VALID [2022-04-27 14:42:44,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {13178#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; {13178#true} is VALID [2022-04-27 14:42:44,586 INFO L272 TraceCheckUtils]: 6: Hoare triple {13178#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {13178#true} is VALID [2022-04-27 14:42:44,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,587 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13178#true} {13178#true} #52#return; {13178#true} is VALID [2022-04-27 14:42:44,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {13178#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:44,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {13216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {13216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:44,587 INFO L272 TraceCheckUtils]: 13: Hoare triple {13216#(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)); {13178#true} is VALID [2022-04-27 14:42:44,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,587 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13178#true} {13216#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {13216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:44,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {13216#(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; {13238#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:42:44,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {13238#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {13238#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:42:44,588 INFO L272 TraceCheckUtils]: 20: Hoare triple {13238#(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)); {13178#true} is VALID [2022-04-27 14:42:44,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,588 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {13178#true} {13238#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {13238#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:42:44,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {13238#(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; {13260#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:42:44,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {13260#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {13260#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:42:44,589 INFO L272 TraceCheckUtils]: 27: Hoare triple {13260#(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)); {13178#true} is VALID [2022-04-27 14:42:44,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,589 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13178#true} {13260#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {13260#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:42:44,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {13260#(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; {13282#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:42:44,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {13282#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {13282#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:42:44,596 INFO L272 TraceCheckUtils]: 34: Hoare triple {13282#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-27 14:42:44,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,597 INFO L290 TraceCheckUtils]: 36: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,597 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13178#true} {13282#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {13282#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:42:44,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {13282#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13304#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:42:44,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {13304#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {13304#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:42:44,597 INFO L272 TraceCheckUtils]: 41: Hoare triple {13304#(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)); {13178#true} is VALID [2022-04-27 14:42:44,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,598 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13178#true} {13304#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {13304#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:42:44,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {13304#(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; {13326#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:44,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {13326#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {13326#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:44,598 INFO L272 TraceCheckUtils]: 48: Hoare triple {13326#(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)); {13178#true} is VALID [2022-04-27 14:42:44,598 INFO L290 TraceCheckUtils]: 49: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,598 INFO L290 TraceCheckUtils]: 51: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,599 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13178#true} {13326#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {13326#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:44,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {13326#(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; {13348#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:44,599 INFO L290 TraceCheckUtils]: 54: Hoare triple {13348#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {13348#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:44,599 INFO L272 TraceCheckUtils]: 55: Hoare triple {13348#(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)); {13178#true} is VALID [2022-04-27 14:42:44,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,599 INFO L290 TraceCheckUtils]: 57: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,599 INFO L290 TraceCheckUtils]: 58: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,600 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13178#true} {13348#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {13348#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:44,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {13348#(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; {13370#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:42:44,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {13370#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {13370#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:42:44,600 INFO L272 TraceCheckUtils]: 62: Hoare triple {13370#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-27 14:42:44,600 INFO L290 TraceCheckUtils]: 63: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,600 INFO L290 TraceCheckUtils]: 64: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,600 INFO L290 TraceCheckUtils]: 65: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,601 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13178#true} {13370#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {13370#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:42:44,601 INFO L290 TraceCheckUtils]: 67: Hoare triple {13370#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13392#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:42:44,601 INFO L290 TraceCheckUtils]: 68: Hoare triple {13392#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {13392#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:42:44,601 INFO L272 TraceCheckUtils]: 69: Hoare triple {13392#(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)); {13178#true} is VALID [2022-04-27 14:42:44,601 INFO L290 TraceCheckUtils]: 70: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,601 INFO L290 TraceCheckUtils]: 71: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,601 INFO L290 TraceCheckUtils]: 72: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,601 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13178#true} {13392#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {13392#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:42:44,602 INFO L290 TraceCheckUtils]: 74: Hoare triple {13392#(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; {13414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:42:44,602 INFO L290 TraceCheckUtils]: 75: Hoare triple {13414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !false; {13414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:42:44,602 INFO L272 TraceCheckUtils]: 76: Hoare triple {13414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-27 14:42:44,602 INFO L290 TraceCheckUtils]: 77: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,602 INFO L290 TraceCheckUtils]: 78: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,602 INFO L290 TraceCheckUtils]: 79: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,602 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13178#true} {13414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #54#return; {13414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:42:44,603 INFO L290 TraceCheckUtils]: 81: Hoare triple {13414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13436#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:42:44,603 INFO L290 TraceCheckUtils]: 82: Hoare triple {13436#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {13436#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:42:44,603 INFO L272 TraceCheckUtils]: 83: Hoare triple {13436#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-27 14:42:44,603 INFO L290 TraceCheckUtils]: 84: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,603 INFO L290 TraceCheckUtils]: 85: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,603 INFO L290 TraceCheckUtils]: 86: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,616 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13178#true} {13436#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {13436#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:42:44,617 INFO L290 TraceCheckUtils]: 88: Hoare triple {13436#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13458#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:42:44,617 INFO L290 TraceCheckUtils]: 89: Hoare triple {13458#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {13458#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:42:44,617 INFO L272 TraceCheckUtils]: 90: Hoare triple {13458#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-27 14:42:44,617 INFO L290 TraceCheckUtils]: 91: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,617 INFO L290 TraceCheckUtils]: 92: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,617 INFO L290 TraceCheckUtils]: 93: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,617 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {13178#true} {13458#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {13458#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:42:44,618 INFO L290 TraceCheckUtils]: 95: Hoare triple {13458#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13480#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:42:44,618 INFO L290 TraceCheckUtils]: 96: Hoare triple {13480#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {13480#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:42:44,618 INFO L272 TraceCheckUtils]: 97: Hoare triple {13480#(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)); {13178#true} is VALID [2022-04-27 14:42:44,618 INFO L290 TraceCheckUtils]: 98: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,618 INFO L290 TraceCheckUtils]: 99: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,618 INFO L290 TraceCheckUtils]: 100: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,618 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13178#true} {13480#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {13480#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:42:44,619 INFO L290 TraceCheckUtils]: 102: Hoare triple {13480#(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; {13502#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:44,619 INFO L290 TraceCheckUtils]: 103: Hoare triple {13502#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {13502#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:44,619 INFO L272 TraceCheckUtils]: 104: Hoare triple {13502#(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)); {13178#true} is VALID [2022-04-27 14:42:44,619 INFO L290 TraceCheckUtils]: 105: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,619 INFO L290 TraceCheckUtils]: 106: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,619 INFO L290 TraceCheckUtils]: 107: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,619 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {13178#true} {13502#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {13502#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:44,620 INFO L290 TraceCheckUtils]: 109: Hoare triple {13502#(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; {13524#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:42:44,620 INFO L290 TraceCheckUtils]: 110: Hoare triple {13524#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} assume !false; {13524#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:42:44,620 INFO L272 TraceCheckUtils]: 111: Hoare triple {13524#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-27 14:42:44,620 INFO L290 TraceCheckUtils]: 112: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,620 INFO L290 TraceCheckUtils]: 113: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,620 INFO L290 TraceCheckUtils]: 114: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,620 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {13178#true} {13524#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} #54#return; {13524#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:42:44,620 INFO L290 TraceCheckUtils]: 116: Hoare triple {13524#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13546#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:42:44,621 INFO L290 TraceCheckUtils]: 117: Hoare triple {13546#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {13546#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:42:44,621 INFO L272 TraceCheckUtils]: 118: Hoare triple {13546#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-27 14:42:44,621 INFO L290 TraceCheckUtils]: 119: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,621 INFO L290 TraceCheckUtils]: 120: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,621 INFO L290 TraceCheckUtils]: 121: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,621 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13178#true} {13546#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {13546#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:42:44,621 INFO L290 TraceCheckUtils]: 123: Hoare triple {13546#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13568#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-27 14:42:44,622 INFO L290 TraceCheckUtils]: 124: Hoare triple {13568#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} assume !false; {13568#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-27 14:42:44,622 INFO L272 TraceCheckUtils]: 125: Hoare triple {13568#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-27 14:42:44,622 INFO L290 TraceCheckUtils]: 126: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,622 INFO L290 TraceCheckUtils]: 127: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,622 INFO L290 TraceCheckUtils]: 128: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,622 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {13178#true} {13568#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} #54#return; {13568#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-27 14:42:44,623 INFO L290 TraceCheckUtils]: 130: Hoare triple {13568#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13590#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:44,623 INFO L290 TraceCheckUtils]: 131: Hoare triple {13590#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} assume !false; {13590#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:44,623 INFO L272 TraceCheckUtils]: 132: Hoare triple {13590#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-27 14:42:44,623 INFO L290 TraceCheckUtils]: 133: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,623 INFO L290 TraceCheckUtils]: 134: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,623 INFO L290 TraceCheckUtils]: 135: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,624 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {13178#true} {13590#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} #54#return; {13590#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:44,624 INFO L290 TraceCheckUtils]: 137: Hoare triple {13590#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13612#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:42:44,624 INFO L290 TraceCheckUtils]: 138: Hoare triple {13612#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {13612#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:42:44,624 INFO L272 TraceCheckUtils]: 139: Hoare triple {13612#(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)); {13178#true} is VALID [2022-04-27 14:42:44,624 INFO L290 TraceCheckUtils]: 140: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,624 INFO L290 TraceCheckUtils]: 141: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,624 INFO L290 TraceCheckUtils]: 142: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,625 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {13178#true} {13612#(and (= main_~c~0 18) (= main_~y~0 18))} #54#return; {13612#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:42:44,625 INFO L290 TraceCheckUtils]: 144: Hoare triple {13612#(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; {13634#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} is VALID [2022-04-27 14:42:44,625 INFO L290 TraceCheckUtils]: 145: Hoare triple {13634#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} assume !false; {13634#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} is VALID [2022-04-27 14:42:44,625 INFO L272 TraceCheckUtils]: 146: Hoare triple {13634#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-27 14:42:44,625 INFO L290 TraceCheckUtils]: 147: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-27 14:42:44,625 INFO L290 TraceCheckUtils]: 148: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-27 14:42:44,625 INFO L290 TraceCheckUtils]: 149: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-27 14:42:44,625 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {13178#true} {13634#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} #54#return; {13634#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} is VALID [2022-04-27 14:42:44,626 INFO L290 TraceCheckUtils]: 151: Hoare triple {13634#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} assume !(~c~0 < ~k~0); {13656#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~k~0 19))} is VALID [2022-04-27 14:42:44,626 INFO L272 TraceCheckUtils]: 152: Hoare triple {13656#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~k~0 19))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13660#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:44,627 INFO L290 TraceCheckUtils]: 153: Hoare triple {13660#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13664#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:44,627 INFO L290 TraceCheckUtils]: 154: Hoare triple {13664#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13179#false} is VALID [2022-04-27 14:42:44,627 INFO L290 TraceCheckUtils]: 155: Hoare triple {13179#false} assume !false; {13179#false} is VALID [2022-04-27 14:42:44,627 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-27 14:42:44,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:44,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:44,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134640993] [2022-04-27 14:42:44,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:44,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116630623] [2022-04-27 14:42:44,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116630623] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:44,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:44,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-04-27 14:42:44,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627449759] [2022-04-27 14:42:44,907 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:44,907 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-27 14:42:44,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:44,907 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-27 14:42:44,996 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-27 14:42:44,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 14:42:44,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:44,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 14:42:44,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-04-27 14:42:44,997 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-27 14:42:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:48,831 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-04-27 14:42:48,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 14:42:48,831 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-27 14:42:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:48,831 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-27 14:42:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-27 14:42:48,833 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-27 14:42:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-27 14:42:48,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 108 transitions. [2022-04-27 14:42:48,998 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-27 14:42:49,000 INFO L225 Difference]: With dead ends: 93 [2022-04-27 14:42:49,000 INFO L226 Difference]: Without dead ends: 88 [2022-04-27 14:42:49,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2022-04-27 14:42:49,000 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:49,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 925 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-27 14:42:49,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-27 14:42:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-27 14:42:49,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:49,068 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-27 14:42:49,068 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-27 14:42:49,068 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-27 14:42:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:49,069 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-27 14:42:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-27 14:42:49,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:49,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:49,070 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-27 14:42:49,070 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-27 14:42:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:49,071 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-27 14:42:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-27 14:42:49,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:49,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:49,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:49,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:49,071 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-27 14:42:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-04-27 14:42:49,074 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 156 [2022-04-27 14:42:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:49,075 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-04-27 14:42:49,075 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-27 14:42:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-27 14:42:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-27 14:42:49,076 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:49,076 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-27 14:42:49,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-27 14:42:49,281 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-27 14:42:49,282 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:49,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:49,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1670771305, now seen corresponding path program 20 times [2022-04-27 14:42:49,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:49,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788844702] [2022-04-27 14:42:49,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:49,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:49,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:49,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1407822574] [2022-04-27 14:42:49,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:42:49,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:49,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:49,304 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-27 14:42:49,306 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-27 14:42:49,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:42:49,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:49,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-27 14:42:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:49,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:50,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {14179#true} call ULTIMATE.init(); {14179#true} is VALID [2022-04-27 14:42:50,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {14179#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); {14179#true} is VALID [2022-04-27 14:42:50,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14179#true} {14179#true} #60#return; {14179#true} is VALID [2022-04-27 14:42:50,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {14179#true} call #t~ret5 := main(); {14179#true} is VALID [2022-04-27 14:42:50,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {14179#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; {14179#true} is VALID [2022-04-27 14:42:50,765 INFO L272 TraceCheckUtils]: 6: Hoare triple {14179#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {14179#true} is VALID [2022-04-27 14:42:50,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,765 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14179#true} {14179#true} #52#return; {14179#true} is VALID [2022-04-27 14:42:50,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {14179#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {14217#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:50,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {14217#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {14217#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:50,766 INFO L272 TraceCheckUtils]: 13: Hoare triple {14217#(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)); {14179#true} is VALID [2022-04-27 14:42:50,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,766 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14179#true} {14217#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {14217#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:50,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {14217#(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; {14239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:42:50,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {14239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {14239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:42:50,767 INFO L272 TraceCheckUtils]: 20: Hoare triple {14239#(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)); {14179#true} is VALID [2022-04-27 14:42:50,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,767 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {14179#true} {14239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {14239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:42:50,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {14239#(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; {14261#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:42:50,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {14261#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {14261#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:42:50,768 INFO L272 TraceCheckUtils]: 27: Hoare triple {14261#(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)); {14179#true} is VALID [2022-04-27 14:42:50,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,769 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14179#true} {14261#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {14261#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:42:50,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {14261#(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; {14283#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:42:50,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {14283#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {14283#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:42:50,769 INFO L272 TraceCheckUtils]: 34: Hoare triple {14283#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-27 14:42:50,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,770 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14179#true} {14283#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {14283#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:42:50,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {14283#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14305#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:42:50,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {14305#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !false; {14305#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:42:50,771 INFO L272 TraceCheckUtils]: 41: Hoare triple {14305#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-27 14:42:50,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,771 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14179#true} {14305#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #54#return; {14305#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:42:50,771 INFO L290 TraceCheckUtils]: 46: Hoare triple {14305#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14327#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:42:50,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {14327#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} assume !false; {14327#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:42:50,772 INFO L272 TraceCheckUtils]: 48: Hoare triple {14327#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-27 14:42:50,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,772 INFO L290 TraceCheckUtils]: 50: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,772 INFO L290 TraceCheckUtils]: 51: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,772 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14179#true} {14327#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} #54#return; {14327#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:42:50,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {14327#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14349#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:42:50,773 INFO L290 TraceCheckUtils]: 54: Hoare triple {14349#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {14349#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:42:50,773 INFO L272 TraceCheckUtils]: 55: Hoare triple {14349#(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)); {14179#true} is VALID [2022-04-27 14:42:50,773 INFO L290 TraceCheckUtils]: 56: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,773 INFO L290 TraceCheckUtils]: 57: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,773 INFO L290 TraceCheckUtils]: 58: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,773 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14179#true} {14349#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {14349#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:42:50,774 INFO L290 TraceCheckUtils]: 60: Hoare triple {14349#(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; {14371#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:42:50,774 INFO L290 TraceCheckUtils]: 61: Hoare triple {14371#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {14371#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:42:50,774 INFO L272 TraceCheckUtils]: 62: Hoare triple {14371#(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)); {14179#true} is VALID [2022-04-27 14:42:50,774 INFO L290 TraceCheckUtils]: 63: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,774 INFO L290 TraceCheckUtils]: 64: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,774 INFO L290 TraceCheckUtils]: 65: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,774 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14179#true} {14371#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {14371#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:42:50,775 INFO L290 TraceCheckUtils]: 67: Hoare triple {14371#(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; {14393#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-27 14:42:50,775 INFO L290 TraceCheckUtils]: 68: Hoare triple {14393#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {14393#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-27 14:42:50,775 INFO L272 TraceCheckUtils]: 69: Hoare triple {14393#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-27 14:42:50,775 INFO L290 TraceCheckUtils]: 70: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,775 INFO L290 TraceCheckUtils]: 71: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,775 INFO L290 TraceCheckUtils]: 72: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,776 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {14179#true} {14393#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #54#return; {14393#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-27 14:42:50,776 INFO L290 TraceCheckUtils]: 74: Hoare triple {14393#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14415#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:50,776 INFO L290 TraceCheckUtils]: 75: Hoare triple {14415#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} assume !false; {14415#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:50,776 INFO L272 TraceCheckUtils]: 76: Hoare triple {14415#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-27 14:42:50,776 INFO L290 TraceCheckUtils]: 77: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,776 INFO L290 TraceCheckUtils]: 78: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,776 INFO L290 TraceCheckUtils]: 79: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,777 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {14179#true} {14415#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} #54#return; {14415#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:50,777 INFO L290 TraceCheckUtils]: 81: Hoare triple {14415#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14437#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:42:50,777 INFO L290 TraceCheckUtils]: 82: Hoare triple {14437#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {14437#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:42:50,778 INFO L272 TraceCheckUtils]: 83: Hoare triple {14437#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-27 14:42:50,778 INFO L290 TraceCheckUtils]: 84: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,778 INFO L290 TraceCheckUtils]: 85: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,778 INFO L290 TraceCheckUtils]: 86: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,778 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14179#true} {14437#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {14437#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:42:50,778 INFO L290 TraceCheckUtils]: 88: Hoare triple {14437#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14459#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:42:50,779 INFO L290 TraceCheckUtils]: 89: Hoare triple {14459#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {14459#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:42:50,779 INFO L272 TraceCheckUtils]: 90: Hoare triple {14459#(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)); {14179#true} is VALID [2022-04-27 14:42:50,779 INFO L290 TraceCheckUtils]: 91: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,779 INFO L290 TraceCheckUtils]: 92: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,779 INFO L290 TraceCheckUtils]: 93: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,779 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {14179#true} {14459#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {14459#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:42:50,779 INFO L290 TraceCheckUtils]: 95: Hoare triple {14459#(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; {14481#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:42:50,780 INFO L290 TraceCheckUtils]: 96: Hoare triple {14481#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {14481#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:42:50,780 INFO L272 TraceCheckUtils]: 97: Hoare triple {14481#(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)); {14179#true} is VALID [2022-04-27 14:42:50,780 INFO L290 TraceCheckUtils]: 98: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,780 INFO L290 TraceCheckUtils]: 99: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,780 INFO L290 TraceCheckUtils]: 100: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,780 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {14179#true} {14481#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {14481#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:42:50,781 INFO L290 TraceCheckUtils]: 102: Hoare triple {14481#(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; {14503#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:42:50,781 INFO L290 TraceCheckUtils]: 103: Hoare triple {14503#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {14503#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:42:50,781 INFO L272 TraceCheckUtils]: 104: Hoare triple {14503#(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)); {14179#true} is VALID [2022-04-27 14:42:50,781 INFO L290 TraceCheckUtils]: 105: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,781 INFO L290 TraceCheckUtils]: 106: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,781 INFO L290 TraceCheckUtils]: 107: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,781 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {14179#true} {14503#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {14503#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:42:50,782 INFO L290 TraceCheckUtils]: 109: Hoare triple {14503#(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; {14525#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:42:50,782 INFO L290 TraceCheckUtils]: 110: Hoare triple {14525#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {14525#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:42:50,782 INFO L272 TraceCheckUtils]: 111: Hoare triple {14525#(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)); {14179#true} is VALID [2022-04-27 14:42:50,782 INFO L290 TraceCheckUtils]: 112: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,782 INFO L290 TraceCheckUtils]: 113: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,782 INFO L290 TraceCheckUtils]: 114: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,783 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {14179#true} {14525#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {14525#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:42:50,783 INFO L290 TraceCheckUtils]: 116: Hoare triple {14525#(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; {14547#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:50,783 INFO L290 TraceCheckUtils]: 117: Hoare triple {14547#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !false; {14547#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:50,783 INFO L272 TraceCheckUtils]: 118: Hoare triple {14547#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-27 14:42:50,783 INFO L290 TraceCheckUtils]: 119: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,783 INFO L290 TraceCheckUtils]: 120: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,783 INFO L290 TraceCheckUtils]: 121: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,784 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {14179#true} {14547#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} #54#return; {14547#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:50,784 INFO L290 TraceCheckUtils]: 123: Hoare triple {14547#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14569#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:42:50,784 INFO L290 TraceCheckUtils]: 124: Hoare triple {14569#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {14569#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:42:50,784 INFO L272 TraceCheckUtils]: 125: Hoare triple {14569#(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)); {14179#true} is VALID [2022-04-27 14:42:50,784 INFO L290 TraceCheckUtils]: 126: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,785 INFO L290 TraceCheckUtils]: 127: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,785 INFO L290 TraceCheckUtils]: 128: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,785 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {14179#true} {14569#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {14569#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:42:50,785 INFO L290 TraceCheckUtils]: 130: Hoare triple {14569#(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; {14591#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-27 14:42:50,786 INFO L290 TraceCheckUtils]: 131: Hoare triple {14591#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {14591#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-27 14:42:50,786 INFO L272 TraceCheckUtils]: 132: Hoare triple {14591#(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)); {14179#true} is VALID [2022-04-27 14:42:50,786 INFO L290 TraceCheckUtils]: 133: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,786 INFO L290 TraceCheckUtils]: 134: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,786 INFO L290 TraceCheckUtils]: 135: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,786 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {14179#true} {14591#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #54#return; {14591#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-27 14:42:50,786 INFO L290 TraceCheckUtils]: 137: Hoare triple {14591#(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; {14613#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-27 14:42:50,787 INFO L290 TraceCheckUtils]: 138: Hoare triple {14613#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} assume !false; {14613#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-27 14:42:50,787 INFO L272 TraceCheckUtils]: 139: Hoare triple {14613#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-27 14:42:50,787 INFO L290 TraceCheckUtils]: 140: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,787 INFO L290 TraceCheckUtils]: 141: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,787 INFO L290 TraceCheckUtils]: 142: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,787 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {14179#true} {14613#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} #54#return; {14613#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-27 14:42:50,788 INFO L290 TraceCheckUtils]: 144: Hoare triple {14613#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14635#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-27 14:42:50,788 INFO L290 TraceCheckUtils]: 145: Hoare triple {14635#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !false; {14635#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-27 14:42:50,788 INFO L272 TraceCheckUtils]: 146: Hoare triple {14635#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-27 14:42:50,788 INFO L290 TraceCheckUtils]: 147: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,788 INFO L290 TraceCheckUtils]: 148: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,788 INFO L290 TraceCheckUtils]: 149: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,788 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {14179#true} {14635#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} #54#return; {14635#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-27 14:42:50,789 INFO L290 TraceCheckUtils]: 151: Hoare triple {14635#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14657#(and (<= main_~c~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} is VALID [2022-04-27 14:42:50,789 INFO L290 TraceCheckUtils]: 152: Hoare triple {14657#(and (<= main_~c~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} assume !false; {14657#(and (<= main_~c~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} is VALID [2022-04-27 14:42:50,789 INFO L272 TraceCheckUtils]: 153: Hoare triple {14657#(and (<= main_~c~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-27 14:42:50,789 INFO L290 TraceCheckUtils]: 154: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-27 14:42:50,789 INFO L290 TraceCheckUtils]: 155: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-27 14:42:50,789 INFO L290 TraceCheckUtils]: 156: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-27 14:42:50,790 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {14179#true} {14657#(and (<= main_~c~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} #54#return; {14657#(and (<= main_~c~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} is VALID [2022-04-27 14:42:50,790 INFO L290 TraceCheckUtils]: 158: Hoare triple {14657#(and (<= main_~c~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} assume !(~c~0 < ~k~0); {14679#(and (<= main_~k~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} is VALID [2022-04-27 14:42:50,791 INFO L272 TraceCheckUtils]: 159: Hoare triple {14679#(and (<= main_~k~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:50,791 INFO L290 TraceCheckUtils]: 160: Hoare triple {14683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:50,792 INFO L290 TraceCheckUtils]: 161: Hoare triple {14687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14180#false} is VALID [2022-04-27 14:42:50,792 INFO L290 TraceCheckUtils]: 162: Hoare triple {14180#false} assume !false; {14180#false} is VALID [2022-04-27 14:42:50,792 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-27 14:42:50,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:51,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:51,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788844702] [2022-04-27 14:42:51,131 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:51,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407822574] [2022-04-27 14:42:51,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407822574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:51,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:51,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-04-27 14:42:51,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824239427] [2022-04-27 14:42:51,131 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:51,132 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-27 14:42:51,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:51,132 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-27 14:42:51,230 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-27 14:42:51,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 14:42:51,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:51,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 14:42:51,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-27 14:42:51,231 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-27 14:42:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:55,691 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-04-27 14:42:55,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-27 14:42:55,691 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-27 14:42:55,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:55,691 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-27 14:42:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-27 14:42:55,693 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-27 14:42:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-27 14:42:55,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 112 transitions. [2022-04-27 14:42:55,804 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-27 14:42:55,805 INFO L225 Difference]: With dead ends: 96 [2022-04-27 14:42:55,805 INFO L226 Difference]: Without dead ends: 91 [2022-04-27 14:42:55,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2022-04-27 14:42:55,805 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:55,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 989 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 14:42:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-27 14:42:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-27 14:42:55,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:55,874 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-27 14:42:55,874 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-27 14:42:55,874 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-27 14:42:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:55,875 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-27 14:42:55,875 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-27 14:42:55,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:55,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:55,876 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-27 14:42:55,876 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-27 14:42:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:55,877 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-27 14:42:55,877 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-27 14:42:55,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:55,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:55,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:55,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:55,878 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-27 14:42:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-04-27 14:42:55,879 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 163 [2022-04-27 14:42:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:55,879 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-04-27 14:42:55,880 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-27 14:42:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-27 14:42:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-04-27 14:42:55,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:55,881 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-27 14:42:55,888 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-27 14:42:56,086 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-27 14:42:56,086 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:56,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:56,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1329797496, now seen corresponding path program 21 times [2022-04-27 14:42:56,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:56,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890088583] [2022-04-27 14:42:56,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:56,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:56,099 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:56,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [799588262] [2022-04-27 14:42:56,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:42:56,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:56,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:56,100 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-27 14:42:56,101 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-27 14:42:56,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2022-04-27 14:42:56,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:56,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-27 14:42:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:56,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:57,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {15218#true} call ULTIMATE.init(); {15218#true} is VALID [2022-04-27 14:42:57,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {15218#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); {15218#true} is VALID [2022-04-27 14:42:57,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15218#true} {15218#true} #60#return; {15218#true} is VALID [2022-04-27 14:42:57,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {15218#true} call #t~ret5 := main(); {15218#true} is VALID [2022-04-27 14:42:57,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {15218#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; {15218#true} is VALID [2022-04-27 14:42:57,869 INFO L272 TraceCheckUtils]: 6: Hoare triple {15218#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {15218#true} is VALID [2022-04-27 14:42:57,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,869 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15218#true} {15218#true} #52#return; {15218#true} is VALID [2022-04-27 14:42:57,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {15218#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15256#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:57,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {15256#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {15256#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:57,870 INFO L272 TraceCheckUtils]: 13: Hoare triple {15256#(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)); {15218#true} is VALID [2022-04-27 14:42:57,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,870 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15218#true} {15256#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {15256#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:57,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {15256#(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; {15278#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:57,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {15278#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {15278#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:57,871 INFO L272 TraceCheckUtils]: 20: Hoare triple {15278#(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)); {15218#true} is VALID [2022-04-27 14:42:57,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,872 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {15218#true} {15278#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {15278#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:57,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {15278#(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; {15300#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:42:57,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {15300#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {15300#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:42:57,873 INFO L272 TraceCheckUtils]: 27: Hoare triple {15300#(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)); {15218#true} is VALID [2022-04-27 14:42:57,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,874 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15218#true} {15300#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {15300#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:42:57,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {15300#(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; {15322#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 14:42:57,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {15322#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} assume !false; {15322#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 14:42:57,875 INFO L272 TraceCheckUtils]: 34: Hoare triple {15322#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-27 14:42:57,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,875 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15218#true} {15322#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} #54#return; {15322#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 14:42:57,876 INFO L290 TraceCheckUtils]: 39: Hoare triple {15322#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15344#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-27 14:42:57,876 INFO L290 TraceCheckUtils]: 40: Hoare triple {15344#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !false; {15344#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-27 14:42:57,876 INFO L272 TraceCheckUtils]: 41: Hoare triple {15344#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-27 14:42:57,876 INFO L290 TraceCheckUtils]: 42: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,876 INFO L290 TraceCheckUtils]: 44: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,877 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15218#true} {15344#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} #54#return; {15344#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-27 14:42:57,877 INFO L290 TraceCheckUtils]: 46: Hoare triple {15344#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15366#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:57,878 INFO L290 TraceCheckUtils]: 47: Hoare triple {15366#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {15366#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:57,878 INFO L272 TraceCheckUtils]: 48: Hoare triple {15366#(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)); {15218#true} is VALID [2022-04-27 14:42:57,878 INFO L290 TraceCheckUtils]: 49: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,878 INFO L290 TraceCheckUtils]: 50: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,878 INFO L290 TraceCheckUtils]: 51: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,878 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15218#true} {15366#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {15366#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:57,879 INFO L290 TraceCheckUtils]: 53: Hoare triple {15366#(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; {15388#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:42:57,879 INFO L290 TraceCheckUtils]: 54: Hoare triple {15388#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {15388#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:42:57,879 INFO L272 TraceCheckUtils]: 55: Hoare triple {15388#(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)); {15218#true} is VALID [2022-04-27 14:42:57,879 INFO L290 TraceCheckUtils]: 56: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,879 INFO L290 TraceCheckUtils]: 57: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,880 INFO L290 TraceCheckUtils]: 58: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,880 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15218#true} {15388#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {15388#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:42:57,880 INFO L290 TraceCheckUtils]: 60: Hoare triple {15388#(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; {15410#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:42:57,881 INFO L290 TraceCheckUtils]: 61: Hoare triple {15410#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {15410#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:42:57,881 INFO L272 TraceCheckUtils]: 62: Hoare triple {15410#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-27 14:42:57,881 INFO L290 TraceCheckUtils]: 63: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,881 INFO L290 TraceCheckUtils]: 64: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,881 INFO L290 TraceCheckUtils]: 65: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,882 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15218#true} {15410#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {15410#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:42:57,882 INFO L290 TraceCheckUtils]: 67: Hoare triple {15410#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15432#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:42:57,883 INFO L290 TraceCheckUtils]: 68: Hoare triple {15432#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {15432#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:42:57,883 INFO L272 TraceCheckUtils]: 69: Hoare triple {15432#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-27 14:42:57,883 INFO L290 TraceCheckUtils]: 70: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,883 INFO L290 TraceCheckUtils]: 71: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,883 INFO L290 TraceCheckUtils]: 72: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,883 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15218#true} {15432#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #54#return; {15432#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:42:57,884 INFO L290 TraceCheckUtils]: 74: Hoare triple {15432#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15454#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:57,884 INFO L290 TraceCheckUtils]: 75: Hoare triple {15454#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !false; {15454#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:57,884 INFO L272 TraceCheckUtils]: 76: Hoare triple {15454#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-27 14:42:57,884 INFO L290 TraceCheckUtils]: 77: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,884 INFO L290 TraceCheckUtils]: 78: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,885 INFO L290 TraceCheckUtils]: 79: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,885 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15218#true} {15454#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} #54#return; {15454#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:57,885 INFO L290 TraceCheckUtils]: 81: Hoare triple {15454#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15476#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-27 14:42:57,886 INFO L290 TraceCheckUtils]: 82: Hoare triple {15476#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !false; {15476#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-27 14:42:57,886 INFO L272 TraceCheckUtils]: 83: Hoare triple {15476#(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)); {15218#true} is VALID [2022-04-27 14:42:57,886 INFO L290 TraceCheckUtils]: 84: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,886 INFO L290 TraceCheckUtils]: 85: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,886 INFO L290 TraceCheckUtils]: 86: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,886 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {15218#true} {15476#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} #54#return; {15476#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-27 14:42:57,887 INFO L290 TraceCheckUtils]: 88: Hoare triple {15476#(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; {15498#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:42:57,887 INFO L290 TraceCheckUtils]: 89: Hoare triple {15498#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {15498#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:42:57,887 INFO L272 TraceCheckUtils]: 90: Hoare triple {15498#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-27 14:42:57,887 INFO L290 TraceCheckUtils]: 91: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,887 INFO L290 TraceCheckUtils]: 92: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,887 INFO L290 TraceCheckUtils]: 93: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,888 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {15218#true} {15498#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {15498#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:42:57,888 INFO L290 TraceCheckUtils]: 95: Hoare triple {15498#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15520#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:42:57,888 INFO L290 TraceCheckUtils]: 96: Hoare triple {15520#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {15520#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:42:57,888 INFO L272 TraceCheckUtils]: 97: Hoare triple {15520#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-27 14:42:57,888 INFO L290 TraceCheckUtils]: 98: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,889 INFO L290 TraceCheckUtils]: 99: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,889 INFO L290 TraceCheckUtils]: 100: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,889 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15218#true} {15520#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #54#return; {15520#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:42:57,889 INFO L290 TraceCheckUtils]: 102: Hoare triple {15520#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15542#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:42:57,890 INFO L290 TraceCheckUtils]: 103: Hoare triple {15542#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} assume !false; {15542#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:42:57,890 INFO L272 TraceCheckUtils]: 104: Hoare triple {15542#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-27 14:42:57,890 INFO L290 TraceCheckUtils]: 105: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,890 INFO L290 TraceCheckUtils]: 106: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,890 INFO L290 TraceCheckUtils]: 107: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,890 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15218#true} {15542#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} #54#return; {15542#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:42:57,891 INFO L290 TraceCheckUtils]: 109: Hoare triple {15542#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15564#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:57,891 INFO L290 TraceCheckUtils]: 110: Hoare triple {15564#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} assume !false; {15564#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:57,891 INFO L272 TraceCheckUtils]: 111: Hoare triple {15564#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-27 14:42:57,891 INFO L290 TraceCheckUtils]: 112: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,891 INFO L290 TraceCheckUtils]: 113: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,891 INFO L290 TraceCheckUtils]: 114: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,892 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {15218#true} {15564#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} #54#return; {15564#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:57,892 INFO L290 TraceCheckUtils]: 116: Hoare triple {15564#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15586#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:57,892 INFO L290 TraceCheckUtils]: 117: Hoare triple {15586#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {15586#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:57,892 INFO L272 TraceCheckUtils]: 118: Hoare triple {15586#(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)); {15218#true} is VALID [2022-04-27 14:42:57,892 INFO L290 TraceCheckUtils]: 119: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,892 INFO L290 TraceCheckUtils]: 120: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,892 INFO L290 TraceCheckUtils]: 121: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,893 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {15218#true} {15586#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {15586#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:57,893 INFO L290 TraceCheckUtils]: 123: Hoare triple {15586#(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; {15608#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-27 14:42:57,894 INFO L290 TraceCheckUtils]: 124: Hoare triple {15608#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} assume !false; {15608#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-27 14:42:57,894 INFO L272 TraceCheckUtils]: 125: Hoare triple {15608#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-27 14:42:57,894 INFO L290 TraceCheckUtils]: 126: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,894 INFO L290 TraceCheckUtils]: 127: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,894 INFO L290 TraceCheckUtils]: 128: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,894 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {15218#true} {15608#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} #54#return; {15608#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-27 14:42:57,894 INFO L290 TraceCheckUtils]: 130: Hoare triple {15608#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15630#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:57,895 INFO L290 TraceCheckUtils]: 131: Hoare triple {15630#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} assume !false; {15630#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:57,895 INFO L272 TraceCheckUtils]: 132: Hoare triple {15630#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-27 14:42:57,895 INFO L290 TraceCheckUtils]: 133: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,895 INFO L290 TraceCheckUtils]: 134: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,895 INFO L290 TraceCheckUtils]: 135: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,895 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {15218#true} {15630#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} #54#return; {15630#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:57,896 INFO L290 TraceCheckUtils]: 137: Hoare triple {15630#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15652#(and (= (+ main_~c~0 (- 3)) 15) (= (+ main_~y~0 (- 4)) 14))} is VALID [2022-04-27 14:42:57,896 INFO L290 TraceCheckUtils]: 138: Hoare triple {15652#(and (= (+ main_~c~0 (- 3)) 15) (= (+ main_~y~0 (- 4)) 14))} assume !false; {15652#(and (= (+ main_~c~0 (- 3)) 15) (= (+ main_~y~0 (- 4)) 14))} is VALID [2022-04-27 14:42:57,896 INFO L272 TraceCheckUtils]: 139: Hoare triple {15652#(and (= (+ main_~c~0 (- 3)) 15) (= (+ main_~y~0 (- 4)) 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)); {15218#true} is VALID [2022-04-27 14:42:57,896 INFO L290 TraceCheckUtils]: 140: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,896 INFO L290 TraceCheckUtils]: 141: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,896 INFO L290 TraceCheckUtils]: 142: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,897 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {15218#true} {15652#(and (= (+ main_~c~0 (- 3)) 15) (= (+ main_~y~0 (- 4)) 14))} #54#return; {15652#(and (= (+ main_~c~0 (- 3)) 15) (= (+ main_~y~0 (- 4)) 14))} is VALID [2022-04-27 14:42:57,897 INFO L290 TraceCheckUtils]: 144: Hoare triple {15652#(and (= (+ main_~c~0 (- 3)) 15) (= (+ main_~y~0 (- 4)) 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; {15674#(and (= 14 (+ main_~y~0 (- 5))) (= 15 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:42:57,897 INFO L290 TraceCheckUtils]: 145: Hoare triple {15674#(and (= 14 (+ main_~y~0 (- 5))) (= 15 (+ main_~c~0 (- 4))))} assume !false; {15674#(and (= 14 (+ main_~y~0 (- 5))) (= 15 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:42:57,897 INFO L272 TraceCheckUtils]: 146: Hoare triple {15674#(and (= 14 (+ main_~y~0 (- 5))) (= 15 (+ 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)); {15218#true} is VALID [2022-04-27 14:42:57,898 INFO L290 TraceCheckUtils]: 147: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,898 INFO L290 TraceCheckUtils]: 148: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,898 INFO L290 TraceCheckUtils]: 149: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,898 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {15218#true} {15674#(and (= 14 (+ main_~y~0 (- 5))) (= 15 (+ main_~c~0 (- 4))))} #54#return; {15674#(and (= 14 (+ main_~y~0 (- 5))) (= 15 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:42:57,898 INFO L290 TraceCheckUtils]: 151: Hoare triple {15674#(and (= 14 (+ main_~y~0 (- 5))) (= 15 (+ 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; {15696#(and (= 15 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 14))} is VALID [2022-04-27 14:42:57,899 INFO L290 TraceCheckUtils]: 152: Hoare triple {15696#(and (= 15 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 14))} assume !false; {15696#(and (= 15 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 14))} is VALID [2022-04-27 14:42:57,899 INFO L272 TraceCheckUtils]: 153: Hoare triple {15696#(and (= 15 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 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)); {15218#true} is VALID [2022-04-27 14:42:57,899 INFO L290 TraceCheckUtils]: 154: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,899 INFO L290 TraceCheckUtils]: 155: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,899 INFO L290 TraceCheckUtils]: 156: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,899 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {15218#true} {15696#(and (= 15 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 14))} #54#return; {15696#(and (= 15 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 14))} is VALID [2022-04-27 14:42:57,900 INFO L290 TraceCheckUtils]: 158: Hoare triple {15696#(and (= 15 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 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; {15718#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-27 14:42:57,900 INFO L290 TraceCheckUtils]: 159: Hoare triple {15718#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} assume !false; {15718#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-27 14:42:57,900 INFO L272 TraceCheckUtils]: 160: Hoare triple {15718#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-27 14:42:57,900 INFO L290 TraceCheckUtils]: 161: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-27 14:42:57,900 INFO L290 TraceCheckUtils]: 162: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-27 14:42:57,900 INFO L290 TraceCheckUtils]: 163: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-27 14:42:57,901 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {15218#true} {15718#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} #54#return; {15718#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-27 14:42:57,902 INFO L290 TraceCheckUtils]: 165: Hoare triple {15718#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} assume !(~c~0 < ~k~0); {15740#(and (< 20 main_~k~0) (= main_~y~0 21) (<= main_~k~0 21))} is VALID [2022-04-27 14:42:57,903 INFO L272 TraceCheckUtils]: 166: Hoare triple {15740#(and (< 20 main_~k~0) (= main_~y~0 21) (<= main_~k~0 21))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15744#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:57,903 INFO L290 TraceCheckUtils]: 167: Hoare triple {15744#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15748#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:57,904 INFO L290 TraceCheckUtils]: 168: Hoare triple {15748#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15219#false} is VALID [2022-04-27 14:42:57,904 INFO L290 TraceCheckUtils]: 169: Hoare triple {15219#false} assume !false; {15219#false} is VALID [2022-04-27 14:42:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 44 proven. 693 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-27 14:42:57,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:58,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:58,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890088583] [2022-04-27 14:42:58,142 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:58,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799588262] [2022-04-27 14:42:58,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799588262] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:58,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:58,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-04-27 14:42:58,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594799989] [2022-04-27 14:42:58,142 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:58,142 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Word has length 170 [2022-04-27 14:42:58,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:58,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-27 14:42:58,229 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-27 14:42:58,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-27 14:42:58,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:58,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-27 14:42:58,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2022-04-27 14:42:58,230 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-27 14:43:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:02,780 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2022-04-27 14:43:02,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-27 14:43:02,780 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Word has length 170 [2022-04-27 14:43:02,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:43:02,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-27 14:43:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 116 transitions. [2022-04-27 14:43:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-27 14:43:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 116 transitions. [2022-04-27 14:43:02,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 116 transitions. [2022-04-27 14:43:02,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:02,926 INFO L225 Difference]: With dead ends: 99 [2022-04-27 14:43:02,926 INFO L226 Difference]: Without dead ends: 94 [2022-04-27 14:43:02,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2022-04-27 14:43:02,927 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 2 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:43:02,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1055 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 14:43:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-27 14:43:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-27 14:43:02,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:43:02,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 14:43:02,998 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 14:43:02,998 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 14:43:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:03,000 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-27 14:43:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-27 14:43:03,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:03,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:03,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 94 states. [2022-04-27 14:43:03,000 INFO L87 Difference]: Start difference. First operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 94 states. [2022-04-27 14:43:03,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:03,002 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-27 14:43:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-27 14:43:03,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:03,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:03,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:43:03,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:43:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 14:43:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2022-04-27 14:43:03,005 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 170 [2022-04-27 14:43:03,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:43:03,005 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2022-04-27 14:43:03,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-27 14:43:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-27 14:43:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-04-27 14:43:03,006 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:43:03,006 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:43:03,029 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-27 14:43:03,227 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-27 14:43:03,227 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:43:03,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:43:03,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1612717687, now seen corresponding path program 22 times [2022-04-27 14:43:03,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:43:03,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567039481] [2022-04-27 14:43:03,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:43:03,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:43:03,249 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:43:03,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758287053] [2022-04-27 14:43:03,249 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:43:03,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:43:03,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:43:03,250 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:43:03,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-27 14:43:03,803 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:43:03,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:43:03,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-27 14:43:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:43:03,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:43:04,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {16295#true} call ULTIMATE.init(); {16295#true} is VALID [2022-04-27 14:43:04,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {16295#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); {16295#true} is VALID [2022-04-27 14:43:04,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16295#true} {16295#true} #60#return; {16295#true} is VALID [2022-04-27 14:43:04,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {16295#true} call #t~ret5 := main(); {16295#true} is VALID [2022-04-27 14:43:04,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {16295#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; {16295#true} is VALID [2022-04-27 14:43:04,823 INFO L272 TraceCheckUtils]: 6: Hoare triple {16295#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {16295#true} is VALID [2022-04-27 14:43:04,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,823 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16295#true} {16295#true} #52#return; {16295#true} is VALID [2022-04-27 14:43:04,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {16295#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {16333#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:04,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {16333#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {16333#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:04,824 INFO L272 TraceCheckUtils]: 13: Hoare triple {16333#(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)); {16295#true} is VALID [2022-04-27 14:43:04,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,824 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16295#true} {16333#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {16333#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:04,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {16333#(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; {16355#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:43:04,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {16355#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {16355#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:43:04,825 INFO L272 TraceCheckUtils]: 20: Hoare triple {16355#(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)); {16295#true} is VALID [2022-04-27 14:43:04,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,826 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {16295#true} {16355#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {16355#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:43:04,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {16355#(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; {16377#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:43:04,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {16377#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {16377#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:43:04,826 INFO L272 TraceCheckUtils]: 27: Hoare triple {16377#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-27 14:43:04,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,827 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16295#true} {16377#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #54#return; {16377#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:43:04,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {16377#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16399#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:43:04,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {16399#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {16399#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:43:04,828 INFO L272 TraceCheckUtils]: 34: Hoare triple {16399#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-27 14:43:04,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,828 INFO L290 TraceCheckUtils]: 36: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,828 INFO L290 TraceCheckUtils]: 37: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,828 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16295#true} {16399#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {16399#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:43:04,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {16399#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16421#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:43:04,829 INFO L290 TraceCheckUtils]: 40: Hoare triple {16421#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !false; {16421#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:43:04,829 INFO L272 TraceCheckUtils]: 41: Hoare triple {16421#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-27 14:43:04,829 INFO L290 TraceCheckUtils]: 42: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,829 INFO L290 TraceCheckUtils]: 43: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,829 INFO L290 TraceCheckUtils]: 44: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,830 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16295#true} {16421#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #54#return; {16421#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:43:04,830 INFO L290 TraceCheckUtils]: 46: Hoare triple {16421#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16443#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:43:04,830 INFO L290 TraceCheckUtils]: 47: Hoare triple {16443#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {16443#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:43:04,830 INFO L272 TraceCheckUtils]: 48: Hoare triple {16443#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-27 14:43:04,830 INFO L290 TraceCheckUtils]: 49: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,830 INFO L290 TraceCheckUtils]: 50: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,830 INFO L290 TraceCheckUtils]: 51: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,831 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16295#true} {16443#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {16443#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:43:04,831 INFO L290 TraceCheckUtils]: 53: Hoare triple {16443#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16465#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:43:04,832 INFO L290 TraceCheckUtils]: 54: Hoare triple {16465#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {16465#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:43:04,832 INFO L272 TraceCheckUtils]: 55: Hoare triple {16465#(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)); {16295#true} is VALID [2022-04-27 14:43:04,832 INFO L290 TraceCheckUtils]: 56: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,832 INFO L290 TraceCheckUtils]: 57: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,832 INFO L290 TraceCheckUtils]: 58: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,832 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16295#true} {16465#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {16465#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:43:04,832 INFO L290 TraceCheckUtils]: 60: Hoare triple {16465#(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; {16487#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:04,833 INFO L290 TraceCheckUtils]: 61: Hoare triple {16487#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {16487#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:04,833 INFO L272 TraceCheckUtils]: 62: Hoare triple {16487#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-27 14:43:04,833 INFO L290 TraceCheckUtils]: 63: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,833 INFO L290 TraceCheckUtils]: 64: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,833 INFO L290 TraceCheckUtils]: 65: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,833 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16295#true} {16487#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #54#return; {16487#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:04,834 INFO L290 TraceCheckUtils]: 67: Hoare triple {16487#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16509#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 14:43:04,834 INFO L290 TraceCheckUtils]: 68: Hoare triple {16509#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {16509#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 14:43:04,834 INFO L272 TraceCheckUtils]: 69: Hoare triple {16509#(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)); {16295#true} is VALID [2022-04-27 14:43:04,834 INFO L290 TraceCheckUtils]: 70: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,834 INFO L290 TraceCheckUtils]: 71: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,834 INFO L290 TraceCheckUtils]: 72: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,835 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16295#true} {16509#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #54#return; {16509#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 14:43:04,835 INFO L290 TraceCheckUtils]: 74: Hoare triple {16509#(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; {16531#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:43:04,835 INFO L290 TraceCheckUtils]: 75: Hoare triple {16531#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !false; {16531#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:43:04,835 INFO L272 TraceCheckUtils]: 76: Hoare triple {16531#(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)); {16295#true} is VALID [2022-04-27 14:43:04,835 INFO L290 TraceCheckUtils]: 77: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,836 INFO L290 TraceCheckUtils]: 78: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,836 INFO L290 TraceCheckUtils]: 79: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,836 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16295#true} {16531#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #54#return; {16531#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:43:04,836 INFO L290 TraceCheckUtils]: 81: Hoare triple {16531#(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; {16553#(and (= 8 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 3))))} is VALID [2022-04-27 14:43:04,837 INFO L290 TraceCheckUtils]: 82: Hoare triple {16553#(and (= 8 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 3))))} assume !false; {16553#(and (= 8 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 3))))} is VALID [2022-04-27 14:43:04,837 INFO L272 TraceCheckUtils]: 83: Hoare triple {16553#(and (= 8 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-27 14:43:04,837 INFO L290 TraceCheckUtils]: 84: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,837 INFO L290 TraceCheckUtils]: 85: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,837 INFO L290 TraceCheckUtils]: 86: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,837 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {16295#true} {16553#(and (= 8 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 3))))} #54#return; {16553#(and (= 8 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 3))))} is VALID [2022-04-27 14:43:04,838 INFO L290 TraceCheckUtils]: 88: Hoare triple {16553#(and (= 8 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16575#(and (= (+ main_~c~0 (- 3)) 8) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-27 14:43:04,838 INFO L290 TraceCheckUtils]: 89: Hoare triple {16575#(and (= (+ main_~c~0 (- 3)) 8) (= 7 (+ main_~y~0 (- 4))))} assume !false; {16575#(and (= (+ main_~c~0 (- 3)) 8) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-27 14:43:04,838 INFO L272 TraceCheckUtils]: 90: Hoare triple {16575#(and (= (+ main_~c~0 (- 3)) 8) (= 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)); {16295#true} is VALID [2022-04-27 14:43:04,838 INFO L290 TraceCheckUtils]: 91: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,838 INFO L290 TraceCheckUtils]: 92: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,838 INFO L290 TraceCheckUtils]: 93: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,839 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {16295#true} {16575#(and (= (+ main_~c~0 (- 3)) 8) (= 7 (+ main_~y~0 (- 4))))} #54#return; {16575#(and (= (+ main_~c~0 (- 3)) 8) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-27 14:43:04,839 INFO L290 TraceCheckUtils]: 95: Hoare triple {16575#(and (= (+ main_~c~0 (- 3)) 8) (= 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; {16597#(and (= main_~y~0 12) (= 8 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:43:04,839 INFO L290 TraceCheckUtils]: 96: Hoare triple {16597#(and (= main_~y~0 12) (= 8 (+ main_~c~0 (- 4))))} assume !false; {16597#(and (= main_~y~0 12) (= 8 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:43:04,839 INFO L272 TraceCheckUtils]: 97: Hoare triple {16597#(and (= main_~y~0 12) (= 8 (+ 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)); {16295#true} is VALID [2022-04-27 14:43:04,839 INFO L290 TraceCheckUtils]: 98: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,839 INFO L290 TraceCheckUtils]: 99: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,840 INFO L290 TraceCheckUtils]: 100: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,840 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {16295#true} {16597#(and (= main_~y~0 12) (= 8 (+ main_~c~0 (- 4))))} #54#return; {16597#(and (= main_~y~0 12) (= 8 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:43:04,840 INFO L290 TraceCheckUtils]: 102: Hoare triple {16597#(and (= main_~y~0 12) (= 8 (+ 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; {16619#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:04,841 INFO L290 TraceCheckUtils]: 103: Hoare triple {16619#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {16619#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:04,841 INFO L272 TraceCheckUtils]: 104: Hoare triple {16619#(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)); {16295#true} is VALID [2022-04-27 14:43:04,841 INFO L290 TraceCheckUtils]: 105: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,841 INFO L290 TraceCheckUtils]: 106: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,841 INFO L290 TraceCheckUtils]: 107: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,841 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16295#true} {16619#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {16619#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:04,842 INFO L290 TraceCheckUtils]: 109: Hoare triple {16619#(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; {16641#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:43:04,842 INFO L290 TraceCheckUtils]: 110: Hoare triple {16641#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} assume !false; {16641#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:43:04,842 INFO L272 TraceCheckUtils]: 111: Hoare triple {16641#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-27 14:43:04,842 INFO L290 TraceCheckUtils]: 112: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,842 INFO L290 TraceCheckUtils]: 113: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,842 INFO L290 TraceCheckUtils]: 114: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,843 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {16295#true} {16641#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} #54#return; {16641#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:43:04,843 INFO L290 TraceCheckUtils]: 116: Hoare triple {16641#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16663#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:43:04,843 INFO L290 TraceCheckUtils]: 117: Hoare triple {16663#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {16663#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:43:04,843 INFO L272 TraceCheckUtils]: 118: Hoare triple {16663#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-27 14:43:04,843 INFO L290 TraceCheckUtils]: 119: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,843 INFO L290 TraceCheckUtils]: 120: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,843 INFO L290 TraceCheckUtils]: 121: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,844 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {16295#true} {16663#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {16663#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:43:04,844 INFO L290 TraceCheckUtils]: 123: Hoare triple {16663#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16685#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:04,844 INFO L290 TraceCheckUtils]: 124: Hoare triple {16685#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {16685#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:04,845 INFO L272 TraceCheckUtils]: 125: Hoare triple {16685#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-27 14:43:04,845 INFO L290 TraceCheckUtils]: 126: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,845 INFO L290 TraceCheckUtils]: 127: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,845 INFO L290 TraceCheckUtils]: 128: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,845 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {16295#true} {16685#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #54#return; {16685#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:04,845 INFO L290 TraceCheckUtils]: 130: Hoare triple {16685#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16707#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-27 14:43:04,846 INFO L290 TraceCheckUtils]: 131: Hoare triple {16707#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !false; {16707#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-27 14:43:04,846 INFO L272 TraceCheckUtils]: 132: Hoare triple {16707#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-27 14:43:04,846 INFO L290 TraceCheckUtils]: 133: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,846 INFO L290 TraceCheckUtils]: 134: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,846 INFO L290 TraceCheckUtils]: 135: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,846 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {16295#true} {16707#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} #54#return; {16707#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-27 14:43:04,847 INFO L290 TraceCheckUtils]: 137: Hoare triple {16707#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16729#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:43:04,847 INFO L290 TraceCheckUtils]: 138: Hoare triple {16729#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} assume !false; {16729#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:43:04,847 INFO L272 TraceCheckUtils]: 139: Hoare triple {16729#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-27 14:43:04,847 INFO L290 TraceCheckUtils]: 140: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,847 INFO L290 TraceCheckUtils]: 141: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,847 INFO L290 TraceCheckUtils]: 142: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,848 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {16295#true} {16729#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} #54#return; {16729#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:43:04,848 INFO L290 TraceCheckUtils]: 144: Hoare triple {16729#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16751#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-27 14:43:04,848 INFO L290 TraceCheckUtils]: 145: Hoare triple {16751#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !false; {16751#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-27 14:43:04,848 INFO L272 TraceCheckUtils]: 146: Hoare triple {16751#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-27 14:43:04,848 INFO L290 TraceCheckUtils]: 147: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,849 INFO L290 TraceCheckUtils]: 148: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,849 INFO L290 TraceCheckUtils]: 149: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,849 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {16295#true} {16751#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} #54#return; {16751#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-27 14:43:04,849 INFO L290 TraceCheckUtils]: 151: Hoare triple {16751#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16773#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-27 14:43:04,850 INFO L290 TraceCheckUtils]: 152: Hoare triple {16773#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} assume !false; {16773#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-27 14:43:04,850 INFO L272 TraceCheckUtils]: 153: Hoare triple {16773#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-27 14:43:04,850 INFO L290 TraceCheckUtils]: 154: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,850 INFO L290 TraceCheckUtils]: 155: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,850 INFO L290 TraceCheckUtils]: 156: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,850 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {16295#true} {16773#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} #54#return; {16773#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-27 14:43:04,851 INFO L290 TraceCheckUtils]: 158: Hoare triple {16773#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16795#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 14:43:04,851 INFO L290 TraceCheckUtils]: 159: Hoare triple {16795#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {16795#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 14:43:04,851 INFO L272 TraceCheckUtils]: 160: Hoare triple {16795#(and (= main_~c~0 21) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-27 14:43:04,851 INFO L290 TraceCheckUtils]: 161: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,851 INFO L290 TraceCheckUtils]: 162: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,851 INFO L290 TraceCheckUtils]: 163: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,852 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {16295#true} {16795#(and (= main_~c~0 21) (= main_~y~0 21))} #54#return; {16795#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 14:43:04,852 INFO L290 TraceCheckUtils]: 165: Hoare triple {16795#(and (= main_~c~0 21) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16817#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-27 14:43:04,852 INFO L290 TraceCheckUtils]: 166: Hoare triple {16817#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} assume !false; {16817#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-27 14:43:04,852 INFO L272 TraceCheckUtils]: 167: Hoare triple {16817#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-27 14:43:04,852 INFO L290 TraceCheckUtils]: 168: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-27 14:43:04,852 INFO L290 TraceCheckUtils]: 169: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-27 14:43:04,852 INFO L290 TraceCheckUtils]: 170: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-27 14:43:04,853 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {16295#true} {16817#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} #54#return; {16817#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-27 14:43:04,854 INFO L290 TraceCheckUtils]: 172: Hoare triple {16817#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} assume !(~c~0 < ~k~0); {16839#(and (<= main_~k~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-27 14:43:04,854 INFO L272 TraceCheckUtils]: 173: Hoare triple {16839#(and (<= main_~k~0 22) (= main_~y~0 22) (< 21 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:43:04,855 INFO L290 TraceCheckUtils]: 174: Hoare triple {16843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:43:04,855 INFO L290 TraceCheckUtils]: 175: Hoare triple {16847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16296#false} is VALID [2022-04-27 14:43:04,855 INFO L290 TraceCheckUtils]: 176: Hoare triple {16296#false} assume !false; {16296#false} is VALID [2022-04-27 14:43:04,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1817 backedges. 46 proven. 759 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2022-04-27 14:43:04,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:43:05,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:43:05,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567039481] [2022-04-27 14:43:05,284 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:43:05,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758287053] [2022-04-27 14:43:05,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758287053] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:43:05,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:43:05,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-04-27 14:43:05,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175969368] [2022-04-27 14:43:05,285 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:43:05,285 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) Word has length 177 [2022-04-27 14:43:05,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:43:05,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-27 14:43:05,405 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-27 14:43:05,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 14:43:05,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:43:05,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 14:43:05,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-04-27 14:43:05,406 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-27 14:43:11,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:11,687 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-04-27 14:43:11,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-27 14:43:11,688 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) Word has length 177 [2022-04-27 14:43:11,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:43:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-27 14:43:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-27 14:43:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-27 14:43:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-27 14:43:11,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 120 transitions. [2022-04-27 14:43:11,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:11,833 INFO L225 Difference]: With dead ends: 102 [2022-04-27 14:43:11,833 INFO L226 Difference]: Without dead ends: 97 [2022-04-27 14:43:11,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 14:43:11,834 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:43:11,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1123 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-27 14:43:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-27 14:43:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-04-27 14:43:11,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:43:11,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 14:43:11,899 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 14:43:11,899 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 14:43:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:11,900 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-04-27 14:43:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-27 14:43:11,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:11,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:11,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 97 states. [2022-04-27 14:43:11,912 INFO L87 Difference]: Start difference. First operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 97 states. [2022-04-27 14:43:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:11,914 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-04-27 14:43:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-27 14:43:11,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:11,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:11,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:43:11,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:43:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 14:43:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2022-04-27 14:43:11,916 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 177 [2022-04-27 14:43:11,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:43:11,916 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2022-04-27 14:43:11,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-27 14:43:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-27 14:43:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-04-27 14:43:11,917 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:43:11,917 INFO L195 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:43:11,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-27 14:43:12,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-27 14:43:12,123 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:43:12,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:43:12,124 INFO L85 PathProgramCache]: Analyzing trace with hash -178408600, now seen corresponding path program 23 times [2022-04-27 14:43:12,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:43:12,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699566778] [2022-04-27 14:43:12,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:43:12,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:43:12,140 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:43:12,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463232701] [2022-04-27 14:43:12,140 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:43:12,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:43:12,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:43:12,141 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:43:12,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-27 14:43:32,947 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-04-27 14:43:32,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:43:32,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-27 14:43:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:43:32,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:43:33,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {17410#true} call ULTIMATE.init(); {17410#true} is VALID [2022-04-27 14:43:33,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {17410#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); {17410#true} is VALID [2022-04-27 14:43:33,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17410#true} {17410#true} #60#return; {17410#true} is VALID [2022-04-27 14:43:33,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {17410#true} call #t~ret5 := main(); {17410#true} is VALID [2022-04-27 14:43:33,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {17410#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; {17410#true} is VALID [2022-04-27 14:43:33,860 INFO L272 TraceCheckUtils]: 6: Hoare triple {17410#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,860 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17410#true} {17410#true} #52#return; {17410#true} is VALID [2022-04-27 14:43:33,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {17410#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {17448#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:33,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {17448#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {17448#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:33,861 INFO L272 TraceCheckUtils]: 13: Hoare triple {17448#(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)); {17410#true} is VALID [2022-04-27 14:43:33,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,861 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17410#true} {17448#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {17448#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:33,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {17448#(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; {17470#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:43:33,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {17470#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {17470#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:43:33,862 INFO L272 TraceCheckUtils]: 20: Hoare triple {17470#(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)); {17410#true} is VALID [2022-04-27 14:43:33,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,863 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {17410#true} {17470#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {17470#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:43:33,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {17470#(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; {17492#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:43:33,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {17492#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {17492#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:43:33,863 INFO L272 TraceCheckUtils]: 27: Hoare triple {17492#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,864 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17410#true} {17492#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #54#return; {17492#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:43:33,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {17492#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17514#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:43:33,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {17514#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {17514#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:43:33,865 INFO L272 TraceCheckUtils]: 34: Hoare triple {17514#(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)); {17410#true} is VALID [2022-04-27 14:43:33,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,865 INFO L290 TraceCheckUtils]: 37: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,865 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17410#true} {17514#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {17514#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:43:33,865 INFO L290 TraceCheckUtils]: 39: Hoare triple {17514#(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; {17536#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:43:33,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {17536#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {17536#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:43:33,866 INFO L272 TraceCheckUtils]: 41: Hoare triple {17536#(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)); {17410#true} is VALID [2022-04-27 14:43:33,866 INFO L290 TraceCheckUtils]: 42: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,866 INFO L290 TraceCheckUtils]: 43: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,866 INFO L290 TraceCheckUtils]: 44: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,866 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17410#true} {17536#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {17536#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:43:33,867 INFO L290 TraceCheckUtils]: 46: Hoare triple {17536#(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; {17558#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:43:33,867 INFO L290 TraceCheckUtils]: 47: Hoare triple {17558#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {17558#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:43:33,867 INFO L272 TraceCheckUtils]: 48: Hoare triple {17558#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,867 INFO L290 TraceCheckUtils]: 49: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,867 INFO L290 TraceCheckUtils]: 51: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,868 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17410#true} {17558#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {17558#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:43:33,868 INFO L290 TraceCheckUtils]: 53: Hoare triple {17558#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17580#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-27 14:43:33,868 INFO L290 TraceCheckUtils]: 54: Hoare triple {17580#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !false; {17580#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-27 14:43:33,868 INFO L272 TraceCheckUtils]: 55: Hoare triple {17580#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,868 INFO L290 TraceCheckUtils]: 56: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,868 INFO L290 TraceCheckUtils]: 57: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,868 INFO L290 TraceCheckUtils]: 58: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,869 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17410#true} {17580#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #54#return; {17580#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-27 14:43:33,869 INFO L290 TraceCheckUtils]: 60: Hoare triple {17580#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17602#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:33,870 INFO L290 TraceCheckUtils]: 61: Hoare triple {17602#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {17602#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:33,870 INFO L272 TraceCheckUtils]: 62: Hoare triple {17602#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,870 INFO L290 TraceCheckUtils]: 63: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,870 INFO L290 TraceCheckUtils]: 64: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,870 INFO L290 TraceCheckUtils]: 65: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,870 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17410#true} {17602#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #54#return; {17602#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:33,870 INFO L290 TraceCheckUtils]: 67: Hoare triple {17602#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17624#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:43:33,871 INFO L290 TraceCheckUtils]: 68: Hoare triple {17624#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} assume !false; {17624#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:43:33,871 INFO L272 TraceCheckUtils]: 69: Hoare triple {17624#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,871 INFO L290 TraceCheckUtils]: 70: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,871 INFO L290 TraceCheckUtils]: 71: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,871 INFO L290 TraceCheckUtils]: 72: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,871 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17410#true} {17624#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} #54#return; {17624#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:43:33,872 INFO L290 TraceCheckUtils]: 74: Hoare triple {17624#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17646#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:43:33,872 INFO L290 TraceCheckUtils]: 75: Hoare triple {17646#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} assume !false; {17646#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:43:33,872 INFO L272 TraceCheckUtils]: 76: Hoare triple {17646#(and (= main_~y~0 9) (= 5 (+ 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)); {17410#true} is VALID [2022-04-27 14:43:33,872 INFO L290 TraceCheckUtils]: 77: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,872 INFO L290 TraceCheckUtils]: 78: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,872 INFO L290 TraceCheckUtils]: 79: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,873 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {17410#true} {17646#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} #54#return; {17646#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:43:33,873 INFO L290 TraceCheckUtils]: 81: Hoare triple {17646#(and (= main_~y~0 9) (= 5 (+ 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; {17668#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:43:33,873 INFO L290 TraceCheckUtils]: 82: Hoare triple {17668#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {17668#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:43:33,873 INFO L272 TraceCheckUtils]: 83: Hoare triple {17668#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,873 INFO L290 TraceCheckUtils]: 84: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,873 INFO L290 TraceCheckUtils]: 85: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,874 INFO L290 TraceCheckUtils]: 86: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,874 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {17410#true} {17668#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {17668#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:43:33,874 INFO L290 TraceCheckUtils]: 88: Hoare triple {17668#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17690#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:43:33,875 INFO L290 TraceCheckUtils]: 89: Hoare triple {17690#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {17690#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:43:33,875 INFO L272 TraceCheckUtils]: 90: Hoare triple {17690#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,875 INFO L290 TraceCheckUtils]: 91: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,875 INFO L290 TraceCheckUtils]: 92: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,875 INFO L290 TraceCheckUtils]: 93: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,875 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {17410#true} {17690#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #54#return; {17690#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:43:33,876 INFO L290 TraceCheckUtils]: 95: Hoare triple {17690#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17712#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-27 14:43:33,876 INFO L290 TraceCheckUtils]: 96: Hoare triple {17712#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} assume !false; {17712#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-27 14:43:33,876 INFO L272 TraceCheckUtils]: 97: Hoare triple {17712#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,876 INFO L290 TraceCheckUtils]: 98: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,876 INFO L290 TraceCheckUtils]: 99: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,876 INFO L290 TraceCheckUtils]: 100: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,876 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {17410#true} {17712#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} #54#return; {17712#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-27 14:43:33,877 INFO L290 TraceCheckUtils]: 102: Hoare triple {17712#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17734#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:43:33,877 INFO L290 TraceCheckUtils]: 103: Hoare triple {17734#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {17734#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:43:33,877 INFO L272 TraceCheckUtils]: 104: Hoare triple {17734#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,877 INFO L290 TraceCheckUtils]: 105: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,877 INFO L290 TraceCheckUtils]: 106: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,877 INFO L290 TraceCheckUtils]: 107: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,878 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17410#true} {17734#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #54#return; {17734#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:43:33,878 INFO L290 TraceCheckUtils]: 109: Hoare triple {17734#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17756#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:33,878 INFO L290 TraceCheckUtils]: 110: Hoare triple {17756#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} assume !false; {17756#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:33,878 INFO L272 TraceCheckUtils]: 111: Hoare triple {17756#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,878 INFO L290 TraceCheckUtils]: 112: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,879 INFO L290 TraceCheckUtils]: 113: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,879 INFO L290 TraceCheckUtils]: 114: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,879 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {17410#true} {17756#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} #54#return; {17756#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:33,879 INFO L290 TraceCheckUtils]: 116: Hoare triple {17756#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17778#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:43:33,880 INFO L290 TraceCheckUtils]: 117: Hoare triple {17778#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {17778#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:43:33,880 INFO L272 TraceCheckUtils]: 118: Hoare triple {17778#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,880 INFO L290 TraceCheckUtils]: 119: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,880 INFO L290 TraceCheckUtils]: 120: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,880 INFO L290 TraceCheckUtils]: 121: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,880 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {17410#true} {17778#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {17778#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:43:33,881 INFO L290 TraceCheckUtils]: 123: Hoare triple {17778#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17800#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:43:33,881 INFO L290 TraceCheckUtils]: 124: Hoare triple {17800#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {17800#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:43:33,881 INFO L272 TraceCheckUtils]: 125: Hoare triple {17800#(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)); {17410#true} is VALID [2022-04-27 14:43:33,881 INFO L290 TraceCheckUtils]: 126: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,881 INFO L290 TraceCheckUtils]: 127: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,881 INFO L290 TraceCheckUtils]: 128: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,881 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17410#true} {17800#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {17800#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:43:33,882 INFO L290 TraceCheckUtils]: 130: Hoare triple {17800#(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; {17822#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 14:43:33,882 INFO L290 TraceCheckUtils]: 131: Hoare triple {17822#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !false; {17822#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 14:43:33,882 INFO L272 TraceCheckUtils]: 132: Hoare triple {17822#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,882 INFO L290 TraceCheckUtils]: 133: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,882 INFO L290 TraceCheckUtils]: 134: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,882 INFO L290 TraceCheckUtils]: 135: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,883 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {17410#true} {17822#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} #54#return; {17822#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 14:43:33,883 INFO L290 TraceCheckUtils]: 137: Hoare triple {17822#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17844#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-27 14:43:33,883 INFO L290 TraceCheckUtils]: 138: Hoare triple {17844#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} assume !false; {17844#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-27 14:43:33,883 INFO L272 TraceCheckUtils]: 139: Hoare triple {17844#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,883 INFO L290 TraceCheckUtils]: 140: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,884 INFO L290 TraceCheckUtils]: 141: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,884 INFO L290 TraceCheckUtils]: 142: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,884 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {17410#true} {17844#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} #54#return; {17844#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-27 14:43:33,884 INFO L290 TraceCheckUtils]: 144: Hoare triple {17844#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17866#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:33,885 INFO L290 TraceCheckUtils]: 145: Hoare triple {17866#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} assume !false; {17866#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:33,885 INFO L272 TraceCheckUtils]: 146: Hoare triple {17866#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,885 INFO L290 TraceCheckUtils]: 147: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,885 INFO L290 TraceCheckUtils]: 148: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,885 INFO L290 TraceCheckUtils]: 149: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,885 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {17410#true} {17866#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} #54#return; {17866#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:33,886 INFO L290 TraceCheckUtils]: 151: Hoare triple {17866#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17888#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} is VALID [2022-04-27 14:43:33,886 INFO L290 TraceCheckUtils]: 152: Hoare triple {17888#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} assume !false; {17888#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} is VALID [2022-04-27 14:43:33,886 INFO L272 TraceCheckUtils]: 153: Hoare triple {17888#(and (= 16 (+ main_~c~0 (- 4))) (= 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)); {17410#true} is VALID [2022-04-27 14:43:33,886 INFO L290 TraceCheckUtils]: 154: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,886 INFO L290 TraceCheckUtils]: 155: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,886 INFO L290 TraceCheckUtils]: 156: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,887 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {17410#true} {17888#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} #54#return; {17888#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} is VALID [2022-04-27 14:43:33,887 INFO L290 TraceCheckUtils]: 158: Hoare triple {17888#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17910#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 14:43:33,887 INFO L290 TraceCheckUtils]: 159: Hoare triple {17910#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {17910#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 14:43:33,887 INFO L272 TraceCheckUtils]: 160: Hoare triple {17910#(and (= main_~c~0 21) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,888 INFO L290 TraceCheckUtils]: 161: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,888 INFO L290 TraceCheckUtils]: 162: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,888 INFO L290 TraceCheckUtils]: 163: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,888 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {17410#true} {17910#(and (= main_~c~0 21) (= main_~y~0 21))} #54#return; {17910#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 14:43:33,889 INFO L290 TraceCheckUtils]: 165: Hoare triple {17910#(and (= main_~c~0 21) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17932#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:43:33,889 INFO L290 TraceCheckUtils]: 166: Hoare triple {17932#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {17932#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:43:33,889 INFO L272 TraceCheckUtils]: 167: Hoare triple {17932#(and (= main_~y~0 22) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,889 INFO L290 TraceCheckUtils]: 168: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,889 INFO L290 TraceCheckUtils]: 169: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,889 INFO L290 TraceCheckUtils]: 170: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,889 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {17410#true} {17932#(and (= main_~y~0 22) (= main_~c~0 22))} #54#return; {17932#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:43:33,890 INFO L290 TraceCheckUtils]: 172: Hoare triple {17932#(and (= main_~y~0 22) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17954#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-27 14:43:33,890 INFO L290 TraceCheckUtils]: 173: Hoare triple {17954#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} assume !false; {17954#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-27 14:43:33,890 INFO L272 TraceCheckUtils]: 174: Hoare triple {17954#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-27 14:43:33,890 INFO L290 TraceCheckUtils]: 175: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 14:43:33,890 INFO L290 TraceCheckUtils]: 176: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 14:43:33,890 INFO L290 TraceCheckUtils]: 177: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 14:43:33,891 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {17410#true} {17954#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} #54#return; {17954#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-27 14:43:33,893 INFO L290 TraceCheckUtils]: 179: Hoare triple {17954#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} assume !(~c~0 < ~k~0); {17976#(and (< 22 main_~k~0) (<= main_~k~0 23) (= 23 main_~y~0))} is VALID [2022-04-27 14:43:33,893 INFO L272 TraceCheckUtils]: 180: Hoare triple {17976#(and (< 22 main_~k~0) (<= main_~k~0 23) (= 23 main_~y~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17980#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:43:33,894 INFO L290 TraceCheckUtils]: 181: Hoare triple {17980#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17984#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:43:33,894 INFO L290 TraceCheckUtils]: 182: Hoare triple {17984#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17411#false} is VALID [2022-04-27 14:43:33,894 INFO L290 TraceCheckUtils]: 183: Hoare triple {17411#false} assume !false; {17411#false} is VALID [2022-04-27 14:43:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 48 proven. 828 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2022-04-27 14:43:33,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:43:34,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:43:34,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699566778] [2022-04-27 14:43:34,181 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:43:34,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463232701] [2022-04-27 14:43:34,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463232701] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:43:34,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:43:34,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2022-04-27 14:43:34,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017122110] [2022-04-27 14:43:34,181 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:43:34,181 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) Word has length 184 [2022-04-27 14:43:34,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:43:34,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-27 14:43:34,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:34,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-27 14:43:34,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:43:34,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-27 14:43:34,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2022-04-27 14:43:34,305 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-27 14:43:41,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:41,601 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2022-04-27 14:43:41,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 14:43:41,601 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) Word has length 184 [2022-04-27 14:43:41,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:43:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-27 14:43:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2022-04-27 14:43:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-27 14:43:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2022-04-27 14:43:41,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 124 transitions. [2022-04-27 14:43:41,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:41,805 INFO L225 Difference]: With dead ends: 105 [2022-04-27 14:43:41,805 INFO L226 Difference]: Without dead ends: 100 [2022-04-27 14:43:41,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 14:43:41,806 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-27 14:43:41,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1193 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-27 14:43:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-27 14:43:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-27 14:43:41,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:43:41,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 14:43:41,884 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 14:43:41,884 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 14:43:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:41,886 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-27 14:43:41,886 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-27 14:43:41,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:41,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:41,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 100 states. [2022-04-27 14:43:41,903 INFO L87 Difference]: Start difference. First operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 100 states. [2022-04-27 14:43:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:41,905 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-27 14:43:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-27 14:43:41,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:41,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:41,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:43:41,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:43:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 14:43:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2022-04-27 14:43:41,907 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 184 [2022-04-27 14:43:41,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:43:41,908 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2022-04-27 14:43:41,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-27 14:43:41,908 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-27 14:43:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-04-27 14:43:41,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:43:41,909 INFO L195 NwaCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:43:41,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-27 14:43:42,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-27 14:43:42,109 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:43:42,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:43:42,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1007212713, now seen corresponding path program 24 times [2022-04-27 14:43:42,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:43:42,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711417534] [2022-04-27 14:43:42,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:43:42,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:43:42,126 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:43:42,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [534819228] [2022-04-27 14:43:42,126 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:43:42,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:43:42,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:43:42,139 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:43:42,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-27 14:43:42,946 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-27 14:43:42,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:43:42,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-27 14:43:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:43:42,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:43:44,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {18563#true} call ULTIMATE.init(); {18563#true} is VALID [2022-04-27 14:43:44,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {18563#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); {18563#true} is VALID [2022-04-27 14:43:44,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18563#true} {18563#true} #60#return; {18563#true} is VALID [2022-04-27 14:43:44,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {18563#true} call #t~ret5 := main(); {18563#true} is VALID [2022-04-27 14:43:44,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {18563#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; {18563#true} is VALID [2022-04-27 14:43:44,033 INFO L272 TraceCheckUtils]: 6: Hoare triple {18563#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {18563#true} is VALID [2022-04-27 14:43:44,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,033 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18563#true} {18563#true} #52#return; {18563#true} is VALID [2022-04-27 14:43:44,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {18563#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {18601#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:44,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {18601#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {18601#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:44,034 INFO L272 TraceCheckUtils]: 13: Hoare triple {18601#(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)); {18563#true} is VALID [2022-04-27 14:43:44,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,034 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18563#true} {18601#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {18601#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:44,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {18601#(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; {18623#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:43:44,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {18623#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {18623#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:43:44,035 INFO L272 TraceCheckUtils]: 20: Hoare triple {18623#(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)); {18563#true} is VALID [2022-04-27 14:43:44,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,035 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {18563#true} {18623#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {18623#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:43:44,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {18623#(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; {18645#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:43:44,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {18645#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {18645#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:43:44,036 INFO L272 TraceCheckUtils]: 27: Hoare triple {18645#(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)); {18563#true} is VALID [2022-04-27 14:43:44,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,037 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18563#true} {18645#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {18645#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:43:44,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {18645#(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; {18667#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:43:44,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {18667#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {18667#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:43:44,038 INFO L272 TraceCheckUtils]: 34: Hoare triple {18667#(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)); {18563#true} is VALID [2022-04-27 14:43:44,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,038 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {18563#true} {18667#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {18667#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:43:44,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {18667#(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; {18689#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:43:44,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {18689#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {18689#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:43:44,039 INFO L272 TraceCheckUtils]: 41: Hoare triple {18689#(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)); {18563#true} is VALID [2022-04-27 14:43:44,039 INFO L290 TraceCheckUtils]: 42: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,039 INFO L290 TraceCheckUtils]: 43: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,039 INFO L290 TraceCheckUtils]: 44: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,039 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {18563#true} {18689#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {18689#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:43:44,040 INFO L290 TraceCheckUtils]: 46: Hoare triple {18689#(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; {18711#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:43:44,040 INFO L290 TraceCheckUtils]: 47: Hoare triple {18711#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {18711#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:43:44,040 INFO L272 TraceCheckUtils]: 48: Hoare triple {18711#(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)); {18563#true} is VALID [2022-04-27 14:43:44,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,040 INFO L290 TraceCheckUtils]: 50: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,040 INFO L290 TraceCheckUtils]: 51: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,041 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18563#true} {18711#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {18711#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:43:44,041 INFO L290 TraceCheckUtils]: 53: Hoare triple {18711#(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; {18733#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:44,041 INFO L290 TraceCheckUtils]: 54: Hoare triple {18733#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {18733#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:44,041 INFO L272 TraceCheckUtils]: 55: Hoare triple {18733#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-27 14:43:44,041 INFO L290 TraceCheckUtils]: 56: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,041 INFO L290 TraceCheckUtils]: 57: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,041 INFO L290 TraceCheckUtils]: 58: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,042 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18563#true} {18733#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #54#return; {18733#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:44,042 INFO L290 TraceCheckUtils]: 60: Hoare triple {18733#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18755#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:43:44,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {18755#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {18755#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:43:44,043 INFO L272 TraceCheckUtils]: 62: Hoare triple {18755#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-27 14:43:44,043 INFO L290 TraceCheckUtils]: 63: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,043 INFO L290 TraceCheckUtils]: 64: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,043 INFO L290 TraceCheckUtils]: 65: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,043 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18563#true} {18755#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {18755#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:43:44,043 INFO L290 TraceCheckUtils]: 67: Hoare triple {18755#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18777#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:43:44,044 INFO L290 TraceCheckUtils]: 68: Hoare triple {18777#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {18777#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:43:44,044 INFO L272 TraceCheckUtils]: 69: Hoare triple {18777#(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)); {18563#true} is VALID [2022-04-27 14:43:44,044 INFO L290 TraceCheckUtils]: 70: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,044 INFO L290 TraceCheckUtils]: 71: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,044 INFO L290 TraceCheckUtils]: 72: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,044 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {18563#true} {18777#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {18777#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:43:44,045 INFO L290 TraceCheckUtils]: 74: Hoare triple {18777#(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; {18799#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:43:44,045 INFO L290 TraceCheckUtils]: 75: Hoare triple {18799#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {18799#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:43:44,045 INFO L272 TraceCheckUtils]: 76: Hoare triple {18799#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-27 14:43:44,045 INFO L290 TraceCheckUtils]: 77: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,045 INFO L290 TraceCheckUtils]: 78: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,045 INFO L290 TraceCheckUtils]: 79: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,046 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18563#true} {18799#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #54#return; {18799#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:43:44,046 INFO L290 TraceCheckUtils]: 81: Hoare triple {18799#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18821#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:43:44,046 INFO L290 TraceCheckUtils]: 82: Hoare triple {18821#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {18821#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:43:44,046 INFO L272 TraceCheckUtils]: 83: Hoare triple {18821#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-27 14:43:44,046 INFO L290 TraceCheckUtils]: 84: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,047 INFO L290 TraceCheckUtils]: 85: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,047 INFO L290 TraceCheckUtils]: 86: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,047 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {18563#true} {18821#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {18821#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:43:44,047 INFO L290 TraceCheckUtils]: 88: Hoare triple {18821#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18843#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:43:44,048 INFO L290 TraceCheckUtils]: 89: Hoare triple {18843#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {18843#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:43:44,048 INFO L272 TraceCheckUtils]: 90: Hoare triple {18843#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-27 14:43:44,048 INFO L290 TraceCheckUtils]: 91: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,048 INFO L290 TraceCheckUtils]: 92: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,048 INFO L290 TraceCheckUtils]: 93: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,048 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {18563#true} {18843#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #54#return; {18843#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:43:44,049 INFO L290 TraceCheckUtils]: 95: Hoare triple {18843#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18865#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 14:43:44,049 INFO L290 TraceCheckUtils]: 96: Hoare triple {18865#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} assume !false; {18865#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 14:43:44,049 INFO L272 TraceCheckUtils]: 97: Hoare triple {18865#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-27 14:43:44,049 INFO L290 TraceCheckUtils]: 98: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,049 INFO L290 TraceCheckUtils]: 99: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,049 INFO L290 TraceCheckUtils]: 100: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,049 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {18563#true} {18865#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} #54#return; {18865#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 14:43:44,050 INFO L290 TraceCheckUtils]: 102: Hoare triple {18865#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18887#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-27 14:43:44,050 INFO L290 TraceCheckUtils]: 103: Hoare triple {18887#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} assume !false; {18887#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-27 14:43:44,050 INFO L272 TraceCheckUtils]: 104: Hoare triple {18887#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-27 14:43:44,050 INFO L290 TraceCheckUtils]: 105: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,050 INFO L290 TraceCheckUtils]: 106: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,050 INFO L290 TraceCheckUtils]: 107: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,051 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18563#true} {18887#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} #54#return; {18887#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-27 14:43:44,051 INFO L290 TraceCheckUtils]: 109: Hoare triple {18887#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18909#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:43:44,051 INFO L290 TraceCheckUtils]: 110: Hoare triple {18909#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {18909#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:43:44,052 INFO L272 TraceCheckUtils]: 111: Hoare triple {18909#(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)); {18563#true} is VALID [2022-04-27 14:43:44,052 INFO L290 TraceCheckUtils]: 112: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,052 INFO L290 TraceCheckUtils]: 113: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,052 INFO L290 TraceCheckUtils]: 114: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,052 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {18563#true} {18909#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {18909#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:43:44,052 INFO L290 TraceCheckUtils]: 116: Hoare triple {18909#(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; {18931#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:44,053 INFO L290 TraceCheckUtils]: 117: Hoare triple {18931#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !false; {18931#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:44,053 INFO L272 TraceCheckUtils]: 118: Hoare triple {18931#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-27 14:43:44,053 INFO L290 TraceCheckUtils]: 119: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,053 INFO L290 TraceCheckUtils]: 120: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,053 INFO L290 TraceCheckUtils]: 121: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,053 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {18563#true} {18931#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} #54#return; {18931#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:44,054 INFO L290 TraceCheckUtils]: 123: Hoare triple {18931#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18953#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-27 14:43:44,054 INFO L290 TraceCheckUtils]: 124: Hoare triple {18953#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} assume !false; {18953#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-27 14:43:44,054 INFO L272 TraceCheckUtils]: 125: Hoare triple {18953#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-27 14:43:44,054 INFO L290 TraceCheckUtils]: 126: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,054 INFO L290 TraceCheckUtils]: 127: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,054 INFO L290 TraceCheckUtils]: 128: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,055 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {18563#true} {18953#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} #54#return; {18953#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-27 14:43:44,055 INFO L290 TraceCheckUtils]: 130: Hoare triple {18953#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18975#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} is VALID [2022-04-27 14:43:44,055 INFO L290 TraceCheckUtils]: 131: Hoare triple {18975#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} assume !false; {18975#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} is VALID [2022-04-27 14:43:44,055 INFO L272 TraceCheckUtils]: 132: Hoare triple {18975#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-27 14:43:44,055 INFO L290 TraceCheckUtils]: 133: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,056 INFO L290 TraceCheckUtils]: 134: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,056 INFO L290 TraceCheckUtils]: 135: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,056 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {18563#true} {18975#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} #54#return; {18975#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} is VALID [2022-04-27 14:43:44,056 INFO L290 TraceCheckUtils]: 137: Hoare triple {18975#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18997#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:43:44,057 INFO L290 TraceCheckUtils]: 138: Hoare triple {18997#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} assume !false; {18997#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:43:44,057 INFO L272 TraceCheckUtils]: 139: Hoare triple {18997#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-27 14:43:44,057 INFO L290 TraceCheckUtils]: 140: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,057 INFO L290 TraceCheckUtils]: 141: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,057 INFO L290 TraceCheckUtils]: 142: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,057 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {18563#true} {18997#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} #54#return; {18997#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:43:44,058 INFO L290 TraceCheckUtils]: 144: Hoare triple {18997#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19019#(and (= 14 (+ main_~y~0 (- 5))) (= 19 main_~c~0))} is VALID [2022-04-27 14:43:44,058 INFO L290 TraceCheckUtils]: 145: Hoare triple {19019#(and (= 14 (+ main_~y~0 (- 5))) (= 19 main_~c~0))} assume !false; {19019#(and (= 14 (+ main_~y~0 (- 5))) (= 19 main_~c~0))} is VALID [2022-04-27 14:43:44,058 INFO L272 TraceCheckUtils]: 146: Hoare triple {19019#(and (= 14 (+ main_~y~0 (- 5))) (= 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)); {18563#true} is VALID [2022-04-27 14:43:44,058 INFO L290 TraceCheckUtils]: 147: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,058 INFO L290 TraceCheckUtils]: 148: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,058 INFO L290 TraceCheckUtils]: 149: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,059 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {18563#true} {19019#(and (= 14 (+ main_~y~0 (- 5))) (= 19 main_~c~0))} #54#return; {19019#(and (= 14 (+ main_~y~0 (- 5))) (= 19 main_~c~0))} is VALID [2022-04-27 14:43:44,059 INFO L290 TraceCheckUtils]: 151: Hoare triple {19019#(and (= 14 (+ main_~y~0 (- 5))) (= 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; {19041#(and (= (+ main_~y~0 (- 6)) 14) (= main_~c~0 20))} is VALID [2022-04-27 14:43:44,059 INFO L290 TraceCheckUtils]: 152: Hoare triple {19041#(and (= (+ main_~y~0 (- 6)) 14) (= main_~c~0 20))} assume !false; {19041#(and (= (+ main_~y~0 (- 6)) 14) (= main_~c~0 20))} is VALID [2022-04-27 14:43:44,059 INFO L272 TraceCheckUtils]: 153: Hoare triple {19041#(and (= (+ main_~y~0 (- 6)) 14) (= main_~c~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-27 14:43:44,059 INFO L290 TraceCheckUtils]: 154: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,059 INFO L290 TraceCheckUtils]: 155: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,059 INFO L290 TraceCheckUtils]: 156: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,060 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {18563#true} {19041#(and (= (+ main_~y~0 (- 6)) 14) (= main_~c~0 20))} #54#return; {19041#(and (= (+ main_~y~0 (- 6)) 14) (= main_~c~0 20))} is VALID [2022-04-27 14:43:44,060 INFO L290 TraceCheckUtils]: 158: Hoare triple {19041#(and (= (+ main_~y~0 (- 6)) 14) (= main_~c~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19063#(and (= main_~c~0 21) (= 14 (+ main_~y~0 (- 7))))} is VALID [2022-04-27 14:43:44,061 INFO L290 TraceCheckUtils]: 159: Hoare triple {19063#(and (= main_~c~0 21) (= 14 (+ main_~y~0 (- 7))))} assume !false; {19063#(and (= main_~c~0 21) (= 14 (+ main_~y~0 (- 7))))} is VALID [2022-04-27 14:43:44,061 INFO L272 TraceCheckUtils]: 160: Hoare triple {19063#(and (= main_~c~0 21) (= 14 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-27 14:43:44,061 INFO L290 TraceCheckUtils]: 161: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,061 INFO L290 TraceCheckUtils]: 162: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,061 INFO L290 TraceCheckUtils]: 163: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,061 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {18563#true} {19063#(and (= main_~c~0 21) (= 14 (+ main_~y~0 (- 7))))} #54#return; {19063#(and (= main_~c~0 21) (= 14 (+ main_~y~0 (- 7))))} is VALID [2022-04-27 14:43:44,062 INFO L290 TraceCheckUtils]: 165: Hoare triple {19063#(and (= main_~c~0 21) (= 14 (+ main_~y~0 (- 7))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19085#(and (= (+ (- 1) main_~c~0) 21) (= 14 (+ main_~y~0 (- 8))))} is VALID [2022-04-27 14:43:44,062 INFO L290 TraceCheckUtils]: 166: Hoare triple {19085#(and (= (+ (- 1) main_~c~0) 21) (= 14 (+ main_~y~0 (- 8))))} assume !false; {19085#(and (= (+ (- 1) main_~c~0) 21) (= 14 (+ main_~y~0 (- 8))))} is VALID [2022-04-27 14:43:44,062 INFO L272 TraceCheckUtils]: 167: Hoare triple {19085#(and (= (+ (- 1) main_~c~0) 21) (= 14 (+ main_~y~0 (- 8))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-27 14:43:44,062 INFO L290 TraceCheckUtils]: 168: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,062 INFO L290 TraceCheckUtils]: 169: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,062 INFO L290 TraceCheckUtils]: 170: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,062 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {18563#true} {19085#(and (= (+ (- 1) main_~c~0) 21) (= 14 (+ main_~y~0 (- 8))))} #54#return; {19085#(and (= (+ (- 1) main_~c~0) 21) (= 14 (+ main_~y~0 (- 8))))} is VALID [2022-04-27 14:43:44,063 INFO L290 TraceCheckUtils]: 172: Hoare triple {19085#(and (= (+ (- 1) main_~c~0) 21) (= 14 (+ main_~y~0 (- 8))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19107#(and (= 21 (+ (- 2) main_~c~0)) (= (+ (- 9) main_~y~0) 14))} is VALID [2022-04-27 14:43:44,063 INFO L290 TraceCheckUtils]: 173: Hoare triple {19107#(and (= 21 (+ (- 2) main_~c~0)) (= (+ (- 9) main_~y~0) 14))} assume !false; {19107#(and (= 21 (+ (- 2) main_~c~0)) (= (+ (- 9) main_~y~0) 14))} is VALID [2022-04-27 14:43:44,063 INFO L272 TraceCheckUtils]: 174: Hoare triple {19107#(and (= 21 (+ (- 2) main_~c~0)) (= (+ (- 9) 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)); {18563#true} is VALID [2022-04-27 14:43:44,063 INFO L290 TraceCheckUtils]: 175: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,063 INFO L290 TraceCheckUtils]: 176: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,063 INFO L290 TraceCheckUtils]: 177: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,064 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {18563#true} {19107#(and (= 21 (+ (- 2) main_~c~0)) (= (+ (- 9) main_~y~0) 14))} #54#return; {19107#(and (= 21 (+ (- 2) main_~c~0)) (= (+ (- 9) main_~y~0) 14))} is VALID [2022-04-27 14:43:44,064 INFO L290 TraceCheckUtils]: 179: Hoare triple {19107#(and (= 21 (+ (- 2) main_~c~0)) (= (+ (- 9) 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; {19129#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-27 14:43:44,064 INFO L290 TraceCheckUtils]: 180: Hoare triple {19129#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} assume !false; {19129#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-27 14:43:44,065 INFO L272 TraceCheckUtils]: 181: Hoare triple {19129#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-27 14:43:44,065 INFO L290 TraceCheckUtils]: 182: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-27 14:43:44,065 INFO L290 TraceCheckUtils]: 183: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-27 14:43:44,065 INFO L290 TraceCheckUtils]: 184: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-27 14:43:44,065 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {18563#true} {19129#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} #54#return; {19129#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-27 14:43:44,066 INFO L290 TraceCheckUtils]: 186: Hoare triple {19129#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} assume !(~c~0 < ~k~0); {19151#(and (<= main_~k~0 24) (< 23 main_~k~0) (= main_~y~0 24))} is VALID [2022-04-27 14:43:44,067 INFO L272 TraceCheckUtils]: 187: Hoare triple {19151#(and (<= main_~k~0 24) (< 23 main_~k~0) (= main_~y~0 24))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19155#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:43:44,067 INFO L290 TraceCheckUtils]: 188: Hoare triple {19155#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19159#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:43:44,067 INFO L290 TraceCheckUtils]: 189: Hoare triple {19159#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18564#false} is VALID [2022-04-27 14:43:44,067 INFO L290 TraceCheckUtils]: 190: Hoare triple {18564#false} assume !false; {18564#false} is VALID [2022-04-27 14:43:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 50 proven. 900 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2022-04-27 14:43:44,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:43:44,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:43:44,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711417534] [2022-04-27 14:43:44,399 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:43:44,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534819228] [2022-04-27 14:43:44,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534819228] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:43:44,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:43:44,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2022-04-27 14:43:44,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635009570] [2022-04-27 14:43:44,399 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:43:44,399 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) Word has length 191 [2022-04-27 14:43:44,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:43:44,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-27 14:43:44,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:44,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 14:43:44,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:43:44,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 14:43:44,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 14:43:44,557 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-27 14:43:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:52,240 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2022-04-27 14:43:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-27 14:43:52,240 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) Word has length 191 [2022-04-27 14:43:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:43:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-27 14:43:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 128 transitions. [2022-04-27 14:43:52,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-27 14:43:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 128 transitions. [2022-04-27 14:43:52,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 128 transitions. [2022-04-27 14:43:52,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:52,466 INFO L225 Difference]: With dead ends: 108 [2022-04-27 14:43:52,466 INFO L226 Difference]: Without dead ends: 103 [2022-04-27 14:43:52,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 14:43:52,467 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 2167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-27 14:43:52,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1265 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2167 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-27 14:43:52,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-27 14:43:52,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-27 14:43:52,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:43:52,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 14:43:52,561 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 14:43:52,562 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 14:43:52,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:52,563 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-27 14:43:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-27 14:43:52,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:52,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:52,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 103 states. [2022-04-27 14:43:52,564 INFO L87 Difference]: Start difference. First operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 103 states. [2022-04-27 14:43:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:52,566 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-27 14:43:52,567 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-27 14:43:52,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:52,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:52,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:43:52,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:43:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 14:43:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2022-04-27 14:43:52,570 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 191 [2022-04-27 14:43:52,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:43:52,570 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2022-04-27 14:43:52,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-27 14:43:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-27 14:43:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-04-27 14:43:52,571 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:43:52,571 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:43:52,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-27 14:43:52,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-27 14:43:52,775 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:43:52,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:43:52,775 INFO L85 PathProgramCache]: Analyzing trace with hash 447117384, now seen corresponding path program 25 times [2022-04-27 14:43:52,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:43:52,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056370450] [2022-04-27 14:43:52,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:43:52,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:43:52,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:43:52,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [76667382] [2022-04-27 14:43:52,842 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:43:52,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:43:52,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:43:52,843 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:43:52,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-27 14:43:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:43:53,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-27 14:43:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:43:53,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:43:54,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {19754#true} call ULTIMATE.init(); {19754#true} is VALID [2022-04-27 14:43:54,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {19754#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); {19754#true} is VALID [2022-04-27 14:43:54,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19754#true} {19754#true} #60#return; {19754#true} is VALID [2022-04-27 14:43:54,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {19754#true} call #t~ret5 := main(); {19754#true} is VALID [2022-04-27 14:43:54,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {19754#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; {19754#true} is VALID [2022-04-27 14:43:54,839 INFO L272 TraceCheckUtils]: 6: Hoare triple {19754#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,839 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19754#true} {19754#true} #52#return; {19754#true} is VALID [2022-04-27 14:43:54,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {19754#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {19792#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:54,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {19792#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {19792#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:54,839 INFO L272 TraceCheckUtils]: 13: Hoare triple {19792#(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)); {19754#true} is VALID [2022-04-27 14:43:54,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,840 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19754#true} {19792#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {19792#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:54,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {19792#(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; {19814#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:43:54,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {19814#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {19814#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:43:54,841 INFO L272 TraceCheckUtils]: 20: Hoare triple {19814#(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)); {19754#true} is VALID [2022-04-27 14:43:54,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,841 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {19754#true} {19814#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {19814#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:43:54,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {19814#(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; {19836#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:43:54,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {19836#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {19836#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:43:54,842 INFO L272 TraceCheckUtils]: 27: Hoare triple {19836#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,842 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {19754#true} {19836#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {19836#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:43:54,843 INFO L290 TraceCheckUtils]: 32: Hoare triple {19836#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19858#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:43:54,843 INFO L290 TraceCheckUtils]: 33: Hoare triple {19858#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {19858#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:43:54,843 INFO L272 TraceCheckUtils]: 34: Hoare triple {19858#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,843 INFO L290 TraceCheckUtils]: 37: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,844 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {19754#true} {19858#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {19858#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:43:54,844 INFO L290 TraceCheckUtils]: 39: Hoare triple {19858#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19880#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:54,844 INFO L290 TraceCheckUtils]: 40: Hoare triple {19880#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {19880#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:54,845 INFO L272 TraceCheckUtils]: 41: Hoare triple {19880#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,845 INFO L290 TraceCheckUtils]: 43: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,845 INFO L290 TraceCheckUtils]: 44: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,845 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19754#true} {19880#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #54#return; {19880#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:54,845 INFO L290 TraceCheckUtils]: 46: Hoare triple {19880#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19902#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:43:54,846 INFO L290 TraceCheckUtils]: 47: Hoare triple {19902#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {19902#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:43:54,846 INFO L272 TraceCheckUtils]: 48: Hoare triple {19902#(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)); {19754#true} is VALID [2022-04-27 14:43:54,846 INFO L290 TraceCheckUtils]: 49: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,846 INFO L290 TraceCheckUtils]: 50: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,846 INFO L290 TraceCheckUtils]: 51: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,859 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19754#true} {19902#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #54#return; {19902#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:43:54,860 INFO L290 TraceCheckUtils]: 53: Hoare triple {19902#(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; {19924#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:54,860 INFO L290 TraceCheckUtils]: 54: Hoare triple {19924#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {19924#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:54,860 INFO L272 TraceCheckUtils]: 55: Hoare triple {19924#(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)); {19754#true} is VALID [2022-04-27 14:43:54,860 INFO L290 TraceCheckUtils]: 56: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,860 INFO L290 TraceCheckUtils]: 57: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,860 INFO L290 TraceCheckUtils]: 58: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,861 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19754#true} {19924#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {19924#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:54,861 INFO L290 TraceCheckUtils]: 60: Hoare triple {19924#(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; {19946#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:43:54,861 INFO L290 TraceCheckUtils]: 61: Hoare triple {19946#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !false; {19946#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:43:54,861 INFO L272 TraceCheckUtils]: 62: Hoare triple {19946#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,861 INFO L290 TraceCheckUtils]: 63: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,861 INFO L290 TraceCheckUtils]: 64: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,862 INFO L290 TraceCheckUtils]: 65: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,862 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {19754#true} {19946#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #54#return; {19946#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:43:54,862 INFO L290 TraceCheckUtils]: 67: Hoare triple {19946#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19968#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:54,863 INFO L290 TraceCheckUtils]: 68: Hoare triple {19968#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} assume !false; {19968#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:54,863 INFO L272 TraceCheckUtils]: 69: Hoare triple {19968#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,863 INFO L290 TraceCheckUtils]: 70: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,863 INFO L290 TraceCheckUtils]: 71: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,863 INFO L290 TraceCheckUtils]: 72: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,863 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {19754#true} {19968#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} #54#return; {19968#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:54,864 INFO L290 TraceCheckUtils]: 74: Hoare triple {19968#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19990#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:43:54,864 INFO L290 TraceCheckUtils]: 75: Hoare triple {19990#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {19990#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:43:54,864 INFO L272 TraceCheckUtils]: 76: Hoare triple {19990#(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)); {19754#true} is VALID [2022-04-27 14:43:54,864 INFO L290 TraceCheckUtils]: 77: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,864 INFO L290 TraceCheckUtils]: 78: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,864 INFO L290 TraceCheckUtils]: 79: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,864 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {19754#true} {19990#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {19990#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:43:54,865 INFO L290 TraceCheckUtils]: 81: Hoare triple {19990#(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; {20012#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:43:54,865 INFO L290 TraceCheckUtils]: 82: Hoare triple {20012#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {20012#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:43:54,865 INFO L272 TraceCheckUtils]: 83: Hoare triple {20012#(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)); {19754#true} is VALID [2022-04-27 14:43:54,865 INFO L290 TraceCheckUtils]: 84: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,865 INFO L290 TraceCheckUtils]: 85: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,865 INFO L290 TraceCheckUtils]: 86: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,866 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {19754#true} {20012#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #54#return; {20012#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:43:54,866 INFO L290 TraceCheckUtils]: 88: Hoare triple {20012#(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; {20034#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-27 14:43:54,866 INFO L290 TraceCheckUtils]: 89: Hoare triple {20034#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {20034#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-27 14:43:54,866 INFO L272 TraceCheckUtils]: 90: Hoare triple {20034#(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)); {19754#true} is VALID [2022-04-27 14:43:54,867 INFO L290 TraceCheckUtils]: 91: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,867 INFO L290 TraceCheckUtils]: 92: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,867 INFO L290 TraceCheckUtils]: 93: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,867 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {19754#true} {20034#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #54#return; {20034#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-27 14:43:54,867 INFO L290 TraceCheckUtils]: 95: Hoare triple {20034#(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; {20056#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:43:54,868 INFO L290 TraceCheckUtils]: 96: Hoare triple {20056#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !false; {20056#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:43:54,868 INFO L272 TraceCheckUtils]: 97: Hoare triple {20056#(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)); {19754#true} is VALID [2022-04-27 14:43:54,868 INFO L290 TraceCheckUtils]: 98: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,868 INFO L290 TraceCheckUtils]: 99: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,868 INFO L290 TraceCheckUtils]: 100: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,868 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {19754#true} {20056#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} #54#return; {20056#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:43:54,869 INFO L290 TraceCheckUtils]: 102: Hoare triple {20056#(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; {20078#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-27 14:43:54,869 INFO L290 TraceCheckUtils]: 103: Hoare triple {20078#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !false; {20078#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-27 14:43:54,869 INFO L272 TraceCheckUtils]: 104: Hoare triple {20078#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,869 INFO L290 TraceCheckUtils]: 105: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,869 INFO L290 TraceCheckUtils]: 106: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,869 INFO L290 TraceCheckUtils]: 107: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,870 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19754#true} {20078#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #54#return; {20078#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-27 14:43:54,870 INFO L290 TraceCheckUtils]: 109: Hoare triple {20078#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20100#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:43:54,870 INFO L290 TraceCheckUtils]: 110: Hoare triple {20100#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} assume !false; {20100#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:43:54,870 INFO L272 TraceCheckUtils]: 111: Hoare triple {20100#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,870 INFO L290 TraceCheckUtils]: 112: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,870 INFO L290 TraceCheckUtils]: 113: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,870 INFO L290 TraceCheckUtils]: 114: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,871 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {19754#true} {20100#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} #54#return; {20100#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:43:54,871 INFO L290 TraceCheckUtils]: 116: Hoare triple {20100#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20122#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:43:54,872 INFO L290 TraceCheckUtils]: 117: Hoare triple {20122#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {20122#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:43:54,872 INFO L272 TraceCheckUtils]: 118: Hoare triple {20122#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,872 INFO L290 TraceCheckUtils]: 119: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,872 INFO L290 TraceCheckUtils]: 120: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,872 INFO L290 TraceCheckUtils]: 121: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,872 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {19754#true} {20122#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {20122#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:43:54,873 INFO L290 TraceCheckUtils]: 123: Hoare triple {20122#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20144#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:43:54,873 INFO L290 TraceCheckUtils]: 124: Hoare triple {20144#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {20144#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:43:54,873 INFO L272 TraceCheckUtils]: 125: Hoare triple {20144#(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)); {19754#true} is VALID [2022-04-27 14:43:54,873 INFO L290 TraceCheckUtils]: 126: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,873 INFO L290 TraceCheckUtils]: 127: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,873 INFO L290 TraceCheckUtils]: 128: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,873 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {19754#true} {20144#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {20144#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:43:54,874 INFO L290 TraceCheckUtils]: 130: Hoare triple {20144#(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; {20166#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 14:43:54,874 INFO L290 TraceCheckUtils]: 131: Hoare triple {20166#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !false; {20166#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 14:43:54,874 INFO L272 TraceCheckUtils]: 132: Hoare triple {20166#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,874 INFO L290 TraceCheckUtils]: 133: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,874 INFO L290 TraceCheckUtils]: 134: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,874 INFO L290 TraceCheckUtils]: 135: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,875 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {19754#true} {20166#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} #54#return; {20166#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 14:43:54,875 INFO L290 TraceCheckUtils]: 137: Hoare triple {20166#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20188#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:54,875 INFO L290 TraceCheckUtils]: 138: Hoare triple {20188#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} assume !false; {20188#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:54,875 INFO L272 TraceCheckUtils]: 139: Hoare triple {20188#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,876 INFO L290 TraceCheckUtils]: 140: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,876 INFO L290 TraceCheckUtils]: 141: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,876 INFO L290 TraceCheckUtils]: 142: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,876 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {19754#true} {20188#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} #54#return; {20188#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:54,876 INFO L290 TraceCheckUtils]: 144: Hoare triple {20188#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20210#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-27 14:43:54,877 INFO L290 TraceCheckUtils]: 145: Hoare triple {20210#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} assume !false; {20210#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-27 14:43:54,877 INFO L272 TraceCheckUtils]: 146: Hoare triple {20210#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,877 INFO L290 TraceCheckUtils]: 147: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,877 INFO L290 TraceCheckUtils]: 148: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,877 INFO L290 TraceCheckUtils]: 149: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,877 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {19754#true} {20210#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} #54#return; {20210#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-27 14:43:54,878 INFO L290 TraceCheckUtils]: 151: Hoare triple {20210#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20232#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-27 14:43:54,878 INFO L290 TraceCheckUtils]: 152: Hoare triple {20232#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !false; {20232#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-27 14:43:54,878 INFO L272 TraceCheckUtils]: 153: Hoare triple {20232#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,878 INFO L290 TraceCheckUtils]: 154: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,878 INFO L290 TraceCheckUtils]: 155: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,878 INFO L290 TraceCheckUtils]: 156: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,879 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {19754#true} {20232#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} #54#return; {20232#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-27 14:43:54,879 INFO L290 TraceCheckUtils]: 158: Hoare triple {20232#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20254#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 14:43:54,879 INFO L290 TraceCheckUtils]: 159: Hoare triple {20254#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {20254#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 14:43:54,879 INFO L272 TraceCheckUtils]: 160: Hoare triple {20254#(and (= main_~c~0 21) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,879 INFO L290 TraceCheckUtils]: 161: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,880 INFO L290 TraceCheckUtils]: 162: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,880 INFO L290 TraceCheckUtils]: 163: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,880 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {19754#true} {20254#(and (= main_~c~0 21) (= main_~y~0 21))} #54#return; {20254#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 14:43:54,880 INFO L290 TraceCheckUtils]: 165: Hoare triple {20254#(and (= main_~c~0 21) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20276#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:43:54,881 INFO L290 TraceCheckUtils]: 166: Hoare triple {20276#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {20276#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:43:54,881 INFO L272 TraceCheckUtils]: 167: Hoare triple {20276#(and (= main_~y~0 22) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,881 INFO L290 TraceCheckUtils]: 168: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,881 INFO L290 TraceCheckUtils]: 169: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,881 INFO L290 TraceCheckUtils]: 170: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,881 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {19754#true} {20276#(and (= main_~y~0 22) (= main_~c~0 22))} #54#return; {20276#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:43:54,882 INFO L290 TraceCheckUtils]: 172: Hoare triple {20276#(and (= main_~y~0 22) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20298#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-27 14:43:54,882 INFO L290 TraceCheckUtils]: 173: Hoare triple {20298#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !false; {20298#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-27 14:43:54,882 INFO L272 TraceCheckUtils]: 174: Hoare triple {20298#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,882 INFO L290 TraceCheckUtils]: 175: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,882 INFO L290 TraceCheckUtils]: 176: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,882 INFO L290 TraceCheckUtils]: 177: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,883 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {19754#true} {20298#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} #54#return; {20298#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-27 14:43:54,883 INFO L290 TraceCheckUtils]: 179: Hoare triple {20298#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20320#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 14:43:54,883 INFO L290 TraceCheckUtils]: 180: Hoare triple {20320#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {20320#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 14:43:54,883 INFO L272 TraceCheckUtils]: 181: Hoare triple {20320#(and (= main_~c~0 24) (= main_~y~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,883 INFO L290 TraceCheckUtils]: 182: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,883 INFO L290 TraceCheckUtils]: 183: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,884 INFO L290 TraceCheckUtils]: 184: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,884 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {19754#true} {20320#(and (= main_~c~0 24) (= main_~y~0 24))} #54#return; {20320#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 14:43:54,884 INFO L290 TraceCheckUtils]: 186: Hoare triple {20320#(and (= main_~c~0 24) (= main_~y~0 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20342#(and (< 24 main_~k~0) (<= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 14:43:54,885 INFO L290 TraceCheckUtils]: 187: Hoare triple {20342#(and (< 24 main_~k~0) (<= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !false; {20342#(and (< 24 main_~k~0) (<= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 14:43:54,885 INFO L272 TraceCheckUtils]: 188: Hoare triple {20342#(and (< 24 main_~k~0) (<= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-27 14:43:54,885 INFO L290 TraceCheckUtils]: 189: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-27 14:43:54,885 INFO L290 TraceCheckUtils]: 190: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-27 14:43:54,885 INFO L290 TraceCheckUtils]: 191: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-27 14:43:54,885 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {19754#true} {20342#(and (< 24 main_~k~0) (<= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} #54#return; {20342#(and (< 24 main_~k~0) (<= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 14:43:54,888 INFO L290 TraceCheckUtils]: 193: Hoare triple {20342#(and (< 24 main_~k~0) (<= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !(~c~0 < ~k~0); {20364#(and (<= main_~k~0 25) (< 24 main_~k~0) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 14:43:54,888 INFO L272 TraceCheckUtils]: 194: Hoare triple {20364#(and (<= main_~k~0 25) (< 24 main_~k~0) (= (+ (- 1) main_~y~0) 24))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20368#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:43:54,889 INFO L290 TraceCheckUtils]: 195: Hoare triple {20368#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20372#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:43:54,889 INFO L290 TraceCheckUtils]: 196: Hoare triple {20372#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19755#false} is VALID [2022-04-27 14:43:54,889 INFO L290 TraceCheckUtils]: 197: Hoare triple {19755#false} assume !false; {19755#false} is VALID [2022-04-27 14:43:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 52 proven. 975 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2022-04-27 14:43:54,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:43:55,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:43:55,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056370450] [2022-04-27 14:43:55,250 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:43:55,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76667382] [2022-04-27 14:43:55,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76667382] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:43:55,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:43:55,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2022-04-27 14:43:55,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583526556] [2022-04-27 14:43:55,251 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:43:55,251 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) Word has length 198 [2022-04-27 14:43:55,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:43:55,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-27 14:43:55,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:55,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-27 14:43:55,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:43:55,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-27 14:43:55,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 14:43:55,452 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-27 14:44:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:06,899 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-04-27 14:44:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 14:44:06,899 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) Word has length 198 [2022-04-27 14:44:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:44:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-27 14:44:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 132 transitions. [2022-04-27 14:44:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-27 14:44:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 132 transitions. [2022-04-27 14:44:06,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 132 transitions. [2022-04-27 14:44:07,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:44:07,203 INFO L225 Difference]: With dead ends: 111 [2022-04-27 14:44:07,203 INFO L226 Difference]: Without dead ends: 106 [2022-04-27 14:44:07,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=1154, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 14:44:07,203 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-27 14:44:07,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1339 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-04-27 14:44:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-27 14:44:07,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-04-27 14:44:07,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:44:07,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 14:44:07,288 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 14:44:07,288 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 14:44:07,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:07,290 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-04-27 14:44:07,290 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-27 14:44:07,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:44:07,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:44:07,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 106 states. [2022-04-27 14:44:07,291 INFO L87 Difference]: Start difference. First operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 106 states. [2022-04-27 14:44:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:07,294 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-04-27 14:44:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-27 14:44:07,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:44:07,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:44:07,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:44:07,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:44:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 14:44:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2022-04-27 14:44:07,297 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 198 [2022-04-27 14:44:07,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:44:07,297 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2022-04-27 14:44:07,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-27 14:44:07,298 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-27 14:44:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-04-27 14:44:07,298 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:44:07,299 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:44:07,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-27 14:44:07,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-27 14:44:07,506 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:44:07,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:44:07,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1629673417, now seen corresponding path program 26 times [2022-04-27 14:44:07,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:44:07,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586016677] [2022-04-27 14:44:07,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:44:07,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:44:07,526 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:44:07,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968856727] [2022-04-27 14:44:07,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:44:07,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:44:07,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:44:07,540 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:44:07,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-27 14:44:08,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:44:08,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:44:08,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-27 14:44:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:44:08,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:44:09,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {20983#true} call ULTIMATE.init(); {20983#true} is VALID [2022-04-27 14:44:09,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {20983#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); {20983#true} is VALID [2022-04-27 14:44:09,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20983#true} {20983#true} #60#return; {20983#true} is VALID [2022-04-27 14:44:09,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {20983#true} call #t~ret5 := main(); {20983#true} is VALID [2022-04-27 14:44:09,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {20983#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; {20983#true} is VALID [2022-04-27 14:44:09,459 INFO L272 TraceCheckUtils]: 6: Hoare triple {20983#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {20983#true} is VALID [2022-04-27 14:44:09,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,459 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20983#true} {20983#true} #52#return; {20983#true} is VALID [2022-04-27 14:44:09,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {20983#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {21021#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:09,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {21021#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {21021#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:09,460 INFO L272 TraceCheckUtils]: 13: Hoare triple {21021#(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)); {20983#true} is VALID [2022-04-27 14:44:09,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,460 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20983#true} {21021#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {21021#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:09,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {21021#(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; {21043#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:44:09,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {21043#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {21043#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:44:09,461 INFO L272 TraceCheckUtils]: 20: Hoare triple {21043#(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)); {20983#true} is VALID [2022-04-27 14:44:09,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,461 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {20983#true} {21043#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {21043#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:44:09,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {21043#(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; {21065#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:44:09,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {21065#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {21065#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:44:09,462 INFO L272 TraceCheckUtils]: 27: Hoare triple {21065#(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)); {20983#true} is VALID [2022-04-27 14:44:09,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,463 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20983#true} {21065#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {21065#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:44:09,463 INFO L290 TraceCheckUtils]: 32: Hoare triple {21065#(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; {21087#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:44:09,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {21087#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {21087#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:44:09,464 INFO L272 TraceCheckUtils]: 34: Hoare triple {21087#(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)); {20983#true} is VALID [2022-04-27 14:44:09,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,464 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20983#true} {21087#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {21087#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:44:09,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {21087#(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; {21109#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:09,465 INFO L290 TraceCheckUtils]: 40: Hoare triple {21109#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {21109#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:09,465 INFO L272 TraceCheckUtils]: 41: Hoare triple {21109#(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)); {20983#true} is VALID [2022-04-27 14:44:09,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,465 INFO L290 TraceCheckUtils]: 44: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,465 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20983#true} {21109#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {21109#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:09,466 INFO L290 TraceCheckUtils]: 46: Hoare triple {21109#(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; {21131#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:44:09,466 INFO L290 TraceCheckUtils]: 47: Hoare triple {21131#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !false; {21131#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:44:09,466 INFO L272 TraceCheckUtils]: 48: Hoare triple {21131#(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)); {20983#true} is VALID [2022-04-27 14:44:09,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,467 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20983#true} {21131#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #54#return; {21131#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:44:09,467 INFO L290 TraceCheckUtils]: 53: Hoare triple {21131#(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; {21153#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:09,467 INFO L290 TraceCheckUtils]: 54: Hoare triple {21153#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} assume !false; {21153#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:09,467 INFO L272 TraceCheckUtils]: 55: Hoare triple {21153#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-27 14:44:09,468 INFO L290 TraceCheckUtils]: 56: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,468 INFO L290 TraceCheckUtils]: 57: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,468 INFO L290 TraceCheckUtils]: 58: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,468 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20983#true} {21153#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} #54#return; {21153#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:09,468 INFO L290 TraceCheckUtils]: 60: Hoare triple {21153#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21175#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-27 14:44:09,469 INFO L290 TraceCheckUtils]: 61: Hoare triple {21175#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {21175#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-27 14:44:09,469 INFO L272 TraceCheckUtils]: 62: Hoare triple {21175#(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)); {20983#true} is VALID [2022-04-27 14:44:09,469 INFO L290 TraceCheckUtils]: 63: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,469 INFO L290 TraceCheckUtils]: 64: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,469 INFO L290 TraceCheckUtils]: 65: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,469 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20983#true} {21175#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #54#return; {21175#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-27 14:44:09,470 INFO L290 TraceCheckUtils]: 67: Hoare triple {21175#(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; {21197#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:09,470 INFO L290 TraceCheckUtils]: 68: Hoare triple {21197#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {21197#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:09,470 INFO L272 TraceCheckUtils]: 69: Hoare triple {21197#(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)); {20983#true} is VALID [2022-04-27 14:44:09,470 INFO L290 TraceCheckUtils]: 70: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,470 INFO L290 TraceCheckUtils]: 71: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,470 INFO L290 TraceCheckUtils]: 72: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,471 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20983#true} {21197#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {21197#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:09,471 INFO L290 TraceCheckUtils]: 74: Hoare triple {21197#(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; {21219#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:09,471 INFO L290 TraceCheckUtils]: 75: Hoare triple {21219#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !false; {21219#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:09,471 INFO L272 TraceCheckUtils]: 76: Hoare triple {21219#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-27 14:44:09,472 INFO L290 TraceCheckUtils]: 77: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,472 INFO L290 TraceCheckUtils]: 78: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,472 INFO L290 TraceCheckUtils]: 79: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,472 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {20983#true} {21219#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} #54#return; {21219#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:09,472 INFO L290 TraceCheckUtils]: 81: Hoare triple {21219#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21241#(and (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-27 14:44:09,473 INFO L290 TraceCheckUtils]: 82: Hoare triple {21241#(and (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} assume !false; {21241#(and (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-27 14:44:09,473 INFO L272 TraceCheckUtils]: 83: Hoare triple {21241#(and (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-27 14:44:09,473 INFO L290 TraceCheckUtils]: 84: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,473 INFO L290 TraceCheckUtils]: 85: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,473 INFO L290 TraceCheckUtils]: 86: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,473 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {20983#true} {21241#(and (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} #54#return; {21241#(and (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-27 14:44:09,474 INFO L290 TraceCheckUtils]: 88: Hoare triple {21241#(and (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21263#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-27 14:44:09,474 INFO L290 TraceCheckUtils]: 89: Hoare triple {21263#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} assume !false; {21263#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-27 14:44:09,474 INFO L272 TraceCheckUtils]: 90: Hoare triple {21263#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-27 14:44:09,474 INFO L290 TraceCheckUtils]: 91: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,474 INFO L290 TraceCheckUtils]: 92: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,474 INFO L290 TraceCheckUtils]: 93: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,475 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {20983#true} {21263#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} #54#return; {21263#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-27 14:44:09,475 INFO L290 TraceCheckUtils]: 95: Hoare triple {21263#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21285#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:44:09,475 INFO L290 TraceCheckUtils]: 96: Hoare triple {21285#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {21285#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:44:09,476 INFO L272 TraceCheckUtils]: 97: Hoare triple {21285#(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)); {20983#true} is VALID [2022-04-27 14:44:09,476 INFO L290 TraceCheckUtils]: 98: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,476 INFO L290 TraceCheckUtils]: 99: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,476 INFO L290 TraceCheckUtils]: 100: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,476 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {20983#true} {21285#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {21285#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:44:09,476 INFO L290 TraceCheckUtils]: 102: Hoare triple {21285#(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; {21307#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:44:09,477 INFO L290 TraceCheckUtils]: 103: Hoare triple {21307#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {21307#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:44:09,477 INFO L272 TraceCheckUtils]: 104: Hoare triple {21307#(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)); {20983#true} is VALID [2022-04-27 14:44:09,477 INFO L290 TraceCheckUtils]: 105: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,477 INFO L290 TraceCheckUtils]: 106: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,477 INFO L290 TraceCheckUtils]: 107: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,477 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {20983#true} {21307#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {21307#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:44:09,478 INFO L290 TraceCheckUtils]: 109: Hoare triple {21307#(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; {21329#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:44:09,478 INFO L290 TraceCheckUtils]: 110: Hoare triple {21329#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {21329#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:44:09,478 INFO L272 TraceCheckUtils]: 111: Hoare triple {21329#(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)); {20983#true} is VALID [2022-04-27 14:44:09,478 INFO L290 TraceCheckUtils]: 112: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,478 INFO L290 TraceCheckUtils]: 113: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,478 INFO L290 TraceCheckUtils]: 114: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,479 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {20983#true} {21329#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #54#return; {21329#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:44:09,479 INFO L290 TraceCheckUtils]: 116: Hoare triple {21329#(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; {21351#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:09,479 INFO L290 TraceCheckUtils]: 117: Hoare triple {21351#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !false; {21351#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:09,479 INFO L272 TraceCheckUtils]: 118: Hoare triple {21351#(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)); {20983#true} is VALID [2022-04-27 14:44:09,480 INFO L290 TraceCheckUtils]: 119: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,480 INFO L290 TraceCheckUtils]: 120: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,480 INFO L290 TraceCheckUtils]: 121: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,480 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {20983#true} {21351#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} #54#return; {21351#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:09,480 INFO L290 TraceCheckUtils]: 123: Hoare triple {21351#(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; {21373#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:44:09,481 INFO L290 TraceCheckUtils]: 124: Hoare triple {21373#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {21373#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:44:09,481 INFO L272 TraceCheckUtils]: 125: Hoare triple {21373#(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)); {20983#true} is VALID [2022-04-27 14:44:09,481 INFO L290 TraceCheckUtils]: 126: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,481 INFO L290 TraceCheckUtils]: 127: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,481 INFO L290 TraceCheckUtils]: 128: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,481 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {20983#true} {21373#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {21373#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:44:09,482 INFO L290 TraceCheckUtils]: 130: Hoare triple {21373#(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; {21395#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 14:44:09,482 INFO L290 TraceCheckUtils]: 131: Hoare triple {21395#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !false; {21395#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 14:44:09,482 INFO L272 TraceCheckUtils]: 132: Hoare triple {21395#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-27 14:44:09,482 INFO L290 TraceCheckUtils]: 133: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,482 INFO L290 TraceCheckUtils]: 134: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,482 INFO L290 TraceCheckUtils]: 135: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,483 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {20983#true} {21395#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} #54#return; {21395#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 14:44:09,483 INFO L290 TraceCheckUtils]: 137: Hoare triple {21395#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21417#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-27 14:44:09,483 INFO L290 TraceCheckUtils]: 138: Hoare triple {21417#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} assume !false; {21417#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-27 14:44:09,483 INFO L272 TraceCheckUtils]: 139: Hoare triple {21417#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-27 14:44:09,484 INFO L290 TraceCheckUtils]: 140: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,484 INFO L290 TraceCheckUtils]: 141: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,484 INFO L290 TraceCheckUtils]: 142: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,484 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {20983#true} {21417#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} #54#return; {21417#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-27 14:44:09,484 INFO L290 TraceCheckUtils]: 144: Hoare triple {21417#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21439#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:09,485 INFO L290 TraceCheckUtils]: 145: Hoare triple {21439#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} assume !false; {21439#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:09,485 INFO L272 TraceCheckUtils]: 146: Hoare triple {21439#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-27 14:44:09,485 INFO L290 TraceCheckUtils]: 147: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,485 INFO L290 TraceCheckUtils]: 148: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,485 INFO L290 TraceCheckUtils]: 149: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,485 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {20983#true} {21439#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} #54#return; {21439#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:09,486 INFO L290 TraceCheckUtils]: 151: Hoare triple {21439#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21461#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} is VALID [2022-04-27 14:44:09,486 INFO L290 TraceCheckUtils]: 152: Hoare triple {21461#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} assume !false; {21461#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} is VALID [2022-04-27 14:44:09,486 INFO L272 TraceCheckUtils]: 153: Hoare triple {21461#(and (= 16 (+ main_~c~0 (- 4))) (= 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)); {20983#true} is VALID [2022-04-27 14:44:09,486 INFO L290 TraceCheckUtils]: 154: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,486 INFO L290 TraceCheckUtils]: 155: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,486 INFO L290 TraceCheckUtils]: 156: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,487 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {20983#true} {21461#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} #54#return; {21461#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} is VALID [2022-04-27 14:44:09,487 INFO L290 TraceCheckUtils]: 158: Hoare triple {21461#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21483#(and (= 16 (+ main_~c~0 (- 5))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:09,487 INFO L290 TraceCheckUtils]: 159: Hoare triple {21483#(and (= 16 (+ main_~c~0 (- 5))) (= 20 (+ (- 1) main_~y~0)))} assume !false; {21483#(and (= 16 (+ main_~c~0 (- 5))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:09,487 INFO L272 TraceCheckUtils]: 160: Hoare triple {21483#(and (= 16 (+ main_~c~0 (- 5))) (= 20 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-27 14:44:09,488 INFO L290 TraceCheckUtils]: 161: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,488 INFO L290 TraceCheckUtils]: 162: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,488 INFO L290 TraceCheckUtils]: 163: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,488 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {20983#true} {21483#(and (= 16 (+ main_~c~0 (- 5))) (= 20 (+ (- 1) main_~y~0)))} #54#return; {21483#(and (= 16 (+ main_~c~0 (- 5))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:09,488 INFO L290 TraceCheckUtils]: 165: Hoare triple {21483#(and (= 16 (+ main_~c~0 (- 5))) (= 20 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21505#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:44:09,489 INFO L290 TraceCheckUtils]: 166: Hoare triple {21505#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {21505#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:44:09,489 INFO L272 TraceCheckUtils]: 167: Hoare triple {21505#(and (= main_~y~0 22) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-27 14:44:09,489 INFO L290 TraceCheckUtils]: 168: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,489 INFO L290 TraceCheckUtils]: 169: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,489 INFO L290 TraceCheckUtils]: 170: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,489 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {20983#true} {21505#(and (= main_~y~0 22) (= main_~c~0 22))} #54#return; {21505#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:44:09,490 INFO L290 TraceCheckUtils]: 172: Hoare triple {21505#(and (= main_~y~0 22) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21527#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-27 14:44:09,490 INFO L290 TraceCheckUtils]: 173: Hoare triple {21527#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !false; {21527#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-27 14:44:09,490 INFO L272 TraceCheckUtils]: 174: Hoare triple {21527#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-27 14:44:09,490 INFO L290 TraceCheckUtils]: 175: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,490 INFO L290 TraceCheckUtils]: 176: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,490 INFO L290 TraceCheckUtils]: 177: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,491 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {20983#true} {21527#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} #54#return; {21527#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-27 14:44:09,491 INFO L290 TraceCheckUtils]: 179: Hoare triple {21527#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21549#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 14:44:09,491 INFO L290 TraceCheckUtils]: 180: Hoare triple {21549#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {21549#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 14:44:09,491 INFO L272 TraceCheckUtils]: 181: Hoare triple {21549#(and (= main_~c~0 24) (= main_~y~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-27 14:44:09,491 INFO L290 TraceCheckUtils]: 182: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,491 INFO L290 TraceCheckUtils]: 183: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,492 INFO L290 TraceCheckUtils]: 184: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,492 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {20983#true} {21549#(and (= main_~c~0 24) (= main_~y~0 24))} #54#return; {21549#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 14:44:09,492 INFO L290 TraceCheckUtils]: 186: Hoare triple {21549#(and (= main_~c~0 24) (= main_~y~0 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21571#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 14:44:09,493 INFO L290 TraceCheckUtils]: 187: Hoare triple {21571#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !false; {21571#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 14:44:09,493 INFO L272 TraceCheckUtils]: 188: Hoare triple {21571#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-27 14:44:09,493 INFO L290 TraceCheckUtils]: 189: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,493 INFO L290 TraceCheckUtils]: 190: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,493 INFO L290 TraceCheckUtils]: 191: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,493 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {20983#true} {21571#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} #54#return; {21571#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 14:44:09,494 INFO L290 TraceCheckUtils]: 193: Hoare triple {21571#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21593#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-27 14:44:09,494 INFO L290 TraceCheckUtils]: 194: Hoare triple {21593#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} assume !false; {21593#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-27 14:44:09,494 INFO L272 TraceCheckUtils]: 195: Hoare triple {21593#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-27 14:44:09,494 INFO L290 TraceCheckUtils]: 196: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-27 14:44:09,494 INFO L290 TraceCheckUtils]: 197: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-27 14:44:09,494 INFO L290 TraceCheckUtils]: 198: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-27 14:44:09,495 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {20983#true} {21593#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} #54#return; {21593#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-27 14:44:09,496 INFO L290 TraceCheckUtils]: 200: Hoare triple {21593#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} assume !(~c~0 < ~k~0); {21615#(and (<= main_~k~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-27 14:44:09,497 INFO L272 TraceCheckUtils]: 201: Hoare triple {21615#(and (<= main_~k~0 26) (< 25 main_~k~0) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21619#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:44:09,497 INFO L290 TraceCheckUtils]: 202: Hoare triple {21619#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21623#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:44:09,497 INFO L290 TraceCheckUtils]: 203: Hoare triple {21623#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20984#false} is VALID [2022-04-27 14:44:09,497 INFO L290 TraceCheckUtils]: 204: Hoare triple {20984#false} assume !false; {20984#false} is VALID [2022-04-27 14:44:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2511 backedges. 54 proven. 1053 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-04-27 14:44:09,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:44:09,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:44:09,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586016677] [2022-04-27 14:44:09,912 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:44:09,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968856727] [2022-04-27 14:44:09,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968856727] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:44:09,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:44:09,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2022-04-27 14:44:09,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919691743] [2022-04-27 14:44:09,912 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:44:09,913 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) Word has length 205 [2022-04-27 14:44:09,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:44:09,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-27 14:44:10,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:44:10,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-27 14:44:10,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:44:10,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-27 14:44:10,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 14:44:10,161 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-27 14:44:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:21,796 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-27 14:44:21,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-27 14:44:21,796 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) Word has length 205 [2022-04-27 14:44:21,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:44:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-27 14:44:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 136 transitions. [2022-04-27 14:44:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-27 14:44:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 136 transitions. [2022-04-27 14:44:21,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 136 transitions. [2022-04-27 14:44:22,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:44:22,099 INFO L225 Difference]: With dead ends: 114 [2022-04-27 14:44:22,099 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 14:44:22,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=1223, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 14:44:22,100 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-27 14:44:22,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1415 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-04-27 14:44:22,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 14:44:22,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-27 14:44:22,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:44:22,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 14:44:22,183 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 14:44:22,183 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 14:44:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:22,185 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-27 14:44:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-27 14:44:22,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:44:22,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:44:22,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 109 states. [2022-04-27 14:44:22,186 INFO L87 Difference]: Start difference. First operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 109 states. [2022-04-27 14:44:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:22,189 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-27 14:44:22,189 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-27 14:44:22,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:44:22,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:44:22,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:44:22,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:44:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 14:44:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-27 14:44:22,192 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 205 [2022-04-27 14:44:22,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:44:22,192 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-27 14:44:22,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-27 14:44:22,192 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-27 14:44:22,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-04-27 14:44:22,193 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:44:22,193 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:44:22,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-27 14:44:22,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-27 14:44:22,398 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:44:22,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:44:22,398 INFO L85 PathProgramCache]: Analyzing trace with hash -12241624, now seen corresponding path program 27 times [2022-04-27 14:44:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:44:22,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669167296] [2022-04-27 14:44:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:44:22,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:44:22,413 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:44:22,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267140092] [2022-04-27 14:44:22,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:44:22,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:44:22,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:44:22,414 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:44:22,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-27 14:44:26,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2022-04-27 14:44:26,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:44:26,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 128 conjunts are in the unsatisfiable core [2022-04-27 14:44:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:44:26,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:44:27,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {22250#true} call ULTIMATE.init(); {22250#true} is VALID [2022-04-27 14:44:27,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {22250#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); {22250#true} is VALID [2022-04-27 14:44:27,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22250#true} {22250#true} #60#return; {22250#true} is VALID [2022-04-27 14:44:27,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {22250#true} call #t~ret5 := main(); {22250#true} is VALID [2022-04-27 14:44:27,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {22250#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; {22250#true} is VALID [2022-04-27 14:44:27,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {22250#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {22250#true} is VALID [2022-04-27 14:44:27,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,792 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22250#true} {22250#true} #52#return; {22250#true} is VALID [2022-04-27 14:44:27,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {22250#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {22288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:27,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {22288#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {22288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:27,792 INFO L272 TraceCheckUtils]: 13: Hoare triple {22288#(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)); {22250#true} is VALID [2022-04-27 14:44:27,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,793 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22250#true} {22288#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {22288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:27,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {22288#(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; {22310#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:44:27,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {22310#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {22310#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:44:27,793 INFO L272 TraceCheckUtils]: 20: Hoare triple {22310#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-27 14:44:27,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,794 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {22250#true} {22310#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {22310#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:44:27,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {22310#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22332#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:27,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {22332#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !false; {22332#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:27,796 INFO L272 TraceCheckUtils]: 27: Hoare triple {22332#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-27 14:44:27,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,797 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22250#true} {22332#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #54#return; {22332#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:27,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {22332#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22354#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:44:27,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {22354#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} assume !false; {22354#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:44:27,798 INFO L272 TraceCheckUtils]: 34: Hoare triple {22354#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-27 14:44:27,798 INFO L290 TraceCheckUtils]: 35: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,798 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22250#true} {22354#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} #54#return; {22354#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:44:27,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {22354#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22376#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {22376#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} assume !false; {22376#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,799 INFO L272 TraceCheckUtils]: 41: Hoare triple {22376#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-27 14:44:27,799 INFO L290 TraceCheckUtils]: 42: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,800 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {22250#true} {22376#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} #54#return; {22376#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {22376#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22398#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {22398#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0) (< 0 main_~k~0))} assume !false; {22398#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,800 INFO L272 TraceCheckUtils]: 48: Hoare triple {22398#(and (= (+ main_~y~0 (- 4)) 1) (= 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)); {22250#true} is VALID [2022-04-27 14:44:27,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,800 INFO L290 TraceCheckUtils]: 50: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,800 INFO L290 TraceCheckUtils]: 51: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,801 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22250#true} {22398#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0) (< 0 main_~k~0))} #54#return; {22398#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,801 INFO L290 TraceCheckUtils]: 53: Hoare triple {22398#(and (= (+ main_~y~0 (- 4)) 1) (= 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; {22420#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,801 INFO L290 TraceCheckUtils]: 54: Hoare triple {22420#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1) (< 0 main_~k~0))} assume !false; {22420#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,801 INFO L272 TraceCheckUtils]: 55: Hoare triple {22420#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 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)); {22250#true} is VALID [2022-04-27 14:44:27,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,801 INFO L290 TraceCheckUtils]: 58: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,802 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22250#true} {22420#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1) (< 0 main_~k~0))} #54#return; {22420#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,802 INFO L290 TraceCheckUtils]: 60: Hoare triple {22420#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 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; {22442#(and (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 14:44:27,802 INFO L290 TraceCheckUtils]: 61: Hoare triple {22442#(and (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} assume !false; {22442#(and (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 14:44:27,802 INFO L272 TraceCheckUtils]: 62: Hoare triple {22442#(and (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-27 14:44:27,802 INFO L290 TraceCheckUtils]: 63: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,802 INFO L290 TraceCheckUtils]: 64: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,802 INFO L290 TraceCheckUtils]: 65: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,803 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {22250#true} {22442#(and (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} #54#return; {22442#(and (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 14:44:27,803 INFO L290 TraceCheckUtils]: 67: Hoare triple {22442#(and (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22464#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,803 INFO L290 TraceCheckUtils]: 68: Hoare triple {22464#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {22464#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,803 INFO L272 TraceCheckUtils]: 69: Hoare triple {22464#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-27 14:44:27,803 INFO L290 TraceCheckUtils]: 70: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,803 INFO L290 TraceCheckUtils]: 71: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,803 INFO L290 TraceCheckUtils]: 72: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,803 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {22250#true} {22464#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} #54#return; {22464#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,804 INFO L290 TraceCheckUtils]: 74: Hoare triple {22464#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22486#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,804 INFO L290 TraceCheckUtils]: 75: Hoare triple {22486#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {22486#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,804 INFO L272 TraceCheckUtils]: 76: Hoare triple {22486#(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)); {22250#true} is VALID [2022-04-27 14:44:27,804 INFO L290 TraceCheckUtils]: 77: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,804 INFO L290 TraceCheckUtils]: 78: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,804 INFO L290 TraceCheckUtils]: 79: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,804 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22250#true} {22486#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} #54#return; {22486#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,805 INFO L290 TraceCheckUtils]: 81: Hoare triple {22486#(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; {22508#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,805 INFO L290 TraceCheckUtils]: 82: Hoare triple {22508#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} assume !false; {22508#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,805 INFO L272 TraceCheckUtils]: 83: Hoare triple {22508#(and (= main_~y~0 10) (= (+ (- 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)); {22250#true} is VALID [2022-04-27 14:44:27,805 INFO L290 TraceCheckUtils]: 84: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,805 INFO L290 TraceCheckUtils]: 85: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,805 INFO L290 TraceCheckUtils]: 86: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,805 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {22250#true} {22508#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} #54#return; {22508#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,806 INFO L290 TraceCheckUtils]: 88: Hoare triple {22508#(and (= main_~y~0 10) (= (+ (- 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; {22530#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,806 INFO L290 TraceCheckUtils]: 89: Hoare triple {22530#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !false; {22530#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,806 INFO L272 TraceCheckUtils]: 90: Hoare triple {22530#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-27 14:44:27,806 INFO L290 TraceCheckUtils]: 91: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,806 INFO L290 TraceCheckUtils]: 92: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,806 INFO L290 TraceCheckUtils]: 93: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,806 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22250#true} {22530#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} #54#return; {22530#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,807 INFO L290 TraceCheckUtils]: 95: Hoare triple {22530#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22552#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,807 INFO L290 TraceCheckUtils]: 96: Hoare triple {22552#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0))} assume !false; {22552#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,807 INFO L272 TraceCheckUtils]: 97: Hoare triple {22552#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-27 14:44:27,807 INFO L290 TraceCheckUtils]: 98: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,807 INFO L290 TraceCheckUtils]: 99: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,807 INFO L290 TraceCheckUtils]: 100: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,807 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {22250#true} {22552#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0))} #54#return; {22552#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,808 INFO L290 TraceCheckUtils]: 102: Hoare triple {22552#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22574#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 14:44:27,808 INFO L290 TraceCheckUtils]: 103: Hoare triple {22574#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {22574#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 14:44:27,808 INFO L272 TraceCheckUtils]: 104: Hoare triple {22574#(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)); {22250#true} is VALID [2022-04-27 14:44:27,808 INFO L290 TraceCheckUtils]: 105: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,808 INFO L290 TraceCheckUtils]: 106: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,808 INFO L290 TraceCheckUtils]: 107: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,808 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {22250#true} {22574#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} #54#return; {22574#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 14:44:27,809 INFO L290 TraceCheckUtils]: 109: Hoare triple {22574#(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; {22596#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:44:27,809 INFO L290 TraceCheckUtils]: 110: Hoare triple {22596#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !false; {22596#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:44:27,809 INFO L272 TraceCheckUtils]: 111: Hoare triple {22596#(and (= main_~c~0 14) (< 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)); {22250#true} is VALID [2022-04-27 14:44:27,809 INFO L290 TraceCheckUtils]: 112: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,809 INFO L290 TraceCheckUtils]: 113: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,809 INFO L290 TraceCheckUtils]: 114: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,809 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {22250#true} {22596#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} #54#return; {22596#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:44:27,809 INFO L290 TraceCheckUtils]: 116: Hoare triple {22596#(and (= main_~c~0 14) (< 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; {22618#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,810 INFO L290 TraceCheckUtils]: 117: Hoare triple {22618#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0))} assume !false; {22618#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,810 INFO L272 TraceCheckUtils]: 118: Hoare triple {22618#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 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)); {22250#true} is VALID [2022-04-27 14:44:27,810 INFO L290 TraceCheckUtils]: 119: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,810 INFO L290 TraceCheckUtils]: 120: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,810 INFO L290 TraceCheckUtils]: 121: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,810 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {22250#true} {22618#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0))} #54#return; {22618#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,810 INFO L290 TraceCheckUtils]: 123: Hoare triple {22618#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 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; {22640#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,811 INFO L290 TraceCheckUtils]: 124: Hoare triple {22640#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} assume !false; {22640#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,811 INFO L272 TraceCheckUtils]: 125: Hoare triple {22640#(and (= main_~c~0 16) (= (+ main_~y~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)); {22250#true} is VALID [2022-04-27 14:44:27,811 INFO L290 TraceCheckUtils]: 126: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,811 INFO L290 TraceCheckUtils]: 127: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,811 INFO L290 TraceCheckUtils]: 128: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,811 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {22250#true} {22640#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} #54#return; {22640#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,811 INFO L290 TraceCheckUtils]: 130: Hoare triple {22640#(and (= main_~c~0 16) (= (+ main_~y~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; {22662#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:44:27,812 INFO L290 TraceCheckUtils]: 131: Hoare triple {22662#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !false; {22662#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:44:27,812 INFO L272 TraceCheckUtils]: 132: Hoare triple {22662#(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)); {22250#true} is VALID [2022-04-27 14:44:27,812 INFO L290 TraceCheckUtils]: 133: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,812 INFO L290 TraceCheckUtils]: 134: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,812 INFO L290 TraceCheckUtils]: 135: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,812 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {22250#true} {22662#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} #54#return; {22662#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:44:27,812 INFO L290 TraceCheckUtils]: 137: Hoare triple {22662#(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; {22684#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 14:44:27,813 INFO L290 TraceCheckUtils]: 138: Hoare triple {22684#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} assume !false; {22684#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 14:44:27,813 INFO L272 TraceCheckUtils]: 139: Hoare triple {22684#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-27 14:44:27,813 INFO L290 TraceCheckUtils]: 140: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,813 INFO L290 TraceCheckUtils]: 141: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,813 INFO L290 TraceCheckUtils]: 142: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,813 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {22250#true} {22684#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} #54#return; {22684#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 14:44:27,813 INFO L290 TraceCheckUtils]: 144: Hoare triple {22684#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22706#(and (= (+ (- 2) main_~y~0) 17) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:44:27,814 INFO L290 TraceCheckUtils]: 145: Hoare triple {22706#(and (= (+ (- 2) main_~y~0) 17) (< 0 main_~k~0) (= 19 main_~c~0))} assume !false; {22706#(and (= (+ (- 2) main_~y~0) 17) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:44:27,814 INFO L272 TraceCheckUtils]: 146: Hoare triple {22706#(and (= (+ (- 2) main_~y~0) 17) (< 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)); {22250#true} is VALID [2022-04-27 14:44:27,814 INFO L290 TraceCheckUtils]: 147: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,814 INFO L290 TraceCheckUtils]: 148: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,814 INFO L290 TraceCheckUtils]: 149: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,814 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {22250#true} {22706#(and (= (+ (- 2) main_~y~0) 17) (< 0 main_~k~0) (= 19 main_~c~0))} #54#return; {22706#(and (= (+ (- 2) main_~y~0) 17) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:44:27,814 INFO L290 TraceCheckUtils]: 151: Hoare triple {22706#(and (= (+ (- 2) main_~y~0) 17) (< 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; {22728#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,815 INFO L290 TraceCheckUtils]: 152: Hoare triple {22728#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17) (< 0 main_~k~0))} assume !false; {22728#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,815 INFO L272 TraceCheckUtils]: 153: Hoare triple {22728#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17) (< 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)); {22250#true} is VALID [2022-04-27 14:44:27,815 INFO L290 TraceCheckUtils]: 154: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,815 INFO L290 TraceCheckUtils]: 155: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,815 INFO L290 TraceCheckUtils]: 156: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,815 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {22250#true} {22728#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17) (< 0 main_~k~0))} #54#return; {22728#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,815 INFO L290 TraceCheckUtils]: 158: Hoare triple {22728#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17) (< 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; {22750#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,815 INFO L290 TraceCheckUtils]: 159: Hoare triple {22750#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {22750#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,816 INFO L272 TraceCheckUtils]: 160: Hoare triple {22750#(and (= main_~y~0 21) (= 19 (+ (- 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)); {22250#true} is VALID [2022-04-27 14:44:27,816 INFO L290 TraceCheckUtils]: 161: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,816 INFO L290 TraceCheckUtils]: 162: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,816 INFO L290 TraceCheckUtils]: 163: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,816 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {22250#true} {22750#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #54#return; {22750#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,816 INFO L290 TraceCheckUtils]: 165: Hoare triple {22750#(and (= main_~y~0 21) (= 19 (+ (- 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; {22772#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,816 INFO L290 TraceCheckUtils]: 166: Hoare triple {22772#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 0 main_~k~0))} assume !false; {22772#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,817 INFO L272 TraceCheckUtils]: 167: Hoare triple {22772#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-27 14:44:27,817 INFO L290 TraceCheckUtils]: 168: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,817 INFO L290 TraceCheckUtils]: 169: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,817 INFO L290 TraceCheckUtils]: 170: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,817 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {22250#true} {22772#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 0 main_~k~0))} #54#return; {22772#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,817 INFO L290 TraceCheckUtils]: 172: Hoare triple {22772#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22794#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,817 INFO L290 TraceCheckUtils]: 173: Hoare triple {22794#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} assume !false; {22794#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,817 INFO L272 TraceCheckUtils]: 174: Hoare triple {22794#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-27 14:44:27,817 INFO L290 TraceCheckUtils]: 175: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,818 INFO L290 TraceCheckUtils]: 176: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,818 INFO L290 TraceCheckUtils]: 177: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,818 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {22250#true} {22794#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} #54#return; {22794#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,818 INFO L290 TraceCheckUtils]: 179: Hoare triple {22794#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22816#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,818 INFO L290 TraceCheckUtils]: 180: Hoare triple {22816#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} assume !false; {22816#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,818 INFO L272 TraceCheckUtils]: 181: Hoare triple {22816#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-27 14:44:27,818 INFO L290 TraceCheckUtils]: 182: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,818 INFO L290 TraceCheckUtils]: 183: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,819 INFO L290 TraceCheckUtils]: 184: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,819 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {22250#true} {22816#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} #54#return; {22816#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,819 INFO L290 TraceCheckUtils]: 186: Hoare triple {22816#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22838#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,819 INFO L290 TraceCheckUtils]: 187: Hoare triple {22838#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25) (< 0 main_~k~0))} assume !false; {22838#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,819 INFO L272 TraceCheckUtils]: 188: Hoare triple {22838#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-27 14:44:27,819 INFO L290 TraceCheckUtils]: 189: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-27 14:44:27,819 INFO L290 TraceCheckUtils]: 190: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-27 14:44:27,820 INFO L290 TraceCheckUtils]: 191: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-27 14:44:27,820 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {22250#true} {22838#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25) (< 0 main_~k~0))} #54#return; {22838#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,820 INFO L290 TraceCheckUtils]: 193: Hoare triple {22838#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22860#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,820 INFO L290 TraceCheckUtils]: 194: Hoare triple {22860#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26) (< 0 main_~k~0))} assume !false; {22860#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26) (< 0 main_~k~0))} is VALID [2022-04-27 14:44:27,820 INFO L272 TraceCheckUtils]: 195: Hoare triple {22860#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26) (< 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)); {22250#true} is VALID [2022-04-27 14:44:27,820 INFO L290 TraceCheckUtils]: 196: Hoare triple {22250#true} ~cond := #in~cond; {22870#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:44:27,821 INFO L290 TraceCheckUtils]: 197: Hoare triple {22870#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22874#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:44:27,821 INFO L290 TraceCheckUtils]: 198: Hoare triple {22874#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22874#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:44:27,821 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {22874#(not (= |__VERIFIER_assert_#in~cond| 0))} {22860#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26) (< 0 main_~k~0))} #54#return; {22881#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26) (< 0 main_~k~0) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} is VALID [2022-04-27 14:44:27,822 INFO L290 TraceCheckUtils]: 200: Hoare triple {22881#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26) (< 0 main_~k~0) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22885#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0))} is VALID [2022-04-27 14:44:27,823 INFO L290 TraceCheckUtils]: 201: Hoare triple {22885#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0))} assume !false; {22885#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0))} is VALID [2022-04-27 14:44:27,823 INFO L272 TraceCheckUtils]: 202: Hoare triple {22885#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~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)); {22250#true} is VALID [2022-04-27 14:44:27,823 INFO L290 TraceCheckUtils]: 203: Hoare triple {22250#true} ~cond := #in~cond; {22870#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:44:27,823 INFO L290 TraceCheckUtils]: 204: Hoare triple {22870#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22874#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:44:27,843 INFO L290 TraceCheckUtils]: 205: Hoare triple {22874#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22874#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:44:27,844 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {22874#(not (= |__VERIFIER_assert_#in~cond| 0))} {22885#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0))} #54#return; {22904#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} is VALID [2022-04-27 14:44:27,844 INFO L290 TraceCheckUtils]: 207: Hoare triple {22904#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} assume !(~c~0 < ~k~0); {22908#(and (= main_~y~0 27) (< 26 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-27 14:44:27,845 INFO L272 TraceCheckUtils]: 208: Hoare triple {22908#(and (= main_~y~0 27) (< 26 main_~k~0) (<= main_~k~0 27))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22912#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:44:27,845 INFO L290 TraceCheckUtils]: 209: Hoare triple {22912#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22916#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:44:27,845 INFO L290 TraceCheckUtils]: 210: Hoare triple {22916#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22251#false} is VALID [2022-04-27 14:44:27,845 INFO L290 TraceCheckUtils]: 211: Hoare triple {22251#false} assume !false; {22251#false} is VALID [2022-04-27 14:44:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2702 backedges. 210 proven. 1136 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2022-04-27 14:44:27,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:44:58,663 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~y~0 1))) (or (= (+ (* .cse0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) 3 (* .cse0 .cse0))) (< (+ 2 c_main_~c~0) c_main_~k~0) (not (= (mod (+ (* (- 13) .cse0 .cse0) (* (- 1) .cse0 .cse0 .cse0 .cse0) (* (- 6) .cse0 .cse0 .cse0)) 4) 0)) (<= c_main_~k~0 (+ c_main_~c~0 1)))) is different from false [2022-04-27 14:46:29,344 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 c_main_~y~0))) (or (= (+ (* 2 c_main_~y~0) 7 (* .cse0 .cse0)) (+ (* .cse0 c_main_~k~0) c_main_~k~0)) (< (+ c_main_~c~0 4) c_main_~k~0) (<= c_main_~k~0 (+ 3 c_main_~c~0)) (not (= (mod (+ (* (- 1) .cse0 .cse0 .cse0 .cse0) (* (- 13) .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6))) 4) 0)))) is different from false [2022-04-27 14:47:47,844 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 6 c_main_~y~0))) (or (= (+ (* 2 c_main_~y~0) (* .cse0 .cse0) 13) (+ c_main_~k~0 (* .cse0 c_main_~k~0))) (not (= (mod (+ (* (- 1) .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6)) (* (- 13) .cse0 .cse0)) 4) 0)) (< (+ 7 c_main_~c~0) c_main_~k~0) (<= c_main_~k~0 (+ 6 c_main_~c~0)))) is different from false [2022-04-27 14:50:14,174 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 10 c_main_~y~0))) (or (= (+ (* 2 c_main_~y~0) 21 (* .cse0 .cse0)) (+ (* .cse0 c_main_~k~0) c_main_~k~0)) (not (= (mod (+ (* (- 13) .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6)) (* (- 1) .cse0 .cse0 .cse0 .cse0)) 4) 0)) (<= c_main_~k~0 (+ c_main_~c~0 10)) (< (+ c_main_~c~0 11) c_main_~k~0))) is different from false [2022-04-27 14:50:22,290 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 11 c_main_~y~0))) (or (<= c_main_~k~0 (+ c_main_~c~0 11)) (not (= (mod (+ (* (- 13) .cse0 .cse0) (* (- 1) .cse0 .cse0 .cse0 .cse0) (* (- 6) .cse0 .cse0 .cse0)) 4) 0)) (= (+ (* .cse0 c_main_~k~0) c_main_~k~0) (+ 23 (* 2 c_main_~y~0) (* .cse0 .cse0))) (< (+ c_main_~c~0 12) c_main_~k~0))) is different from false [2022-04-27 14:52:18,067 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 14 c_main_~y~0))) (or (= (+ (* .cse0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) 29 (* .cse0 .cse0))) (not (= (mod (+ (* (- 1) .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6)) (* .cse0 .cse0 (- 13))) 4) 0)) (< (+ c_main_~c~0 15) c_main_~k~0) (<= c_main_~k~0 (+ 14 c_main_~c~0)))) is different from false [2022-04-27 14:52:26,186 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 15 c_main_~y~0))) (or (<= c_main_~k~0 (+ c_main_~c~0 15)) (not (= (mod (+ (* (- 1) .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6)) (* (- 13) .cse0 .cse0)) 4) 0)) (< (+ 16 c_main_~c~0) c_main_~k~0) (= (+ (* 2 c_main_~y~0) (* .cse0 .cse0) 31) (+ (* .cse0 c_main_~k~0) c_main_~k~0)))) is different from false